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.
 
 
 
 
 

199 lines
8.8 KiB

  1. September 6, 2014:
  2. Pull in minor changes from David Leon Gil and Nicholas Wilson, with
  3. some adjustments. I hope the adjustments don't break their compiles.
  4. `make bat` now makes a bat which passes supercop-fastbuild, though
  5. the benchmarks are rather different from `make bench`. I need to track
  6. down why.
  7. August 4, 2014:
  8. Experiments and bug fixes.
  9. Add really_memset = memset_s (except not because I'm setting -std=c99),
  10. thanks David Leon Gil. I think I put it in the right places.
  11. Try to work around what I think is a compiler bug in GCC -O3 on non-AVX
  12. platforms. I can't seem to work around it as -Os, so I'm just flagging
  13. a warning (-Werror makes it an error) for now. Will take more
  14. investigation. Thanks Samuel Neves.
  15. Added an experimental (not ready yet!) ARM NEON implementation in
  16. arch_neon_experimental. This implementation seems to work, but needs
  17. more testing. It is currently asm-heavy and not GCC clean. I am
  18. planning to have a flag for it to use intrinsics instead of asm;
  19. currently the intrinsics are commented out. On clang this does ECDH
  20. in 1850kcy on my BeagleBone Black, comparable to Curve41417. Once this
  21. is ready, I will probably move it to arch_neon proper, since arch_neon
  22. isn't particularly tuned.
  23. July 11, 2014:
  24. This is mostly a cleanup release.
  25. Added CRANDOM_MIGHT_IS_MUST config flag (default: 1). When set, this
  26. causes crandom to assume that all features in the target arch will
  27. be available, instead of detecting them. This makes sense because
  28. the rest of the Goldilocks code is not (yet?) able to detect features.
  29. Also, I'd like to submit this to SUPERCOP eventually, and SUPERCOP won't
  30. pass -DMUST_HAVE_XXX on the command line the way the Makefile here did.
  31. Flag EXPERIMENT_CRANDOM_BUFFER_CUTOFF_BYTES to disable the crandom
  32. output buffer. This buffer improves performance (very marginally at
  33. Goldilocks sizes), but can cause problems with forking and VM
  34. snapshotting. By default, the buffer is now disabled.
  35. I've slightly tweaked the Elligator implementation (which is still
  36. unused) to make it easier to invert. This makes anything using Elligator
  37. (i.e. nothing) incompatible with previous releases.
  38. I've been factoring "magic" constants such as curve orders, window sizes,
  39. etc into a few headers, to reduce the effort to port the code to other
  40. primes, curves, etc. For example, I could test the Microsoft curves, and
  41. something like:
  42. x^2 + y^2 = 1 +- 5382[45] x^2 y^2 mod 2^480-2^240-1
  43. ("Goldeneye"? "Ridinghood"?) might be a reasonable thing to try for
  44. 64-bit CPUs.
  45. In a similar vein, most of the internal code has been changed to say
  46. "field" instead of p448, so that a future version of magic.h can decide
  47. which field header to include.
  48. You can now `make bat` to create an eBAT in build/ed448-goldilocks. This
  49. is only minimally tested, though, because SUPERCOP doesn't work on my
  50. machine and I'm too lazy to reverse engineer it. It sets a new macro,
  51. SUPERCOP_WONT_LET_ME_OPEN_FILES, which causes goldilocks_init() to fall
  52. back to something horribly insecure if crandom_init_from_file raises
  53. EMFILE.
  54. Slightly improved documentation.
  55. Removed some old commented-out code; restored the /* C-style */ comment
  56. discipline.
  57. The AMD-64 version should now be GCC clean, at least for reasonably
  58. recent GCC (tested on OS X.9.3, Haswell, gcc-4.9).
  59. History no longer says "2104".
  60. May 3, 2014:
  61. Minor changes to internal routines mean that this version is not
  62. compatible with the previous one.
  63. Added ARM NEON code.
  64. Added the ability to precompute multiples of a partner's public key. This
  65. takes slightly longer than a signature verification, but reduces future
  66. verifications with the precomputed key by ~63% and ECDH by ~70%.
  67. goldilocks_precompute_public_key
  68. goldilocks_destroy_precomputed_public_key
  69. goldilocks_verify_precomputed
  70. goldilocks_shared_secret_precomputed
  71. The precomputation feature are is protected by a macro
  72. GOLDI_IMPLEMENT_PRECOMPUTED_KEYS
  73. which can be #defined to 0 to compile these functions out. Unlike most
  74. of Goldilocks' functions, goldilocks_precompute_public_key uses malloc()
  75. (and goldilocks_destroy_precomputed_public_key uses free()).
  76. Changed private keys to be derived from just the symmetric part. This
  77. means that you can compress them to 32 bytes for cold storage, or derive
  78. keypairs from crypto secrets from other systems.
  79. goldilocks_derive_private_key
  80. goldilocks_underive_private_key
  81. goldilocks_private_to_public
  82. Fixed a number of bugs related to vector alignment on Sandy Bridge, which
  83. has AVX but uses SSE2 alignment (because it doesn't have AVX2). Maybe I
  84. should just switch it to use AVX2 alignment?
  85. Beginning to factor out curve-specific magic, so as to build other curves
  86. with the Goldilocks framework. That would enable fair tests against eg
  87. E-521, Ed25519 etc. Still would be a lot of work.
  88. More thorough testing of arithmetic. Now uses GMP for testing framework,
  89. but not in the actual library.
  90. Added some high-level tests for the whole library, including some (bs)
  91. negative testing. Obviously, effective negative testing is a very difficult
  92. proposition in a crypto library.
  93. March 29, 2014:
  94. Added a test directory with various tests. Currently testing SHA512 Monte
  95. Carlo, compatibility of the different scalarmul functions, and some
  96. identities on EC point ops. Began moving these tests out of benchmarker.
  97. Added scan-build support.
  98. Improved some internal interfaces. Made a structure for Barrett primes
  99. instead of passing parameters individually. Moved some field operations
  100. to places that make more sense, eg Barrett serialize and deserialize. The
  101. deserialize operation now checks that its argument is in [0,q).
  102. Added more documentation.
  103. Changed the names of a bunch of functions. Still not entirely consistent,
  104. but getting more so.
  105. Some minor speed improvements. For example, multiply is now a couple cycles
  106. faster.
  107. Added a hackish attempt at thread-safety and initialization sanity checking
  108. in the Goldilocks top-level routines.
  109. Fixed some vector alignment bugs. Compiling with -O0 should now work.
  110. Slightly simplified recode_wnaf.
  111. Add a config.h file for future configuration. EXPERIMENT flags moved here.
  112. I've decided against major changes to SHA512 for the moment. They add speed
  113. but also significantly bloat the code, which is going to hurt L1 cache
  114. performance. Perhaps we should link to OpenSSL if a faster SHA512 is desired.
  115. Reorganize the source tree into src, test; factor arch stuff into src/arch_*.
  116. Make most of the code 32-bit clean. There's now a 32-bit generic and 32-bit
  117. vectorless ARM version. No NEON version yet because I don't have a test
  118. machine (could use my phone in a pinch I guess?). The 32-bit version still
  119. isn't heavily optimized, but on ARM it's using a nicely reworked signed/phi-adic
  120. multiplier. The squaring is also based on this, but could really stand some
  121. improvement.
  122. When passed an even exponent (or extra doubles), the Montgomery ladder should
  123. now be accept points if and only if they lie on the curve. This needs
  124. additional testing, but it passes the zero bit exponent test.
  125. On 32-bit, use 8x4x14 instead of 5x5x18 table organization. Probably there's
  126. a better heuristic.
  127. March 5, 2014:
  128. First revision.
  129. Private keys are now longer. They now store a copy of the public key, and
  130. a secret symmetric key for signing purposes.
  131. Signatures are now supported, though like everything else in this library,
  132. their format is not stable. They use a deterministic Schnorr mode,
  133. similar to EdDSA. Precomputed low-latency signing is not supported (yet?).
  134. The hash function is SHA-512.
  135. The deterministic hashing mode needs to be changed to HMAC (TODO!). It's
  136. currently envelope-MAC.
  137. Probably in the future there will be a distinction between ECDH key and
  138. signing keys (and possibly also MQV keys etc).
  139. Began renaming internal functions. Removing p448_ prefixes from EC point
  140. operations. Trying to put the verb first. For example,
  141. "p448_isogeny_un_to_tw" is now called "twist_and_double".
  142. Began documenting with Doxygen. Use "make doc" to make a very incomplete
  143. documentation directory.
  144. There have been many other internal changes.
  145. Feb 21, 2014:
  146. Initial import and benchmarking scripts.
  147. Keygen and ECDH are implemented, but there's no hash function.