Software Implementation of the NIST Elliptic Curves Over Prime Fields

306 citations recorded by the source corpus.

How researchers see this paper

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

Algorithms for Multi-exponentiation (2001, background): “[6]), possibly because it is perceived to be simpler to implement.”
The security of vehicular ad hoc networks (2005, background): “These figures are derived from [4] and [8] and should be taken only as indicative for the specific platform (Pentium II 400 Mhz with memory constraints).”
Efficient and robust pseudonymous authentication in VANET (2007, methodology): “As implementations of group signatures and the chosen GS were not available to us, we calculated the number of 32-bit word multiplications required for GS signing and verifying, extracting the relevant data from [14] and [22].”
Guide to Elliptic Curve Cryptography (2004, methodology): “247 Acronyms AES Advanced Encryption Standard AIA Almost Inverse Algorithm ANSI American National Standards Institute ASIC Application-Specific Integrated Circuit BEA Binary Extended Algorithm DES Data Encryption Standard DH Diffie-Hellman DHP Diffie-Hellman Problem DL Discrete Logarithm DLP Discret”
The advantages of elliptic curve cryptography for wireless security (2004, background): “Finding further ways to improve elliptic curve scalar multiplication is an active area of research [ 7 , 14, 15].”