Post: Full List of Black Ops Encryption SRC Links
Options
The following 10 users say thank you to *SCHAOS* for this useful post:
04-29-2011, 08:43 PM
#65
PS3FFviewer
Banned
The following 2 users groaned at PS3FFviewer for this awful post:
04-29-2011, 11:54 PM
#66
PS3FFviewer
Banned
Originally posted by TheUnkn0wn
This has no connection to the Black Ops FastFile encryption. Seriously.
you have no say in anything no more shhhh ok
---------- Post added at 07:52 PM ---------- Previous post was at 07:51 PM ----------
Originally posted by SCHAOS
I have extracted these from the Eboot.elf aswell as the Default.xex. These are all the direct links to the Black Ops Encryption SRC code. Some are used for packet encryption, some are used for file encryption.
You can Download these and experiment with your own decryption programs.
You must login or register to view this content. (Expand File List)
libtomcrypt-1.17\\src\\modes\\ctr\\ctr_done.c"
libtomcrypt-1.17\\src\\modes\\ctr\\ctr_encrypt.c"
libtomcrypt-1.17\\src\\modes\\ctr\\ctr_start.c"
libtomcrypt-1.17\\src\\misc\\crypt\\crypt_register_cipher.c"
libtomcrypt-1.17\\src\\ciphers\\aes\\aes.c"
libtomcrypt-1.17\\src\\misc\\crypt\\crypt_register_hash.c"
libtomcrypt-1.17\\src\\hashes\\sha2\\sha256.c"
libtomcrypt-1.17\\src\\math\\ltm_desc.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_free.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_verify_hash.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_import.c"
libtomcrypt-1.17\\src\\misc\\crypt\\crypt_find_hash.c"
libtomcrypt-1.17\\src\\modes\\ctr\\ctr_decrypt.c"
libtomcrypt-1.17\\src\\misc\\zeromem.c"
libtomcrypt-1.17\\src\\pk\\ecc\\ltc_ecc_mulmod.c"
libtomcrypt-1.17
\\src\\pk\\ecc\\ltc_ecc_map.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_exptmod.c"
libtomcrypt-1.17\\src\\pk\\ecc\\ltc_ecc_projective_add_point.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_make_key.c"
libtomcrypt-1.17\\src\\pk\\ecc\\ltc_ecc_projective_dbl_point.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\sequence\\der_decode_sequence_ex.c"
libtomcrypt-1.17\\src\\pk\\pkcs1\\pkcs_1_pss_decode.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\sequence\\der_decode_sequence_multi.c"
libtomcrypt-1.17\\src\\math\\rand_prime.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\integer\\der_decode_integer.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\object_identifier\\der_decode_object_identifier.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\boolean\\der_length_boolean.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\integer\\der_length_integer.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\octet\\der_decode_octet_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\short_integer\\der_decode_short_integer.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\utf8\\der_decode_utf8_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\bit\\der_length_bit_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\boolean\\der_decode_boolean.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\sequence\\der_length_sequence.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\short_integer\\der_length_short_integer.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\utf8\\der_length_utf8_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\ia5\\der_length_ia5_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\printable_string\\der_decode_printable_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\printable_string\\der_length_printable_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\choice\\der_decode_choice.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\utctime\\der_decode_utctime.c"
.libtomcrypt-1.17\\src\\pk\\asn1\\der\\octet\\der_length_octet_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\object_identifier\\der_length_object_identifier.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\ia5\\der_decode_ia5_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\bit\\der_decode_bit_string.c"
libtomcrypt-1.17\\src\\pk\\pkcs1\\pkcs_1_mgf1.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\utctime\\der_length_utctime.c"
libtomcrypt-1.17\\src\\hashes\\helper\\hash_memory.c"
libtomcrypt-1.17\\src\\hashes\\tiger.c"
Here is an example of the RSA_MAKE_KEY SRC
#include "tomcrypt.h"
/**
@file rsa_make_key.c
RSA key generation, Tom St Denis
*/
#ifdef LTC_MRSA
/**
Create an RSA key
@param prng An active PRNG state
@param wprng The index of the PRNG desired
@param size The size of the modulus (key size) desired (octets)
@param e The "e" value (public key). e==65537 is a good choice
@param key [out] Destination of a newly created private key pair
@return CRYPT_OK if successful, upon error all allocated ram is freed
*/
int rsa_make_key(prng_state *prng, int wprng, int size, long e, rsa_key *key)
{
void *p, *q, *tmp1, *tmp2, *tmp3;
int err;
LTC_ARGCHK(ltc_mp.name != NULL);
LTC_ARGCHK(key != NULL);
if ((size < (MIN_RSA_SIZE/; ) || (size> (MAX_RSA_SIZE/; )) {
return CRYPT_INVALID_KEYSIZE;
}
if ((e < 3) || ((e & 1) == 0)) {
return CRYPT_INVALID_ARG;
}
if ((err = prng_is_valid(wprng)) != CRYPT_OK) {
return err;
}
if ((err = mp_init_multi(&p, &q, &tmp1, &tmp2, &tmp3, NULL)) != CRYPT_OK) {
return err;
}
/* make primes p and q (optimization provided by Wayne Scott) */
if ((err = mp_set_int(tmp3, e)) != CRYPT_OK) { goto errkey; } /* tmp3 = e */
/* make prime "p" */
do {
if ((err = rand_prime( p, size/2, prng, wprng)) != CRYPT_OK) { goto errkey; }
if ((err = mp_sub_d( p, 1, tmp1)) != CRYPT_OK) { goto errkey; } /* tmp1 = p-1 */
if ((err = mp_gcd( tmp1, tmp3, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = gcd(p-1, e) */
} while (mp_cmp_d( tmp2, 1) != 0); /* while e divides p-1 */
/* make prime "q" */
do {
if ((err = rand_prime( q, size/2, prng, wprng)) != CRYPT_OK) { goto errkey; }
if ((err = mp_sub_d( q, 1, tmp1)) != CRYPT_OK) { goto errkey; } /* tmp1 = q-1 */
if ((err = mp_gcd( tmp1, tmp3, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = gcd(q-1, e) */
} while (mp_cmp_d( tmp2, 1) != 0); /* while e divides q-1 */
/* tmp1 = lcm(p-1, q-1) */
if ((err = mp_sub_d( p, 1, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = p-1 */
/* tmp1 = q-1 (previous do/while loop) */
if ((err = mp_lcm( tmp1, tmp2, tmp1)) != CRYPT_OK) { goto errkey; } /* tmp1 = lcm(p-1, q-1) */
/* make key */
if ((err = mp_init_multi(&key->e, &key->d, &key->N, &key->dQ, &key->dP, &key->qP, &key->p, &key->q, NULL)) != CRYPT_OK) {
goto errkey;
}
if ((err = mp_set_int( key->e, e)) != CRYPT_OK) { goto errkey; } /* key->e = e */
if ((err = mp_invmod( key->e, tmp1, key->d)) != CRYPT_OK) { goto errkey; } /* key->d = 1/e mod lcm(p-1,q-1) */
if ((err = mp_mul( p, q, key->N)) != CRYPT_OK) { goto errkey; } /* key->N = pq */
/* optimize for CRT now */
/* find d mod q-1 and d mod p-1 */
if ((err = mp_sub_d( p, 1, tmp1)) != CRYPT_OK) { goto errkey; } /* tmp1 = q-1 */
if ((err = mp_sub_d( q, 1, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = p-1 */
if ((err = mp_mod( key->d, tmp1, key->dP)) != CRYPT_OK) { goto errkey; } /* dP = d mod p-1 */
if ((err = mp_mod( key->d, tmp2, key->dQ)) != CRYPT_OK) { goto errkey; } /* dQ = d mod q-1 */
if ((err = mp_invmod( q, p, key->qP)) != CRYPT_OK) { goto errkey; } /* qP = 1/q mod p */
if ((err = mp_copy( p, key->p)) != CRYPT_OK) { goto errkey; }
if ((err = mp_copy( q, key->q)) != CRYPT_OK) { goto errkey; }
/* set key type (in this case it's CRT optimized) */
key->type = PK_PRIVATE;
/* return ok and free temps */
err = CRYPT_OK;
goto cleanup;
errkey:
mp_clear_multi(key->d, key->e, key->N, key->dQ, key->dP, key->qP, key->p, key->q, NULL);
cleanup:
mp_clear_multi(tmp3, tmp2, tmp1, p, q, NULL);
return err;
}
#endif
You can Download these and experiment with your own decryption programs.
You must login or register to view this content. (Expand File List)
libtomcrypt-1.17\\src\\modes\\ctr\\ctr_done.c"
libtomcrypt-1.17\\src\\modes\\ctr\\ctr_encrypt.c"
libtomcrypt-1.17\\src\\modes\\ctr\\ctr_start.c"
libtomcrypt-1.17\\src\\misc\\crypt\\crypt_register_cipher.c"
libtomcrypt-1.17\\src\\ciphers\\aes\\aes.c"
libtomcrypt-1.17\\src\\misc\\crypt\\crypt_register_hash.c"
libtomcrypt-1.17\\src\\hashes\\sha2\\sha256.c"
libtomcrypt-1.17\\src\\math\\ltm_desc.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_free.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_verify_hash.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_import.c"
libtomcrypt-1.17\\src\\misc\\crypt\\crypt_find_hash.c"
libtomcrypt-1.17\\src\\modes\\ctr\\ctr_decrypt.c"
libtomcrypt-1.17\\src\\misc\\zeromem.c"
libtomcrypt-1.17\\src\\pk\\ecc\\ltc_ecc_mulmod.c"
libtomcrypt-1.17
\\src\\pk\\ecc\\ltc_ecc_map.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_exptmod.c"
libtomcrypt-1.17\\src\\pk\\ecc\\ltc_ecc_projective_add_point.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_make_key.c"
libtomcrypt-1.17\\src\\pk\\ecc\\ltc_ecc_projective_dbl_point.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\sequence\\der_decode_sequence_ex.c"
libtomcrypt-1.17\\src\\pk\\pkcs1\\pkcs_1_pss_decode.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\sequence\\der_decode_sequence_multi.c"
libtomcrypt-1.17\\src\\math\\rand_prime.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\integer\\der_decode_integer.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\object_identifier\\der_decode_object_identifier.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\boolean\\der_length_boolean.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\integer\\der_length_integer.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\octet\\der_decode_octet_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\short_integer\\der_decode_short_integer.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\utf8\\der_decode_utf8_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\bit\\der_length_bit_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\boolean\\der_decode_boolean.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\sequence\\der_length_sequence.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\short_integer\\der_length_short_integer.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\utf8\\der_length_utf8_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\ia5\\der_length_ia5_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\printable_string\\der_decode_printable_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\printable_string\\der_length_printable_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\choice\\der_decode_choice.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\utctime\\der_decode_utctime.c"
.libtomcrypt-1.17\\src\\pk\\asn1\\der\\octet\\der_length_octet_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\object_identifier\\der_length_object_identifier.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\ia5\\der_decode_ia5_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\bit\\der_decode_bit_string.c"
libtomcrypt-1.17\\src\\pk\\pkcs1\\pkcs_1_mgf1.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\utctime\\der_length_utctime.c"
libtomcrypt-1.17\\src\\hashes\\helper\\hash_memory.c"
libtomcrypt-1.17\\src\\hashes\\tiger.c"
Here is an example of the RSA_MAKE_KEY SRC
#include "tomcrypt.h"
/**
@file rsa_make_key.c
RSA key generation, Tom St Denis
*/
#ifdef LTC_MRSA
/**
Create an RSA key
@param prng An active PRNG state
@param wprng The index of the PRNG desired
@param size The size of the modulus (key size) desired (octets)
@param e The "e" value (public key). e==65537 is a good choice
@param key [out] Destination of a newly created private key pair
@return CRYPT_OK if successful, upon error all allocated ram is freed
*/
int rsa_make_key(prng_state *prng, int wprng, int size, long e, rsa_key *key)
{
void *p, *q, *tmp1, *tmp2, *tmp3;
int err;
LTC_ARGCHK(ltc_mp.name != NULL);
LTC_ARGCHK(key != NULL);
if ((size < (MIN_RSA_SIZE/; ) || (size> (MAX_RSA_SIZE/; )) {
return CRYPT_INVALID_KEYSIZE;
}
if ((e < 3) || ((e & 1) == 0)) {
return CRYPT_INVALID_ARG;
}
if ((err = prng_is_valid(wprng)) != CRYPT_OK) {
return err;
}
if ((err = mp_init_multi(&p, &q, &tmp1, &tmp2, &tmp3, NULL)) != CRYPT_OK) {
return err;
}
/* make primes p and q (optimization provided by Wayne Scott) */
if ((err = mp_set_int(tmp3, e)) != CRYPT_OK) { goto errkey; } /* tmp3 = e */
/* make prime "p" */
do {
if ((err = rand_prime( p, size/2, prng, wprng)) != CRYPT_OK) { goto errkey; }
if ((err = mp_sub_d( p, 1, tmp1)) != CRYPT_OK) { goto errkey; } /* tmp1 = p-1 */
if ((err = mp_gcd( tmp1, tmp3, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = gcd(p-1, e) */
} while (mp_cmp_d( tmp2, 1) != 0); /* while e divides p-1 */
/* make prime "q" */
do {
if ((err = rand_prime( q, size/2, prng, wprng)) != CRYPT_OK) { goto errkey; }
if ((err = mp_sub_d( q, 1, tmp1)) != CRYPT_OK) { goto errkey; } /* tmp1 = q-1 */
if ((err = mp_gcd( tmp1, tmp3, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = gcd(q-1, e) */
} while (mp_cmp_d( tmp2, 1) != 0); /* while e divides q-1 */
/* tmp1 = lcm(p-1, q-1) */
if ((err = mp_sub_d( p, 1, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = p-1 */
/* tmp1 = q-1 (previous do/while loop) */
if ((err = mp_lcm( tmp1, tmp2, tmp1)) != CRYPT_OK) { goto errkey; } /* tmp1 = lcm(p-1, q-1) */
/* make key */
if ((err = mp_init_multi(&key->e, &key->d, &key->N, &key->dQ, &key->dP, &key->qP, &key->p, &key->q, NULL)) != CRYPT_OK) {
goto errkey;
}
if ((err = mp_set_int( key->e, e)) != CRYPT_OK) { goto errkey; } /* key->e = e */
if ((err = mp_invmod( key->e, tmp1, key->d)) != CRYPT_OK) { goto errkey; } /* key->d = 1/e mod lcm(p-1,q-1) */
if ((err = mp_mul( p, q, key->N)) != CRYPT_OK) { goto errkey; } /* key->N = pq */
/* optimize for CRT now */
/* find d mod q-1 and d mod p-1 */
if ((err = mp_sub_d( p, 1, tmp1)) != CRYPT_OK) { goto errkey; } /* tmp1 = q-1 */
if ((err = mp_sub_d( q, 1, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = p-1 */
if ((err = mp_mod( key->d, tmp1, key->dP)) != CRYPT_OK) { goto errkey; } /* dP = d mod p-1 */
if ((err = mp_mod( key->d, tmp2, key->dQ)) != CRYPT_OK) { goto errkey; } /* dQ = d mod q-1 */
if ((err = mp_invmod( q, p, key->qP)) != CRYPT_OK) { goto errkey; } /* qP = 1/q mod p */
if ((err = mp_copy( p, key->p)) != CRYPT_OK) { goto errkey; }
if ((err = mp_copy( q, key->q)) != CRYPT_OK) { goto errkey; }
/* set key type (in this case it's CRT optimized) */
key->type = PK_PRIVATE;
/* return ok and free temps */
err = CRYPT_OK;
goto cleanup;
errkey:
mp_clear_multi(key->d, key->e, key->N, key->dQ, key->dP, key->qP, key->p, key->q, NULL);
cleanup:
mp_clear_multi(tmp3, tmp2, tmp1, p, q, NULL);
return err;
}
#endif
why do people constantly ask me for things it is it possbile for you to try your self your all seing i should of have seen it all in the codes hint hint am i not wrong ?
---------- Post added at 07:53 PM ---------- Previous post was at 07:52 PM ----------
Originally posted by SCHAOS
I have extracted these from the Eboot.elf aswell as the Default.xex. These are all the direct links to the Black Ops Encryption SRC code. Some are used for packet encryption, some are used for file encryption.
You can Download these and experiment with your own decryption programs.
You must login or register to view this content. (Expand File List)
libtomcrypt-1.17\\src\\modes\\ctr\\ctr_done.c"
libtomcrypt-1.17\\src\\modes\\ctr\\ctr_encrypt.c"
libtomcrypt-1.17\\src\\modes\\ctr\\ctr_start.c"
libtomcrypt-1.17\\src\\misc\\crypt\\crypt_register_cipher.c"
libtomcrypt-1.17\\src\\ciphers\\aes\\aes.c"
libtomcrypt-1.17\\src\\misc\\crypt\\crypt_register_hash.c"
libtomcrypt-1.17\\src\\hashes\\sha2\\sha256.c"
libtomcrypt-1.17\\src\\math\\ltm_desc.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_free.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_verify_hash.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_import.c"
libtomcrypt-1.17\\src\\misc\\crypt\\crypt_find_hash.c"
libtomcrypt-1.17\\src\\modes\\ctr\\ctr_decrypt.c"
libtomcrypt-1.17\\src\\misc\\zeromem.c"
libtomcrypt-1.17\\src\\pk\\ecc\\ltc_ecc_mulmod.c"
libtomcrypt-1.17
\\src\\pk\\ecc\\ltc_ecc_map.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_exptmod.c"
libtomcrypt-1.17\\src\\pk\\ecc\\ltc_ecc_projective_add_point.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_make_key.c"
libtomcrypt-1.17\\src\\pk\\ecc\\ltc_ecc_projective_dbl_point.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\sequence\\der_decode_sequence_ex.c"
libtomcrypt-1.17\\src\\pk\\pkcs1\\pkcs_1_pss_decode.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\sequence\\der_decode_sequence_multi.c"
libtomcrypt-1.17\\src\\math\\rand_prime.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\integer\\der_decode_integer.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\object_identifier\\der_decode_object_identifier.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\boolean\\der_length_boolean.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\integer\\der_length_integer.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\octet\\der_decode_octet_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\short_integer\\der_decode_short_integer.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\utf8\\der_decode_utf8_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\bit\\der_length_bit_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\boolean\\der_decode_boolean.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\sequence\\der_length_sequence.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\short_integer\\der_length_short_integer.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\utf8\\der_length_utf8_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\ia5\\der_length_ia5_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\printable_string\\der_decode_printable_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\printable_string\\der_length_printable_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\choice\\der_decode_choice.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\utctime\\der_decode_utctime.c"
.libtomcrypt-1.17\\src\\pk\\asn1\\der\\octet\\der_length_octet_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\object_identifier\\der_length_object_identifier.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\ia5\\der_decode_ia5_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\bit\\der_decode_bit_string.c"
libtomcrypt-1.17\\src\\pk\\pkcs1\\pkcs_1_mgf1.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\utctime\\der_length_utctime.c"
libtomcrypt-1.17\\src\\hashes\\helper\\hash_memory.c"
libtomcrypt-1.17\\src\\hashes\\tiger.c"
Here is an example of the RSA_MAKE_KEY SRC
#include "tomcrypt.h"
/**
@file rsa_make_key.c
RSA key generation, Tom St Denis
*/
#ifdef LTC_MRSA
/**
Create an RSA key
@param prng An active PRNG state
@param wprng The index of the PRNG desired
@param size The size of the modulus (key size) desired (octets)
@param e The "e" value (public key). e==65537 is a good choice
@param key [out] Destination of a newly created private key pair
@return CRYPT_OK if successful, upon error all allocated ram is freed
*/
int rsa_make_key(prng_state *prng, int wprng, int size, long e, rsa_key *key)
{
void *p, *q, *tmp1, *tmp2, *tmp3;
int err;
LTC_ARGCHK(ltc_mp.name != NULL);
LTC_ARGCHK(key != NULL);
if ((size < (MIN_RSA_SIZE/; ) || (size> (MAX_RSA_SIZE/; )) {
return CRYPT_INVALID_KEYSIZE;
}
if ((e < 3) || ((e & 1) == 0)) {
return CRYPT_INVALID_ARG;
}
if ((err = prng_is_valid(wprng)) != CRYPT_OK) {
return err;
}
if ((err = mp_init_multi(&p, &q, &tmp1, &tmp2, &tmp3, NULL)) != CRYPT_OK) {
return err;
}
/* make primes p and q (optimization provided by Wayne Scott) */
if ((err = mp_set_int(tmp3, e)) != CRYPT_OK) { goto errkey; } /* tmp3 = e */
/* make prime "p" */
do {
if ((err = rand_prime( p, size/2, prng, wprng)) != CRYPT_OK) { goto errkey; }
if ((err = mp_sub_d( p, 1, tmp1)) != CRYPT_OK) { goto errkey; } /* tmp1 = p-1 */
if ((err = mp_gcd( tmp1, tmp3, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = gcd(p-1, e) */
} while (mp_cmp_d( tmp2, 1) != 0); /* while e divides p-1 */
/* make prime "q" */
do {
if ((err = rand_prime( q, size/2, prng, wprng)) != CRYPT_OK) { goto errkey; }
if ((err = mp_sub_d( q, 1, tmp1)) != CRYPT_OK) { goto errkey; } /* tmp1 = q-1 */
if ((err = mp_gcd( tmp1, tmp3, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = gcd(q-1, e) */
} while (mp_cmp_d( tmp2, 1) != 0); /* while e divides q-1 */
/* tmp1 = lcm(p-1, q-1) */
if ((err = mp_sub_d( p, 1, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = p-1 */
/* tmp1 = q-1 (previous do/while loop) */
if ((err = mp_lcm( tmp1, tmp2, tmp1)) != CRYPT_OK) { goto errkey; } /* tmp1 = lcm(p-1, q-1) */
/* make key */
if ((err = mp_init_multi(&key->e, &key->d, &key->N, &key->dQ, &key->dP, &key->qP, &key->p, &key->q, NULL)) != CRYPT_OK) {
goto errkey;
}
if ((err = mp_set_int( key->e, e)) != CRYPT_OK) { goto errkey; } /* key->e = e */
if ((err = mp_invmod( key->e, tmp1, key->d)) != CRYPT_OK) { goto errkey; } /* key->d = 1/e mod lcm(p-1,q-1) */
if ((err = mp_mul( p, q, key->N)) != CRYPT_OK) { goto errkey; } /* key->N = pq */
/* optimize for CRT now */
/* find d mod q-1 and d mod p-1 */
if ((err = mp_sub_d( p, 1, tmp1)) != CRYPT_OK) { goto errkey; } /* tmp1 = q-1 */
if ((err = mp_sub_d( q, 1, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = p-1 */
if ((err = mp_mod( key->d, tmp1, key->dP)) != CRYPT_OK) { goto errkey; } /* dP = d mod p-1 */
if ((err = mp_mod( key->d, tmp2, key->dQ)) != CRYPT_OK) { goto errkey; } /* dQ = d mod q-1 */
if ((err = mp_invmod( q, p, key->qP)) != CRYPT_OK) { goto errkey; } /* qP = 1/q mod p */
if ((err = mp_copy( p, key->p)) != CRYPT_OK) { goto errkey; }
if ((err = mp_copy( q, key->q)) != CRYPT_OK) { goto errkey; }
/* set key type (in this case it's CRT optimized) */
key->type = PK_PRIVATE;
/* return ok and free temps */
err = CRYPT_OK;
goto cleanup;
errkey:
mp_clear_multi(key->d, key->e, key->N, key->dQ, key->dP, key->qP, key->p, key->q, NULL);
cleanup:
mp_clear_multi(tmp3, tmp2, tmp1, p, q, NULL);
return err;
}
#endif
You can Download these and experiment with your own decryption programs.
You must login or register to view this content. (Expand File List)
libtomcrypt-1.17\\src\\modes\\ctr\\ctr_done.c"
libtomcrypt-1.17\\src\\modes\\ctr\\ctr_encrypt.c"
libtomcrypt-1.17\\src\\modes\\ctr\\ctr_start.c"
libtomcrypt-1.17\\src\\misc\\crypt\\crypt_register_cipher.c"
libtomcrypt-1.17\\src\\ciphers\\aes\\aes.c"
libtomcrypt-1.17\\src\\misc\\crypt\\crypt_register_hash.c"
libtomcrypt-1.17\\src\\hashes\\sha2\\sha256.c"
libtomcrypt-1.17\\src\\math\\ltm_desc.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_free.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_verify_hash.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_import.c"
libtomcrypt-1.17\\src\\misc\\crypt\\crypt_find_hash.c"
libtomcrypt-1.17\\src\\modes\\ctr\\ctr_decrypt.c"
libtomcrypt-1.17\\src\\misc\\zeromem.c"
libtomcrypt-1.17\\src\\pk\\ecc\\ltc_ecc_mulmod.c"
libtomcrypt-1.17
\\src\\pk\\ecc\\ltc_ecc_map.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_exptmod.c"
libtomcrypt-1.17\\src\\pk\\ecc\\ltc_ecc_projective_add_point.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_make_key.c"
libtomcrypt-1.17\\src\\pk\\ecc\\ltc_ecc_projective_dbl_point.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\sequence\\der_decode_sequence_ex.c"
libtomcrypt-1.17\\src\\pk\\pkcs1\\pkcs_1_pss_decode.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\sequence\\der_decode_sequence_multi.c"
libtomcrypt-1.17\\src\\math\\rand_prime.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\integer\\der_decode_integer.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\object_identifier\\der_decode_object_identifier.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\boolean\\der_length_boolean.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\integer\\der_length_integer.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\octet\\der_decode_octet_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\short_integer\\der_decode_short_integer.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\utf8\\der_decode_utf8_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\bit\\der_length_bit_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\boolean\\der_decode_boolean.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\sequence\\der_length_sequence.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\short_integer\\der_length_short_integer.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\utf8\\der_length_utf8_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\ia5\\der_length_ia5_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\printable_string\\der_decode_printable_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\printable_string\\der_length_printable_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\choice\\der_decode_choice.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\utctime\\der_decode_utctime.c"
.libtomcrypt-1.17\\src\\pk\\asn1\\der\\octet\\der_length_octet_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\object_identifier\\der_length_object_identifier.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\ia5\\der_decode_ia5_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\bit\\der_decode_bit_string.c"
libtomcrypt-1.17\\src\\pk\\pkcs1\\pkcs_1_mgf1.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\utctime\\der_length_utctime.c"
libtomcrypt-1.17\\src\\hashes\\helper\\hash_memory.c"
libtomcrypt-1.17\\src\\hashes\\tiger.c"
Here is an example of the RSA_MAKE_KEY SRC
#include "tomcrypt.h"
/**
@file rsa_make_key.c
RSA key generation, Tom St Denis
*/
#ifdef LTC_MRSA
/**
Create an RSA key
@param prng An active PRNG state
@param wprng The index of the PRNG desired
@param size The size of the modulus (key size) desired (octets)
@param e The "e" value (public key). e==65537 is a good choice
@param key [out] Destination of a newly created private key pair
@return CRYPT_OK if successful, upon error all allocated ram is freed
*/
int rsa_make_key(prng_state *prng, int wprng, int size, long e, rsa_key *key)
{
void *p, *q, *tmp1, *tmp2, *tmp3;
int err;
LTC_ARGCHK(ltc_mp.name != NULL);
LTC_ARGCHK(key != NULL);
if ((size < (MIN_RSA_SIZE/; ) || (size> (MAX_RSA_SIZE/; )) {
return CRYPT_INVALID_KEYSIZE;
}
if ((e < 3) || ((e & 1) == 0)) {
return CRYPT_INVALID_ARG;
}
if ((err = prng_is_valid(wprng)) != CRYPT_OK) {
return err;
}
if ((err = mp_init_multi(&p, &q, &tmp1, &tmp2, &tmp3, NULL)) != CRYPT_OK) {
return err;
}
/* make primes p and q (optimization provided by Wayne Scott) */
if ((err = mp_set_int(tmp3, e)) != CRYPT_OK) { goto errkey; } /* tmp3 = e */
/* make prime "p" */
do {
if ((err = rand_prime( p, size/2, prng, wprng)) != CRYPT_OK) { goto errkey; }
if ((err = mp_sub_d( p, 1, tmp1)) != CRYPT_OK) { goto errkey; } /* tmp1 = p-1 */
if ((err = mp_gcd( tmp1, tmp3, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = gcd(p-1, e) */
} while (mp_cmp_d( tmp2, 1) != 0); /* while e divides p-1 */
/* make prime "q" */
do {
if ((err = rand_prime( q, size/2, prng, wprng)) != CRYPT_OK) { goto errkey; }
if ((err = mp_sub_d( q, 1, tmp1)) != CRYPT_OK) { goto errkey; } /* tmp1 = q-1 */
if ((err = mp_gcd( tmp1, tmp3, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = gcd(q-1, e) */
} while (mp_cmp_d( tmp2, 1) != 0); /* while e divides q-1 */
/* tmp1 = lcm(p-1, q-1) */
if ((err = mp_sub_d( p, 1, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = p-1 */
/* tmp1 = q-1 (previous do/while loop) */
if ((err = mp_lcm( tmp1, tmp2, tmp1)) != CRYPT_OK) { goto errkey; } /* tmp1 = lcm(p-1, q-1) */
/* make key */
if ((err = mp_init_multi(&key->e, &key->d, &key->N, &key->dQ, &key->dP, &key->qP, &key->p, &key->q, NULL)) != CRYPT_OK) {
goto errkey;
}
if ((err = mp_set_int( key->e, e)) != CRYPT_OK) { goto errkey; } /* key->e = e */
if ((err = mp_invmod( key->e, tmp1, key->d)) != CRYPT_OK) { goto errkey; } /* key->d = 1/e mod lcm(p-1,q-1) */
if ((err = mp_mul( p, q, key->N)) != CRYPT_OK) { goto errkey; } /* key->N = pq */
/* optimize for CRT now */
/* find d mod q-1 and d mod p-1 */
if ((err = mp_sub_d( p, 1, tmp1)) != CRYPT_OK) { goto errkey; } /* tmp1 = q-1 */
if ((err = mp_sub_d( q, 1, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = p-1 */
if ((err = mp_mod( key->d, tmp1, key->dP)) != CRYPT_OK) { goto errkey; } /* dP = d mod p-1 */
if ((err = mp_mod( key->d, tmp2, key->dQ)) != CRYPT_OK) { goto errkey; } /* dQ = d mod q-1 */
if ((err = mp_invmod( q, p, key->qP)) != CRYPT_OK) { goto errkey; } /* qP = 1/q mod p */
if ((err = mp_copy( p, key->p)) != CRYPT_OK) { goto errkey; }
if ((err = mp_copy( q, key->q)) != CRYPT_OK) { goto errkey; }
/* set key type (in this case it's CRT optimized) */
key->type = PK_PRIVATE;
/* return ok and free temps */
err = CRYPT_OK;
goto cleanup;
errkey:
mp_clear_multi(key->d, key->e, key->N, key->dQ, key->dP, key->qP, key->p, key->q, NULL);
cleanup:
mp_clear_multi(tmp3, tmp2, tmp1, p, q, NULL);
return err;
}
#endif
why do people constantly ask me for things it is it possbile for you to try your self your all seing i should of have seen it all in the codes hint hint am i not wrong ?
---------- Post added at 07:54 PM ---------- Previous post was at 07:53 PM ----------
Originally posted by SCHAOS
I have extracted these from the Eboot.elf aswell as the Default.xex. These are all the direct links to the Black Ops Encryption SRC code. Some are used for packet encryption, some are used for file encryption.
You can Download these and experiment with your own decryption programs.
You must login or register to view this content. (Expand File List)
libtomcrypt-1.17\\src\\modes\\ctr\\ctr_done.c"
libtomcrypt-1.17\\src\\modes\\ctr\\ctr_encrypt.c"
libtomcrypt-1.17\\src\\modes\\ctr\\ctr_start.c"
libtomcrypt-1.17\\src\\misc\\crypt\\crypt_register_cipher.c"
libtomcrypt-1.17\\src\\ciphers\\aes\\aes.c"
libtomcrypt-1.17\\src\\misc\\crypt\\crypt_register_hash.c"
libtomcrypt-1.17\\src\\hashes\\sha2\\sha256.c"
libtomcrypt-1.17\\src\\math\\ltm_desc.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_free.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_verify_hash.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_import.c"
libtomcrypt-1.17\\src\\misc\\crypt\\crypt_find_hash.c"
libtomcrypt-1.17\\src\\modes\\ctr\\ctr_decrypt.c"
libtomcrypt-1.17\\src\\misc\\zeromem.c"
libtomcrypt-1.17\\src\\pk\\ecc\\ltc_ecc_mulmod.c"
libtomcrypt-1.17
\\src\\pk\\ecc\\ltc_ecc_map.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_exptmod.c"
libtomcrypt-1.17\\src\\pk\\ecc\\ltc_ecc_projective_add_point.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_make_key.c"
libtomcrypt-1.17\\src\\pk\\ecc\\ltc_ecc_projective_dbl_point.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\sequence\\der_decode_sequence_ex.c"
libtomcrypt-1.17\\src\\pk\\pkcs1\\pkcs_1_pss_decode.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\sequence\\der_decode_sequence_multi.c"
libtomcrypt-1.17\\src\\math\\rand_prime.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\integer\\der_decode_integer.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\object_identifier\\der_decode_object_identifier.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\boolean\\der_length_boolean.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\integer\\der_length_integer.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\octet\\der_decode_octet_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\short_integer\\der_decode_short_integer.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\utf8\\der_decode_utf8_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\bit\\der_length_bit_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\boolean\\der_decode_boolean.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\sequence\\der_length_sequence.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\short_integer\\der_length_short_integer.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\utf8\\der_length_utf8_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\ia5\\der_length_ia5_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\printable_string\\der_decode_printable_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\printable_string\\der_length_printable_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\choice\\der_decode_choice.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\utctime\\der_decode_utctime.c"
.libtomcrypt-1.17\\src\\pk\\asn1\\der\\octet\\der_length_octet_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\object_identifier\\der_length_object_identifier.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\ia5\\der_decode_ia5_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\bit\\der_decode_bit_string.c"
libtomcrypt-1.17\\src\\pk\\pkcs1\\pkcs_1_mgf1.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\utctime\\der_length_utctime.c"
libtomcrypt-1.17\\src\\hashes\\helper\\hash_memory.c"
libtomcrypt-1.17\\src\\hashes\\tiger.c"
Here is an example of the RSA_MAKE_KEY SRC
#include "tomcrypt.h"
/**
@file rsa_make_key.c
RSA key generation, Tom St Denis
*/
#ifdef LTC_MRSA
/**
Create an RSA key
@param prng An active PRNG state
@param wprng The index of the PRNG desired
@param size The size of the modulus (key size) desired (octets)
@param e The "e" value (public key). e==65537 is a good choice
@param key [out] Destination of a newly created private key pair
@return CRYPT_OK if successful, upon error all allocated ram is freed
*/
int rsa_make_key(prng_state *prng, int wprng, int size, long e, rsa_key *key)
{
void *p, *q, *tmp1, *tmp2, *tmp3;
int err;
LTC_ARGCHK(ltc_mp.name != NULL);
LTC_ARGCHK(key != NULL);
if ((size < (MIN_RSA_SIZE/; ) || (size> (MAX_RSA_SIZE/; )) {
return CRYPT_INVALID_KEYSIZE;
}
if ((e < 3) || ((e & 1) == 0)) {
return CRYPT_INVALID_ARG;
}
if ((err = prng_is_valid(wprng)) != CRYPT_OK) {
return err;
}
if ((err = mp_init_multi(&p, &q, &tmp1, &tmp2, &tmp3, NULL)) != CRYPT_OK) {
return err;
}
/* make primes p and q (optimization provided by Wayne Scott) */
if ((err = mp_set_int(tmp3, e)) != CRYPT_OK) { goto errkey; } /* tmp3 = e */
/* make prime "p" */
do {
if ((err = rand_prime( p, size/2, prng, wprng)) != CRYPT_OK) { goto errkey; }
if ((err = mp_sub_d( p, 1, tmp1)) != CRYPT_OK) { goto errkey; } /* tmp1 = p-1 */
if ((err = mp_gcd( tmp1, tmp3, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = gcd(p-1, e) */
} while (mp_cmp_d( tmp2, 1) != 0); /* while e divides p-1 */
/* make prime "q" */
do {
if ((err = rand_prime( q, size/2, prng, wprng)) != CRYPT_OK) { goto errkey; }
if ((err = mp_sub_d( q, 1, tmp1)) != CRYPT_OK) { goto errkey; } /* tmp1 = q-1 */
if ((err = mp_gcd( tmp1, tmp3, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = gcd(q-1, e) */
} while (mp_cmp_d( tmp2, 1) != 0); /* while e divides q-1 */
/* tmp1 = lcm(p-1, q-1) */
if ((err = mp_sub_d( p, 1, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = p-1 */
/* tmp1 = q-1 (previous do/while loop) */
if ((err = mp_lcm( tmp1, tmp2, tmp1)) != CRYPT_OK) { goto errkey; } /* tmp1 = lcm(p-1, q-1) */
/* make key */
if ((err = mp_init_multi(&key->e, &key->d, &key->N, &key->dQ, &key->dP, &key->qP, &key->p, &key->q, NULL)) != CRYPT_OK) {
goto errkey;
}
if ((err = mp_set_int( key->e, e)) != CRYPT_OK) { goto errkey; } /* key->e = e */
if ((err = mp_invmod( key->e, tmp1, key->d)) != CRYPT_OK) { goto errkey; } /* key->d = 1/e mod lcm(p-1,q-1) */
if ((err = mp_mul( p, q, key->N)) != CRYPT_OK) { goto errkey; } /* key->N = pq */
/* optimize for CRT now */
/* find d mod q-1 and d mod p-1 */
if ((err = mp_sub_d( p, 1, tmp1)) != CRYPT_OK) { goto errkey; } /* tmp1 = q-1 */
if ((err = mp_sub_d( q, 1, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = p-1 */
if ((err = mp_mod( key->d, tmp1, key->dP)) != CRYPT_OK) { goto errkey; } /* dP = d mod p-1 */
if ((err = mp_mod( key->d, tmp2, key->dQ)) != CRYPT_OK) { goto errkey; } /* dQ = d mod q-1 */
if ((err = mp_invmod( q, p, key->qP)) != CRYPT_OK) { goto errkey; } /* qP = 1/q mod p */
if ((err = mp_copy( p, key->p)) != CRYPT_OK) { goto errkey; }
if ((err = mp_copy( q, key->q)) != CRYPT_OK) { goto errkey; }
/* set key type (in this case it's CRT optimized) */
key->type = PK_PRIVATE;
/* return ok and free temps */
err = CRYPT_OK;
goto cleanup;
errkey:
mp_clear_multi(key->d, key->e, key->N, key->dQ, key->dP, key->qP, key->p, key->q, NULL);
cleanup:
mp_clear_multi(tmp3, tmp2, tmp1, p, q, NULL);
return err;
}
#endif
You can Download these and experiment with your own decryption programs.
You must login or register to view this content. (Expand File List)
libtomcrypt-1.17\\src\\modes\\ctr\\ctr_done.c"
libtomcrypt-1.17\\src\\modes\\ctr\\ctr_encrypt.c"
libtomcrypt-1.17\\src\\modes\\ctr\\ctr_start.c"
libtomcrypt-1.17\\src\\misc\\crypt\\crypt_register_cipher.c"
libtomcrypt-1.17\\src\\ciphers\\aes\\aes.c"
libtomcrypt-1.17\\src\\misc\\crypt\\crypt_register_hash.c"
libtomcrypt-1.17\\src\\hashes\\sha2\\sha256.c"
libtomcrypt-1.17\\src\\math\\ltm_desc.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_free.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_verify_hash.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_import.c"
libtomcrypt-1.17\\src\\misc\\crypt\\crypt_find_hash.c"
libtomcrypt-1.17\\src\\modes\\ctr\\ctr_decrypt.c"
libtomcrypt-1.17\\src\\misc\\zeromem.c"
libtomcrypt-1.17\\src\\pk\\ecc\\ltc_ecc_mulmod.c"
libtomcrypt-1.17
\\src\\pk\\ecc\\ltc_ecc_map.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_exptmod.c"
libtomcrypt-1.17\\src\\pk\\ecc\\ltc_ecc_projective_add_point.c"
libtomcrypt-1.17\\src\\pk\\rsa\\rsa_make_key.c"
libtomcrypt-1.17\\src\\pk\\ecc\\ltc_ecc_projective_dbl_point.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\sequence\\der_decode_sequence_ex.c"
libtomcrypt-1.17\\src\\pk\\pkcs1\\pkcs_1_pss_decode.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\sequence\\der_decode_sequence_multi.c"
libtomcrypt-1.17\\src\\math\\rand_prime.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\integer\\der_decode_integer.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\object_identifier\\der_decode_object_identifier.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\boolean\\der_length_boolean.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\integer\\der_length_integer.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\octet\\der_decode_octet_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\short_integer\\der_decode_short_integer.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\utf8\\der_decode_utf8_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\bit\\der_length_bit_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\boolean\\der_decode_boolean.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\sequence\\der_length_sequence.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\short_integer\\der_length_short_integer.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\utf8\\der_length_utf8_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\ia5\\der_length_ia5_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\printable_string\\der_decode_printable_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\printable_string\\der_length_printable_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\choice\\der_decode_choice.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\utctime\\der_decode_utctime.c"
.libtomcrypt-1.17\\src\\pk\\asn1\\der\\octet\\der_length_octet_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\object_identifier\\der_length_object_identifier.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\ia5\\der_decode_ia5_string.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\bit\\der_decode_bit_string.c"
libtomcrypt-1.17\\src\\pk\\pkcs1\\pkcs_1_mgf1.c"
libtomcrypt-1.17\\src\\pk\\asn1\\der\\utctime\\der_length_utctime.c"
libtomcrypt-1.17\\src\\hashes\\helper\\hash_memory.c"
libtomcrypt-1.17\\src\\hashes\\tiger.c"
Here is an example of the RSA_MAKE_KEY SRC
#include "tomcrypt.h"
/**
@file rsa_make_key.c
RSA key generation, Tom St Denis
*/
#ifdef LTC_MRSA
/**
Create an RSA key
@param prng An active PRNG state
@param wprng The index of the PRNG desired
@param size The size of the modulus (key size) desired (octets)
@param e The "e" value (public key). e==65537 is a good choice
@param key [out] Destination of a newly created private key pair
@return CRYPT_OK if successful, upon error all allocated ram is freed
*/
int rsa_make_key(prng_state *prng, int wprng, int size, long e, rsa_key *key)
{
void *p, *q, *tmp1, *tmp2, *tmp3;
int err;
LTC_ARGCHK(ltc_mp.name != NULL);
LTC_ARGCHK(key != NULL);
if ((size < (MIN_RSA_SIZE/; ) || (size> (MAX_RSA_SIZE/; )) {
return CRYPT_INVALID_KEYSIZE;
}
if ((e < 3) || ((e & 1) == 0)) {
return CRYPT_INVALID_ARG;
}
if ((err = prng_is_valid(wprng)) != CRYPT_OK) {
return err;
}
if ((err = mp_init_multi(&p, &q, &tmp1, &tmp2, &tmp3, NULL)) != CRYPT_OK) {
return err;
}
/* make primes p and q (optimization provided by Wayne Scott) */
if ((err = mp_set_int(tmp3, e)) != CRYPT_OK) { goto errkey; } /* tmp3 = e */
/* make prime "p" */
do {
if ((err = rand_prime( p, size/2, prng, wprng)) != CRYPT_OK) { goto errkey; }
if ((err = mp_sub_d( p, 1, tmp1)) != CRYPT_OK) { goto errkey; } /* tmp1 = p-1 */
if ((err = mp_gcd( tmp1, tmp3, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = gcd(p-1, e) */
} while (mp_cmp_d( tmp2, 1) != 0); /* while e divides p-1 */
/* make prime "q" */
do {
if ((err = rand_prime( q, size/2, prng, wprng)) != CRYPT_OK) { goto errkey; }
if ((err = mp_sub_d( q, 1, tmp1)) != CRYPT_OK) { goto errkey; } /* tmp1 = q-1 */
if ((err = mp_gcd( tmp1, tmp3, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = gcd(q-1, e) */
} while (mp_cmp_d( tmp2, 1) != 0); /* while e divides q-1 */
/* tmp1 = lcm(p-1, q-1) */
if ((err = mp_sub_d( p, 1, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = p-1 */
/* tmp1 = q-1 (previous do/while loop) */
if ((err = mp_lcm( tmp1, tmp2, tmp1)) != CRYPT_OK) { goto errkey; } /* tmp1 = lcm(p-1, q-1) */
/* make key */
if ((err = mp_init_multi(&key->e, &key->d, &key->N, &key->dQ, &key->dP, &key->qP, &key->p, &key->q, NULL)) != CRYPT_OK) {
goto errkey;
}
if ((err = mp_set_int( key->e, e)) != CRYPT_OK) { goto errkey; } /* key->e = e */
if ((err = mp_invmod( key->e, tmp1, key->d)) != CRYPT_OK) { goto errkey; } /* key->d = 1/e mod lcm(p-1,q-1) */
if ((err = mp_mul( p, q, key->N)) != CRYPT_OK) { goto errkey; } /* key->N = pq */
/* optimize for CRT now */
/* find d mod q-1 and d mod p-1 */
if ((err = mp_sub_d( p, 1, tmp1)) != CRYPT_OK) { goto errkey; } /* tmp1 = q-1 */
if ((err = mp_sub_d( q, 1, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = p-1 */
if ((err = mp_mod( key->d, tmp1, key->dP)) != CRYPT_OK) { goto errkey; } /* dP = d mod p-1 */
if ((err = mp_mod( key->d, tmp2, key->dQ)) != CRYPT_OK) { goto errkey; } /* dQ = d mod q-1 */
if ((err = mp_invmod( q, p, key->qP)) != CRYPT_OK) { goto errkey; } /* qP = 1/q mod p */
if ((err = mp_copy( p, key->p)) != CRYPT_OK) { goto errkey; }
if ((err = mp_copy( q, key->q)) != CRYPT_OK) { goto errkey; }
/* set key type (in this case it's CRT optimized) */
key->type = PK_PRIVATE;
/* return ok and free temps */
err = CRYPT_OK;
goto cleanup;
errkey:
mp_clear_multi(key->d, key->e, key->N, key->dQ, key->dP, key->qP, key->p, key->q, NULL);
cleanup:
mp_clear_multi(tmp3, tmp2, tmp1, p, q, NULL);
return err;
}
#endif
why do people constantly ask me for things it is it possbile for you to try your self your all seing i should of have seen it all in the codes hint hint am i not wrong ?
The following 2 users groaned at PS3FFviewer for this awful post:
04-30-2011, 12:06 AM
#68
BuC-ShoTz
TeamMvKâ?¢
Originally posted by PS3FFviewer
you have no say in anything no more shhhh ok
---------- Post added at 07:52 PM ---------- Previous post was at 07:51 PM ----------
why do people constantly ask me for things it is it possbile for you to try your self your all seing i should of have seen it all in the codes hint hint am i not wrong ?
---------- Post added at 07:53 PM ---------- Previous post was at 07:52 PM ----------
why do people constantly ask me for things it is it possbile for you to try your self your all seing i should of have seen it all in the codes hint hint am i not wrong ?
---------- Post added at 07:54 PM ---------- Previous post was at 07:53 PM ----------
why do people constantly ask me for things it is it possbile for you to try your self your all seing i should of have seen it all in the codes hint hint am i not wrong ?
---------- Post added at 07:52 PM ---------- Previous post was at 07:51 PM ----------
why do people constantly ask me for things it is it possbile for you to try your self your all seing i should of have seen it all in the codes hint hint am i not wrong ?
---------- Post added at 07:53 PM ---------- Previous post was at 07:52 PM ----------
why do people constantly ask me for things it is it possbile for you to try your self your all seing i should of have seen it all in the codes hint hint am i not wrong ?
---------- Post added at 07:54 PM ---------- Previous post was at 07:53 PM ----------
why do people constantly ask me for things it is it possbile for you to try your self your all seing i should of have seen it all in the codes hint hint am i not wrong ?
its funny that pic in your sig is from my app, what r u trying to take credit or something, and those .dll's arent gonna do anything for you encryption wise, and im the guy that made PS3 FastFile Editor...
your gonna end -rep by everybody, nobodies asking you to release anything.
but if make claims at least back it up with a vid.
dont you love how a noob comes in and claims to have done something?
04-30-2011, 12:09 AM
#69
PS3FFviewer
Banned
Originally posted by ShoTz
its funny that pic in your sig is from my app, what r u trying to take credit or something, and those .dll's arent gonna do anything for you encryption wise, and im the guy that made PS3 FastFile Editor...
as i said belive what you wanna belive i have done what i have i dont care and nothing you see is yours ok i dont have time for frames and jokes child
o ps everything with dll has been modified so your mad
The following 3 users groaned at PS3FFviewer for this awful post:
04-30-2011, 12:11 AM
#70
BuC-ShoTz
TeamMvKâ?¢
Gtfo scrub...
why would you have intellilock dll in there it has nothing to do with decryption you dumbass
its there to provide a license key for an app.
and quit renaming text files to .dll
just from your spelling in your sig we know your stupid
everybody -rep this faggot, try to steal credit for my work
why would you have intellilock dll in there it has nothing to do with decryption you dumbass
its there to provide a license key for an app.
and quit renaming text files to .dll
just from your spelling in your sig we know your stupid
everybody -rep this faggot, try to steal credit for my work
04-30-2011, 01:40 AM
#71
DiJiTaLNiCk
BaLLiN' STaTuS
LOLOL and ur an idiot. no one can decrypt blackops ff files.. not even unkn0wn.
unkn0wn uses CPU and GPU language to get the fastfiles already decrypted..
---------- Post added at 08:40 PM ---------- Previous post was at 08:35 PM ----------
Why are you talking about codes.. there not codes there scripts.. /facepalm
maybe you should take 2 months to create a NGU user and make another set of bullsh*t for MW3..
You wont get sued by sony, as its not there game.. treyarch wont sue you because there speds.
im giving you 24hours to show me some real proof and then ill decide on what you are.. because looks to me that there is no .dll files or ffviewer needed to decrypt a blackops fastfile. its all done with keys and so on.
unkn0wn uses CPU and GPU language to get the fastfiles already decrypted..
---------- Post added at 08:40 PM ---------- Previous post was at 08:35 PM ----------
Originally posted by PS3FFviewer
look in the code there something you are looking for it not to hard i found a method on how to decrypt and encrypt fast files from ps3 it took 2months but I don’t want to releases. I’m afraid of being sued it took a few reversing in algorithms I did it though give it a try if you guys can’t come with something ill releases it to the world
Why are you talking about codes.. there not codes there scripts.. /facepalm
maybe you should take 2 months to create a NGU user and make another set of bullsh*t for MW3..
You wont get sued by sony, as its not there game.. treyarch wont sue you because there speds.
im giving you 24hours to show me some real proof and then ill decide on what you are.. because looks to me that there is no .dll files or ffviewer needed to decrypt a blackops fastfile. its all done with keys and so on.
The following 2 users say thank you to DiJiTaLNiCk for this useful post:
The following 7 users say thank you to hunter12 for this useful post:
04-30-2011, 06:52 AM
#73
Blackstorm
Veni. Vidi. Vici.
Copyright © 2026, NextGenUpdate.
All Rights Reserved.
