You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 

80 lines
3.4 KiB

  1. March 29, 2014:
  2. Added a test directory with various tests. Currently testing SHA512 Monte
  3. Carlo, compatibility of the different scalarmul functions, and some
  4. identities on EC point ops. Began moving these tests out of benchmarker.
  5. Added scan-build support.
  6. Improved some internal interfaces. Made a structure for Barrett primes
  7. instead of passing parameters individually. Moved some field operations
  8. to places that make more sense, eg Barrett serialize and deserialize. The
  9. deserialize operation now checks that its argument is in [0,q).
  10. Added more documentation.
  11. Changed the names of a bunch of functions. Still not entirely consistent,
  12. but getting more so.
  13. Some minor speed improvements. For example, multiply is now a couple cycles
  14. faster.
  15. Added a hackish attempt at thread-safety and initialization sanity checking
  16. in the Goldilocks top-level routines.
  17. Fixed some vector alignment bugs. Compiling with -O0 should now work.
  18. Slightly simplified recode_wnaf.
  19. Add a config.h file for future configuration. EXPERIMENT flags moved here.
  20. I've decided against major changes to SHA512 for the moment. They add speed
  21. but also significantly bloat the code, which is going to hurt L1 cache
  22. performance. Perhaps we should link to OpenSSL if a faster SHA512 is desired.
  23. Reorganize the source tree into src, test; factor arch stuff into src/arch_*.
  24. Make most of the code 32-bit clean. There's now a 32-bit generic and 32-bit
  25. vectorless ARM version. No NEON version yet because I don't have a test
  26. machine (could use my phone in a pinch I guess?). The 32-bit version still
  27. isn't heavily optimized, but on ARM it's using a nicely reworked signed/phi-adic
  28. multiplier. The squaring is also based on this, but could really stand some
  29. improvement.
  30. When passed an even exponent (or extra doubles), the Montgomery ladder should
  31. now be accept points if and only if they lie on the curve. This needs
  32. additional testing, but it passes the zero bit exponent test.
  33. On 32-bit, use 8x4x14 instead of 5x5x18 table organization. Probably there's
  34. a better heuristic.
  35. March 5, 2014:
  36. First revision.
  37. Private keys are now longer. They now store a copy of the public key, and
  38. a secret symmetric key for signing purposes.
  39. Signatures are now supported, though like everything else in this library,
  40. their format is not stable. They use a deterministic Schnorr mode,
  41. similar to EdDSA. Precomputed low-latency signing is not supported (yet?).
  42. The hash function is SHA-512.
  43. The deterministic hashing mode needs to be changed to HMAC (TODO!). It's
  44. currently envelope-MAC.
  45. Probably in the future there will be a distinction between ECDH key and
  46. signing keys (and possibly also MQV keys etc).
  47. Began renaming internal functions. Removing p448_ prefixes from EC point
  48. operations. Trying to put the verb first. For example,
  49. "p448_isogeny_un_to_tw" is now called "twist_and_double".
  50. Began documenting with Doxygen. Use "make doc" to make a very incomplete
  51. documentation directory.
  52. There have been many other internal changes.
  53. Feb 21, 2014:
  54. Initial import and benchmarking scripts.
  55. Keygen and ECDH are implemented, but there's no hash function.