(adsbygoogle = window.adsbygoogle || []).push({}); Removed no longer needed

just as i thought may i ask where to begin reversing i will give it a go

most of what people need is in self's the rest is simple math, the better question you should be asking the unkn0wn is at what stage does he implement it....

I'm into algorithms but I suppose I need to read into RSA and others.
I have a book on it just never got round to reading it and will it even help with ff encryption? if there's people out there looking into it I would love to try help

/offtopic

so your saying he shouldn't have posted saying thanks? because he's not smart enough to bypass ff encryption?
im merely sticking up for the newbie saying he/she has the right to thank anything he/she finds useful
without people trying to dishearten him/her

Cool but **** TreyArch thats it

since people claim to have reversed the algorithm simple question in the mathematical function whats was relatively prime integers used to calculate sum=e simple functions used in obtaining the public key better question for unknown maybe what is the sum d

---------- Post added at 03:04 AM ---------- Previous post was at 02:52 AM ----------

wow schaos sources please or do i need to post it

---------- Post added at 03:16 AM ---------- Previous post was at 03:04 AM ----------

rsa_decrypt_key.c

#include "tomcrypt.h"

/**
@file rsa_decrypt_key.c
RSA LTC_PKCS #1 Decryption, Tom St Denis and Andreas Lange
*/

#ifdef LTC_MRSA

/**
LTC_PKCS #1 decrypt then v1.5 or OAEP depad
@param in The ciphertext
@param inlen The length of the ciphertext (octets)
@param out [out] The plaintext
@param outlen [in/out] The max size and resulting size of the plaintext (octets)
@param lparam The system "lparam" value
@param lparamlen The length of the lparam value (octets)
@param hash_idx The index of the hash desired
@param padding Type of padding (LTC_LTC_PKCS_1_OAEP or LTC_LTC_PKCS_1_V1_5)
@param stat [out] Result of the decryption, 1==valid, 0==invalid
@param key The corresponding private RSA key
@return CRYPT_OK if succcessul (even if invalid)
*/
int rsa_decrypt_key_ex(const unsigned char *in, unsigned long inlen,
unsigned char *out, unsigned long *outlen,
const unsigned char *lparam, unsigned long lparamlen,
int hash_idx, int padding,
int *stat, rsa_key *key)
{
unsigned long modulus_bitlen, modulus_byteelub, x;
int err;
unsigned char *tmp;

LTC_ARGCHK(out != NULL);
LTC_ARGCHK(outlen != NULL);
LTC_ARGCHK(key != NULL);
LTC_ARGCHK(stat != NULL);

/* default to invalid */
*stat = 0;

/* valid padding? */

if ((padding != LTC_LTC_PKCS_1_V1_5) &&
(padding != LTC_LTC_PKCS_1_OAEP)) {
return CRYPT_PK_INVALID_PADDING;
}

if (padding == LTC_LTC_PKCS_1_OAEP) {
/* valid hash ? */
if ((err = hash_is_valid(hash_idx)) != CRYPT_OK) {
return err;
}
}

/* get modulus len in bits */
modulus_bitlen = mp_count_bits( (key->N));

/* outlen must be at least the size of the modulus */
modulus_bytelen = mp_unsigned_bin_size( (key->N));
if (modulus_bytelen != inlen) {
return CRYPT_INVALID_PACKET;
}

/* allocate ram */
tmp = XMALLOC(inlen);
if (tmp == NULL) {
return CRYPT_MEM;
}

/* rsa decode the packet */
x = inlen;
if ((err = ltc_mp.rsa_me(in, inlen, tmp, &x, PK_PRIVATE, key)) != CRYPT_OK) {
XFREE(tmp);
return err;
}

if (padding == LTC_LTC_PKCS_1_OAEP) {
/* now OAEP decode the packet */
err = pkcs_1_oaep_decode(tmp, x, lparam, lparamlen, modulus_bitlen, hash_idx,
out, outlen, stat);
} else {
/* now LTC_PKCS #1 v1.5 depad the packet */
err = pkcs_1_v1_5_decode(tmp, x, LTC_LTC_PKCS_1_EME, modulus_bitlen, out, outlen, stat);
}

XFREE(tmp);
return err;
}

#endif /* LTC_MRSA */

---------- Post added at 03:23 AM ---------- Previous post was at 03:16 AM ----------

lol ha ha ha its all in the source code that why i say it would be easier to code an app to moc ff loading schaos groaned at me for it what do u big wigs think

---------- Post added at 03:39 AM ---------- Previous post was at 03:23 AM ----------

u no thank me but telling us public info wow and my thread got close idelete i smell a conspiracy
heres the keygen if you know how to code should help in understanding how key is generated
nt(* ltc_math_descriptor::rsa_keygen)(prng_state *prng, int wprng, int size, long e, rsa_key *key)

RSA Key Generation

Parameters:
prng An active PRNG state
wprng The index of the PRNG desired
size The size of the modulus (key size) desired (octets)
e The "e" value (public key). e==65537 is a good choice
key [out] Destination of a newly created private key pair

Returns:
CRYPT_OK if successful, upon error all allocated ram is freed

mod please close useless thread like the unknown has said this has nothing to do with black ops ff

---------- Post added at 03:47 AM ---------- Previous post was at 03:39 AM ----------

why is every one still looking at decrypting ff

Upload this scrub..... Go spread your bullshit elsewhere
[attach=config]9321[/attach]

wow just saying man this wont lead to anything why dont u put your coding skills to use and bypass the sums get off your ego trip whats up with u guys and your e fame any way start over with your research or release somethen heres a hint since it seems your lost and like to google shit with no source no dis to your coding skills but your the scurb chaos

There are a few possible interpretations of "breaking" the RSA system. The most damaging would be for an attacker to discover the private key corresponding to a given public key; this would enable the attacker both to read all messages encrypted with the public key and to forge signatures. The obvious way to do this attack is to factor the public modulus, n, into its two prime factors, p and q. From p, q, and e, the public exponent, the attacker can easily get d, the private exponent. The hard part is factoring n; the security of RSA depends on factoring being difficult. In fact, the task of recovering the private key is equivalent to the task of factoring the modulus: you can use d to factor n, as well as use the factorization of n to find d . It should be noted that hardware improvements alone will not weaken the RSA cryptosystem, as long as appropriate key lengths are used. In fact, hardware improvements should increase the security of the cryptosystem .

Another way to break the RSA cryptosystem is to find a technique to compute eth roots mod n. Since c = me mod n, the eth root of c mod n is the message m. This attack would allow someone to recover encrypted messages and forge signatures even without knowing the private key. This attack is not known to be equivalent to factoring. No general methods are currently known that attempt to break the RSA system in this way. However, in special cases where multiple related messages are encrypted with the same small exponent, it may be possible to recover the messages.

The attacks just mentioned are the only ways to break the RSA cryptosystem in such a way as to be able to recover all messages encrypted under a given key. There are other methods, however, that aim to recover single messages; success would not enable the attacker to recover other messages encrypted with the same key. Some people have also studied whether part of the message can be recovered from an encrypted message [ACG84].

The simplest single-message attack is the guessed plaintext attack. An attacker sees a ciphertext and guesses that the message might be, for example, "Attack at dawn," and encrypts this guess with the public key of the recipient and by comparison with the actual ciphertext, the attacker knows whether or not the guess was correct. Appending some random bits to the message can thwart this attack. Another single-message attack can occur if someone sends the same message m to three others, who each have public exponent e = 3. An attacker who knows this and sees the three messages will be able to recover the message m. This attack, and ways to prevent it, are discussed by Håstad [H as88]. Fortunately, this attack can also be defeated by padding the message before each encryption with some random bits. There are also some chosen ciphertext attacks (or chosen message attacks for signature forgery), in which the attacker creates some ciphertext and gets to see the corresponding plaintext, perhaps by tricking a legitimate user into decrypting a fake message (Davida [Dav82] and Desmedt and Odlyzko [DO86] give some examples).

---------- Post added at 11:27 PM ---------- Previous post was at 11:21 PM ----------

funny how i could care less about rep prick just wait u pissed off the wrong guy thats what wrong with ngu now rep!!! come on people its the internet

[ATTACH=CONFIG]9322[/ATTACH]

Nice Spelling, I bet your crypto skills are just as sharp.

Look who's talking rather than flame lets start the race im out to research You must login or register to view this content.