Generic implementations of elliptic curve cryptography using partial reduction

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2002, Pages 108-116

  Gura, Nils ^a   Eberle, Hans ^a   Shantz, Sheueling Chang ^a  

^a SUN MICROSYSTEMS   (United States)

Author keywords

Elliptic curve cryptography; Modular reduction

Indexed keywords

ALGORITHMS; CLIENT SERVER COMPUTER SYSTEMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; NETWORK PROTOCOLS; POLYNOMIALS; SECURITY OF DATA; STANDARDS; WORLD WIDE WEB;

ELLIPTIC CURVE CRYPTOGRAPHY; ELLIPTIC CURVE DIGITAL SIGNATURE ALGORITHM;

PUBLIC KEY CRYPTOGRAPHY;

EID: 0038005998     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/586123.586126     Document Type: Conference Paper

References (21)

1. 2155. In IEEE Journal on Selected Areas in Communications, 11(5):804-813, June 1993.
2. M. Bednara, M. Daldrup, J. von zur Gathen, and J. Shokrollahi. Reconfigurable implementation of elliptic curve crypto algorithms. Reconfigurable Architectures Workshop, 16th International Parallel and Distributed Processing Symposium, April 2002.
3. Berlekamp. Algebraic Coding Theory. Aegan Park Press, 1984.
4. I. Blake, G. Seroussi, and N. Smart. Elliptic Curves in Cryptography. Cambridge University Press, 1999. London Mathematical Society Lecture Note Series 265.
5. S. Blake-Wilson, D. Brown, Y. Poeluev, and M. Salter. Additional ECC Groups For IKE. IETF Internet Draft, July, 2002.
6. Certicom Research. Sec 2: Recommended elliptic curve domain parameters. Standards for Efficient Cryptography Version 1.0, September 2000.
7. S. Chang-Shantz. From euclid's gcd to montgomery multiplication to the great divide. Technical report. Sun Microsystems Laboratories TR-2001-95, June 2001.
8. J. Goodman and A. P. Chandrakasan. An energy-efficient reconfigurable public-key cryptography processor. IEEE Journal of Solid-State Circuits, 36(11):1808-1820, November 2001.
9. V. Gupta, S. Blake-Wilson, B. Möller, and C. Hawk. ECC Cipher Suites for TLS. IETF Internet Draft, August 2002.
10. N. Gura, H. Eberle, and S. C. Shantz. An end-to-end systems approach to elliptic curve cryptography. In CHES '2002 Workshop on Cryptographic Hardware and Embedded Systems, Lecture Notes in Computer Science, Springer-Verlag, August 2002.
11. A. Halbutog̈ullari and Ç. K. Koç. Mastrovito multiplier for general irreducible polynomials. IEEE Transactions on Computers, 49(5):503-518, May 2000.
12. D. Hankerson, J. L. Hernandez, and A. Menezes. Software implementation of elliptic curve. Workshop on Cryptographic Hardware and Embedded Systems, Lecture Notes in Computer Science 1965. Springer-Verlag August 2000.
13. m) using normal bases. Information and Computation, (78): 171-177, 1988.
14. A. Karatsuba and Y. Ofman. Multiplication of many-digital numbers by automatic computers. Doklady Akad. Nauk, (145):293-294, 1963. Translation in Physics-Doklady 7, 595-596.
15. J. López and R. Dahab. Fast multiplication on elliptic curves over gf(2m) without precomputation. In CHES '99 Workshop on Cryptographic Hardware and Embedded Systems, Lecture Notes in Computer Science 1717. Springer-Verlag, August 1999.
16. m). In CHES '2000 Workshop on Cryptographic Hardware and Embedded Systems, Lecture Notes in Computer Science 1965. Springer-Verlag, August 2000.
17. R. Schroeppel, H. Orman, and S. O'Malley. Fast key exchange with elliptic curve systems. In Advances in Cryptography, Crypto '95, Lecture Notes in Computer Science 963. Springer-Verlag, 1995.
18. L. Song and K. K. Parhi. Low-energy digit-serial/parallel finite field multipliers. IEEE Journal of VLSI Signal Processing Systems, (19):149-166, 1998.
19. U.S. Department of Commerce and National Institute of Standards and Technology. Digital signature standard (dss). Federal Information Processing Standards Publication FIPS PUB 186-2. January 2000.
20. A. D. Woodbury, D. V. Bailey, and C. Paar. Elliptic curve cryptography on smart cards without coprocessors. In The Fourth Smart Card Research and Advanced Applications (CARDIS2000) Conference, September 2000. Bristol, UK.
21. T. Yanik, E. Savaş, and Ç. K. Koç. Incomplete reduction in modular arithmetic. IEE Proceedings: Computers and Digital Technique, 149(2), March 2002.