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
10 /* Original version from Steven Schoch <schoch@sheba.arc.nasa.gov> */
13 #include "internal/cryptlib.h"
14 #include <openssl/bn.h>
15 #include <openssl/sha.h>
17 #include <openssl/asn1.h>
19 static DSA_SIG *dsa_do_sign(const unsigned char *dgst, int dlen, DSA *dsa);
20 static int dsa_sign_setup_no_digest(DSA *dsa, BN_CTX *ctx_in, BIGNUM **kinvp,
22 static int dsa_sign_setup(DSA *dsa, BN_CTX *ctx_in, BIGNUM **kinvp,
23 BIGNUM **rp, const unsigned char *dgst, int dlen);
24 static int dsa_do_verify(const unsigned char *dgst, int dgst_len,
25 DSA_SIG *sig, DSA *dsa);
26 static int dsa_init(DSA *dsa);
27 static int dsa_finish(DSA *dsa);
29 static DSA_METHOD openssl_dsa_meth = {
32 dsa_sign_setup_no_digest,
34 NULL, /* dsa_mod_exp, */
35 NULL, /* dsa_bn_mod_exp, */
44 static const DSA_METHOD *default_DSA_method = &openssl_dsa_meth;
46 void DSA_set_default_method(const DSA_METHOD *meth)
48 default_DSA_method = meth;
51 const DSA_METHOD *DSA_get_default_method(void)
53 return default_DSA_method;
56 const DSA_METHOD *DSA_OpenSSL(void)
58 return &openssl_dsa_meth;
61 static DSA_SIG *dsa_do_sign(const unsigned char *dgst, int dlen, DSA *dsa)
67 int reason = ERR_R_BN_LIB;
73 if (m == NULL || xr == NULL)
76 if (!dsa->p || !dsa->q || !dsa->g) {
77 reason = DSA_R_MISSING_PARAMETERS;
86 if (ret->r == NULL || ret->s == NULL)
93 if (!dsa_sign_setup(dsa, ctx, &kinv, &ret->r, dgst, dlen))
96 if (dlen > BN_num_bytes(dsa->q))
98 * if the digest length is greater than the size of q use the
99 * BN_num_bits(dsa->q) leftmost bits of the digest, see fips 186-3,
102 dlen = BN_num_bytes(dsa->q);
103 if (BN_bin2bn(dgst, dlen, m) == NULL)
106 /* Compute s = inv(k) (m + xr) mod q */
107 if (!BN_mod_mul(xr, dsa->priv_key, ret->r, dsa->q, ctx))
108 goto err; /* s = xr */
109 if (!BN_add(ret->s, xr, m))
110 goto err; /* s = m + xr */
111 if (BN_cmp(ret->s, dsa->q) > 0)
112 if (!BN_sub(ret->s, ret->s, dsa->q))
114 if (!BN_mod_mul(ret->s, ret->s, kinv, dsa->q, ctx))
118 * Redo if r or s is zero as required by FIPS 186-3: this is very
121 if (BN_is_zero(ret->r) || BN_is_zero(ret->s))
128 DSAerr(DSA_F_DSA_DO_SIGN, reason);
139 static int dsa_sign_setup_no_digest(DSA *dsa, BN_CTX *ctx_in,
140 BIGNUM **kinvp, BIGNUM **rp)
142 return dsa_sign_setup(dsa, ctx_in, kinvp, rp, NULL, 0);
145 static int dsa_sign_setup(DSA *dsa, BN_CTX *ctx_in,
146 BIGNUM **kinvp, BIGNUM **rp,
147 const unsigned char *dgst, int dlen)
150 BIGNUM *k, *kinv = NULL, *r = *rp;
153 if (!dsa->p || !dsa->q || !dsa->g) {
154 DSAerr(DSA_F_DSA_SIGN_SETUP, DSA_R_MISSING_PARAMETERS);
162 if (ctx_in == NULL) {
163 if ((ctx = BN_CTX_new()) == NULL)
172 * We calculate k from SHA512(private_key + H(message) + random).
173 * This protects the private key from a weak PRNG.
175 if (!BN_generate_dsa_nonce(k, dsa->q, dsa->priv_key, dgst,
178 } else if (!BN_priv_rand_range(k, dsa->q))
180 } while (BN_is_zero(k));
182 BN_set_flags(k, BN_FLG_CONSTTIME);
184 if (dsa->flags & DSA_FLAG_CACHE_MONT_P) {
185 if (!BN_MONT_CTX_set_locked(&dsa->method_mont_p,
186 dsa->lock, dsa->p, ctx))
190 /* Compute r = (g^k mod p) mod q */
193 * We do not want timing information to leak the length of k, so we
194 * compute g^k using an equivalent exponent of fixed length. (This
195 * is a kludge that we need because the BN_mod_exp_mont() does not
196 * let us specify the desired timing behaviour.)
199 if (!BN_add(k, k, dsa->q))
201 if (BN_num_bits(k) <= BN_num_bits(dsa->q)) {
202 if (!BN_add(k, k, dsa->q))
206 if ((dsa)->meth->bn_mod_exp != NULL) {
207 if (!dsa->meth->bn_mod_exp(dsa, r, dsa->g, k, dsa->p, ctx,
211 if (!BN_mod_exp_mont(r, dsa->g, k, dsa->p, ctx, dsa->method_mont_p))
215 if (!BN_mod(r, r, dsa->q, ctx))
218 /* Compute part of 's = inv(k) (m + xr) mod q' */
219 if ((kinv = BN_mod_inverse(NULL, k, dsa->q, ctx)) == NULL)
222 BN_clear_free(*kinvp);
228 DSAerr(DSA_F_DSA_SIGN_SETUP, ERR_R_BN_LIB);
235 static int dsa_do_verify(const unsigned char *dgst, int dgst_len,
236 DSA_SIG *sig, DSA *dsa)
239 BIGNUM *u1, *u2, *t1;
240 BN_MONT_CTX *mont = NULL;
243 if (!dsa->p || !dsa->q || !dsa->g) {
244 DSAerr(DSA_F_DSA_DO_VERIFY, DSA_R_MISSING_PARAMETERS);
248 i = BN_num_bits(dsa->q);
249 /* fips 186-3 allows only different sizes for q */
250 if (i != 160 && i != 224 && i != 256) {
251 DSAerr(DSA_F_DSA_DO_VERIFY, DSA_R_BAD_Q_VALUE);
255 if (BN_num_bits(dsa->p) > OPENSSL_DSA_MAX_MODULUS_BITS) {
256 DSAerr(DSA_F_DSA_DO_VERIFY, DSA_R_MODULUS_TOO_LARGE);
263 if (u1 == NULL || u2 == NULL || t1 == NULL || ctx == NULL)
266 DSA_SIG_get0(sig, &r, &s);
268 if (BN_is_zero(r) || BN_is_negative(r) ||
269 BN_ucmp(r, dsa->q) >= 0) {
273 if (BN_is_zero(s) || BN_is_negative(s) ||
274 BN_ucmp(s, dsa->q) >= 0) {
280 * Calculate W = inv(S) mod Q save W in u2
282 if ((BN_mod_inverse(u2, s, dsa->q, ctx)) == NULL)
286 if (dgst_len > (i >> 3))
288 * if the digest length is greater than the size of q use the
289 * BN_num_bits(dsa->q) leftmost bits of the digest, see fips 186-3,
293 if (BN_bin2bn(dgst, dgst_len, u1) == NULL)
296 /* u1 = M * w mod q */
297 if (!BN_mod_mul(u1, u1, u2, dsa->q, ctx))
300 /* u2 = r * w mod q */
301 if (!BN_mod_mul(u2, r, u2, dsa->q, ctx))
304 if (dsa->flags & DSA_FLAG_CACHE_MONT_P) {
305 mont = BN_MONT_CTX_set_locked(&dsa->method_mont_p,
306 dsa->lock, dsa->p, ctx);
311 if (dsa->meth->dsa_mod_exp != NULL) {
312 if (!dsa->meth->dsa_mod_exp(dsa, t1, dsa->g, u1, dsa->pub_key, u2,
316 if (!BN_mod_exp2_mont(t1, dsa->g, u1, dsa->pub_key, u2, dsa->p, ctx,
321 /* let u1 = u1 mod q */
322 if (!BN_mod(u1, t1, dsa->q, ctx))
326 * V is now in u1. If the signature is correct, it will be equal to R.
328 ret = (BN_ucmp(u1, r) == 0);
332 DSAerr(DSA_F_DSA_DO_VERIFY, ERR_R_BN_LIB);
340 static int dsa_init(DSA *dsa)
342 dsa->flags |= DSA_FLAG_CACHE_MONT_P;
346 static int dsa_finish(DSA *dsa)
348 BN_MONT_CTX_free(dsa->method_mont_p);