1 /* crypto/dsa/dsa_gen.c */
2 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
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.
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).
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.
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
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)"
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
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.]
60 * Parameter generation follows the updated Appendix 2.2 for FIPS PUB 186,
61 * also Appendix 2.2 of FIPS PUB 186-1 (i.e. use SHA as defined in FIPS PUB
64 #define xxxHASH EVP_sha1()
66 #include <openssl/opensslconf.h> /* To see if OPENSSL_NO_SHA is defined */
69 #include "internal/cryptlib.h"
70 #include <openssl/evp.h>
71 #include <openssl/bn.h>
72 #include <openssl/rand.h>
73 #include <openssl/sha.h>
77 int DSA_generate_parameters_ex(DSA *ret, int bits,
78 const unsigned char *seed_in, int seed_len,
79 int *counter_ret, unsigned long *h_ret,
82 if (ret->meth->dsa_paramgen)
83 return ret->meth->dsa_paramgen(ret, bits, seed_in, seed_len,
84 counter_ret, h_ret, cb);
87 size_t qbits = bits >= 2048 ? 256 : 160;
97 return dsa_builtin_paramgen(ret, bits, qbits, evpmd,
98 seed_in, seed_len, NULL, counter_ret,
103 int dsa_builtin_paramgen(DSA *ret, size_t bits, size_t qbits,
104 const EVP_MD *evpmd, const unsigned char *seed_in,
105 size_t seed_len, unsigned char *seed_out,
106 int *counter_ret, unsigned long *h_ret, BN_GENCB *cb)
109 unsigned char seed[SHA256_DIGEST_LENGTH];
110 unsigned char md[SHA256_DIGEST_LENGTH];
111 unsigned char buf[SHA256_DIGEST_LENGTH], buf2[SHA256_DIGEST_LENGTH];
112 BIGNUM *r0, *W, *X, *c, *test;
113 BIGNUM *g = NULL, *q = NULL, *p = NULL;
114 BN_MONT_CTX *mont = NULL;
115 int i, k, n = 0, m = 0, qsize = qbits >> 3;
121 if (qsize != SHA_DIGEST_LENGTH && qsize != SHA224_DIGEST_LENGTH &&
122 qsize != SHA256_DIGEST_LENGTH)
127 /* use SHA1 as default */
133 bits = (bits + 63) / 64 * 64;
135 if (seed_in != NULL) {
136 if (seed_len < (size_t)qsize)
138 if (seed_len > (size_t)qsize) {
139 /* Only consume as much seed as is expected. */
142 memcpy(seed, seed_in, seed_len);
145 if ((ctx = BN_CTX_new()) == NULL)
148 if ((mont = BN_MONT_CTX_new()) == NULL)
152 r0 = BN_CTX_get(ctx);
159 test = BN_CTX_get(ctx);
161 if (!BN_lshift(test, BN_value_one(), bits - 1))
165 for (;;) { /* find q */
166 int use_random_seed = (seed_in == NULL);
169 if (!BN_GENCB_call(cb, 0, m++))
172 if (use_random_seed) {
173 if (RAND_bytes(seed, qsize) <= 0)
176 /* If we come back through, use random seed next time. */
179 memcpy(buf, seed, qsize);
180 memcpy(buf2, seed, qsize);
181 /* precompute "SEED + 1" for step 7: */
182 for (i = qsize - 1; i >= 0; i--) {
189 if (!EVP_Digest(seed, qsize, md, NULL, evpmd, NULL))
191 if (!EVP_Digest(buf, qsize, buf2, NULL, evpmd, NULL))
193 for (i = 0; i < qsize; i++)
198 md[qsize - 1] |= 0x01;
199 if (!BN_bin2bn(md, qsize, q))
203 r = BN_is_prime_fasttest_ex(q, DSS_prime_checks, ctx,
204 use_random_seed, cb);
210 /* do a callback call */
214 if (!BN_GENCB_call(cb, 2, 0))
216 if (!BN_GENCB_call(cb, 3, 0))
223 n = (bits - 1) / 160;
226 if ((counter != 0) && !BN_GENCB_call(cb, 0, counter))
231 /* now 'buf' contains "SEED + offset - 1" */
232 for (k = 0; k <= n; k++) {
234 * obtain "SEED + offset + k" by incrementing:
236 for (i = qsize - 1; i >= 0; i--) {
242 if (!EVP_Digest(buf, qsize, md, NULL, evpmd, NULL))
246 if (!BN_bin2bn(md, qsize, r0))
248 if (!BN_lshift(r0, r0, (qsize << 3) * k))
250 if (!BN_add(W, W, r0))
255 if (!BN_mask_bits(W, bits - 1))
259 if (!BN_add(X, X, test))
263 if (!BN_lshift1(r0, q))
265 if (!BN_mod(c, X, r0, ctx))
267 if (!BN_sub(r0, c, BN_value_one()))
269 if (!BN_sub(p, X, r0))
273 if (BN_cmp(p, test) >= 0) {
275 r = BN_is_prime_fasttest_ex(p, DSS_prime_checks, ctx, 1, cb);
277 goto end; /* found it */
284 /* "offset = offset + n + 1" */
292 if (!BN_GENCB_call(cb, 2, 1))
295 /* We now need to generate g */
297 if (!BN_sub(test, p, BN_value_one()))
299 if (!BN_div(r0, NULL, test, q, ctx))
302 if (!BN_set_word(test, h))
304 if (!BN_MONT_CTX_set(mont, p, ctx))
309 if (!BN_mod_exp_mont(g, test, r0, p, ctx, mont))
313 if (!BN_add(test, test, BN_value_one()))
318 if (!BN_GENCB_call(cb, 3, 1))
330 if (ret->p == NULL || ret->q == NULL || ret->g == NULL) {
334 if (counter_ret != NULL)
335 *counter_ret = counter;
339 memcpy(seed_out, seed, qsize);
344 BN_MONT_CTX_free(mont);
349 * This is a parameter generation algorithm for the DSA2 algorithm as
350 * described in FIPS 186-3.
353 int dsa_builtin_paramgen2(DSA *ret, size_t L, size_t N,
354 const EVP_MD *evpmd, const unsigned char *seed_in,
355 size_t seed_len, int idx, unsigned char *seed_out,
356 int *counter_ret, unsigned long *h_ret,
360 unsigned char *seed = NULL, *seed_tmp = NULL;
361 unsigned char md[EVP_MAX_MD_SIZE];
363 BIGNUM *r0, *W, *X, *c, *test;
364 BIGNUM *g = NULL, *q = NULL, *p = NULL;
365 BN_MONT_CTX *mont = NULL;
366 int i, k, n = 0, m = 0, qsize = N >> 3;
373 EVP_MD_CTX_init(&mctx);
379 evpmd = EVP_sha224();
381 evpmd = EVP_sha256();
384 mdsize = M_EVP_MD_size(evpmd);
385 /* If unverificable g generation only don't need seed */
386 if (!ret->p || !ret->q || idx >= 0) {
390 seed = OPENSSL_malloc(seed_len);
395 seed_tmp = OPENSSL_malloc(seed_len);
397 if (!seed || !seed_tmp)
401 memcpy(seed, seed_in, seed_len);
405 if ((ctx = BN_CTX_new()) == NULL)
408 if ((mont = BN_MONT_CTX_new()) == NULL)
412 r0 = BN_CTX_get(ctx);
417 test = BN_CTX_get(ctx);
419 /* if p, q already supplied generate g only */
420 if (ret->p && ret->q) {
424 memcpy(seed_tmp, seed, seed_len);
431 if (!BN_lshift(test, BN_value_one(), L - 1))
434 for (;;) { /* find q */
437 if (!BN_GENCB_call(cb, 0, m++))
441 if (RAND_bytes(seed, seed_len) <= 0)
445 if (!EVP_Digest(seed, seed_len, md, NULL, evpmd, NULL))
447 /* Take least significant bits of md */
449 pmd = md + mdsize - qsize;
454 memset(md + mdsize, 0, qsize - mdsize);
458 pmd[qsize - 1] |= 0x01;
459 if (!BN_bin2bn(pmd, qsize, q))
463 r = BN_is_prime_fasttest_ex(q, DSS_prime_checks, ctx,
464 seed_in ? 1 : 0, cb);
469 /* Provided seed didn't produce a prime: error */
472 DSAerr(DSA_F_DSA_BUILTIN_PARAMGEN2, DSA_R_Q_NOT_PRIME);
476 /* do a callback call */
479 /* Copy seed to seed_out before we mess with it */
481 memcpy(seed_out, seed, seed_len);
483 if (!BN_GENCB_call(cb, 2, 0))
485 if (!BN_GENCB_call(cb, 3, 0))
492 n = (L - 1) / (mdsize << 3);
495 if ((counter != 0) && !BN_GENCB_call(cb, 0, counter))
500 /* now 'buf' contains "SEED + offset - 1" */
501 for (k = 0; k <= n; k++) {
503 * obtain "SEED + offset + k" by incrementing:
505 for (i = seed_len - 1; i >= 0; i--) {
511 if (!EVP_Digest(seed, seed_len, md, NULL, evpmd, NULL))
515 if (!BN_bin2bn(md, mdsize, r0))
517 if (!BN_lshift(r0, r0, (mdsize << 3) * k))
519 if (!BN_add(W, W, r0))
524 if (!BN_mask_bits(W, L - 1))
528 if (!BN_add(X, X, test))
532 if (!BN_lshift1(r0, q))
534 if (!BN_mod(c, X, r0, ctx))
536 if (!BN_sub(r0, c, BN_value_one()))
538 if (!BN_sub(p, X, r0))
542 if (BN_cmp(p, test) >= 0) {
544 r = BN_is_prime_fasttest_ex(p, DSS_prime_checks, ctx, 1, cb);
546 goto end; /* found it */
553 /* "offset = offset + n + 1" */
556 if (counter >= (int)(4 * L))
561 DSAerr(DSA_F_DSA_BUILTIN_PARAMGEN2, DSA_R_INVALID_PARAMETERS);
566 if (!BN_GENCB_call(cb, 2, 1))
571 /* We now need to generate g */
573 if (!BN_sub(test, p, BN_value_one()))
575 if (!BN_div(r0, NULL, test, q, ctx))
579 if (!BN_set_word(test, h))
583 if (!BN_MONT_CTX_set(mont, p, ctx))
587 static const unsigned char ggen[4] = { 0x67, 0x67, 0x65, 0x6e };
590 md[1] = (h >> 8) & 0xff;
592 if (!EVP_DigestInit_ex(&mctx, evpmd, NULL))
594 if (!EVP_DigestUpdate(&mctx, seed_tmp, seed_len))
596 if (!EVP_DigestUpdate(&mctx, ggen, sizeof(ggen)))
598 if (!EVP_DigestUpdate(&mctx, md, 3))
600 if (!EVP_DigestFinal_ex(&mctx, md, NULL))
602 if (!BN_bin2bn(md, mdsize, test))
606 if (!BN_mod_exp_mont(g, test, r0, p, ctx, mont))
610 if (idx < 0 && !BN_add(test, test, BN_value_one()))
613 if (idx >= 0 && h > 0xffff)
617 if (!BN_GENCB_call(cb, 3, 1))
633 if (ret->p == NULL || ret->q == NULL || ret->g == NULL) {
637 if (counter_ret != NULL)
638 *counter_ret = counter;
643 if (seed_out != seed_tmp)
644 OPENSSL_free(seed_tmp);
648 BN_MONT_CTX_free(mont);
649 EVP_MD_CTX_cleanup(&mctx);
653 int dsa_paramgen_check_g(DSA *dsa)
657 BN_MONT_CTX *mont = NULL;
663 if (BN_cmp(dsa->g, BN_value_one()) <= 0)
665 if (BN_cmp(dsa->g, dsa->p) >= 0)
667 tmp = BN_CTX_get(ctx);
670 if ((mont = BN_MONT_CTX_new()) == NULL)
672 if (!BN_MONT_CTX_set(mont, dsa->p, ctx))
674 /* Work out g^q mod p */
675 if (!BN_mod_exp_mont(tmp, dsa->g, dsa->q, dsa->p, ctx, mont))
677 if (!BN_cmp(tmp, BN_value_one()))
683 BN_MONT_CTX_free(mont);