aboutsummaryrefslogtreecommitdiffstats
path: root/src/lib/math/numbertheory
Commit message (Expand)AuthorAgeFilesLines
* Add script for running TLS fuzzerJack Lloyd2019-05-241-2/+2
* Fix feature macro checks.Jack Lloyd2019-04-262-4/+5
* Fix some warnings from PVS-StudioJack Lloyd2019-01-171-2/+5
* Fix Barrett reduction input boundJack Lloyd2018-12-262-5/+5
* Avoid size-based bypass of the comparison in Barrett reduction.Jack Lloyd2018-12-241-1/+1
* Avoid conditional branch in Barrett for negative inputsJack Lloyd2018-12-241-4/+27
* In NIST P-xxx reductions unpoison S before using itJack Lloyd2018-12-241-8/+10
* Unroll const_time_lookup by 2Jack Lloyd2018-12-141-6/+10
* Merge GH #1780 Use constant time algorithm for monty_inverseJack Lloyd2018-12-092-39/+23
|\
| * Use a const time algorithm for monty_inverseJack Lloyd2018-12-092-39/+23
* | Fix typoJack Lloyd2018-12-091-1/+1
* | Avoid doing a variable time division during Montgomery setupJack Lloyd2018-12-093-4/+9
|/
* Move Miller-Rabin t param inside the blockJack Lloyd2018-12-091-2/+2
* Avoid repeated size checks when setting words in NIST reductionJack Lloyd2018-12-081-25/+33
* Add BigInt::ct_reduce_belowJack Lloyd2018-12-061-1/+2
* Reduce the base in the fixed window exponentiatorJack Lloyd2018-12-041-1/+1
* Make binary extended Euclidean algorithm less branchyJack Lloyd2018-12-031-12/+45
* Use const time reductions in Barrett and LCM computationsJack Lloyd2018-12-032-4/+6
* Avoid conditional operations in P-521 reductionJack Lloyd2018-12-011-30/+31
* Add BigInt::mod_mulJack Lloyd2018-12-012-16/+12
* Add CT::Mask typeJack Lloyd2018-11-281-2/+4
* Need to ensure minimum size hereJack Lloyd2018-11-271-0/+1
* Optimizations for NIST reductionJack Lloyd2018-11-261-22/+20
* Make more BigInt functions const-timeJack Lloyd2018-11-261-3/+2
* Make exceptions easier to translate to error codesJack Lloyd2018-11-231-1/+1
* Avoid branching in the NIST prime reduction codeJack Lloyd2018-11-091-48/+10
* Use resize instead of shrink_to_fitJack Lloyd2018-11-091-3/+3
* Rename get_uint32_t to get_uint32Jack Lloyd2018-11-091-67/+67
* Minor optimization when primality checkingJack Lloyd2018-10-311-2/+4
* Use a smaller sieve when generating primesJack Lloyd2018-10-151-3/+7
* Fix some MSVC warningsJack Lloyd2018-09-303-6/+6
* Remove unneeded load_on autoJack Lloyd2018-09-041-2/+0
* Remove support for 8 or 16 bit BigInt wordsJack Lloyd2018-08-152-10/+2
* Add some final annotationsJack Lloyd2018-08-131-1/+1
* Add Lucas test from FIPS 186-4Jack Lloyd2018-07-319-123/+382
* Fix some -Wshadow warningsJack Lloyd2018-06-291-2/+1
* Move reduction mod q to DL_GroupJack Lloyd2018-06-281-5/+11
* Avoid useless multiplication in Montgomery exponentiationJack Lloyd2018-06-263-22/+39
* Minor optimization for Montgomery exponentiationJack Lloyd2018-06-233-17/+26
* Attempt to verify decoded ECC groups are using prime fieldsJack Lloyd2018-06-201-3/+20
* Avoid a small timing channel in Barrett reductionJack Lloyd2018-06-201-8/+12
* Avoid a special case in Barrett reduction for x < modJack Lloyd2018-06-181-8/+3
* Avoid leaking size of exponentJack Lloyd2018-06-174-13/+22
* In Montgomery mul, avoid branching based on sig words of integersJack Lloyd2018-06-141-13/+21
* Fix a bug in Barrett reductionJack Lloyd2018-06-051-22/+30
* Correct error in P-224 computationJack Lloyd2018-05-311-2/+3
* Speed up DSA param genJack Lloyd2018-05-211-3/+6
* Fix typo in comment [ci skip]Jack Lloyd2018-05-171-1/+1
* Add clarifying comments and increase M-R tests for 256-bit integersJack Lloyd2018-05-151-3/+7
* Always use 1/2^-128 error bounds with Miller-RabinJack Lloyd2018-05-141-24/+14
generated by cgit v1.2.3 (git 2.39.1) at 2024-12-21 08:54:08 +0000