FPGA Implementation of a Fast Scalar Point Multiplier for an Elliptic Curve Crypto-Processor

Conference paper
Part of the Lecture Notes in Networks and Systems book series (LNNS, volume 38)

Abstract

This paper presents a fast scalar point multiplier for an elliptic curve crypto-processor in the field \( {\text{GF}}\left( {2^{163} } \right) \). Elliptic curve-based cryptographic algorithms have been in wide use since the early 2000s after being introduced in 1986. With the ever-increasing need for information security, it is essential for systems to perform the required operations in a fast and efficient manner. In this work, a hybrid type Karatsuba multiplier has been used for fast field multiplications and a dedicated inverter module based on the extended Euclidean algorithm is used for fast field inversions. The point multiplication is performed using the standard double-and-add algorithm for which the point doubling and point addition are done using standard projective coordinates. The use of the fast multipliers and field inverters makes the implementation a fast one as compared to other high-performance implementations that have been reported over the years, at the cost of increased resource usage. The results obtained, however, justify this increased resource usage as the point multiplication is the most time-intensive operation in the encryption and decryption process of elliptic curve cryptography.

Keywords

FPGA Karatsuba multiplier Extended Euclidean algorithm Elliptic curve cryptography (ECC) Scalar point multiplication 

References

  1. 1.
    Institute of Electrical and Electronics Engineers (2000) P1363 standard specifications for public key cryptography, NYGoogle Scholar
  2. 2.
    American National Standards Institute (1999) X 9.62 public key cryptography for the financial services industry: elliptic curve digital signature algorithm (ECDSA), WashingtonGoogle Scholar
  3. 3.
    National Institute of Standards and Technology (1994) FIPS 186-digital signature standard, GaithersburgGoogle Scholar
  4. 4.
    Dormale GM, Quisquater J-J (2007) High speed hardware implementations of elliptic curve cryptography, a survey. Elsevier J Syst Archit 53:72–84CrossRefGoogle Scholar
  5. 5.
    Khan ZUA, Benaissa M (2015) Throughput/area efficient ECC processor using montgomery point multiplication on FPGA. IEEE Trans Circuits Syst II Express Briefs 62(11):1078–1082CrossRefGoogle Scholar
  6. 6.
    Khan ZUA, Benaissa M (2016) High-speed and low-latency ECC processor implementation over GF(2m) on FPGA. IEEE Trans Very Large Scale Integr (VLSI) Syst 25(1):165–176Google Scholar
  7. 7.
    Liu Z, Liu D (2016) An efficient and flexible hardware implementation of the dual-field elliptic curve cryptographic processor. IEEE Trans Ind Electron 64(3):2353–2362CrossRefGoogle Scholar
  8. 8.
    Ansari B, Hasan MA (2008) High-performance architecture of elliptic curve scalar multiplication. IEEE Trans Comput 57(11):1443–1453MathSciNetCrossRefGoogle Scholar
  9. 9.
    Roy S, Rebeiro C, Mukhopadhyay D (2013) Theoretical modeling of elliptic curve scalar multiplier on LUT-based FPGAs for area and speed. IEEE Trans VLSI Syst 21(5):901–909CrossRefGoogle Scholar
  10. 10.
    Choi HM, Hong CP, Kim CH (2008) High performance elliptic curve cryptographic processor over GF(2163). In: 4th IEEE international symposium on electronic design, test and applicationsGoogle Scholar
  11. 11.
    Mahdizadeh H, Masoumi M (2013) Novel architecture for efficient FPGA implementation of elliptic curve cryptographic processor over GF(2163). IEEE Trans VLSI Syst 21(12):2330–2333CrossRefGoogle Scholar
  12. 12.
    Hankerson D, Menezes A, Vanstone S (2004) Guide to elliptic curve cryptography. SpringerGoogle Scholar
  13. 13.
    Anoop MS (2007) Elliptic curve cryptography: an implementation guideGoogle Scholar
  14. 14.
    Rebeiro C, Mukhopadhyay D (2007) Hybrid masked Karatsuba multiplier for 233(2) GF. In: 11th IEEE VLSI design and test symposium, KolkataGoogle Scholar
  15. 15.
    Kodali RK, Amanchi CN, Kumar S, Boppana L (2014) FPGA implementation of Itoh-Tsujii inversion algorithm. In: IEEE international conference on recent advances and innovations in engineering, JaipurGoogle Scholar
  16. 16.
    Chelton WN, Benaissa M (2008) Fast elliptic curve cryptography on FPGA. IEEE Trans VLSI Syst 16(2):198–205CrossRefGoogle Scholar
  17. 17.
    Azarderakhsh R, Reyhani-Masoleh A (2012) Efficient FPGA implementations of point multiplication on binary edwards and generalized Hessian curves using Gaussian normal basis. IEEE Trans VLSI Syst 20(8):1453–1467CrossRefGoogle Scholar
  18. 18.
    Fournaris AP, Zafeirakis J, Koufopavlou O (2014) Designing and evaluating high speed elliptic curve point multipliers. In: Euromicro conference on digital systems designGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  1. 1.Delhi Technological UniversityDelhiIndia
  2. 2.College of EngineeringPuneIndia

Personalised recommendations