David Benjamin 376f3f1727 Add BN_count_low_zero_bits. ... This allows a BIGNUM consumer to avoid messing around with bn->d and bn->top/width. Bug: 232 Change-Id: I134cf412fef24eb404ff66c84831b4591d921a17 Reviewed-on: https://boringssl-review.googlesource.com/25484 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>		2018-02-06 03:10:54 +00:00
..
asm
add.c	Split BN_uadd into a bn_uadd_fixed.	2018-02-06 02:39:45 +00:00
bn_test_to_fuzzer.go
bn_test.cc	Add BN_count_low_zero_bits.	2018-02-06 03:10:54 +00:00
bn_tests.txt	Make bn_mul_recursive constant-time.	2018-02-06 02:51:34 +00:00
bn.c	Make bn_sqr_recursive constant-time.	2018-02-06 02:47:34 +00:00
bytes.c	Simplify BN_bn2bin_padded.	2018-02-06 02:41:38 +00:00
check_bn_tests.go
cmp.c	Make BN_cmp constant-time.	2018-02-06 03:10:44 +00:00
ctx.c
div.c	Make bn_sqr_recursive constant-time.	2018-02-06 02:47:34 +00:00
exponentiation.c	Remove some easy bn_set_minimal_width calls.	2018-02-05 23:47:14 +00:00
gcd.c
generic.c
internal.h	Make bn_mul_part_recursive constant-time.	2018-02-06 02:51:54 +00:00
jacobi.c	Rename bn->top to bn->width.	2018-02-05 23:44:24 +00:00
montgomery_inv.c	Compute mont->RR in constant-time.	2018-02-06 01:40:24 +00:00
montgomery.c	Compute mont->RR in constant-time.	2018-02-06 01:40:24 +00:00
mul.c	Simplify bn_mul_part_recursive.	2018-02-06 03:04:04 +00:00
prime.c
random.c	Remove some easy bn_set_minimal_width calls.	2018-02-05 23:47:14 +00:00
rsaz_exp.c
rsaz_exp.h
shift.c	Add BN_count_low_zero_bits.	2018-02-06 03:10:54 +00:00
sqrt.c	Make BN_mod_*_quick constant-time.	2018-02-06 01:16:04 +00:00