Fast elliptic curve cryptography on FPGA

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Volumn 16, Issue 2, 2008, Pages 198-205

  Chelton, William N ^a,b   Benaissa, Mohammed ^a,b  

^a IEEE

^b UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

Complex instruction set; Efficient hardware implementation; Elliptic curve cryptography (ECC); Field programmable gate array (FPGA); Pipelining

Indexed keywords

ALGORITHMS; CURVE FITTING; DATA ACQUISITION; FIELD PROGRAMMABLE GATE ARRAYS (FPGA);

COMPLEX INSTRUCTION SETS; ELLIPTIC CURVE CRYPTOGRAPHY (ECC);

CRYPTOGRAPHY;

EID: 38349195343     PISSN: 10638210     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVLSI.2007.912228     Document Type: Article

References (27)

1. J. Lutz and A. Hasan, "High performance FPGA based elliptic curve cryptographic co-processor," in Proc. Int. Conf. Inf. Technol.: Coding Comput. (ITCC), 2004, p. 486.
2. G. Orlando and C. Paar, "A high-performance reconfigurable elliptic curve processor for GF(2/sup m/)," presented at the Workshop Cryptographic Hardw. Embedded Syst. (CHES), Worcester, MA, 2000.
3. N. Koblitz, A. Menezes, and S. Vanstone, "The state of elliptic curve cryptography," Designs, Codes Cryptography, vol. 19, pp. 173-193, 2000.
4. N. Gura, S. C. Shantz, H. Eberle, S. Gupta, V. Gupta, D. Finchelstein, E. Goupy, and D. Stebila, "An end-to-end systems approach to elliptic curve cryptography," presented at the Workshop Cryptographic Hardw. Embedded Syst. (CHES), Redwood Shores, CA, 2002.
5. K. Jarvinen, M. Tommiska, and J. Skytta, "A scalable architecture for elliptic curve point multiplication," presented at the ICFPT, Brisbane, Australia, 2004.
6. Standard Specifications for Public Key Cryptography, IEEE 1363, 2000.
7. F. Rodriguez-Henriquez, N. A. Saqib, and A. Diaz-Perez, "A fast parallel implementation of elliptic curve point multiplication over GF(2m)," Microprocessors Microsyst., vol. 28, pp. 329-339, 2004.
8. NIST-National Institute of Standards and Technology, "Recommended elliptic curves for federal government use," 2000 [Online]. Available : http://csrc.nist.gov/encryption
9. T. Wollinger, J. Guajardo, and C. Paar, "Security on FPGAs: State-of-the-art implementations and attacks," IEEE Trans. Embedded Comput. Syst., vol. 3, no. 3, pp. 534-574, Aug. 2004.
10. R. C. C. Cheung, N. J. Telle, W. Luk, and P. Y. K. Cheung, "Customizable elliptic curve cryptosystems," IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 13, no. 9, pp. 1048-1059, Sep. 2005.
11. N. Mentens, S. B. Ors, and B. Preneel, "An FPGA implementation of an elliptic curve processor GF(2/sup m/)," presented at the 14th ACM Great Lakes Symp. VLSI, Boston, MA, 2004.
12. F. Rodriguez-Henriguez and C. K. Koc, "Parallel multipliers based on special irreducible pentanomials," IEEE Trans. Comput., vol. 52, no. 12, pp. 1535-1542, Dec. 2003.
13. W. Chelton and M. Benaissa, "High-speed pipelined ECC processor over GF(2m)," presented at the IEEE Workshop Signal Process. Syst. (SiPS), Banff, Canada, 2006.
14. J. Lopez and R. Dahab, "Fast multiplication on elliptic curves over GF(2/sup m/) without precomputation," presented at the Workshop on Cryptographic Hardware Embedded Syst. (CHES), Worcester, MA, 1999.
15. G. Seroussi and N. P. Smart, Elliptic Curves in Cryptography. Cambridge, U.K.: Cambridge Univ. Press, 1999.
16. P. L. Montgomery, "Speeding the Pollard and elliptic curve methods of factorization," 1987.
17. Z. Yan and D. V. Sarwate, "New systolic architectures for inversion and division in GF(2m)" IEEE Trans. Comput., vol. 52, no. 11, pp. 1514-1519, Nov. 2003.
18. C. H. Kim and C. P. Hong, "High-speed division architecture for GF(2m)," Electron. Lett., vol. 38, pp. 835-836, 2002.
19. T. Itoh and S. Tsujii, "A fast algorithm for computing multiplicative inverses in GF(2/sup m/) using normal bases," Inf. Computation, vol. 78, pp. 171-177, 1988.
20. P. A. Scott, S. E. Tavares, and L. E. Peppard, "A fast VLSI multiplier for GF(2/sup m/)," IEEE J. Sel. Areas Commun., vol. 4, no. 1, pp. 62-66, Jan. 1986.
21. E. Mastrovito, "VLSI architectures for computations in galois fields," Dept. Elect. Eng., Linkoping Univ., Linkoping, Sweden, 1991, p. 249, "," in.
22. H. Wu, "Bit-parallel finite field multiplier and squarer using polynomial basis," IEEE Trans. Comput., vol. 51, no. 7, pp. 750-758, Jul. 2002.
23. A. Reyhani-Masoleh and M. A. Hasan, "Low complexity bit parallel architectures for polynomial basis multiplication over GF(2/sup m/)," IEEE Trans. Comput., vol. 53, no. 8, pp. 945-959, Aug. 2004.
24. L. Song and K. K. Parhi, "Low-energy digit-serial/parallel finite field multipliers," J. VLSI Signal Process. Syst., vol. 19, pp. 149-166, 1998.
25. M. C. Mekhallalati, A. S. Ashur, and M. K. Ibrahim, "Novel radix finite field multiplier for GF(2/sup m/)" J. VLSI Signal Process., vol. 15, pp. 233-245, 1997.
26. P. K. Mishra, "Pipelined computation of scalar multiplication, in elliptic curve cryptosystems," presented at the CHES, Cambridge, MA, 2004.
27. J. A. Solinas, "Efficient arithmetic on koblitz curves," Designs, Codes Cryptography, vol. 19, pp. 195-249, 2000.