openbsd/src/lib/libcrypto/bn, branch libressl-v2.9.2 A mirror of https://github.com/libressl/openbsd.git https://git.lua4.win/openbsd/atom?h=libressl-v2.9.2 2019-03-23T18:48:15+00:00 Add range checks to varios ASN1_INTEGER functions to ensure the 2019-03-23T18:48:15+00:00 beck 2019-03-23T18:48:15+00:00 urn:sha1:c7b9ffc836ad7a05586d7c83c368d784af9cacda sizes used remain a positive integer. Should address issue 13799 from oss-fuzz ok tb@ jsing@ Fix BN_is_prime_* calls in libcrypto, the API returns -1 on error. 2019-01-20T01:56:59+00:00 tb 2019-01-20T01:56:59+00:00 urn:sha1:4d359baaefb1597abf730cf3a09574e1e03d620b From BoringSSL's commit 53409ee3d7595ed37da472bc73b010cd2c8a5ffd by David Benjamin. ok djm, jsing Flip reversed test in bn_rand_interval(). 2018-11-06T06:49:45+00:00 tb 2018-11-06T06:49:45+00:00 urn:sha1:a8249222cfc2738a9d25e498cd781c3b188cb9e0 ok jsing Introduce bn_rand_interval() that allows specifying an interval [a, b) 2018-11-05T23:52:47+00:00 tb 2018-11-05T23:52:47+00:00 urn:sha1:180c3e4250e4e8ea8cdade42002a7fd6564d66c2 from which a a BIGNUM is chosen uniformly at random. ok beck jsing Use a size_t instead of an int for the byte count in BN_swap_ct(). 2018-07-23T18:14:32+00:00 tb 2018-07-23T18:14:32+00:00 urn:sha1:1b961cfb65c1f00f26f20454324577edec589a1b Since bignums use ints for the same purpose, this still uses an int internally after an overflow check. Suggested by and discussed with jsing. ok inoguchi, jsing Clean up our disgusting implementations of BN_{,u}{add,sub}(), following 2018-07-23T18:07:21+00:00 tb 2018-07-23T18:07:21+00:00 urn:sha1:49a35ed3e279b1c1d03fa757a539851339945e90 changes made in OpenSSL by Davide Galassi and others, so that one can actually follow what is going on. There is no performance impact from this change as the code still does essentially the same thing. There's a ton of work still to be done to make the BN code less terrible. ok jsing, kn Eliminate the weird condition in the BN_swap_ct() API that at most one bit 2018-07-13T08:43:31+00:00 tb 2018-07-13T08:43:31+00:00 urn:sha1:30d844db17bda4a9465f89832a192a4685d70d38 be set in condition. This makes the constant time bit-twiddling a bit trickier, but it's not too bad. Thanks to halex for an extensive rubber ducking session over a non-spicy spicy tabouleh falafel.. ok jsing, kn Sync comment 2018-07-11T13:57:53+00:00 kn 2018-07-11T13:57:53+00:00 urn:sha1:f1a8f36c4bd220fad86be1b60aa0105b32e88eee Makes it a tad easier to read through and compare with BN_swap_ct(). OK tb Turn yesterday's optimistic ! in an XXX comment into a more cautious ? 2018-07-11T07:38:00+00:00 tb 2018-07-11T07:38:00+00:00 urn:sha1:467436bd0e4e1edb3f39ae645b8aba182e9b2b23 Provide BN_swap_ct(), a constant time function that conditionally swaps 2018-07-10T21:52:07+00:00 tb 2018-07-10T21:52:07+00:00 urn:sha1:56d9c9fb3e9ee89475112311a073d8411159080c two bignums. It's saner and substantially less ugly than the existing public BN_constantime_swap() function and will be used in forthcoming work on constant time ECC code. From Billy Brumley and his team. Thanks! ok jsing