Commit Graph

18 Commits

Author SHA1 Message Date
d49c85538c Remove a bunch of test data we don't appear to be using. 2019-02-10 17:41:41 -08:00
d189331312 Try to simplify the multiplication loop, to get better optimization, and add a bunch of missing test cases. 2019-01-30 20:34:38 -08:00
4114db21be Add support for scaling numbers by primitive types. 2019-01-01 20:55:21 -08:00
a4ead1ec3d Add additional test files. 2018-12-30 17:54:08 -08:00
ae8266885b Support modular division of signed numbers. 2018-12-23 21:55:07 -08:00
70a082363a Add a testbit() operationg. 2018-12-23 21:05:27 -08:00
85165c7f68 Address some missing operations for ECDSA. 2018-12-23 21:05:05 -08:00
6c40ee5109 Support signed multiplication and division, for ECDSA. 2018-12-23 20:24:20 -08:00
2b9f5ea7a2 Support unsigned integral square root computations. 2018-11-30 11:28:20 -08:00
0ec5f90d8e Ridiculously over-build the testing infrastructure. 2018-11-29 17:06:34 -08:00
45f7df00d8 Modular inverse computation. 2018-10-26 21:28:48 -07:00
89e2dfc6ef Base implementation of signed numbers and EGCD, with tests. 2018-10-15 19:16:25 -07:00
a251b7a294 Generate better tests, with fewer repeating results. 2018-10-08 20:32:51 -07:00
24ad31df0d Barrett versions of modsq/modmul/modexp, with tests. 2018-10-04 20:52:41 -07:00
78750598a5 Basic mathematics for unsigned integers ported over, tests pass. 2018-10-04 10:40:11 -07:00
3678ffdd6c Be a little bit more careful about what items we do and don't include, start adding modular math into the system. 2018-10-02 13:37:39 -07:00
304d009a67 Now with tests for the basic algorithms. 2018-09-28 17:48:35 -05:00
3b68363b49 Initial commit! 2018-09-26 14:49:10 -05:00