David Benjamin 56ea9e2769 Fix bn_mod_exp_mont_small when exponentiating to zero. ... It's defined to return one in Montgomery form, not a normal one. (Not that this matters. This function is only used to Fermat's Little Theorem. Probably it should have been less general, though we'd need to make new test vectors first.) Change-Id: Ia8d7588e6a413b25f01280af9aacef0192283771 Reviewed-on: https://boringssl-review.googlesource.com/27285 Reviewed-by: Adam Langley <agl@google.com>		2018-04-18 22:13:16 +00:00
..
asm	Merge Intel copyright notice into standard	2018-02-12 21:44:27 +00:00
add.c	Name constant-time functions more consistently.	2018-03-29 23:30:55 +00:00
bn_test_to_fuzzer.go	Generate bn_div and bn_mod_exp corpus from bn_tests.txt.	2017-10-27 18:57:48 +00:00
bn_test.cc	Tolerate a null BN_CTX in BN_primality_test.	2018-04-03 18:13:47 +00:00
bn_tests.txt	Fix bn_mod_exp_mont_small when exponentiating to zero.	2018-04-18 22:13:16 +00:00
bn.c	Don't leak |a| in the primality test.	2018-03-28 01:44:31 +00:00
bytes.c	Simplify BN_bn2bin_padded.	2018-02-06 02:41:38 +00:00
check_bn_tests.go	Add new GCD and related primitives.	2018-03-30 19:53:36 +00:00
cmp.c	Make various BIGNUM comparisons constant-time.	2018-03-26 18:53:53 +00:00
ctx.c	Run the comment converter on libcrypto.	2017-08-18 21:49:04 +00:00
div.c	Remove EC_LOOSE_SCALAR.	2018-04-02 18:22:58 +00:00
exponentiation.c	Fix bn_mod_exp_mont_small when exponentiating to zero.	2018-04-18 22:13:16 +00:00
gcd.c	Add a constant-time generic modular inverse function.	2018-03-30 19:53:44 +00:00
generic.c	Enable __asm__ and uint128_t code in clang-cl.	2017-12-11 22:46:26 +00:00
internal.h	Remove EC_LOOSE_SCALAR.	2018-04-02 18:22:58 +00:00
jacobi.c	Rename bn->top to bn->width.	2018-02-05 23:44:24 +00:00
montgomery_inv.c	Name constant-time functions more consistently.	2018-03-29 23:30:55 +00:00
montgomery.c	Extract the single-subtraction reduction into a helper function.	2018-04-02 18:13:45 +00:00
mul.c	Compute p - q in constant time.	2018-03-30 19:53:28 +00:00
prime.c	Drop some trial-division primes for 1024-bit candidates.	2018-04-05 03:53:01 +00:00
random.c	Rewrite BN_rand without an extra malloc.	2018-04-02 18:07:12 +00:00
rsaz_exp.c	Document RSAZ slightly better.	2018-02-15 18:14:04 +00:00
rsaz_exp.h	clang-format RSAZ C code.	2018-02-13 22:30:03 +00:00
shift.c	Use bn_rshift_words for the ECDSA bit-shift.	2018-04-02 18:17:39 +00:00
sqrt.c	Name constant-time functions more consistently.	2018-03-29 23:30:55 +00:00