Advertisement

A Scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware

  • Gerardo Orlando
  • Christof Paar
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2162)

Abstract

This work proposes a new elliptic curve processor architecture for the computation of point multiplication for curves defined over fields GF(p). This is a scalable architecture in terms of area and speed specially suited for memory-rich hardware platforms such a field programmable gate arrays (FPGAs). This processor uses a new type of high-radix Montgomery multiplier that relies on the precomputation of frequently used values and on the use of multiple processing engines.

Keywords

Elliptic Curve Arithmetic Unit Main Controller Elliptic Curve Cryptosystems Worcester Polytechnic Institute 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    G. Agnew, R. Mullin, and S. Vanstone, “An implementation of elliptic curve cryptosystems over F2155,” IEEE Journal on Selected areas in Communications, vol. 11, pp. 804–813, June 1993.Google Scholar
  2. 2.
    M. Rosner, “Elliptic curve cryptosystems on reconfigurable hardware,” Master’s thesis, ECE Dept., Worcester Polytechnic Institute, Worcester, USA, May 1998.Google Scholar
  3. 3.
    L. Gao, S. Shrivastava, and G. Sobelman, “Elliptic curve scalar multiplier design using FPGAs,” in Workshop on Cryptographic Hardware and Embedded Systems (CHES’ 99) (C. Koc and C. Paar, eds.), vol. LNCS 1717, Springer-Verlag, August 1999.Google Scholar
  4. 4.
    S. Sutikno, R. Effendi, and A. Surya, “Design and implementation of arithmetic processor F in2155 for elliptic curve cryptosystems,” in The 1998 IEEE Asia-Pacific Conference on Circuits and Systems, pp. 647–650, November 1998.Google Scholar
  5. 5.
    K. Leung, K. Ma, W. Wong, and P. Leong, “FPGA implementation of a microcoded elliptic curve cryptographic processor,” in Eight Annual IEEE Symposuium on Field-Programmable Custom Computing Machines, FCCM’ 00, (Napa Valley, California, USA), 2000.Google Scholar
  6. 6.
    G. Orlando and C. Paar, “A high performance elliptic curve processor for GF(2m),” in Workshop on Cryptographic Hardware and Embedded Systems-CHES 2000, vol. LNCS 1965, (Worcester, Massachusetts, USA), Springer-Verlag, August 2000.Google Scholar
  7. 7.
    P. Kornerup, “A systolic, linear-array multiplier for a class of right-shift algorithms,” IEEE Transactions on Computers, vol. 43, pp. 892–898, August 1994.Google Scholar
  8. 8.
    M. Shand and J. Vuillemin, “Fast implementations of RSA cryptography,” in Proceedings 11th Symposium on Computer Arithmetic, pp. 252–259, 1993.Google Scholar
  9. 9.
    H. Orup, “Simplifying quotient determination in high-radix modular multiplication,” in Proceedings 12th Symposium on Computer Arithmetic, pp. 193–199, 1995.Google Scholar
  10. 10.
    T. Blum, “Modular exponentiation on reconfigurable hardware,” Master’s thesis, Dept. of ECE, Worcester Polytechnic Institute, Worcester, U.S.A., May 1999.Google Scholar
  11. 11.
    S. E. Eldridge and C. D. Walter, “Hardware implementation of Montgomery’s modular multiplication algorithm,” IEEE Transactions on Computers, vol. 42, pp. 693–699, July 1993.Google Scholar
  12. 12.
    W. Freking and K. Parhi, “A unified method for iterative computation of modular multiplications and reduction operations,” in International Conference on Computer Design (ICCD’ 99), pp. 80–87, 1999.Google Scholar
  13. 13.
    A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone, Handbook of Applied Cryptography. CRC Press, 1997.Google Scholar
  14. 14.
    I. Blake, G. Seroussi, and N. Smart, Elliptic Curves in Cryptography. Cambridge, UK: Cambridge University Press, first ed., 1999.zbMATHGoogle Scholar
  15. 15.
    P. Montgomery, “Modular multiplication without trial division,” Mathematics of Computation, vol. 44, pp. 519–521, April 1985.Google Scholar
  16. 16.
    E. Brickell, D. Gordon, K. McCurley, and D. Wilson, “Fast exponentiation with precomputation,” in Lecture Notes in Computer Science 658: Advances in Cryptology — EUROCRYPT’ 92, pp. 200–207, Springer-Verlag, Berlin, 1993.CrossRefGoogle Scholar
  17. 17.
    F. I. P. S. Publication, “FIPS 186-2: Digital Signature Standard (DSS),” January 2000.Google Scholar
  18. 18.
    P1363, Standard Specifications for Public-key Cryptography (Draft Version 8). IEEE, October 1998.Google Scholar
  19. 19.
    B. Parhami, Computer Arithmetic Algorithms and Hardware Designs. New York: Oxford University Press, Inc., 1999.Google Scholar
  20. 20.
    I. Koren, Computer Arithmetic Architectures. Prentice-Hall, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Gerardo Orlando
    • 1
  • Christof Paar
    • 2
  1. 1.General Dynamics Communication SystemsNeedhamUSA
  2. 2.ECE DepartmentWorcester Polytechnic InstituteWorcesterUSA

Personalised recommendations