Guide to Elliptic Curve Cryptography

By Darrel Hankerson, Scott A. Vanstone, Alfred J. Menezes. Springer Professional Computing, 2004

580 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/3bfdca5ffd79bdfb8b9110c84a23470d88d774a6

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Sujoy Sinha Roy
2. Kimmo U. Järvinen
3. Ingrid M. R. Verbauwhede
4. Frederik Vercauteren
5. Vassil S. Dimitrov
6. M. Sadegh Riazi
7. Kim Laine
8. Michael Naehrig

Citations in the corpus

• Modular Hardware Architecture for Somewhat Homomorphic Function Evaluation (2015, methodology): “The first reason is that the primes used in this implementation are not of pseudo-Mersenne type which support fast modular reduction technique [26].”
• Review of Security Issues in Industrial Networks (2013, unknown): “Fortunately, at present this does not seem to be completely true any longer, thanks to the advances offered by promising approaches adopting the Elliptic Curve Cryptography (ECC) [3], [76], [77], [81], [87].”
• Introduction to Modern Cryptography, Second Edition (2014, unknown): “[83] also provide extensive detail on the implementation of number-theoretic algorithms for cryptography.”