summaryrefslogtreecommitdiff
path: root/src/lib/libcrypto/dsa
diff options
context:
space:
mode:
Diffstat (limited to 'src/lib/libcrypto/dsa')
-rw-r--r--src/lib/libcrypto/dsa/dsa_gen.c4
-rw-r--r--src/lib/libcrypto/dsa/dsa_ossl.c6
2 files changed, 5 insertions, 5 deletions
diff --git a/src/lib/libcrypto/dsa/dsa_gen.c b/src/lib/libcrypto/dsa/dsa_gen.c
index 1f91894100..49b4561494 100644
--- a/src/lib/libcrypto/dsa/dsa_gen.c
+++ b/src/lib/libcrypto/dsa/dsa_gen.c
@@ -1,4 +1,4 @@
1/* $OpenBSD: dsa_gen.c,v 1.27 2023/01/11 04:39:42 jsing Exp $ */ 1/* $OpenBSD: dsa_gen.c,v 1.28 2023/03/27 10:25:02 tb Exp $ */
2/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) 2/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
3 * All rights reserved. 3 * All rights reserved.
4 * 4 *
@@ -264,7 +264,7 @@ dsa_builtin_paramgen(DSA *ret, size_t bits, size_t qbits, const EVP_MD *evpmd,
264 /* more of step 8 */ 264 /* more of step 8 */
265 if (!BN_mask_bits(W, bits - 1)) 265 if (!BN_mask_bits(W, bits - 1))
266 goto err; 266 goto err;
267 if (!BN_copy(X, W)) 267 if (!bn_copy(X, W))
268 goto err; 268 goto err;
269 if (!BN_add(X, X, test)) 269 if (!BN_add(X, X, test))
270 goto err; 270 goto err;
diff --git a/src/lib/libcrypto/dsa/dsa_ossl.c b/src/lib/libcrypto/dsa/dsa_ossl.c
index ece1026fc9..b69cf1a03f 100644
--- a/src/lib/libcrypto/dsa/dsa_ossl.c
+++ b/src/lib/libcrypto/dsa/dsa_ossl.c
@@ -1,4 +1,4 @@
1/* $OpenBSD: dsa_ossl.c,v 1.50 2023/03/04 21:30:23 tb Exp $ */ 1/* $OpenBSD: dsa_ossl.c,v 1.51 2023/03/27 10:25:02 tb Exp $ */
2/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) 2/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
3 * All rights reserved. 3 * All rights reserved.
4 * 4 *
@@ -282,13 +282,13 @@ dsa_sign_setup(DSA *dsa, BN_CTX *ctx_in, BIGNUM **kinvp, BIGNUM **rp)
282 * small timing information leakage. We then choose the sum that is 282 * small timing information leakage. We then choose the sum that is
283 * one bit longer than the modulus. 283 * one bit longer than the modulus.
284 * 284 *
285 * TODO: revisit the BN_copy aiming for a memory access agnostic 285 * TODO: revisit the bn_copy aiming for a memory access agnostic
286 * conditional copy. 286 * conditional copy.
287 */ 287 */
288 288
289 if (!BN_add(l, k, dsa->q) || 289 if (!BN_add(l, k, dsa->q) ||
290 !BN_add(m, l, dsa->q) || 290 !BN_add(m, l, dsa->q) ||
291 !BN_copy(k, BN_num_bits(l) > q_bits ? l : m)) 291 !bn_copy(k, BN_num_bits(l) > q_bits ? l : m))
292 goto err; 292 goto err;
293 293
294 if (dsa->meth->bn_mod_exp != NULL) { 294 if (dsa->meth->bn_mod_exp != NULL) {