48
if ((err = mp_init_multi(&p, &q, &tmp1, &tmp2, &tmp3, NULL)) != MP_OKAY) {
49
return mpi_to_ltc_error(err);
49
if ((err = mp_init_multi(&p, &q, &tmp1, &tmp2, &tmp3, NULL)) != CRYPT_OK) {
52
53
/* make primes p and q (optimization provided by Wayne Scott) */
53
if ((err = mp_set_int(&tmp3, e)) != MP_OKAY) { goto error; } /* tmp3 = e */
54
if ((err = mp_set_int(tmp3, e)) != CRYPT_OK) { goto errkey; } /* tmp3 = e */
55
56
/* make prime "p" */
57
if ((err = rand_prime(&p, size*4, prng, wprng)) != CRYPT_OK) { goto done; }
58
if ((err = mp_sub_d(&p, 1, &tmp1)) != MP_OKAY) { goto error; } /* tmp1 = p-1 */
59
if ((err = mp_gcd(&tmp1, &tmp3, &tmp2)) != MP_OKAY) { goto error; } /* tmp2 = gcd(p-1, e) */
60
} while (mp_cmp_d(&tmp2, 1) != 0); /* while e divides p-1 */
58
if ((err = rand_prime( p, size/2, prng, wprng)) != CRYPT_OK) { goto errkey; }
59
if ((err = mp_sub_d( p, 1, tmp1)) != CRYPT_OK) { goto errkey; } /* tmp1 = p-1 */
60
if ((err = mp_gcd( tmp1, tmp3, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = gcd(p-1, e) */
61
} while (mp_cmp_d( tmp2, 1) != 0); /* while e divides p-1 */
62
63
/* make prime "q" */
64
if ((err = rand_prime(&q, size*4, prng, wprng)) != CRYPT_OK) { goto done; }
65
if ((err = mp_sub_d(&q, 1, &tmp1)) != MP_OKAY) { goto error; } /* tmp1 = q-1 */
66
if ((err = mp_gcd(&tmp1, &tmp3, &tmp2)) != MP_OKAY) { goto error; } /* tmp2 = gcd(q-1, e) */
67
} while (mp_cmp_d(&tmp2, 1) != 0); /* while e divides q-1 */
65
if ((err = rand_prime( q, size/2, prng, wprng)) != CRYPT_OK) { goto errkey; }
66
if ((err = mp_sub_d( q, 1, tmp1)) != CRYPT_OK) { goto errkey; } /* tmp1 = q-1 */
67
if ((err = mp_gcd( tmp1, tmp3, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = gcd(q-1, e) */
68
} while (mp_cmp_d( tmp2, 1) != 0); /* while e divides q-1 */
69
70
/* tmp1 = lcm(p-1, q-1) */
70
if ((err = mp_sub_d(&p, 1, &tmp2)) != MP_OKAY) { goto error; } /* tmp2 = p-1 */
71
/* tmp1 = q-1 (previous do/while loop) */
72
if ((err = mp_lcm(&tmp1, &tmp2, &tmp1)) != MP_OKAY) { goto error; } /* tmp1 = lcm(p-1, q-1) */
71
if ((err = mp_sub_d( p, 1, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = p-1 */
72
/* tmp1 = q-1 (previous do/while loop) */
73
if ((err = mp_lcm( tmp1, tmp2, tmp1)) != CRYPT_OK) { goto errkey; } /* tmp1 = lcm(p-1, q-1) */
75
if ((err = mp_init_multi(&key->e, &key->d, &key->N, &key->dQ, &key->dP,
76
&key->qP, &key->p, &key->q, NULL)) != MP_OKAY) {
76
if ((err = mp_init_multi(&key->e, &key->d, &key->N, &key->dQ, &key->dP, &key->qP, &key->p, &key->q, NULL)) != CRYPT_OK) {
80
if ((err = mp_set_int(&key->e, e)) != MP_OKAY) { goto error2; } /* key->e = e */
81
if ((err = mp_invmod(&key->e, &tmp1, &key->d)) != MP_OKAY) { goto error2; } /* key->d = 1/e mod lcm(p-1,q-1) */
82
if ((err = mp_mul(&p, &q, &key->N)) != MP_OKAY) { goto error2; } /* key->N = pq */
80
if ((err = mp_set_int( key->e, e)) != CRYPT_OK) { goto errkey; } /* key->e = e */
81
if ((err = mp_invmod( key->e, tmp1, key->d)) != CRYPT_OK) { goto errkey; } /* key->d = 1/e mod lcm(p-1,q-1) */
82
if ((err = mp_mul( p, q, key->N)) != CRYPT_OK) { goto errkey; } /* key->N = pq */
84
84
/* optimize for CRT now */
85
85
/* find d mod q-1 and d mod p-1 */
86
if ((err = mp_sub_d(&p, 1, &tmp1)) != MP_OKAY) { goto error2; } /* tmp1 = q-1 */
87
if ((err = mp_sub_d(&q, 1, &tmp2)) != MP_OKAY) { goto error2; } /* tmp2 = p-1 */
88
if ((err = mp_mod(&key->d, &tmp1, &key->dP)) != MP_OKAY) { goto error2; } /* dP = d mod p-1 */
89
if ((err = mp_mod(&key->d, &tmp2, &key->dQ)) != MP_OKAY) { goto error2; } /* dQ = d mod q-1 */
90
if ((err = mp_invmod(&q, &p, &key->qP)) != MP_OKAY) { goto error2; } /* qP = 1/q mod p */
92
if ((err = mp_copy(&p, &key->p)) != MP_OKAY) { goto error2; }
93
if ((err = mp_copy(&q, &key->q)) != MP_OKAY) { goto error2; }
95
/* shrink ram required */
96
if ((err = mp_shrink(&key->e)) != MP_OKAY) { goto error2; }
97
if ((err = mp_shrink(&key->d)) != MP_OKAY) { goto error2; }
98
if ((err = mp_shrink(&key->N)) != MP_OKAY) { goto error2; }
99
if ((err = mp_shrink(&key->dQ)) != MP_OKAY) { goto error2; }
100
if ((err = mp_shrink(&key->dP)) != MP_OKAY) { goto error2; }
101
if ((err = mp_shrink(&key->qP)) != MP_OKAY) { goto error2; }
102
if ((err = mp_shrink(&key->p)) != MP_OKAY) { goto error2; }
103
if ((err = mp_shrink(&key->q)) != MP_OKAY) { goto error2; }
86
if ((err = mp_sub_d( p, 1, tmp1)) != CRYPT_OK) { goto errkey; } /* tmp1 = q-1 */
87
if ((err = mp_sub_d( q, 1, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = p-1 */
88
if ((err = mp_mod( key->d, tmp1, key->dP)) != CRYPT_OK) { goto errkey; } /* dP = d mod p-1 */
89
if ((err = mp_mod( key->d, tmp2, key->dQ)) != CRYPT_OK) { goto errkey; } /* dQ = d mod q-1 */
90
if ((err = mp_invmod( q, p, key->qP)) != CRYPT_OK) { goto errkey; } /* qP = 1/q mod p */
92
if ((err = mp_copy( p, key->p)) != CRYPT_OK) { goto errkey; }
93
if ((err = mp_copy( q, key->q)) != CRYPT_OK) { goto errkey; }
105
95
/* set key type (in this case it's CRT optimized) */
106
96
key->type = PK_PRIVATE;
108
98
/* return ok and free temps */
112
mp_clear_multi(&key->d, &key->e, &key->N, &key->dQ, &key->dP,
113
&key->qP, &key->p, &key->q, NULL);
115
err = mpi_to_ltc_error(err);
117
mp_clear_multi(&tmp3, &tmp2, &tmp1, &p, &q, NULL);
102
mp_clear_multi(key->d, key->e, key->N, key->dQ, key->dP, key->qP, key->p, key->q, NULL);
104
mp_clear_multi(tmp3, tmp2, tmp1, p, q, NULL);
123
110
/* $Source: /cvs/libtom/libtomcrypt/src/pk/rsa/rsa_make_key.c,v $ */
124
/* $Revision: 1.3 $ */
125
/* $Date: 2005/05/05 14:35:59 $ */
111
/* $Revision: 1.14 $ */
112
/* $Date: 2006/12/04 22:23:27 $ */