b01dd1c622
We still need BN_mul and, in particular, bn_mul_recursive will either require bn_abs_sub_words be generalized or that we add a parallel bn_abs_sub_part_words, but start with the easy one. While I'm here, simplify the i and j mess in here. It's patterned after the multiplication one, but can be much simpler. Bug: 234 Change-Id: If936099d53304f2512262a1cbffb6c28ae30ccee Reviewed-on: https://boringssl-review.googlesource.com/25325 Commit-Queue: David Benjamin <davidben@google.com> CQ-Verified: CQ bot account: commit-bot@chromium.org <commit-bot@chromium.org> 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 |