2ccdf584aa
This cuts down on a duplicated place where we mess with bn->top. It also also better abstracts away what determines the value of R. (I ordered this wrong and rebasing will be annoying. Specifically, the question is what happens if the modulus is non-minimal. In https://boringssl-review.googlesource.com/c/boringssl/+/25250/, R will be determined by the stored width of mont->N, so we want to use mont's copy of the modulus. Though, one way or another, the important part is that it's inside the Montgomery abstraction.) Bug: 232 Change-Id: I74212e094c8a47f396b87982039e49048a130916 Reviewed-on: https://boringssl-review.googlesource.com/25247 Reviewed-by: Adam Langley <agl@google.com> |
||
---|---|---|
.. | ||
asm | ||
add.c | ||
bn_test_to_fuzzer.go | ||
bn_test.cc | ||
bn_tests.txt | ||
bn.c | ||
bytes.c | ||
check_bn_tests.go | ||
cmp.c | ||
ctx.c | ||
div.c | ||
exponentiation.c | ||
gcd.c | ||
generic.c | ||
internal.h | ||
jacobi.c | ||
montgomery_inv.c | ||
montgomery.c | ||
mul.c | ||
prime.c | ||
random.c | ||
rsaz_exp.c | ||
rsaz_exp.h | ||
shift.c | ||
sqrt.c |