2 * Copyright 1995-2018 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 "internal/bn_int.h"
15 #include <openssl/bn.h>
16 #include <openssl/sha.h>
18 #include <openssl/asn1.h>
20 static DSA_SIG *dsa_do_sign(const unsigned char *dgst, int dlen, DSA *dsa);
21 static int dsa_sign_setup_no_digest(DSA *dsa, BN_CTX *ctx_in, BIGNUM **kinvp,
23 static int dsa_sign_setup(DSA *dsa, BN_CTX *ctx_in, BIGNUM **kinvp,
24 BIGNUM **rp, const unsigned char *dgst, int dlen);
25 static int dsa_do_verify(const unsigned char *dgst, int dgst_len,
26 DSA_SIG *sig, DSA *dsa);
27 static int dsa_init(DSA *dsa);
28 static int dsa_finish(DSA *dsa);
29 static BIGNUM *dsa_mod_inverse_fermat(const BIGNUM *k, const BIGNUM *q,
32 static DSA_METHOD openssl_dsa_meth = {
35 dsa_sign_setup_no_digest,
37 NULL, /* dsa_mod_exp, */
38 NULL, /* dsa_bn_mod_exp, */
47 static const DSA_METHOD *default_DSA_method = &openssl_dsa_meth;
49 void DSA_set_default_method(const DSA_METHOD *meth)
51 default_DSA_method = meth;
54 const DSA_METHOD *DSA_get_default_method(void)
56 return default_DSA_method;
59 const DSA_METHOD *DSA_OpenSSL(void)
61 return &openssl_dsa_meth;
64 static DSA_SIG *dsa_do_sign(const unsigned char *dgst, int dlen, DSA *dsa)
67 BIGNUM *m, *blind, *blindm, *tmp;
69 int reason = ERR_R_BN_LIB;
73 if (dsa->p == NULL || dsa->q == NULL || dsa->g == NULL) {
74 reason = DSA_R_MISSING_PARAMETERS;
83 if (ret->r == NULL || ret->s == NULL)
90 blind = BN_CTX_get(ctx);
91 blindm = BN_CTX_get(ctx);
92 tmp = BN_CTX_get(ctx);
97 if (!dsa_sign_setup(dsa, ctx, &kinv, &ret->r, dgst, dlen))
100 if (dlen > BN_num_bytes(dsa->q))
102 * if the digest length is greater than the size of q use the
103 * BN_num_bits(dsa->q) leftmost bits of the digest, see fips 186-3,
106 dlen = BN_num_bytes(dsa->q);
107 if (BN_bin2bn(dgst, dlen, m) == NULL)
111 * The normal signature calculation is:
113 * s := k^-1 * (m + r * priv_key) mod q
115 * We will blind this to protect against side channel attacks
117 * s := blind^-1 * k^-1 * (blind * m + blind * r * priv_key) mod q
120 /* Generate a blinding value */
122 if (!BN_rand(blind, BN_num_bits(dsa->q) - 1, BN_RAND_TOP_ANY,
125 } while (BN_is_zero(blind));
126 BN_set_flags(blind, BN_FLG_CONSTTIME);
127 BN_set_flags(blindm, BN_FLG_CONSTTIME);
128 BN_set_flags(tmp, BN_FLG_CONSTTIME);
130 /* tmp := blind * priv_key * r mod q */
131 if (!BN_mod_mul(tmp, blind, dsa->priv_key, dsa->q, ctx))
133 if (!BN_mod_mul(tmp, tmp, ret->r, dsa->q, ctx))
136 /* blindm := blind * m mod q */
137 if (!BN_mod_mul(blindm, blind, m, dsa->q, ctx))
140 /* s : = (blind * priv_key * r) + (blind * m) mod q */
141 if (!BN_mod_add_quick(ret->s, tmp, blindm, dsa->q))
144 /* s := s * k^-1 mod q */
145 if (!BN_mod_mul(ret->s, ret->s, kinv, dsa->q, ctx))
148 /* s:= s * blind^-1 mod q */
149 if (BN_mod_inverse(blind, blind, dsa->q, ctx) == NULL)
151 if (!BN_mod_mul(ret->s, ret->s, blind, dsa->q, ctx))
155 * Redo if r or s is zero as required by FIPS 186-3: this is very
158 if (BN_is_zero(ret->r) || BN_is_zero(ret->s))
165 DSAerr(DSA_F_DSA_DO_SIGN, reason);
174 static int dsa_sign_setup_no_digest(DSA *dsa, BN_CTX *ctx_in,
175 BIGNUM **kinvp, BIGNUM **rp)
177 return dsa_sign_setup(dsa, ctx_in, kinvp, rp, NULL, 0);
180 static int dsa_sign_setup(DSA *dsa, BN_CTX *ctx_in,
181 BIGNUM **kinvp, BIGNUM **rp,
182 const unsigned char *dgst, int dlen)
185 BIGNUM *k, *kinv = NULL, *r = *rp;
190 if (!dsa->p || !dsa->q || !dsa->g) {
191 DSAerr(DSA_F_DSA_SIGN_SETUP, DSA_R_MISSING_PARAMETERS);
197 if (k == NULL || l == NULL)
200 if (ctx_in == NULL) {
201 if ((ctx = BN_CTX_new()) == NULL)
206 /* Preallocate space */
207 q_bits = BN_num_bits(dsa->q);
208 q_words = bn_get_top(dsa->q);
209 if (!bn_wexpand(k, q_words + 2)
210 || !bn_wexpand(l, q_words + 2))
217 * We calculate k from SHA512(private_key + H(message) + random).
218 * This protects the private key from a weak PRNG.
220 if (!BN_generate_dsa_nonce(k, dsa->q, dsa->priv_key, dgst,
223 } else if (!BN_rand_range(k, dsa->q))
225 } while (BN_is_zero(k));
227 BN_set_flags(k, BN_FLG_CONSTTIME);
229 if (dsa->flags & DSA_FLAG_CACHE_MONT_P) {
230 if (!BN_MONT_CTX_set_locked(&dsa->method_mont_p,
231 dsa->lock, dsa->p, ctx))
235 /* Compute r = (g^k mod p) mod q */
238 * We do not want timing information to leak the length of k, so we
239 * compute G^k using an equivalent scalar of fixed bit-length.
241 * We unconditionally perform both of these additions to prevent a
242 * small timing information leakage. We then choose the sum that is
243 * one bit longer than the modulus.
245 * There are some concerns about the efficacy of doing this. More
246 * specificly refer to the discussion starting with:
247 * https://github.com/openssl/openssl/pull/7486#discussion_r228323705
248 * The fix is to rework BN so these gymnastics aren't required.
250 if (!BN_add(l, k, dsa->q)
251 || !BN_add(k, l, dsa->q))
254 BN_consttime_swap(BN_is_bit_set(l, q_bits), k, l, q_words + 2);
256 if ((dsa)->meth->bn_mod_exp != NULL) {
257 if (!dsa->meth->bn_mod_exp(dsa, r, dsa->g, k, dsa->p, ctx,
261 if (!BN_mod_exp_mont(r, dsa->g, k, dsa->p, ctx, dsa->method_mont_p))
265 if (!BN_mod(r, r, dsa->q, ctx))
268 /* Compute part of 's = inv(k) (m + xr) mod q' */
269 if ((kinv = dsa_mod_inverse_fermat(k, dsa->q, ctx)) == NULL)
272 BN_clear_free(*kinvp);
278 DSAerr(DSA_F_DSA_SIGN_SETUP, ERR_R_BN_LIB);
286 static int dsa_do_verify(const unsigned char *dgst, int dgst_len,
287 DSA_SIG *sig, DSA *dsa)
290 BIGNUM *u1, *u2, *t1;
291 BN_MONT_CTX *mont = NULL;
294 if (!dsa->p || !dsa->q || !dsa->g) {
295 DSAerr(DSA_F_DSA_DO_VERIFY, DSA_R_MISSING_PARAMETERS);
299 i = BN_num_bits(dsa->q);
300 /* fips 186-3 allows only different sizes for q */
301 if (i != 160 && i != 224 && i != 256) {
302 DSAerr(DSA_F_DSA_DO_VERIFY, DSA_R_BAD_Q_VALUE);
306 if (BN_num_bits(dsa->p) > OPENSSL_DSA_MAX_MODULUS_BITS) {
307 DSAerr(DSA_F_DSA_DO_VERIFY, DSA_R_MODULUS_TOO_LARGE);
314 if (u1 == NULL || u2 == NULL || t1 == NULL || ctx == NULL)
317 DSA_SIG_get0(sig, &r, &s);
319 if (BN_is_zero(r) || BN_is_negative(r) ||
320 BN_ucmp(r, dsa->q) >= 0) {
324 if (BN_is_zero(s) || BN_is_negative(s) ||
325 BN_ucmp(s, dsa->q) >= 0) {
331 * Calculate W = inv(S) mod Q save W in u2
333 if ((BN_mod_inverse(u2, s, dsa->q, ctx)) == NULL)
337 if (dgst_len > (i >> 3))
339 * if the digest length is greater than the size of q use the
340 * BN_num_bits(dsa->q) leftmost bits of the digest, see fips 186-3,
344 if (BN_bin2bn(dgst, dgst_len, u1) == NULL)
347 /* u1 = M * w mod q */
348 if (!BN_mod_mul(u1, u1, u2, dsa->q, ctx))
351 /* u2 = r * w mod q */
352 if (!BN_mod_mul(u2, r, u2, dsa->q, ctx))
355 if (dsa->flags & DSA_FLAG_CACHE_MONT_P) {
356 mont = BN_MONT_CTX_set_locked(&dsa->method_mont_p,
357 dsa->lock, dsa->p, ctx);
362 if (dsa->meth->dsa_mod_exp != NULL) {
363 if (!dsa->meth->dsa_mod_exp(dsa, t1, dsa->g, u1, dsa->pub_key, u2,
367 if (!BN_mod_exp2_mont(t1, dsa->g, u1, dsa->pub_key, u2, dsa->p, ctx,
372 /* let u1 = u1 mod q */
373 if (!BN_mod(u1, t1, dsa->q, ctx))
377 * V is now in u1. If the signature is correct, it will be equal to R.
379 ret = (BN_ucmp(u1, r) == 0);
383 DSAerr(DSA_F_DSA_DO_VERIFY, ERR_R_BN_LIB);
391 static int dsa_init(DSA *dsa)
393 dsa->flags |= DSA_FLAG_CACHE_MONT_P;
397 static int dsa_finish(DSA *dsa)
399 BN_MONT_CTX_free(dsa->method_mont_p);
404 * Compute the inverse of k modulo q.
405 * Since q is prime, Fermat's Little Theorem applies, which reduces this to
406 * mod-exp operation. Both the exponent and modulus are public information
407 * so a mod-exp that doesn't leak the base is sufficient. A newly allocated
408 * BIGNUM is returned which the caller must free.
410 static BIGNUM *dsa_mod_inverse_fermat(const BIGNUM *k, const BIGNUM *q,
416 if ((r = BN_new()) == NULL)
420 if ((e = BN_CTX_get(ctx)) != NULL
423 && BN_mod_exp_mont(r, k, e, q, ctx, NULL))