summaryrefslogtreecommitdiff
path: root/src/lib/libcrypto/dsa/dsa_gen.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/lib/libcrypto/dsa/dsa_gen.c')
-rw-r--r--src/lib/libcrypto/dsa/dsa_gen.c296
1 files changed, 0 insertions, 296 deletions
diff --git a/src/lib/libcrypto/dsa/dsa_gen.c b/src/lib/libcrypto/dsa/dsa_gen.c
deleted file mode 100644
index dc9c249310..0000000000
--- a/src/lib/libcrypto/dsa/dsa_gen.c
+++ /dev/null
@@ -1,296 +0,0 @@
1/* crypto/dsa/dsa_gen.c */
2/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
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#undef GENUINE_DSA
60
61#ifdef GENUINE_DSA
62/* Parameter generation follows the original release of FIPS PUB 186,
63 * Appendix 2.2 (i.e. use SHA as defined in FIPS PUB 180) */
64#define HASH EVP_sha()
65#else
66/* Parameter generation follows the updated Appendix 2.2 for FIPS PUB 186,
67 * also Appendix 2.2 of FIPS PUB 186-1 (i.e. use SHA as defined in
68 * FIPS PUB 180-1) */
69#define HASH EVP_sha1()
70#endif
71
72#ifndef OPENSSL_NO_SHA
73
74#include <stdio.h>
75#include <time.h>
76#include "cryptlib.h"
77#include <openssl/evp.h>
78#include <openssl/bn.h>
79#include <openssl/dsa.h>
80#include <openssl/rand.h>
81#include <openssl/sha.h>
82
83DSA *DSA_generate_parameters(int bits,
84 unsigned char *seed_in, int seed_len,
85 int *counter_ret, unsigned long *h_ret,
86 void (*callback)(int, int, void *),
87 void *cb_arg)
88 {
89 int ok=0;
90 unsigned char seed[SHA_DIGEST_LENGTH];
91 unsigned char md[SHA_DIGEST_LENGTH];
92 unsigned char buf[SHA_DIGEST_LENGTH],buf2[SHA_DIGEST_LENGTH];
93 BIGNUM *r0,*W,*X,*c,*test;
94 BIGNUM *g=NULL,*q=NULL,*p=NULL;
95 BN_MONT_CTX *mont=NULL;
96 int k,n=0,i,b,m=0;
97 int counter=0;
98 int r=0;
99 BN_CTX *ctx=NULL,*ctx2=NULL,*ctx3=NULL;
100 unsigned int h=2;
101 DSA *ret=NULL;
102
103 if (bits < 512) bits=512;
104 bits=(bits+63)/64*64;
105
106 if (seed_len < 20)
107 seed_in = NULL; /* seed buffer too small -- ignore */
108 if (seed_len > 20)
109 seed_len = 20; /* App. 2.2 of FIPS PUB 186 allows larger SEED,
110 * but our internal buffers are restricted to 160 bits*/
111 if ((seed_in != NULL) && (seed_len == 20))
112 memcpy(seed,seed_in,seed_len);
113
114 if ((ctx=BN_CTX_new()) == NULL) goto err;
115 if ((ctx2=BN_CTX_new()) == NULL) goto err;
116 if ((ctx3=BN_CTX_new()) == NULL) goto err;
117 if ((ret=DSA_new()) == NULL) goto err;
118
119 if ((mont=BN_MONT_CTX_new()) == NULL) goto err;
120
121 BN_CTX_start(ctx2);
122 r0 = BN_CTX_get(ctx2);
123 g = BN_CTX_get(ctx2);
124 W = BN_CTX_get(ctx2);
125 q = BN_CTX_get(ctx2);
126 X = BN_CTX_get(ctx2);
127 c = BN_CTX_get(ctx2);
128 p = BN_CTX_get(ctx2);
129 test = BN_CTX_get(ctx2);
130
131 BN_lshift(test,BN_value_one(),bits-1);
132
133 for (;;)
134 {
135 for (;;) /* find q */
136 {
137 int seed_is_random;
138
139 /* step 1 */
140 if (callback != NULL) callback(0,m++,cb_arg);
141
142 if (!seed_len)
143 {
144 RAND_pseudo_bytes(seed,SHA_DIGEST_LENGTH);
145 seed_is_random = 1;
146 }
147 else
148 {
149 seed_is_random = 0;
150 seed_len=0; /* use random seed if 'seed_in' turns out to be bad*/
151 }
152 memcpy(buf,seed,SHA_DIGEST_LENGTH);
153 memcpy(buf2,seed,SHA_DIGEST_LENGTH);
154 /* precompute "SEED + 1" for step 7: */
155 for (i=SHA_DIGEST_LENGTH-1; i >= 0; i--)
156 {
157 buf[i]++;
158 if (buf[i] != 0) break;
159 }
160
161 /* step 2 */
162 EVP_Digest(seed,SHA_DIGEST_LENGTH,md,NULL,HASH, NULL);
163 EVP_Digest(buf,SHA_DIGEST_LENGTH,buf2,NULL,HASH, NULL);
164 for (i=0; i<SHA_DIGEST_LENGTH; i++)
165 md[i]^=buf2[i];
166
167 /* step 3 */
168 md[0]|=0x80;
169 md[SHA_DIGEST_LENGTH-1]|=0x01;
170 if (!BN_bin2bn(md,SHA_DIGEST_LENGTH,q)) goto err;
171
172 /* step 4 */
173 r = BN_is_prime_fasttest(q, DSS_prime_checks, callback, ctx3, cb_arg, seed_is_random);
174 if (r > 0)
175 break;
176 if (r != 0)
177 goto err;
178
179 /* do a callback call */
180 /* step 5 */
181 }
182
183 if (callback != NULL) callback(2,0,cb_arg);
184 if (callback != NULL) callback(3,0,cb_arg);
185
186 /* step 6 */
187 counter=0;
188 /* "offset = 2" */
189
190 n=(bits-1)/160;
191 b=(bits-1)-n*160;
192
193 for (;;)
194 {
195 if (callback != NULL && counter != 0)
196 callback(0,counter,cb_arg);
197
198 /* step 7 */
199 BN_zero(W);
200 /* now 'buf' contains "SEED + offset - 1" */
201 for (k=0; k<=n; k++)
202 {
203 /* obtain "SEED + offset + k" by incrementing: */
204 for (i=SHA_DIGEST_LENGTH-1; i >= 0; i--)
205 {
206 buf[i]++;
207 if (buf[i] != 0) break;
208 }
209
210 EVP_Digest(buf,SHA_DIGEST_LENGTH,md,NULL,HASH, NULL);
211
212 /* step 8 */
213 if (!BN_bin2bn(md,SHA_DIGEST_LENGTH,r0))
214 goto err;
215 BN_lshift(r0,r0,160*k);
216 BN_add(W,W,r0);
217 }
218
219 /* more of step 8 */
220 BN_mask_bits(W,bits-1);
221 BN_copy(X,W); /* this should be ok */
222 BN_add(X,X,test); /* this should be ok */
223
224 /* step 9 */
225 BN_lshift1(r0,q);
226 BN_mod(c,X,r0,ctx);
227 BN_sub(r0,c,BN_value_one());
228 BN_sub(p,X,r0);
229
230 /* step 10 */
231 if (BN_cmp(p,test) >= 0)
232 {
233 /* step 11 */
234 r = BN_is_prime_fasttest(p, DSS_prime_checks, callback, ctx3, cb_arg, 1);
235 if (r > 0)
236 goto end; /* found it */
237 if (r != 0)
238 goto err;
239 }
240
241 /* step 13 */
242 counter++;
243 /* "offset = offset + n + 1" */
244
245 /* step 14 */
246 if (counter >= 4096) break;
247 }
248 }
249end:
250 if (callback != NULL) callback(2,1,cb_arg);
251
252 /* We now need to generate g */
253 /* Set r0=(p-1)/q */
254 BN_sub(test,p,BN_value_one());
255 BN_div(r0,NULL,test,q,ctx);
256
257 BN_set_word(test,h);
258 BN_MONT_CTX_set(mont,p,ctx);
259
260 for (;;)
261 {
262 /* g=test^r0%p */
263 BN_mod_exp_mont(g,test,r0,p,ctx,mont);
264 if (!BN_is_one(g)) break;
265 BN_add(test,test,BN_value_one());
266 h++;
267 }
268
269 if (callback != NULL) callback(3,1,cb_arg);
270
271 ok=1;
272err:
273 if (!ok)
274 {
275 if (ret != NULL) DSA_free(ret);
276 }
277 else
278 {
279 ret->p=BN_dup(p);
280 ret->q=BN_dup(q);
281 ret->g=BN_dup(g);
282 if ((m > 1) && (seed_in != NULL)) memcpy(seed_in,seed,20);
283 if (counter_ret != NULL) *counter_ret=counter;
284 if (h_ret != NULL) *h_ret=h;
285 }
286 if (ctx != NULL) BN_CTX_free(ctx);
287 if (ctx2 != NULL)
288 {
289 BN_CTX_end(ctx2);
290 BN_CTX_free(ctx2);
291 }
292 if (ctx3 != NULL) BN_CTX_free(ctx3);
293 if (mont != NULL) BN_MONT_CTX_free(mont);
294 return(ok?ret:NULL);
295 }
296#endif
generated by cgit v1.2.3-55-g6feb (git 2.39.1) at 2025-12-24 20:21:47 +0000