David Benjamin e0ae249f03 Remove a = 0 special-case in BN_mod_exp_mont. ... BN_mod_exp_mont is intended to protect the base, but not the exponent. Accordingly, it shouldn't treat a base of zero as special. Change-Id: Ib053e8ce65ab1741973a9f9bfeff8c353567439c Reviewed-on: https://boringssl-review.googlesource.com/27284 Reviewed-by: Adam Langley <agl@google.com>		2018-04-18 22:03: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
bn_test.cc	Tolerate a null BN_CTX in BN_primality_test.	2018-04-03 18:13:47 +00:00
bn_tests.txt	Add new GCD and related primitives.	2018-03-30 19:53:36 +00:00
bn.c	Don't leak |a| in the primality test.	2018-03-28 01:44:31 +00:00
bytes.c
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
div.c	Remove EC_LOOSE_SCALAR.	2018-04-02 18:22:58 +00:00
exponentiation.c	Remove a = 0 special-case in BN_mod_exp_mont.	2018-04-18 22:03:16 +00:00
gcd.c	Add a constant-time generic modular inverse function.	2018-03-30 19:53:44 +00:00
generic.c
internal.h	Remove EC_LOOSE_SCALAR.	2018-04-02 18:22:58 +00:00
jacobi.c
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