Wuhan University Journal of Natural Sciences

, Volume 10, Issue 1, pp 31–34 | Cite as

An FPGA implementation of GF (p) elliptic curve cryptographic coprocessor

  • Liu Yu-zhen
  • Qin Zhong-ping
  • Zhang Huan-guo
Trusted Software and Hardware
Received:
  • 58 Downloads

Abstract

A GF(p) elliptic curve cryptographic coprocessor is proposed and implemented on Field Programmable Gate Array (FPGA). The focus of the coprocessor is on the most critical, complicated and time-consuming point multiplications. The technique of coordinates conversion and fast multiplication algorithm of two large integers are utilized to avoid frequent inversions and to accelerate the field multiplications used in point multiplications. The characteristic of hardware parallelism is considered in the implementation of point multiplications. The coprocessor implemented on XILINX XC2V3000 computes a point multiplication for an arbitrary point on a curve defined over GF(2192−264−1) with the frequency of 10 MHz in 4.40 ms in the average case and 5.74 ms in the worst case. At the same circumstance, the coprocessor implemented on XILINX XC2V4000 takes 2.2 ms in the average case and 2.88 ms in the worst case.

Key words

elliptic curve cryptosystems cryptographic coprocessor cryptography information security 

CLC number

TP 309 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Koblitz N. Elliptic Curve Cryptosystem.Mathematics of Computation, 1987,48(177):203–209.MATHCrossRefMathSciNetGoogle Scholar
  2. [2]
    Miller V. Uses of Elliptic Curves in Cryptography.Advances in Cryptology-CRYPTO' 85, LNCS 218. Berlin: Springer-Verlag, 1986. 417–426.Google Scholar
  3. [3]
    Orlando G, Paar C. A High Performance Elliptic Curve Processor for GF(2m).Workshop on Cryptographic Hardware and Embedded Systems, CHES 2000, LNCS 1965. Berlin: Springer-Verlag, 2000. 25–40.Google Scholar
  4. [4]
    Sutikno S, Effendi R, Surya A. Design and Implementation of Arithmetic Processor F2155 for Elliptic Curve Cryptosystems. 1998IEEE Asia-Pacific Conference on Circuits and Systems. New York: IEEE Computer Society, 1998. 647–650.Google Scholar
  5. [5]
    Agnew G, Mullin R, Vanstone S. An Implementation of Elliptic Curve Cryptosystems Over F2155.IEEE Journal on Selected areas in Communications, 1993,11(5), 804–813.CrossRefGoogle Scholar
  6. [6]
    Orlando G, Paar C. A Scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware.CHES 2001, LNCS 2162. Berlin: Springer-Verlag, 2001, 348–363.Google Scholar
  7. [7]
    örs S B, Batina L, Preneel B. Hardware Implementation of Elliptic Curve Processor over GF (p).IEEE International Conference on Application-Specific Systems, Architectures, and Processors (ASAP'03). New York: IEEE Computer Society, 2003. 433–443.Google Scholar
  8. [8]
    Menezes A J, van Oorschot P C, Vanstone S A.Handbook of Applied Cryptography. Boca Raton: CRC press, 1997.MATHGoogle Scholar
  9. [9]
    Blake I, Seroussi G, Smart N.Elliptic Curves in Cryptography. Cambridge: Cambridge University Press, 1999. 57–78.MATHGoogle Scholar
  10. [10]
    Orup H. Simplifying Quotient Determination in High-Radix Modular Multiplication.Proceedings 12 th Symposium on Computer Arithmetic. Washington D C: IEEE Press 1995. 193–199.CrossRefGoogle Scholar
  11. [11]
    Kornerup P. A Systolic, Linear-Array Multiplier for a Class of Right-Shift Algorithms.IEEE Transactions on Computers, 1994,43 (8): 892–898.MATHCrossRefGoogle Scholar

Copyright information

© Springer 2005

Authors and Affiliations

  • Liu Yu-zhen
    • 1
  • Qin Zhong-ping
    • 2
  • Zhang Huan-guo
    • 1
  1. 1.School of ComputerWuhan UniversityWuhanChina
  2. 2.School of SoftwareHuazhong University of Science and TechnologyWuhanChina

Personalised recommendations