]>
Commit | Line | Data |
---|---|---|
d02b48c6 | 1 | /* crypto/rsa/rsa_gen.c */ |
58964a49 | 2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) |
d02b48c6 RE |
3 | * All rights reserved. |
4 | * | |
5 | * This package is an SSL implementation written | |
6 | * by Eric Young (eay@cryptsoft.com). | |
7 | * The implementation was written so as to conform with Netscapes SSL. | |
8 | * | |
9 | * This library is free for commercial and non-commercial use as long as | |
10 | * the following conditions are aheared to. The following conditions | |
11 | * apply to all code found in this distribution, be it the RC4, RSA, | |
12 | * lhash, DES, etc., code; not just the SSL code. The SSL documentation | |
13 | * included with this distribution is covered by the same copyright terms | |
14 | * except that the holder is Tim Hudson (tjh@cryptsoft.com). | |
15 | * | |
16 | * Copyright remains Eric Young's, and as such any Copyright notices in | |
17 | * the code are not to be removed. | |
18 | * If this package is used in a product, Eric Young should be given attribution | |
19 | * as the author of the parts of the library used. | |
20 | * This can be in the form of a textual message at program startup or | |
21 | * in documentation (online or textual) provided with the package. | |
22 | * | |
23 | * Redistribution and use in source and binary forms, with or without | |
24 | * modification, are permitted provided that the following conditions | |
25 | * are met: | |
26 | * 1. Redistributions of source code must retain the copyright | |
27 | * notice, this list of conditions and the following disclaimer. | |
28 | * 2. Redistributions in binary form must reproduce the above copyright | |
29 | * notice, this list of conditions and the following disclaimer in the | |
30 | * documentation and/or other materials provided with the distribution. | |
31 | * 3. All advertising materials mentioning features or use of this software | |
32 | * must display the following acknowledgement: | |
33 | * "This product includes cryptographic software written by | |
34 | * Eric Young (eay@cryptsoft.com)" | |
35 | * The word 'cryptographic' can be left out if the rouines from the library | |
36 | * being used are not cryptographic related :-). | |
37 | * 4. If you include any Windows specific code (or a derivative thereof) from | |
38 | * the apps directory (application code) you must include an acknowledgement: | |
39 | * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" | |
40 | * | |
41 | * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND | |
42 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
43 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
44 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE | |
45 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
46 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
47 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
48 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
49 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
50 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
51 | * SUCH DAMAGE. | |
52 | * | |
53 | * The licence and distribution terms for any publically available version or | |
54 | * derivative of this code cannot be changed. i.e. this code cannot simply be | |
55 | * copied and put under another distribution licence | |
56 | * [including the GNU Public Licence.] | |
57 | */ | |
58 | ||
59 | #include <stdio.h> | |
60 | #include <time.h> | |
61 | #include "cryptlib.h" | |
62 | #include "bn.h" | |
63 | #include "rsa.h" | |
64 | ||
58964a49 | 65 | RSA *RSA_generate_key(bits, e_value, callback,cb_arg) |
d02b48c6 RE |
66 | int bits; |
67 | unsigned long e_value; | |
58964a49 RE |
68 | void (*callback)(P_I_I_P); |
69 | char *cb_arg; | |
d02b48c6 RE |
70 | { |
71 | RSA *rsa=NULL; | |
72 | BIGNUM *r0=NULL,*r1=NULL,*r2=NULL,*r3=NULL,*tmp; | |
dfeab068 | 73 | int bitsp,bitsq,ok= -1,n=0,i; |
d02b48c6 RE |
74 | BN_CTX *ctx=NULL,*ctx2=NULL; |
75 | ||
76 | ctx=BN_CTX_new(); | |
77 | if (ctx == NULL) goto err; | |
78 | ctx2=BN_CTX_new(); | |
79 | if (ctx2 == NULL) goto err; | |
dfeab068 RE |
80 | r0= &(ctx->bn[0]); |
81 | r1= &(ctx->bn[1]); | |
82 | r2= &(ctx->bn[2]); | |
83 | r3= &(ctx->bn[3]); | |
d02b48c6 RE |
84 | ctx->tos+=4; |
85 | ||
86 | bitsp=(bits+1)/2; | |
87 | bitsq=bits-bitsp; | |
88 | rsa=RSA_new(); | |
89 | if (rsa == NULL) goto err; | |
90 | ||
91 | /* set e */ | |
92 | rsa->e=BN_new(); | |
93 | if (rsa->e == NULL) goto err; | |
dfeab068 RE |
94 | |
95 | #if 1 | |
96 | /* The problem is when building with 8, 16, or 32 BN_ULONG, | |
97 | * unsigned long can be larger */ | |
98 | for (i=0; i<sizeof(unsigned long)*8; i++) | |
99 | { | |
100 | if (e_value & (1<<i)) | |
101 | BN_set_bit(rsa->e,i); | |
102 | } | |
103 | #else | |
d02b48c6 | 104 | if (!BN_set_word(rsa->e,e_value)) goto err; |
dfeab068 | 105 | #endif |
d02b48c6 RE |
106 | |
107 | /* generate p and q */ | |
108 | for (;;) | |
109 | { | |
dfeab068 | 110 | rsa->p=BN_generate_prime(NULL,bitsp,0,NULL,NULL,callback,cb_arg); |
d02b48c6 RE |
111 | if (rsa->p == NULL) goto err; |
112 | if (!BN_sub(r2,rsa->p,BN_value_one())) goto err; | |
113 | if (!BN_gcd(r1,r2,rsa->e,ctx)) goto err; | |
114 | if (BN_is_one(r1)) break; | |
58964a49 | 115 | if (callback != NULL) callback(2,n++,cb_arg); |
d02b48c6 RE |
116 | BN_free(rsa->p); |
117 | } | |
58964a49 | 118 | if (callback != NULL) callback(3,0,cb_arg); |
d02b48c6 RE |
119 | for (;;) |
120 | { | |
dfeab068 | 121 | rsa->q=BN_generate_prime(NULL,bitsq,0,NULL,NULL,callback,cb_arg); |
d02b48c6 RE |
122 | if (rsa->q == NULL) goto err; |
123 | if (!BN_sub(r2,rsa->q,BN_value_one())) goto err; | |
124 | if (!BN_gcd(r1,r2,rsa->e,ctx)) goto err; | |
125 | if (BN_is_one(r1) && (BN_cmp(rsa->p,rsa->q) != 0)) | |
126 | break; | |
58964a49 | 127 | if (callback != NULL) callback(2,n++,cb_arg); |
d02b48c6 RE |
128 | BN_free(rsa->q); |
129 | } | |
58964a49 | 130 | if (callback != NULL) callback(3,1,cb_arg); |
d02b48c6 RE |
131 | if (BN_cmp(rsa->p,rsa->q) < 0) |
132 | { | |
133 | tmp=rsa->p; | |
134 | rsa->p=rsa->q; | |
135 | rsa->q=tmp; | |
136 | } | |
137 | ||
138 | /* calculate n */ | |
139 | rsa->n=BN_new(); | |
140 | if (rsa->n == NULL) goto err; | |
dfeab068 | 141 | if (!BN_mul(rsa->n,rsa->p,rsa->q,ctx)) goto err; |
d02b48c6 RE |
142 | |
143 | /* calculate d */ | |
144 | if (!BN_sub(r1,rsa->p,BN_value_one())) goto err; /* p-1 */ | |
145 | if (!BN_sub(r2,rsa->q,BN_value_one())) goto err; /* q-1 */ | |
dfeab068 | 146 | if (!BN_mul(r0,r1,r2,ctx)) goto err; /* (p-1)(q-1) */ |
d02b48c6 RE |
147 | |
148 | /* should not be needed, since gcd(p-1,e) == 1 and gcd(q-1,e) == 1 */ | |
149 | /* for (;;) | |
150 | { | |
151 | if (!BN_gcd(r3,r0,rsa->e,ctx)) goto err; | |
152 | if (BN_is_one(r3)) break; | |
153 | ||
154 | if (1) | |
155 | { | |
156 | if (!BN_add_word(rsa->e,2L)) goto err; | |
157 | continue; | |
158 | } | |
159 | RSAerr(RSA_F_RSA_GENERATE_KEY,RSA_R_BAD_E_VALUE); | |
160 | goto err; | |
161 | } | |
162 | */ | |
dfeab068 | 163 | rsa->d=(BIGNUM *)BN_mod_inverse(NULL,rsa->e,r0,ctx2); /* d */ |
d02b48c6 RE |
164 | if (rsa->d == NULL) goto err; |
165 | ||
166 | /* calculate d mod (p-1) */ | |
167 | rsa->dmp1=BN_new(); | |
168 | if (rsa->dmp1 == NULL) goto err; | |
169 | if (!BN_mod(rsa->dmp1,rsa->d,r1,ctx)) goto err; | |
170 | ||
171 | /* calculate d mod (q-1) */ | |
172 | rsa->dmq1=BN_new(); | |
173 | if (rsa->dmq1 == NULL) goto err; | |
174 | if (!BN_mod(rsa->dmq1,rsa->d,r2,ctx)) goto err; | |
175 | ||
176 | /* calculate inverse of q mod p */ | |
dfeab068 | 177 | rsa->iqmp=BN_mod_inverse(NULL,rsa->q,rsa->p,ctx2); |
d02b48c6 RE |
178 | if (rsa->iqmp == NULL) goto err; |
179 | ||
180 | ok=1; | |
181 | err: | |
182 | if (ok == -1) | |
183 | { | |
184 | RSAerr(RSA_F_RSA_GENERATE_KEY,ERR_LIB_BN); | |
185 | ok=0; | |
186 | } | |
187 | BN_CTX_free(ctx); | |
188 | BN_CTX_free(ctx2); | |
189 | ||
190 | if (!ok) | |
191 | { | |
192 | if (rsa != NULL) RSA_free(rsa); | |
193 | return(NULL); | |
194 | } | |
195 | else | |
196 | return(rsa); | |
197 | } | |
198 |