openbsd/src/lib/libcrypto/bn, branch libressl-v3.4.1

Expose BN_bn2{,le}binpad() and BN_lebin2bn() in

2021-09-10T14:33:44+00:00

ok beck inoguchi

Expose BN_RAND_* in

2021-09-10T14:32:05+00:00

ok beck jsing

Prepare to provide BN_RAND_* flags for BN_rand_range()

2021-09-10T09:08:03+00:00

ok beck jsing

Prepare to provide BN_bn2{,le}binpad() and BN_lebin2bn()

2021-09-08T12:19:17+00:00

As found by jsg and patrick, this is needed for newer uboot and will also be used in upcoming elliptic curve work. This is from OpenSSL 1.1.1l with minor style tweaks. ok beck inoguchi

whitespace

2021-08-31T11:19:19+00:00

Unindent a bit of code that performs a few too many checks to

2020-09-12T17:16:36+00:00

figure out whether top > 0 or top == 0.

Avoid an out-of-bounds access in BN_rand()

2020-09-12T15:24:39+00:00

If BN_rand() is called with top > 0 and bits == 1, it would allocate a buf[] of size 1 and set the top bit of buf[1]. Found in OpenSSL commit efee575ad464bfb60bf72dcb73f9b51768f4b1a1 while looking for something else. ok beck djm inoguchi

Change generating and checking of primes so that the error rate of

2019-08-25T19:24:00+00:00

not being prime depends on the intended use based on the size of the input. For larger primes this will result in more rounds of Miller-Rabin. The maximal error rate for primes with more than 1080 bits is lowered to 2^-128. Patch from Kurt Roeckx and Annie Yousar via OpenSSL commit feac7a1c Jul 25 18:55:16 2018 +0200, still under a free license. OK tb@.

make BN_CTX_end(NULL) a NOOP for compatibility with documented behaviour

2019-08-20T10:59:09+00:00

in OpenSSL 1.1.1 even though in general, letting random functions accept NULL is not advisable because it can hide programming errors; "yes please" tb@ "unfortunately I suspect you're right" jsing@ "oh well" deraadt@

Make BN_num_bits_word() constant time.

2019-06-17T17:11:48+00:00

Previously, this function would leak the most significant word of its argument due to branching and memory access pattern. This patch is enough to fix the use of BN_num_bits() on RSA prime factors in the library. The diff is a simplified and more readable (but perhaps less efficient) version of https://github.com/openssl/openssl/commit/972c87df by Andy Polyakov and David Benjamin (pre license change). Consult that commit message for details. Subsequent fixes to follow in the near future. Issue pointed out by David Schrammel and Samuel Weiser as part of a larger report. tests & ok inoguchi, ok jsing