Daniel J. Bernstein
The "Curve25519" speed records for Diffie-Hellman software were set with a Montgomery-form elliptic curve. Is it possible to achieve even better scalar-multiplication speeds with a Gaudry-form hyperelliptic curve? Exactly how fast is arithmetic modulo 2127-1, compared to arithmetic modulo 2255-19?
back to EIDMA Seminar Combinatorial Theory announcements