Age | Commit message (Collapse) | Author | |
---|---|---|---|
2015-10-02 | Revise point addition and point scalar multiplication routines to use | Rob Austein | |
mixed Jacobian-affine coordinates, per a suggestion from Pavel. Old code still present under compile time conditional for easy comparison, but will probably go away soon along with a bit of minor cleanup. | |||
2015-09-14 | Fencepost error in hal_ecdas_key_from_ecpoint(). | Rob Austein | |
2015-09-11 | Avoid gratuitous assertion failure if caller gives us a larger buffer | Rob Austein | |
than necessary when writing private key to DER. | |||
2015-09-06 | Add ECPoint I/O functions. ASN.1 cleanup. | Rob Austein | |
2015-09-02 | Add PKCS11 ECDSA signature format. | 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 | ASN.1 bugfixes. | 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. |