| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2015-09-02 | Identify PBKDF2 tests. | Rob Austein | |
| 2015-09-02 | Clean up excessively complicated handling of opaque types in hash and | Rob Austein | |
| RSA code; use simpler model (pointer to incomplete structure) used in ECDSA code. Refactor RSA code to use shared ASN.1 routines. | |||
| 2015-08-27 | Add point validation check to hal_ecdsa_verify(). Update README.md | Rob Austein | |
| and code comments. | |||
| 2015-08-26 | Signature works better if we read the entire hash. | Rob Austein | |
| 2015-08-25 | More ASN.1 fixes. | Rob Austein | |
| 2015-08-25 | Rework RFC 5915 ASN.1. | Rob Austein | |
| 2015-08-25 | More test code. | Rob Austein | |
| 2015-08-25 | ASN.1 bugfixes. | Rob Austein | |
| 2015-08-25 | Add keygen/sign/verify test with dynamic (not test vector) key. | Rob Austein | |
| 2015-08-24 | First stumblings towards ECDSA test code. | Rob Austein | |
| 2015-08-22 | Rework point_scalar_multiply() to avoid a timing leak with small scalars. | Rob Austein | |
| 2015-08-22 | Add hal_ecdsa_verify(). Move hashing out of ECDSA routines. Clean up | Rob Austein | |
| a few bits that didn't pass self-review. | |||
| 2015-08-21 | Updated point doubling and addition to use algorithms from the | Rob Austein | |
| hyperelliptic.org formula database. Compiles, still not tested. | |||
| 2015-08-21 | Snapshot along the way to ECDSA. Code mostly written, except for | Rob Austein | |
| ecdsa_verify(). Untested. Point addition and doubling algorithms are the ones from libtomcrypt, main point of this commit is to save those before replacing them with faster algorithms from hyperelliptic.org. | |||
| 2015-07-17 | Debian Jessie hangs with bs=128, Kosagi forum tells us that the magic | Rob Austein | |
| solution is to change to bs=32. | |||
| 2015-07-07 | Track move of third party libraries to /sw/thirdparty/. | Rob Austein | |
| 2015-07-05 | Add load_novena_fpga script. | Rob Austein | |
| 2015-07-05 | Use C99 variadic macro as safety wrapper around variadic function. | Rob Austein | |
| Are we having fun yet? | |||
| 2015-07-05 | NULL-terminate string list, doh. | Rob Austein | |
| 2015-07-05 | novena-eim.h had an invisible dependency on <sys/types.h>, at least on | Rob Austein | |
| Debian Wheezy (ie, on the Novena). | |||
| 2015-07-05 | Get rid of autoconf, as we don't really need it. Add eim_peek_poke | Rob Austein | |
| utility program, based on Paul's example in the core/platform/novena repository. | |||
| 2015-07-01 | Change default to use software modexp until we sort out performance | Rob Austein | |
| issues in ModExp core. | |||
| 2015-06-30 | Track ModExp core exponent padding change: this enables the short exponent ↵ | Rob Austein | |
| fast path. | |||
| 2015-06-26 | Verify signature in key generation test. | Rob Austein | |
| 2015-06-24 | Rework API for loading keys from components. Relax key size | Rob Austein | |
| constraints to allow any key size within our supported range, since hsmbully seems to want to twist this knob to every possible setting. | |||
| 2015-06-21 | libcryptech -> libhal, doh. | Rob Austein | |
| 2015-06-21 | Check for hash core present before running PBKDF2 tests. | Rob Austein | |
| 2015-06-21 | Add digest algorithm IDs. | Rob Austein | |
| 2015-06-19 | Add methods to extract public components from an RSA key. Other minor | Rob Austein | |
| cleanup and commenting within RSA module. | |||
| 2015-06-19 | Add README.md. | Rob Austein | |
| 2015-06-19 | Add temporary workaround to let us use software ModExp when we're | Rob Austein | |
| testing other code and don't want to wait for the as-yet-unoptimized FPGA ModExp core. | |||
| 2015-06-19 | Add replacement for fp_exptmod() using our ModExp core, so we don't | Rob Austein | |
| drag in all of TFM's Montgomery just to support the Miller-Rabin test. | |||
| 2015-06-18 | Supply public exponent as bigendian byte string rather than unsigned | Rob Austein | |
| long, since that's the form we'll need for PKCS #11. | |||
| 2015-06-18 | Helps to set the return value when reading a key, doh. | Rob Austein | |
| 2015-06-18 | Add round-trip test for DER I/O code. | Rob Austein | |
| 2015-06-18 | Add RSA blinding. | Rob Austein | |
| 2015-06-18 | Refactor CRT code into public API. | Rob Austein | |
| 2015-06-17 | Debug RSA key generation. | Rob Austein | |
| 2015-06-17 | RSA key generation and DER support. | Rob Austein | |
| 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 | Build issues on Novena. | Rob Austein | |
| 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-05 | This time for sure, Rocky! | Rob Austein | |
| 2015-06-05 | Get feedback cycle right in PBKDF2 iteration. | Rob Austein | |
| 2015-06-05 | HMAC for truncated SHA-512 digests would probably work better if we | Rob Austein | |
| used the right digest length constants. Doh. | |||
| 2015-06-04 | First cut at PBKDF2. | Rob Austein | |
 |
index : sw/libhal | |
| Cryptech libhal: crypto software, HSM management, RPC | git repositories |
| aboutsummaryrefslogtreecommitdiff |