Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
By Robert P. Gallant, Robert J. Lambert, Scott A. Vanstone. Annual International Cryptology Conference, 2001
412 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Geometry and Topology, Information Systems
View Paper: https://www.semanticscholar.org/paper/37b65b54495e44ded68d1fc5e8a42d0db449d7d6
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Michael Naehrig
- David Mandell Freeman
- Edlyn Teske
- Joppe W. Bos
- Michael Scott
- Nadia Heninger
- J. Alex Halderman
- Eric Wustrow
In Geometry and Topology
- Michael Naehrig
- Edlyn Teske
- David Mandell Freeman
- Daniel J. Bernstein
- Michael Scott
- Koray Karabina
- Brent Waters
- Allison Bishop
In Information Systems
- Michael Naehrig
- David Mandell Freeman
- Edlyn Teske
- Michael Scott
- Joppe W. Bos
- J. Alex Halderman
- Eric Wustrow
- Nadia Heninger
Citations in the corpus
- Curve25519: New Diffie-Hellman Speed Records (2006, background): “Special curves with small complex automorphisms have potential benefits, as discussed in [31], and are worth further investigation, but so far I have not succeeded in saving time using them.”
- Elliptic Curve Cryptography in Practice (2014, methodology): “A curve with j-invariant 0 has efficiently computable endomorphisms that can be used to speed up implementations, for example using the GLV decomposition for scalar multiplication [25].”
- A Taxonomy of Pairing-Friendly Elliptic Curves (2010, background): “Curves with D = 1 or 3 have both low-degree endomorphisms and twists; the former may be used to speed up elliptic curve arithmetic [38], while the latter can speed up pairing computation for certain embedding degrees k (see Sect.”