A high-performance reconfigurable elliptic curve processor for GF(2m)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1965, Issue , 2000, Pages 41-56

  Orlando, Gerardo ^a   Paar, Christof ^b  

^a GENERAL DYNAMICS   (United States)

^b WORCESTER POLYTECHNIC INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER HARDWARE; CRYPTOGRAPHY; CURVE FITTING; EMBEDDED SYSTEMS; GEOMETRY; HARDWARE; RECONFIGURABLE ARCHITECTURES; RECONFIGURABLE HARDWARE;

DIGIT-SERIAL MULTIPLIER; HARDWARE IMPLEMENTATIONS; MULTIPLIER ARCHITECTURE; PROCESSOR ARCHITECTURES; PROGRAMMABLE PROCESSORS; SCALABLE ARCHITECTURES; SCALAR MULTIPLICATION; SOFTWARE IMPLEMENTATION;

COMPUTER ARCHITECTURE;

EID: 68549097842     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (21)

1. G.B. Agnew, R.C. Mullin, and S.A. Vanstone. An implementation of el-liptic curve cryptosystems over F2155. IEEE Journal on Selected Areas in Communications, 11(5):804-813, June 1993.
2. ANSI X9.62-1999. Public Key Cryptography For The Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA), January 1998. Approved January 7, 1999.
3. ANSI X9.63-1999. Public Key Cryptography For The Financial Services Industry: Key Agreement and Key Transport Using Elliptic Curve Cryptography, January 1999. Working Draft.
4. T. Beth and D. Gollmann. Algorithm engineering for public key algorithms. IEEE Journal on Selected Areas in Communications, 7(4):458-466, 1989.
5. E.F. Brickell, D.M. Gordon, K.S. McCurley, and D.B. Wilson. Fast exponentiation with precomputation. In Lecture Notes in Computer Science 658: Advances in Cryptology EUROCRYPT '92, pages 200-207. Springer-Verlag, Berlin, 1993.
6. I. Blake, G. Seroussi, and N.P. Smart. Elliptic Curves in Cryptography. Cambridge University Press, Cambridge, UK, first edition, 1999.
7. P. Gaundry, F. Hess, and N.P. Smart. Constructive and destructive facets of Weil descent on elliptic curves. available at http://www.hpl.hp.com/techreports/2000/HPL-2000-10.html, January 2000.
8. L. Gao, S. Shrivastava, and G. Sobelman. Elliptic curve scalar multiplier design using FPGAs. In C. Koc and C. Paar, editors, Workshop on Cryptographic Hardware and Embedded Systems (CHES '99), volume LNCS 1717. Springer-Verlag, August 1999.
9. T. Itoh and S. Tsujii. A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases. Information and Computation, 78:171-177, 1988.
10. J. Lopez and R. Dahab. Fast multiplication on elliptic curves over GF(2m) without precomputation. In C. Koc and C. Paar, editors, Workshop on Cryptographic Hardware and Embedded Systems (CHES '99), volume LNCS 1717. Springer-Verlag, August 1999.
11. R. Lidl and H. Niederreiter. Introduction to finite fields and their applications. Cambridge University Press, Cambridge, UK, revised edition, 1994.
12. NIST. Recommended elliptic curves for federal government use. Available at http://csrc.nist.gov/encryption, May 1999.
13. P1363. Standard Specifications for Public-key Cryptography (Draft Version 8). IEEE, October 1998.
14. C. Paar, P. Fleischmann, and P. Soria-Rodriguez. Fast arithmetic for public-key algorithms in Galois fields with composite exponents. IEEE Transactions on Computers, 48(10):1025-1034, October 1999.
15. M. Rosner. Elliptic curve cryptosystems on reconfigurable hardware. Master's thesis, ECE Dept., Worcester Polytechnic Institute, Worcester, USA, May 1998.
16. S. Sutikno, R. Efiendi, and A. Surya. Design and implementation of arith-metic processor F2155 for elliptic curve cryptosystems. In The 1998 IEEE Asia-Pacific Conference on Circuits and Systems, pages 647-650, November 1998.
17. R. Schroeppel, H. Orman, S. O'Malley, and O. Spatscheck. Fast key exchange with elliptic curve systems. In D. Coppersmith, editor, Advances in Cryptogaphy, Crypto 95, volume LNCS 963. Springer-Verlag, 1995.
18. L. Song and K. K. Parhi. Low-energy digit-serial/parallel finite field multipliers. Journal of VLSI Signal Processing Systems, 2(22):1-17, 1997.
19. S.A. Vanstone. Eficient implementation of elliptic curve cryptography, June 1999. Certicom Corporation Seminar.
20. H. Wu. Low complexity bit-parallel finite field arithmetic using polynomial basis. In C. Koc and C. Paar, editors, Workshop on Cryptographic Hardware and Embedded Systems (CHES '99), volume LNCS 1717. Springer-Verlag, August 1999.
21. Xilinx. The Programmable Logic Data Book. Xilinx, Inc., 1999.