]>
Commit | Line | Data |
---|---|---|
2b4b28dc DSH |
1 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) |
2 | * All rights reserved. | |
3 | * | |
4 | * This package is an SSL implementation written | |
5 | * by Eric Young (eay@cryptsoft.com). | |
6 | * The implementation was written so as to conform with Netscapes SSL. | |
0f113f3e | 7 | * |
2b4b28dc DSH |
8 | * This library is free for commercial and non-commercial use as long as |
9 | * the following conditions are aheared to. The following conditions | |
10 | * apply to all code found in this distribution, be it the RC4, RSA, | |
11 | * lhash, DES, etc., code; not just the SSL code. The SSL documentation | |
12 | * included with this distribution is covered by the same copyright terms | |
13 | * except that the holder is Tim Hudson (tjh@cryptsoft.com). | |
0f113f3e | 14 | * |
2b4b28dc DSH |
15 | * Copyright remains Eric Young's, and as such any Copyright notices in |
16 | * the code are not to be removed. | |
17 | * If this package is used in a product, Eric Young should be given attribution | |
18 | * as the author of the parts of the library used. | |
19 | * This can be in the form of a textual message at program startup or | |
20 | * in documentation (online or textual) provided with the package. | |
0f113f3e | 21 | * |
2b4b28dc DSH |
22 | * Redistribution and use in source and binary forms, with or without |
23 | * modification, are permitted provided that the following conditions | |
24 | * are met: | |
25 | * 1. Redistributions of source code must retain the copyright | |
26 | * notice, this list of conditions and the following disclaimer. | |
27 | * 2. Redistributions in binary form must reproduce the above copyright | |
28 | * notice, this list of conditions and the following disclaimer in the | |
29 | * documentation and/or other materials provided with the distribution. | |
30 | * 3. All advertising materials mentioning features or use of this software | |
31 | * must display the following acknowledgement: | |
32 | * "This product includes cryptographic software written by | |
33 | * Eric Young (eay@cryptsoft.com)" | |
34 | * The word 'cryptographic' can be left out if the rouines from the library | |
35 | * being used are not cryptographic related :-). | |
0f113f3e | 36 | * 4. If you include any Windows specific code (or a derivative thereof) from |
2b4b28dc DSH |
37 | * the apps directory (application code) you must include an acknowledgement: |
38 | * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" | |
0f113f3e | 39 | * |
2b4b28dc DSH |
40 | * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND |
41 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
42 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
43 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE | |
44 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
45 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
46 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
48 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
49 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
50 | * SUCH DAMAGE. | |
0f113f3e | 51 | * |
2b4b28dc DSH |
52 | * The licence and distribution terms for any publically available version or |
53 | * derivative of this code cannot be changed. i.e. this code cannot simply be | |
54 | * copied and put under another distribution licence | |
55 | * [including the GNU Public Licence.] | |
56 | */ | |
57 | ||
58 | #include <stdio.h> | |
59 | #include <string.h> | |
60 | #include <time.h> | |
61 | #include <openssl/err.h> | |
62 | #include <openssl/bn.h> | |
63 | #include <openssl/rsa.h> | |
2b4b28dc | 64 | |
2b4b28dc DSH |
65 | /* X9.31 RSA key derivation and generation */ |
66 | ||
0f113f3e MC |
67 | int RSA_X931_derive_ex(RSA *rsa, BIGNUM *p1, BIGNUM *p2, BIGNUM *q1, |
68 | BIGNUM *q2, const BIGNUM *Xp1, const BIGNUM *Xp2, | |
69 | const BIGNUM *Xp, const BIGNUM *Xq1, const BIGNUM *Xq2, | |
70 | const BIGNUM *Xq, const BIGNUM *e, BN_GENCB *cb) | |
71 | { | |
72 | BIGNUM *r0 = NULL, *r1 = NULL, *r2 = NULL, *r3 = NULL; | |
73 | BN_CTX *ctx = NULL, *ctx2 = NULL; | |
007fd140 | 74 | int ret = 0; |
0f113f3e MC |
75 | |
76 | if (!rsa) | |
77 | goto err; | |
78 | ||
79 | ctx = BN_CTX_new(); | |
90945fa3 | 80 | if (ctx == NULL) |
0f113f3e | 81 | goto err; |
007fd140 | 82 | BN_CTX_start(ctx); |
0f113f3e MC |
83 | |
84 | r0 = BN_CTX_get(ctx); | |
85 | r1 = BN_CTX_get(ctx); | |
86 | r2 = BN_CTX_get(ctx); | |
87 | r3 = BN_CTX_get(ctx); | |
88 | ||
89 | if (r3 == NULL) | |
90 | goto err; | |
91 | if (!rsa->e) { | |
92 | rsa->e = BN_dup(e); | |
93 | if (!rsa->e) | |
94 | goto err; | |
95 | } else | |
96 | e = rsa->e; | |
97 | ||
98 | /* | |
99 | * If not all parameters present only calculate what we can. This allows | |
100 | * test programs to output selective parameters. | |
101 | */ | |
102 | ||
90945fa3 | 103 | if (Xp && rsa->p == NULL) { |
0f113f3e | 104 | rsa->p = BN_new(); |
90945fa3 | 105 | if (rsa->p == NULL) |
0f113f3e MC |
106 | goto err; |
107 | ||
108 | if (!BN_X931_derive_prime_ex(rsa->p, p1, p2, | |
109 | Xp, Xp1, Xp2, e, ctx, cb)) | |
110 | goto err; | |
111 | } | |
112 | ||
90945fa3 | 113 | if (Xq && rsa->q == NULL) { |
0f113f3e | 114 | rsa->q = BN_new(); |
90945fa3 | 115 | if (rsa->q == NULL) |
0f113f3e MC |
116 | goto err; |
117 | if (!BN_X931_derive_prime_ex(rsa->q, q1, q2, | |
118 | Xq, Xq1, Xq2, e, ctx, cb)) | |
119 | goto err; | |
120 | } | |
121 | ||
90945fa3 | 122 | if (rsa->p == NULL || rsa->q == NULL) { |
0f113f3e MC |
123 | BN_CTX_end(ctx); |
124 | BN_CTX_free(ctx); | |
125 | return 2; | |
126 | } | |
127 | ||
128 | /* | |
129 | * Since both primes are set we can now calculate all remaining | |
130 | * components. | |
131 | */ | |
132 | ||
133 | /* calculate n */ | |
134 | rsa->n = BN_new(); | |
135 | if (rsa->n == NULL) | |
136 | goto err; | |
137 | if (!BN_mul(rsa->n, rsa->p, rsa->q, ctx)) | |
138 | goto err; | |
139 | ||
140 | /* calculate d */ | |
141 | if (!BN_sub(r1, rsa->p, BN_value_one())) | |
142 | goto err; /* p-1 */ | |
143 | if (!BN_sub(r2, rsa->q, BN_value_one())) | |
144 | goto err; /* q-1 */ | |
145 | if (!BN_mul(r0, r1, r2, ctx)) | |
146 | goto err; /* (p-1)(q-1) */ | |
147 | ||
148 | if (!BN_gcd(r3, r1, r2, ctx)) | |
149 | goto err; | |
150 | ||
151 | if (!BN_div(r0, NULL, r0, r3, ctx)) | |
152 | goto err; /* LCM((p-1)(q-1)) */ | |
153 | ||
154 | ctx2 = BN_CTX_new(); | |
90945fa3 | 155 | if (ctx2 == NULL) |
0f113f3e MC |
156 | goto err; |
157 | ||
158 | rsa->d = BN_mod_inverse(NULL, rsa->e, r0, ctx2); /* d */ | |
159 | if (rsa->d == NULL) | |
160 | goto err; | |
161 | ||
162 | /* calculate d mod (p-1) */ | |
163 | rsa->dmp1 = BN_new(); | |
164 | if (rsa->dmp1 == NULL) | |
165 | goto err; | |
166 | if (!BN_mod(rsa->dmp1, rsa->d, r1, ctx)) | |
167 | goto err; | |
168 | ||
169 | /* calculate d mod (q-1) */ | |
170 | rsa->dmq1 = BN_new(); | |
171 | if (rsa->dmq1 == NULL) | |
172 | goto err; | |
173 | if (!BN_mod(rsa->dmq1, rsa->d, r2, ctx)) | |
174 | goto err; | |
175 | ||
176 | /* calculate inverse of q mod p */ | |
177 | rsa->iqmp = BN_mod_inverse(NULL, rsa->q, rsa->p, ctx2); | |
178 | ||
007fd140 | 179 | ret = 1; |
0f113f3e | 180 | err: |
23a1d5e9 | 181 | if (ctx) |
0f113f3e | 182 | BN_CTX_end(ctx); |
23a1d5e9 RS |
183 | BN_CTX_free(ctx); |
184 | BN_CTX_free(ctx2); | |
0f113f3e | 185 | |
007fd140 | 186 | return ret; |
0f113f3e MC |
187 | |
188 | } | |
189 | ||
190 | int RSA_X931_generate_key_ex(RSA *rsa, int bits, const BIGNUM *e, | |
191 | BN_GENCB *cb) | |
192 | { | |
193 | int ok = 0; | |
194 | BIGNUM *Xp = NULL, *Xq = NULL; | |
195 | BN_CTX *ctx = NULL; | |
196 | ||
197 | ctx = BN_CTX_new(); | |
90945fa3 | 198 | if (ctx == NULL) |
0f113f3e MC |
199 | goto error; |
200 | ||
201 | BN_CTX_start(ctx); | |
202 | Xp = BN_CTX_get(ctx); | |
203 | Xq = BN_CTX_get(ctx); | |
204 | if (!BN_X931_generate_Xpq(Xp, Xq, bits, ctx)) | |
205 | goto error; | |
206 | ||
207 | rsa->p = BN_new(); | |
208 | rsa->q = BN_new(); | |
90945fa3 | 209 | if (rsa->p == NULL || rsa->q == NULL) |
0f113f3e MC |
210 | goto error; |
211 | ||
212 | /* Generate two primes from Xp, Xq */ | |
213 | ||
214 | if (!BN_X931_generate_prime_ex(rsa->p, NULL, NULL, NULL, NULL, Xp, | |
215 | e, ctx, cb)) | |
216 | goto error; | |
217 | ||
218 | if (!BN_X931_generate_prime_ex(rsa->q, NULL, NULL, NULL, NULL, Xq, | |
219 | e, ctx, cb)) | |
220 | goto error; | |
221 | ||
222 | /* | |
223 | * Since rsa->p and rsa->q are valid this call will just derive remaining | |
224 | * RSA components. | |
225 | */ | |
226 | ||
227 | if (!RSA_X931_derive_ex(rsa, NULL, NULL, NULL, NULL, | |
228 | NULL, NULL, NULL, NULL, NULL, NULL, e, cb)) | |
229 | goto error; | |
230 | ||
231 | ok = 1; | |
232 | ||
233 | error: | |
23a1d5e9 | 234 | if (ctx) |
0f113f3e | 235 | BN_CTX_end(ctx); |
23a1d5e9 | 236 | BN_CTX_free(ctx); |
0f113f3e MC |
237 | |
238 | if (ok) | |
239 | return 1; | |
240 | ||
241 | return 0; | |
242 | ||
243 | } |