Hardware/Software Co-Design Implementations of Elliptic Curve Cryptosystems

This paper presents a survey of hardware/software co-design implementations of elliptic curve cryptosystems. A critical study of the underlying finite field, the representation basis, and the partitioning schemes of these implementations is conducted. The study shows that all implementations are implemented over binary fields GF(2) and the implementations that use polynomial basis are more than implementations that use normal basis for finite field arithmetic. The study also shows that the best partitioning scheme, among the surveyed implementations,

[1]  Tibor Juhas.  The use of elliptic curves in cryptography , 2007 .

[2]  Ricardo Dahaby.  Improved Algorithms for Elliptic Curve Arithmetic in Gf(2 N ) Improved Algorithms for Elliptic Curve Arithmetic in Gf (2 N ) , 1998 .

[3]  Rolf Ernst,et al.  Codesign of Embedded Systems: Status and Trends , 1998, IEEE Des. Test Comput..

[4]  Wayne Luk,et al.  Reconfigurable elliptic curve cryptosystems on a chip , 2005, Design, Automation and Test in Europe.

[5]  N. Koblitz.  Elliptic curve cryptosystems , 1987 .

[6]  Glenn Ramsey.  Hardware/software optimizations for elliptic curve scalar multiplication on hybrid FPGAs , 2008 .

[7]  Atsuko Miyaji,et al.  Efficient Elliptic Curve Exponentiation Using Mixed Coordinates , 1998, ASIACRYPT.

[8]  Wayne H. Wolf.  A Decade of Hardware/Software Codesign , 2003, Computer.

[9]  Yukio Tsuruoka,et al.  Speeding up Elliptic Cryptosystems by Using a Signed Binary Window Method , 1992, CRYPTO.

[10]  Frank Vahid,et al.  The Softening of Hardware , 2003, Computer.

[11]  Wolfgang Bauer.  Implementing elliptic curve cryptography , 2002, Communications and Multimedia Security.

[12]  Patrick Schaumont,et al.  Domain-Specific Codesign for Embedded Security , 2003, Computer.

[13]  Douglas L. Maskell,et al.  Software-Oriented Approach to Hardware-Software Co-Simulation for FPGA-Based Risc Extensible Processor , 2006, 2006 International Conference on Field Programmable Logic and Applications.

[14]  Ricardo Dahab,et al.  Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation , 1999, CHES.

[15]  H. Niederreiter,et al.  Introduction to finite fields and their applications: Factorization of Polynomials , 1994 .

[16]  Manuel Koschuch,et al.  Hardware/Software Co-design of Elliptic Curve Cryptography on an 8051 Microcontroller , 2006, CHES.

[17]  Ingrid Verbauwhede,et al.  Reconfigurable Architectures for Curve-Based Cryptography on Embedded Micro-Controllers , 2006, 2006 International Conference on Field Programmable Logic and Applications.

[18]  Sorin A. Huss,et al.  A Reconfigurable System on Chip Implementation for Elliptic Curve Cryptography over GF(2n) , 2002, CHES.

[19]  T. Elgamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.

[20]  Atsuko Miyaji,et al.  Efficient elliptic curve exponentiation , 1997, ICICS.

[21]  Rajesh Gupta,et al.  Hardware/software co-design , 1996, Proc. IEEE.

[22]  Joos Vandewalle,et al.  Hardware/software co-design of an elliptic curve public-key cryptosystem , 2001, 2001 IEEE Workshop on Signal Processing Systems. SiPS 2001. Design and Implementation (Cat. No.01TH8578).

[23]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[24]  Tanja Lange,et al.  Handbook of Elliptic and Hyperelliptic Curve Cryptography , 2005 .

[25]  Ricardo Dahab,et al.  Improved Algorithms for Elliptic Curve Arithmetic in GF(2n) , 1998, Selected Areas in Cryptography.

[26]  R. McEliece.  Finite Fields for Computer Scientists and Engineers , 1986 .