2016-05-18 02:51:26 +08:00
|
|
|
/*
|
2018-04-17 21:18:40 +08:00
|
|
|
* Copyright 1995-2018 The OpenSSL Project Authors. All Rights Reserved.
|
2015-01-22 11:40:55 +08:00
|
|
|
*
|
2016-05-18 02:51:26 +08:00
|
|
|
* Licensed under the OpenSSL license (the "License"). You may not use
|
|
|
|
* this file except in compliance with the License. You can obtain a copy
|
|
|
|
* in the file LICENSE in the source distribution or at
|
|
|
|
* https://www.openssl.org/source/license.html
|
1998-12-21 18:52:47 +08:00
|
|
|
*/
|
|
|
|
|
2015-01-22 11:40:55 +08:00
|
|
|
/*
|
|
|
|
* Parameter generation follows the updated Appendix 2.2 for FIPS PUB 186,
|
|
|
|
* also Appendix 2.2 of FIPS PUB 186-1 (i.e. use SHA as defined in FIPS PUB
|
|
|
|
* 180-1)
|
|
|
|
*/
|
2015-01-28 01:34:45 +08:00
|
|
|
#define xxxHASH EVP_sha1()
|
1998-12-21 18:52:47 +08:00
|
|
|
|
2016-03-19 02:30:20 +08:00
|
|
|
#include <openssl/opensslconf.h>
|
2015-01-28 01:34:45 +08:00
|
|
|
#include <stdio.h>
|
2015-05-14 22:56:48 +08:00
|
|
|
#include "internal/cryptlib.h"
|
2015-01-28 01:34:45 +08:00
|
|
|
#include <openssl/evp.h>
|
|
|
|
#include <openssl/bn.h>
|
|
|
|
#include <openssl/rand.h>
|
|
|
|
#include <openssl/sha.h>
|
|
|
|
#include "dsa_locl.h"
|
2003-01-15 10:01:55 +08:00
|
|
|
|
2002-12-08 13:24:31 +08:00
|
|
|
int DSA_generate_parameters_ex(DSA *ret, int bits,
|
2015-01-22 11:40:55 +08:00
|
|
|
const unsigned char *seed_in, int seed_len,
|
|
|
|
int *counter_ret, unsigned long *h_ret,
|
|
|
|
BN_GENCB *cb)
|
|
|
|
{
|
|
|
|
if (ret->meth->dsa_paramgen)
|
|
|
|
return ret->meth->dsa_paramgen(ret, bits, seed_in, seed_len,
|
|
|
|
counter_ret, h_ret, cb);
|
|
|
|
else {
|
2015-10-09 04:00:27 +08:00
|
|
|
const EVP_MD *evpmd = bits >= 2048 ? EVP_sha256() : EVP_sha1();
|
|
|
|
size_t qbits = EVP_MD_size(evpmd) * 8;
|
2015-01-22 11:40:55 +08:00
|
|
|
|
|
|
|
return dsa_builtin_paramgen(ret, bits, qbits, evpmd,
|
|
|
|
seed_in, seed_len, NULL, counter_ret,
|
|
|
|
h_ret, cb);
|
|
|
|
}
|
|
|
|
}
|
2003-01-15 10:01:55 +08:00
|
|
|
|
2007-02-03 22:41:12 +08:00
|
|
|
int dsa_builtin_paramgen(DSA *ret, size_t bits, size_t qbits,
|
2015-01-22 11:40:55 +08:00
|
|
|
const EVP_MD *evpmd, const unsigned char *seed_in,
|
|
|
|
size_t seed_len, unsigned char *seed_out,
|
|
|
|
int *counter_ret, unsigned long *h_ret, BN_GENCB *cb)
|
|
|
|
{
|
|
|
|
int ok = 0;
|
|
|
|
unsigned char seed[SHA256_DIGEST_LENGTH];
|
|
|
|
unsigned char md[SHA256_DIGEST_LENGTH];
|
|
|
|
unsigned char buf[SHA256_DIGEST_LENGTH], buf2[SHA256_DIGEST_LENGTH];
|
|
|
|
BIGNUM *r0, *W, *X, *c, *test;
|
|
|
|
BIGNUM *g = NULL, *q = NULL, *p = NULL;
|
|
|
|
BN_MONT_CTX *mont = NULL;
|
|
|
|
int i, k, n = 0, m = 0, qsize = qbits >> 3;
|
|
|
|
int counter = 0;
|
|
|
|
int r = 0;
|
|
|
|
BN_CTX *ctx = NULL;
|
|
|
|
unsigned int h = 2;
|
|
|
|
|
|
|
|
if (qsize != SHA_DIGEST_LENGTH && qsize != SHA224_DIGEST_LENGTH &&
|
|
|
|
qsize != SHA256_DIGEST_LENGTH)
|
|
|
|
/* invalid q size */
|
|
|
|
return 0;
|
|
|
|
|
Pick a q size consistent with the digest for DSA param generation
There are two undocumented DSA parameter generation options available in
the genpkey command line app:
dsa_paramgen_md and dsa_paramgen_q_bits.
These can also be accessed via the EVP API but only by using
EVP_PKEY_CTX_ctrl() or EVP_PKEY_CTX_ctrl_str() directly. There are no
helper macros for these options.
dsa_paramgen_q_bits sets the length of q in bits (default 160 bits).
dsa_paramgen_md sets the digest that is used during the parameter
generation (default SHA1). In particular the output length of the digest
used must be equal to or greater than the number of bits in q because of
this code:
if (!EVP_Digest(seed, qsize, md, NULL, evpmd, NULL))
goto err;
if (!EVP_Digest(buf, qsize, buf2, NULL, evpmd, NULL))
goto err;
for (i = 0; i < qsize; i++)
md[i] ^= buf2[i];
/* step 3 */
md[0] |= 0x80;
md[qsize - 1] |= 0x01;
if (!BN_bin2bn(md, qsize, q))
goto err;
qsize here is the number of bits in q and evpmd is the digest set via
dsa_paramgen_md. md and buf2 are buffers of length SHA256_DIGEST_LENGTH.
buf2 has been filled with qsize bits of random seed data, and md is
uninitialised.
If the output size of evpmd is less than qsize then the line "md[i] ^=
buf2[i]" will be xoring an uninitialised value and the random seed data
together to form the least significant bits of q (and not using the
output of the digest at all for those bits) - which is probably not what
was intended. The same seed is then used as an input to generating p. If
the uninitialised data is actually all zeros (as seems quite likely)
then the least significant bits of q will exactly match the least
significant bits of the seed.
This problem only occurs if you use these undocumented and difficult to
find options and you set the size of q to be greater than the message
digest output size. This is for parameter generation only not key
generation. This scenario is considered highly unlikely and
therefore the security risk of this is considered negligible.
Reviewed-by: Rich Salz <rsalz@openssl.org>
(Merged from https://github.com/openssl/openssl/pull/5800)
2018-03-30 00:49:17 +08:00
|
|
|
if (evpmd == NULL) {
|
|
|
|
if (qsize == SHA_DIGEST_LENGTH)
|
|
|
|
evpmd = EVP_sha1();
|
|
|
|
else if (qsize == SHA224_DIGEST_LENGTH)
|
|
|
|
evpmd = EVP_sha224();
|
|
|
|
else
|
|
|
|
evpmd = EVP_sha256();
|
|
|
|
} else {
|
|
|
|
qsize = EVP_MD_size(evpmd);
|
|
|
|
}
|
2015-01-22 11:40:55 +08:00
|
|
|
|
|
|
|
if (bits < 512)
|
|
|
|
bits = 512;
|
|
|
|
|
|
|
|
bits = (bits + 63) / 64 * 64;
|
|
|
|
|
2015-08-08 10:14:47 +08:00
|
|
|
if (seed_in != NULL) {
|
2016-10-03 23:54:06 +08:00
|
|
|
if (seed_len < (size_t)qsize) {
|
|
|
|
DSAerr(DSA_F_DSA_BUILTIN_PARAMGEN, DSA_R_SEED_LEN_SMALL);
|
2015-08-08 10:14:47 +08:00
|
|
|
return 0;
|
2016-10-03 23:54:06 +08:00
|
|
|
}
|
2015-08-08 10:14:47 +08:00
|
|
|
if (seed_len > (size_t)qsize) {
|
2015-08-29 00:41:50 +08:00
|
|
|
/* Only consume as much seed as is expected. */
|
2015-08-08 10:14:47 +08:00
|
|
|
seed_len = qsize;
|
|
|
|
}
|
2015-01-22 11:40:55 +08:00
|
|
|
memcpy(seed, seed_in, seed_len);
|
2015-08-08 10:14:47 +08:00
|
|
|
}
|
2015-01-22 11:40:55 +08:00
|
|
|
|
2015-10-08 20:38:57 +08:00
|
|
|
if ((mont = BN_MONT_CTX_new()) == NULL)
|
|
|
|
goto err;
|
|
|
|
|
2015-01-22 11:40:55 +08:00
|
|
|
if ((ctx = BN_CTX_new()) == NULL)
|
|
|
|
goto err;
|
|
|
|
|
2015-05-05 17:20:39 +08:00
|
|
|
BN_CTX_start(ctx);
|
|
|
|
|
2015-01-22 11:40:55 +08:00
|
|
|
r0 = BN_CTX_get(ctx);
|
|
|
|
g = BN_CTX_get(ctx);
|
|
|
|
W = BN_CTX_get(ctx);
|
|
|
|
q = BN_CTX_get(ctx);
|
|
|
|
X = BN_CTX_get(ctx);
|
|
|
|
c = BN_CTX_get(ctx);
|
|
|
|
p = BN_CTX_get(ctx);
|
|
|
|
test = BN_CTX_get(ctx);
|
|
|
|
|
2016-09-14 20:27:59 +08:00
|
|
|
if (test == NULL)
|
|
|
|
goto err;
|
|
|
|
|
2015-01-22 11:40:55 +08:00
|
|
|
if (!BN_lshift(test, BN_value_one(), bits - 1))
|
|
|
|
goto err;
|
|
|
|
|
|
|
|
for (;;) {
|
|
|
|
for (;;) { /* find q */
|
2015-08-29 00:41:50 +08:00
|
|
|
int use_random_seed = (seed_in == NULL);
|
2015-01-22 11:40:55 +08:00
|
|
|
|
|
|
|
/* step 1 */
|
|
|
|
if (!BN_GENCB_call(cb, 0, m++))
|
|
|
|
goto err;
|
|
|
|
|
2015-08-29 00:41:50 +08:00
|
|
|
if (use_random_seed) {
|
2015-02-26 19:57:37 +08:00
|
|
|
if (RAND_bytes(seed, qsize) <= 0)
|
2015-01-22 11:40:55 +08:00
|
|
|
goto err;
|
|
|
|
} else {
|
2015-08-08 10:14:47 +08:00
|
|
|
/* If we come back through, use random seed next time. */
|
|
|
|
seed_in = NULL;
|
2015-01-22 11:40:55 +08:00
|
|
|
}
|
|
|
|
memcpy(buf, seed, qsize);
|
|
|
|
memcpy(buf2, seed, qsize);
|
|
|
|
/* precompute "SEED + 1" for step 7: */
|
|
|
|
for (i = qsize - 1; i >= 0; i--) {
|
|
|
|
buf[i]++;
|
|
|
|
if (buf[i] != 0)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* step 2 */
|
|
|
|
if (!EVP_Digest(seed, qsize, md, NULL, evpmd, NULL))
|
|
|
|
goto err;
|
|
|
|
if (!EVP_Digest(buf, qsize, buf2, NULL, evpmd, NULL))
|
|
|
|
goto err;
|
|
|
|
for (i = 0; i < qsize; i++)
|
|
|
|
md[i] ^= buf2[i];
|
|
|
|
|
|
|
|
/* step 3 */
|
|
|
|
md[0] |= 0x80;
|
|
|
|
md[qsize - 1] |= 0x01;
|
|
|
|
if (!BN_bin2bn(md, qsize, q))
|
|
|
|
goto err;
|
|
|
|
|
|
|
|
/* step 4 */
|
|
|
|
r = BN_is_prime_fasttest_ex(q, DSS_prime_checks, ctx,
|
2015-08-29 00:41:50 +08:00
|
|
|
use_random_seed, cb);
|
2015-01-22 11:40:55 +08:00
|
|
|
if (r > 0)
|
|
|
|
break;
|
|
|
|
if (r != 0)
|
|
|
|
goto err;
|
|
|
|
|
|
|
|
/* do a callback call */
|
|
|
|
/* step 5 */
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!BN_GENCB_call(cb, 2, 0))
|
|
|
|
goto err;
|
|
|
|
if (!BN_GENCB_call(cb, 3, 0))
|
|
|
|
goto err;
|
|
|
|
|
|
|
|
/* step 6 */
|
|
|
|
counter = 0;
|
|
|
|
/* "offset = 2" */
|
|
|
|
|
|
|
|
n = (bits - 1) / 160;
|
|
|
|
|
|
|
|
for (;;) {
|
|
|
|
if ((counter != 0) && !BN_GENCB_call(cb, 0, counter))
|
|
|
|
goto err;
|
|
|
|
|
|
|
|
/* step 7 */
|
|
|
|
BN_zero(W);
|
|
|
|
/* now 'buf' contains "SEED + offset - 1" */
|
|
|
|
for (k = 0; k <= n; k++) {
|
|
|
|
/*
|
|
|
|
* obtain "SEED + offset + k" by incrementing:
|
|
|
|
*/
|
|
|
|
for (i = qsize - 1; i >= 0; i--) {
|
|
|
|
buf[i]++;
|
|
|
|
if (buf[i] != 0)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!EVP_Digest(buf, qsize, md, NULL, evpmd, NULL))
|
|
|
|
goto err;
|
|
|
|
|
|
|
|
/* step 8 */
|
|
|
|
if (!BN_bin2bn(md, qsize, r0))
|
|
|
|
goto err;
|
|
|
|
if (!BN_lshift(r0, r0, (qsize << 3) * k))
|
|
|
|
goto err;
|
|
|
|
if (!BN_add(W, W, r0))
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* more of step 8 */
|
|
|
|
if (!BN_mask_bits(W, bits - 1))
|
|
|
|
goto err;
|
|
|
|
if (!BN_copy(X, W))
|
|
|
|
goto err;
|
|
|
|
if (!BN_add(X, X, test))
|
|
|
|
goto err;
|
|
|
|
|
|
|
|
/* step 9 */
|
|
|
|
if (!BN_lshift1(r0, q))
|
|
|
|
goto err;
|
|
|
|
if (!BN_mod(c, X, r0, ctx))
|
|
|
|
goto err;
|
|
|
|
if (!BN_sub(r0, c, BN_value_one()))
|
|
|
|
goto err;
|
|
|
|
if (!BN_sub(p, X, r0))
|
|
|
|
goto err;
|
|
|
|
|
|
|
|
/* step 10 */
|
|
|
|
if (BN_cmp(p, test) >= 0) {
|
|
|
|
/* step 11 */
|
|
|
|
r = BN_is_prime_fasttest_ex(p, DSS_prime_checks, ctx, 1, cb);
|
|
|
|
if (r > 0)
|
|
|
|
goto end; /* found it */
|
|
|
|
if (r != 0)
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* step 13 */
|
|
|
|
counter++;
|
|
|
|
/* "offset = offset + n + 1" */
|
|
|
|
|
|
|
|
/* step 14 */
|
|
|
|
if (counter >= 4096)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
end:
|
|
|
|
if (!BN_GENCB_call(cb, 2, 1))
|
|
|
|
goto err;
|
|
|
|
|
|
|
|
/* We now need to generate g */
|
|
|
|
/* Set r0=(p-1)/q */
|
|
|
|
if (!BN_sub(test, p, BN_value_one()))
|
|
|
|
goto err;
|
|
|
|
if (!BN_div(r0, NULL, test, q, ctx))
|
|
|
|
goto err;
|
|
|
|
|
|
|
|
if (!BN_set_word(test, h))
|
|
|
|
goto err;
|
|
|
|
if (!BN_MONT_CTX_set(mont, p, ctx))
|
|
|
|
goto err;
|
|
|
|
|
|
|
|
for (;;) {
|
|
|
|
/* g=test^r0%p */
|
|
|
|
if (!BN_mod_exp_mont(g, test, r0, p, ctx, mont))
|
|
|
|
goto err;
|
|
|
|
if (!BN_is_one(g))
|
|
|
|
break;
|
|
|
|
if (!BN_add(test, test, BN_value_one()))
|
|
|
|
goto err;
|
|
|
|
h++;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!BN_GENCB_call(cb, 3, 1))
|
|
|
|
goto err;
|
|
|
|
|
|
|
|
ok = 1;
|
|
|
|
err:
|
|
|
|
if (ok) {
|
2015-05-01 09:37:06 +08:00
|
|
|
BN_free(ret->p);
|
|
|
|
BN_free(ret->q);
|
|
|
|
BN_free(ret->g);
|
2015-01-22 11:40:55 +08:00
|
|
|
ret->p = BN_dup(p);
|
|
|
|
ret->q = BN_dup(q);
|
|
|
|
ret->g = BN_dup(g);
|
|
|
|
if (ret->p == NULL || ret->q == NULL || ret->g == NULL) {
|
|
|
|
ok = 0;
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
if (counter_ret != NULL)
|
|
|
|
*counter_ret = counter;
|
|
|
|
if (h_ret != NULL)
|
|
|
|
*h_ret = h;
|
|
|
|
if (seed_out)
|
|
|
|
memcpy(seed_out, seed, qsize);
|
|
|
|
}
|
2015-05-01 09:37:06 +08:00
|
|
|
if (ctx)
|
2015-01-22 11:40:55 +08:00
|
|
|
BN_CTX_end(ctx);
|
2015-05-01 09:37:06 +08:00
|
|
|
BN_CTX_free(ctx);
|
|
|
|
BN_MONT_CTX_free(mont);
|
2015-01-22 11:40:55 +08:00
|
|
|
return ok;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This is a parameter generation algorithm for the DSA2 algorithm as
|
2011-02-01 03:44:09 +08:00
|
|
|
* described in FIPS 186-3.
|
|
|
|
*/
|
|
|
|
|
|
|
|
int dsa_builtin_paramgen2(DSA *ret, size_t L, size_t N,
|
2015-01-22 11:40:55 +08:00
|
|
|
const EVP_MD *evpmd, const unsigned char *seed_in,
|
|
|
|
size_t seed_len, int idx, unsigned char *seed_out,
|
|
|
|
int *counter_ret, unsigned long *h_ret,
|
|
|
|
BN_GENCB *cb)
|
|
|
|
{
|
|
|
|
int ok = -1;
|
|
|
|
unsigned char *seed = NULL, *seed_tmp = NULL;
|
|
|
|
unsigned char md[EVP_MAX_MD_SIZE];
|
|
|
|
int mdsize;
|
|
|
|
BIGNUM *r0, *W, *X, *c, *test;
|
|
|
|
BIGNUM *g = NULL, *q = NULL, *p = NULL;
|
|
|
|
BN_MONT_CTX *mont = NULL;
|
|
|
|
int i, k, n = 0, m = 0, qsize = N >> 3;
|
|
|
|
int counter = 0;
|
|
|
|
int r = 0;
|
|
|
|
BN_CTX *ctx = NULL;
|
2015-12-02 07:49:35 +08:00
|
|
|
EVP_MD_CTX *mctx = EVP_MD_CTX_new();
|
2015-01-22 11:40:55 +08:00
|
|
|
unsigned int h = 2;
|
|
|
|
|
2015-11-27 21:02:12 +08:00
|
|
|
if (mctx == NULL)
|
|
|
|
goto err;
|
2015-01-22 11:40:55 +08:00
|
|
|
|
|
|
|
if (evpmd == NULL) {
|
|
|
|
if (N == 160)
|
|
|
|
evpmd = EVP_sha1();
|
|
|
|
else if (N == 224)
|
|
|
|
evpmd = EVP_sha224();
|
|
|
|
else
|
|
|
|
evpmd = EVP_sha256();
|
|
|
|
}
|
|
|
|
|
2015-11-27 21:02:12 +08:00
|
|
|
mdsize = EVP_MD_size(evpmd);
|
2016-02-06 04:23:54 +08:00
|
|
|
/* If unverifiable g generation only don't need seed */
|
2015-01-22 11:40:55 +08:00
|
|
|
if (!ret->p || !ret->q || idx >= 0) {
|
|
|
|
if (seed_len == 0)
|
|
|
|
seed_len = mdsize;
|
|
|
|
|
|
|
|
seed = OPENSSL_malloc(seed_len);
|
|
|
|
|
|
|
|
if (seed_out)
|
|
|
|
seed_tmp = seed_out;
|
|
|
|
else
|
|
|
|
seed_tmp = OPENSSL_malloc(seed_len);
|
|
|
|
|
2015-10-30 19:12:26 +08:00
|
|
|
if (seed == NULL || seed_tmp == NULL)
|
2015-01-22 11:40:55 +08:00
|
|
|
goto err;
|
|
|
|
|
|
|
|
if (seed_in)
|
|
|
|
memcpy(seed, seed_in, seed_len);
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((ctx = BN_CTX_new()) == NULL)
|
|
|
|
goto err;
|
|
|
|
|
|
|
|
if ((mont = BN_MONT_CTX_new()) == NULL)
|
|
|
|
goto err;
|
|
|
|
|
|
|
|
BN_CTX_start(ctx);
|
|
|
|
r0 = BN_CTX_get(ctx);
|
|
|
|
g = BN_CTX_get(ctx);
|
|
|
|
W = BN_CTX_get(ctx);
|
|
|
|
X = BN_CTX_get(ctx);
|
|
|
|
c = BN_CTX_get(ctx);
|
|
|
|
test = BN_CTX_get(ctx);
|
2016-04-27 20:32:58 +08:00
|
|
|
if (test == NULL)
|
|
|
|
goto err;
|
2015-01-22 11:40:55 +08:00
|
|
|
|
|
|
|
/* if p, q already supplied generate g only */
|
|
|
|
if (ret->p && ret->q) {
|
|
|
|
p = ret->p;
|
|
|
|
q = ret->q;
|
|
|
|
if (idx >= 0)
|
|
|
|
memcpy(seed_tmp, seed, seed_len);
|
|
|
|
goto g_only;
|
|
|
|
} else {
|
|
|
|
p = BN_CTX_get(ctx);
|
|
|
|
q = BN_CTX_get(ctx);
|
2017-06-14 03:22:45 +08:00
|
|
|
if (q == NULL)
|
|
|
|
goto err;
|
2015-01-22 11:40:55 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
if (!BN_lshift(test, BN_value_one(), L - 1))
|
|
|
|
goto err;
|
|
|
|
for (;;) {
|
|
|
|
for (;;) { /* find q */
|
|
|
|
unsigned char *pmd;
|
|
|
|
/* step 1 */
|
|
|
|
if (!BN_GENCB_call(cb, 0, m++))
|
|
|
|
goto err;
|
|
|
|
|
|
|
|
if (!seed_in) {
|
2015-02-26 19:57:37 +08:00
|
|
|
if (RAND_bytes(seed, seed_len) <= 0)
|
2015-01-22 11:40:55 +08:00
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
/* step 2 */
|
|
|
|
if (!EVP_Digest(seed, seed_len, md, NULL, evpmd, NULL))
|
|
|
|
goto err;
|
|
|
|
/* Take least significant bits of md */
|
|
|
|
if (mdsize > qsize)
|
|
|
|
pmd = md + mdsize - qsize;
|
|
|
|
else
|
|
|
|
pmd = md;
|
|
|
|
|
|
|
|
if (mdsize < qsize)
|
|
|
|
memset(md + mdsize, 0, qsize - mdsize);
|
|
|
|
|
|
|
|
/* step 3 */
|
|
|
|
pmd[0] |= 0x80;
|
|
|
|
pmd[qsize - 1] |= 0x01;
|
|
|
|
if (!BN_bin2bn(pmd, qsize, q))
|
|
|
|
goto err;
|
|
|
|
|
|
|
|
/* step 4 */
|
|
|
|
r = BN_is_prime_fasttest_ex(q, DSS_prime_checks, ctx,
|
|
|
|
seed_in ? 1 : 0, cb);
|
|
|
|
if (r > 0)
|
|
|
|
break;
|
|
|
|
if (r != 0)
|
|
|
|
goto err;
|
|
|
|
/* Provided seed didn't produce a prime: error */
|
|
|
|
if (seed_in) {
|
|
|
|
ok = 0;
|
|
|
|
DSAerr(DSA_F_DSA_BUILTIN_PARAMGEN2, DSA_R_Q_NOT_PRIME);
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* do a callback call */
|
|
|
|
/* step 5 */
|
|
|
|
}
|
|
|
|
/* Copy seed to seed_out before we mess with it */
|
|
|
|
if (seed_out)
|
|
|
|
memcpy(seed_out, seed, seed_len);
|
|
|
|
|
|
|
|
if (!BN_GENCB_call(cb, 2, 0))
|
|
|
|
goto err;
|
|
|
|
if (!BN_GENCB_call(cb, 3, 0))
|
|
|
|
goto err;
|
|
|
|
|
|
|
|
/* step 6 */
|
|
|
|
counter = 0;
|
|
|
|
/* "offset = 1" */
|
|
|
|
|
|
|
|
n = (L - 1) / (mdsize << 3);
|
|
|
|
|
|
|
|
for (;;) {
|
|
|
|
if ((counter != 0) && !BN_GENCB_call(cb, 0, counter))
|
|
|
|
goto err;
|
|
|
|
|
|
|
|
/* step 7 */
|
|
|
|
BN_zero(W);
|
|
|
|
/* now 'buf' contains "SEED + offset - 1" */
|
|
|
|
for (k = 0; k <= n; k++) {
|
|
|
|
/*
|
|
|
|
* obtain "SEED + offset + k" by incrementing:
|
|
|
|
*/
|
|
|
|
for (i = seed_len - 1; i >= 0; i--) {
|
|
|
|
seed[i]++;
|
|
|
|
if (seed[i] != 0)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!EVP_Digest(seed, seed_len, md, NULL, evpmd, NULL))
|
|
|
|
goto err;
|
|
|
|
|
|
|
|
/* step 8 */
|
|
|
|
if (!BN_bin2bn(md, mdsize, r0))
|
|
|
|
goto err;
|
|
|
|
if (!BN_lshift(r0, r0, (mdsize << 3) * k))
|
|
|
|
goto err;
|
|
|
|
if (!BN_add(W, W, r0))
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* more of step 8 */
|
|
|
|
if (!BN_mask_bits(W, L - 1))
|
|
|
|
goto err;
|
|
|
|
if (!BN_copy(X, W))
|
|
|
|
goto err;
|
|
|
|
if (!BN_add(X, X, test))
|
|
|
|
goto err;
|
|
|
|
|
|
|
|
/* step 9 */
|
|
|
|
if (!BN_lshift1(r0, q))
|
|
|
|
goto err;
|
|
|
|
if (!BN_mod(c, X, r0, ctx))
|
|
|
|
goto err;
|
|
|
|
if (!BN_sub(r0, c, BN_value_one()))
|
|
|
|
goto err;
|
|
|
|
if (!BN_sub(p, X, r0))
|
|
|
|
goto err;
|
|
|
|
|
|
|
|
/* step 10 */
|
|
|
|
if (BN_cmp(p, test) >= 0) {
|
|
|
|
/* step 11 */
|
|
|
|
r = BN_is_prime_fasttest_ex(p, DSS_prime_checks, ctx, 1, cb);
|
|
|
|
if (r > 0)
|
|
|
|
goto end; /* found it */
|
|
|
|
if (r != 0)
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* step 13 */
|
|
|
|
counter++;
|
|
|
|
/* "offset = offset + n + 1" */
|
|
|
|
|
|
|
|
/* step 14 */
|
|
|
|
if (counter >= (int)(4 * L))
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (seed_in) {
|
|
|
|
ok = 0;
|
|
|
|
DSAerr(DSA_F_DSA_BUILTIN_PARAMGEN2, DSA_R_INVALID_PARAMETERS);
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
end:
|
|
|
|
if (!BN_GENCB_call(cb, 2, 1))
|
|
|
|
goto err;
|
|
|
|
|
|
|
|
g_only:
|
|
|
|
|
|
|
|
/* We now need to generate g */
|
|
|
|
/* Set r0=(p-1)/q */
|
|
|
|
if (!BN_sub(test, p, BN_value_one()))
|
|
|
|
goto err;
|
|
|
|
if (!BN_div(r0, NULL, test, q, ctx))
|
|
|
|
goto err;
|
|
|
|
|
|
|
|
if (idx < 0) {
|
|
|
|
if (!BN_set_word(test, h))
|
|
|
|
goto err;
|
|
|
|
} else
|
|
|
|
h = 1;
|
|
|
|
if (!BN_MONT_CTX_set(mont, p, ctx))
|
|
|
|
goto err;
|
|
|
|
|
|
|
|
for (;;) {
|
|
|
|
static const unsigned char ggen[4] = { 0x67, 0x67, 0x65, 0x6e };
|
|
|
|
if (idx >= 0) {
|
|
|
|
md[0] = idx & 0xff;
|
|
|
|
md[1] = (h >> 8) & 0xff;
|
|
|
|
md[2] = h & 0xff;
|
2015-11-27 21:02:12 +08:00
|
|
|
if (!EVP_DigestInit_ex(mctx, evpmd, NULL))
|
2015-01-22 11:40:55 +08:00
|
|
|
goto err;
|
2015-11-27 21:02:12 +08:00
|
|
|
if (!EVP_DigestUpdate(mctx, seed_tmp, seed_len))
|
2015-01-22 11:40:55 +08:00
|
|
|
goto err;
|
2015-11-27 21:02:12 +08:00
|
|
|
if (!EVP_DigestUpdate(mctx, ggen, sizeof(ggen)))
|
2015-01-22 11:40:55 +08:00
|
|
|
goto err;
|
2015-11-27 21:02:12 +08:00
|
|
|
if (!EVP_DigestUpdate(mctx, md, 3))
|
2015-01-22 11:40:55 +08:00
|
|
|
goto err;
|
2015-11-27 21:02:12 +08:00
|
|
|
if (!EVP_DigestFinal_ex(mctx, md, NULL))
|
2015-01-22 11:40:55 +08:00
|
|
|
goto err;
|
|
|
|
if (!BN_bin2bn(md, mdsize, test))
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
/* g=test^r0%p */
|
|
|
|
if (!BN_mod_exp_mont(g, test, r0, p, ctx, mont))
|
|
|
|
goto err;
|
|
|
|
if (!BN_is_one(g))
|
|
|
|
break;
|
|
|
|
if (idx < 0 && !BN_add(test, test, BN_value_one()))
|
|
|
|
goto err;
|
|
|
|
h++;
|
|
|
|
if (idx >= 0 && h > 0xffff)
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!BN_GENCB_call(cb, 3, 1))
|
|
|
|
goto err;
|
|
|
|
|
|
|
|
ok = 1;
|
|
|
|
err:
|
|
|
|
if (ok == 1) {
|
|
|
|
if (p != ret->p) {
|
2015-05-01 09:37:06 +08:00
|
|
|
BN_free(ret->p);
|
2015-01-22 11:40:55 +08:00
|
|
|
ret->p = BN_dup(p);
|
|
|
|
}
|
|
|
|
if (q != ret->q) {
|
2015-05-01 09:37:06 +08:00
|
|
|
BN_free(ret->q);
|
2015-01-22 11:40:55 +08:00
|
|
|
ret->q = BN_dup(q);
|
|
|
|
}
|
2015-05-01 09:37:06 +08:00
|
|
|
BN_free(ret->g);
|
2015-01-22 11:40:55 +08:00
|
|
|
ret->g = BN_dup(g);
|
|
|
|
if (ret->p == NULL || ret->q == NULL || ret->g == NULL) {
|
|
|
|
ok = -1;
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
if (counter_ret != NULL)
|
|
|
|
*counter_ret = counter;
|
|
|
|
if (h_ret != NULL)
|
|
|
|
*h_ret = h;
|
|
|
|
}
|
2015-05-01 22:02:07 +08:00
|
|
|
OPENSSL_free(seed);
|
2015-01-22 11:40:55 +08:00
|
|
|
if (seed_out != seed_tmp)
|
|
|
|
OPENSSL_free(seed_tmp);
|
2015-05-01 09:37:06 +08:00
|
|
|
if (ctx)
|
2015-01-22 11:40:55 +08:00
|
|
|
BN_CTX_end(ctx);
|
2015-05-01 09:37:06 +08:00
|
|
|
BN_CTX_free(ctx);
|
|
|
|
BN_MONT_CTX_free(mont);
|
2015-12-02 07:49:35 +08:00
|
|
|
EVP_MD_CTX_free(mctx);
|
2015-01-22 11:40:55 +08:00
|
|
|
return ok;
|
|
|
|
}
|