[curves] Comparing high-speed / high-security curve implementations

Ben Smith hyperelliptic at gmail.com
Wed Apr 23 13:07:49 PDT 2014

2014-04-23 22:05 GMT+02:00 Trevor Perrin <trevp at trevp.net>:
>> Maybe in the same vein, I helped with the theoretical part of an
>> implementation over GF(p^2) with p = 2^127 - 1 (Huseyin Hisil and
>> Craig Costello did all the hard work).  It's a Montgomery curve
>> (x-coordinate only) with an efficient endomorphism, aiming at roughly
>> 128-bit security.
>> Ivy Bridge: 148K.
> Thanks, do you have Sandy Bridge or Haswell numbers, since that's what
> I have for others?

Sorry, no.  I/we don't have a Haswell platform to measure it on, but
feel free to download the implementation and try it yourself...


You know we all became mathematicians for the same reason: we were lazy.
  --Max Rosenlicht

More information about the Curves mailing list