2 * Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.
4 * Licensed under the OpenSSL license (the "License"). You may not use
5 * this file except in compliance with the License. You can obtain a copy
6 * in the file LICENSE in the source distribution or at
7 * https://www.openssl.org/source/license.html
11 * Parameter generation follows the updated Appendix 2.2 for FIPS PUB 186,
12 * also Appendix 2.2 of FIPS PUB 186-1 (i.e. use SHA as defined in FIPS PUB
15 #define xxxHASH EVP_sha1()
17 #include <openssl/opensslconf.h>
19 #include "internal/cryptlib.h"
20 #include <openssl/evp.h>
21 #include <openssl/bn.h>
22 #include <openssl/rand.h>
23 #include <openssl/sha.h>
26 int DSA_generate_parameters_ex(DSA *ret, int bits,
27 const unsigned char *seed_in, int seed_len,
28 int *counter_ret, unsigned long *h_ret,
31 if (ret->meth->dsa_paramgen)
32 return ret->meth->dsa_paramgen(ret, bits, seed_in, seed_len,
33 counter_ret, h_ret, cb);
35 const EVP_MD *evpmd = bits >= 2048 ? EVP_sha256() : EVP_sha1();
36 size_t qbits = EVP_MD_size(evpmd) * 8;
38 return dsa_builtin_paramgen(ret, bits, qbits, evpmd,
39 seed_in, seed_len, NULL, counter_ret,
44 int dsa_builtin_paramgen(DSA *ret, size_t bits, size_t qbits,
45 const EVP_MD *evpmd, const unsigned char *seed_in,
46 size_t seed_len, unsigned char *seed_out,
47 int *counter_ret, unsigned long *h_ret, BN_GENCB *cb)
50 unsigned char seed[SHA256_DIGEST_LENGTH];
51 unsigned char md[SHA256_DIGEST_LENGTH];
52 unsigned char buf[SHA256_DIGEST_LENGTH], buf2[SHA256_DIGEST_LENGTH];
53 BIGNUM *r0, *W, *X, *c, *test;
54 BIGNUM *g = NULL, *q = NULL, *p = NULL;
55 BN_MONT_CTX *mont = NULL;
56 int i, k, n = 0, m = 0, qsize = qbits >> 3;
62 if (qsize != SHA_DIGEST_LENGTH && qsize != SHA224_DIGEST_LENGTH &&
63 qsize != SHA256_DIGEST_LENGTH)
68 /* use SHA1 as default */
74 bits = (bits + 63) / 64 * 64;
76 if (seed_in != NULL) {
77 if (seed_len < (size_t)qsize)
79 if (seed_len > (size_t)qsize) {
80 /* Only consume as much seed as is expected. */
83 memcpy(seed, seed_in, seed_len);
86 if ((mont = BN_MONT_CTX_new()) == NULL)
89 if ((ctx = BN_CTX_new()) == NULL)
101 test = BN_CTX_get(ctx);
103 if (!BN_lshift(test, BN_value_one(), bits - 1))
107 for (;;) { /* find q */
108 int use_random_seed = (seed_in == NULL);
111 if (!BN_GENCB_call(cb, 0, m++))
114 if (use_random_seed) {
115 if (RAND_bytes(seed, qsize) <= 0)
118 /* If we come back through, use random seed next time. */
121 memcpy(buf, seed, qsize);
122 memcpy(buf2, seed, qsize);
123 /* precompute "SEED + 1" for step 7: */
124 for (i = qsize - 1; i >= 0; i--) {
131 if (!EVP_Digest(seed, qsize, md, NULL, evpmd, NULL))
133 if (!EVP_Digest(buf, qsize, buf2, NULL, evpmd, NULL))
135 for (i = 0; i < qsize; i++)
140 md[qsize - 1] |= 0x01;
141 if (!BN_bin2bn(md, qsize, q))
145 r = BN_is_prime_fasttest_ex(q, DSS_prime_checks, ctx,
146 use_random_seed, cb);
152 /* do a callback call */
156 if (!BN_GENCB_call(cb, 2, 0))
158 if (!BN_GENCB_call(cb, 3, 0))
165 n = (bits - 1) / 160;
168 if ((counter != 0) && !BN_GENCB_call(cb, 0, counter))
173 /* now 'buf' contains "SEED + offset - 1" */
174 for (k = 0; k <= n; k++) {
176 * obtain "SEED + offset + k" by incrementing:
178 for (i = qsize - 1; i >= 0; i--) {
184 if (!EVP_Digest(buf, qsize, md, NULL, evpmd, NULL))
188 if (!BN_bin2bn(md, qsize, r0))
190 if (!BN_lshift(r0, r0, (qsize << 3) * k))
192 if (!BN_add(W, W, r0))
197 if (!BN_mask_bits(W, bits - 1))
201 if (!BN_add(X, X, test))
205 if (!BN_lshift1(r0, q))
207 if (!BN_mod(c, X, r0, ctx))
209 if (!BN_sub(r0, c, BN_value_one()))
211 if (!BN_sub(p, X, r0))
215 if (BN_cmp(p, test) >= 0) {
217 r = BN_is_prime_fasttest_ex(p, DSS_prime_checks, ctx, 1, cb);
219 goto end; /* found it */
226 /* "offset = offset + n + 1" */
234 if (!BN_GENCB_call(cb, 2, 1))
237 /* We now need to generate g */
239 if (!BN_sub(test, p, BN_value_one()))
241 if (!BN_div(r0, NULL, test, q, ctx))
244 if (!BN_set_word(test, h))
246 if (!BN_MONT_CTX_set(mont, p, ctx))
251 if (!BN_mod_exp_mont(g, test, r0, p, ctx, mont))
255 if (!BN_add(test, test, BN_value_one()))
260 if (!BN_GENCB_call(cb, 3, 1))
272 if (ret->p == NULL || ret->q == NULL || ret->g == NULL) {
276 if (counter_ret != NULL)
277 *counter_ret = counter;
281 memcpy(seed_out, seed, qsize);
286 BN_MONT_CTX_free(mont);
291 * This is a parameter generation algorithm for the DSA2 algorithm as
292 * described in FIPS 186-3.
295 int dsa_builtin_paramgen2(DSA *ret, size_t L, size_t N,
296 const EVP_MD *evpmd, const unsigned char *seed_in,
297 size_t seed_len, int idx, unsigned char *seed_out,
298 int *counter_ret, unsigned long *h_ret,
302 unsigned char *seed = NULL, *seed_tmp = NULL;
303 unsigned char md[EVP_MAX_MD_SIZE];
305 BIGNUM *r0, *W, *X, *c, *test;
306 BIGNUM *g = NULL, *q = NULL, *p = NULL;
307 BN_MONT_CTX *mont = NULL;
308 int i, k, n = 0, m = 0, qsize = N >> 3;
312 EVP_MD_CTX *mctx = EVP_MD_CTX_new();
322 evpmd = EVP_sha224();
324 evpmd = EVP_sha256();
327 mdsize = EVP_MD_size(evpmd);
328 /* If unverifiable g generation only don't need seed */
329 if (!ret->p || !ret->q || idx >= 0) {
333 seed = OPENSSL_malloc(seed_len);
338 seed_tmp = OPENSSL_malloc(seed_len);
340 if (seed == NULL || seed_tmp == NULL)
344 memcpy(seed, seed_in, seed_len);
348 if ((ctx = BN_CTX_new()) == NULL)
351 if ((mont = BN_MONT_CTX_new()) == NULL)
355 r0 = BN_CTX_get(ctx);
360 test = BN_CTX_get(ctx);
364 /* if p, q already supplied generate g only */
365 if (ret->p && ret->q) {
369 memcpy(seed_tmp, seed, seed_len);
376 if (!BN_lshift(test, BN_value_one(), L - 1))
379 for (;;) { /* find q */
382 if (!BN_GENCB_call(cb, 0, m++))
386 if (RAND_bytes(seed, seed_len) <= 0)
390 if (!EVP_Digest(seed, seed_len, md, NULL, evpmd, NULL))
392 /* Take least significant bits of md */
394 pmd = md + mdsize - qsize;
399 memset(md + mdsize, 0, qsize - mdsize);
403 pmd[qsize - 1] |= 0x01;
404 if (!BN_bin2bn(pmd, qsize, q))
408 r = BN_is_prime_fasttest_ex(q, DSS_prime_checks, ctx,
409 seed_in ? 1 : 0, cb);
414 /* Provided seed didn't produce a prime: error */
417 DSAerr(DSA_F_DSA_BUILTIN_PARAMGEN2, DSA_R_Q_NOT_PRIME);
421 /* do a callback call */
424 /* Copy seed to seed_out before we mess with it */
426 memcpy(seed_out, seed, seed_len);
428 if (!BN_GENCB_call(cb, 2, 0))
430 if (!BN_GENCB_call(cb, 3, 0))
437 n = (L - 1) / (mdsize << 3);
440 if ((counter != 0) && !BN_GENCB_call(cb, 0, counter))
445 /* now 'buf' contains "SEED + offset - 1" */
446 for (k = 0; k <= n; k++) {
448 * obtain "SEED + offset + k" by incrementing:
450 for (i = seed_len - 1; i >= 0; i--) {
456 if (!EVP_Digest(seed, seed_len, md, NULL, evpmd, NULL))
460 if (!BN_bin2bn(md, mdsize, r0))
462 if (!BN_lshift(r0, r0, (mdsize << 3) * k))
464 if (!BN_add(W, W, r0))
469 if (!BN_mask_bits(W, L - 1))
473 if (!BN_add(X, X, test))
477 if (!BN_lshift1(r0, q))
479 if (!BN_mod(c, X, r0, ctx))
481 if (!BN_sub(r0, c, BN_value_one()))
483 if (!BN_sub(p, X, r0))
487 if (BN_cmp(p, test) >= 0) {
489 r = BN_is_prime_fasttest_ex(p, DSS_prime_checks, ctx, 1, cb);
491 goto end; /* found it */
498 /* "offset = offset + n + 1" */
501 if (counter >= (int)(4 * L))
506 DSAerr(DSA_F_DSA_BUILTIN_PARAMGEN2, DSA_R_INVALID_PARAMETERS);
511 if (!BN_GENCB_call(cb, 2, 1))
516 /* We now need to generate g */
518 if (!BN_sub(test, p, BN_value_one()))
520 if (!BN_div(r0, NULL, test, q, ctx))
524 if (!BN_set_word(test, h))
528 if (!BN_MONT_CTX_set(mont, p, ctx))
532 static const unsigned char ggen[4] = { 0x67, 0x67, 0x65, 0x6e };
535 md[1] = (h >> 8) & 0xff;
537 if (!EVP_DigestInit_ex(mctx, evpmd, NULL))
539 if (!EVP_DigestUpdate(mctx, seed_tmp, seed_len))
541 if (!EVP_DigestUpdate(mctx, ggen, sizeof(ggen)))
543 if (!EVP_DigestUpdate(mctx, md, 3))
545 if (!EVP_DigestFinal_ex(mctx, md, NULL))
547 if (!BN_bin2bn(md, mdsize, test))
551 if (!BN_mod_exp_mont(g, test, r0, p, ctx, mont))
555 if (idx < 0 && !BN_add(test, test, BN_value_one()))
558 if (idx >= 0 && h > 0xffff)
562 if (!BN_GENCB_call(cb, 3, 1))
578 if (ret->p == NULL || ret->q == NULL || ret->g == NULL) {
582 if (counter_ret != NULL)
583 *counter_ret = counter;
588 if (seed_out != seed_tmp)
589 OPENSSL_free(seed_tmp);
593 BN_MONT_CTX_free(mont);
594 EVP_MD_CTX_free(mctx);