Age | Commit message (Collapse) | Author | |
---|---|---|---|
2015-06-17 | RSA key generation. Compiles, not (yet) tested otherwise. | Rob Austein | |
2015-06-16 | Refactor key loading code. | Rob Austein | |
2015-06-11 | Debug modexp_fp() buffer handling. Add basic timing report. | Rob Austein | |
Compensate for PyCrypto's weird inversion of p and q when calculating CRT coefficients, and add key the key components PyCrypto doesn't bother pre-calculating to our test data. | |||
2015-06-11 | First cut at RSA decryption/signature using the Chinese Remainder | Rob Austein | |
Theorem. Not yet tested, and given the number of moving parts I would be astonished if this version actually worked, but it does compile. Added some timing code to tests/test-rsa.c so we can see whether this is doing anything useful once it does work. | |||
2015-06-10 | Operand lengths weren't including bug-workaround padding. | Rob Austein | |
2015-06-10 | Add hal_modexp(), since the protocol is a bit complex. Rewrite | Rob Austein | |
test-rsa to use hal_modexp(), and generate a new set of test keys without the whacky padding, since hal_modexp() now handles that. | |||
2015-06-04 | Disable HMAC-SHA-384 tests as neither my implementation nor PyCrypto | Rob Austein | |
passes them. Add missing copyright notices, other trivial cleanup (whitespace, etc). | |||
2015-06-03 | ModExp now working! | Rob Austein | |
2015-05-28 | More fun with RSA test cases, still not working. | Rob Austein | |
2015-05-27 | First pass at RSA tests. | Rob Austein | |