Advertisement

Pushing the Limits of High-Speed GF(2m) Elliptic Curve Scalar Multiplication on FPGAs

  • Chester Rebeiro
  • Sujoy Sinha Roy
  • Debdeep Mukhopadhyay
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7428)

Abstract

In this paper we present an FPGA implementation of a high-speed elliptic curve scalar multiplier for binary finite fields. High speeds are achieved by boosting the operating clock frequency while at the same time reducing the number of clock cycles required to do a scalar multiplication. To increase clock frequency, the design uses optimized implementations of the underlying field primitives and a mathematically analyzed pipeline design. To reduce clock cycles, a new scheduling scheme is presented that allows overlapped processing of scalar bits. The resulting scalar multiplier is the fastest reported implementation for generic curves over binary finite fields. Additionally, the optimized primitives leads to area requirements that is significantly lesser compared to other high-speed implementations. Detailed implementation results are furnished in order to support the claims.

Keywords

Elliptic curve scalar multiplication FPGA high-speed implementation Montgomery ladder 

References

  1. 1.
    Ansari, B., Hasan, M.: High-performance architecture of elliptic curve scalar multiplication. IEEE Transactions on Computers 57(11), 1443–1453 (2008)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Azarderakhsh, R., Reyhani-Masoleh, A.: Efficient FPGA Implementations of Point Multiplication on Binary Edwards and Generalized Hessian Curves Using Gaussian Normal Basis. IEEE Transactions on Very Large Scale Integration (VLSI) Systems PP(99), 1 (2011)Google Scholar
  3. 3.
    Bednara, M., Daldrup, M., von zur Gathen, J., Shokrollahi, J., Teich, J.: Reconfigurable Implementation of Elliptic Curve Crypto Algorithms. In: Proceedings of the International Parallel and Distributed Processing Symposium, IPDPS 2002, Abstracts and CD-ROM, pp. 157–164 (2002)Google Scholar
  4. 4.
    Rebeiro, C., Roy, S.S., Reddy, D.S., Mukhopadhyay, D.: Revisiting the Itoh Tsujii Inversion Algorithm for FPGA Platforms. IEEE Transactions on VLSI Systems 19(8), 1508–1512 (2011)CrossRefGoogle Scholar
  5. 5.
    Chelton, W.N., Benaissa, M.: Fast Elliptic Curve Cryptography on FPGA. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 16(2), 198–205 (2008)CrossRefGoogle Scholar
  6. 6.
    Gura, N., Shantz, S.C., Eberle, H., Gupta, S., Gupta, V., Finchelstein, D., Goupy, E., Stebila, D.: An End-to-End Systems Approach to Elliptic Curve Cryptography. In: Kaliski Jr., B.S., Koç, Ç.K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 349–365. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  7. 7.
    Itoh, T., Tsujii, S.: A Fast Algorithm For Computing Multiplicative Inverses in GF(2m) Using Normal Bases. Inf. Comput. 78(3), 171–177 (1988)MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Järvinen, K.U.: On Repeated Squarings in Binary Fields. In: Jacobson Jr., M.J., Rijmen, V., Safavi-Naini, R. (eds.) SAC 2009. LNCS, vol. 5867, pp. 331–349. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  9. 9.
    Järvinen, K., Skytta, J.: On parallelization of high-speed processors for elliptic curve cryptography. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 16(9), 1162–1175 (2008)CrossRefGoogle Scholar
  10. 10.
    Kim, C.H., Kwon, S., Hong, C.P.: FPGA Implementation of High Performance Elliptic Curve Cryptographic processor over GF(2163). Journal of Systems Architecture - Embedded Systems Design 54(10), 893–900 (2008)Google Scholar
  11. 11.
    López, J., Dahab, R.: Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation. In: Koç, Ç.K., Paar, C. (eds.) CHES 1999. LNCS, vol. 1717, pp. 316–327. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  12. 12.
    Lutz, J., Hasan, A.: High Performance FPGA based Elliptic Curve Cryptographic Co-Processor. In: ITCC 2004: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC 2004), vol. 2, p. 486. IEEE Computer Society, Washington, DC (2004)CrossRefGoogle Scholar
  13. 13.
    Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press (2001)Google Scholar
  14. 14.
    Montgomery, P.L.: Speeding the pollard and elliptic curve methods of factorization. Mathematics of Computation 48, 243–264 (1987)MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    Orlando, G., Paar, C.: A High-Performance Reconfigurable Elliptic Curve Processor for GF(2m). In: Paar, C., Koç, Ç.K. (eds.) CHES 2000. LNCS, vol. 1965, pp. 41–56. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  16. 16.
    Pu, Q., Huang, J.: A Microcoded Elliptic Curve Processor for GF(2m) Using FPGA Technology. In: 2006 International Conference on Communications, Circuits and Systems Proceedings, vol. 4, pp. 2771–2775 (June 2006)Google Scholar
  17. 17.
    Rebeiro, C., Mukhopadhyay, D.: High Speed Compact Elliptic Curve Cryptoprocessor for FPGA Platforms. In: Chowdhury, D.R., Rijmen, V., Das, A. (eds.) INDOCRYPT 2008. LNCS, vol. 5365, pp. 376–388. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  18. 18.
    Rebeiro, C., Mukhopadhyay, D.: Power Attack Resistant Efficient FPGA Architecture for Karatsuba Multiplier. In: VLSID 2008: Proceedings of the 21st International Conference on VLSI Design, pp. 706–711. IEEE Computer Society, Washington, DC (2008)CrossRefGoogle Scholar
  19. 19.
    Roy, S.S., Rebeiro, C., Mukhopadhyay, D.: Theoretical Modeling of the Itoh-Tsujii Inversion Algorithm for Enhanced Performance on k-LUT based FPGAs. In: Design, Automation, and Test in Europe, DATE 2011 (2011)Google Scholar
  20. 20.
    Saqib, N.A., Rodríiguez-Henríquez, F., Diaz-Perez, A.: A Parallel Architecture for Fast Computation of Elliptic Curve Scalar Multiplication Over GF(2m). In: Proceedings of the 18th International Parallel and Distributed Processing Symposium (April 2004)Google Scholar
  21. 21.
    I. C. Society. IEEE Standard Specifications for Public-key Cryptography (2000)Google Scholar
  22. 22.
    U.S. Department of Commerce, National Institute of Standards and Technology. Digital signature standard (DSS) (2000)Google Scholar
  23. 23.
    Wollinger, T., Guajardo, J., Paar, C.: Security on FPGAs: State-of-the-art Implementations and Attacks. Trans. on Embedded Computing Sys. 3(3), 534–574 (2004)CrossRefGoogle Scholar

Copyright information

© International Association for Cryptologic Research 2012

Authors and Affiliations

  • Chester Rebeiro
    • 1
  • Sujoy Sinha Roy
    • 1
  • Debdeep Mukhopadhyay
    • 1
  1. 1.Department of Computer Science and EngineeringIndian Institute of Technology KharagpurIndia

Personalised recommendations