On Parallelization of High-Speed Processors for Elliptic Curve Cryptography
Authors:
- 15 August 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 16 (9) , 1162-1175
Abstract
This paper discusses parallelization of elliptic curve cryptography hardware accelerators using elliptic curves over binary fields F2m. Elliptic curve point multiplication, which is the operation used in every elliptic curve cryptosystem, is hierarchical in nature, and parallelism can be utilized in different hierarchy levels as shown in many publications. However, a comprehensive analysis on the effects of parallelization has not been previously presented. This paper provides tools for evaluating the use of parallelism and shows where it should be used in order to maximize efficiency. Special attention is given for a family of curves called Koblitz curves because they offer very efficient point multiplication. A new method where the latency of point multiplication is reduced with parallel field arithmetic processors is introduced. It is shown to outperform the previously presented multiple field multiplier techniques in the cases of Koblitz curves and generic curves with fixed base points. A highly efficient general elliptic curve cryptography processor architecture is presented and analyzed. Based on this architecture and analysis on the effects of parallelization, a few designs are implemented on an Altera Stratix II field-programmable gate array (FPGA).Keywords
This publication has 34 references indexed in Scilit:
- Design of flexible GF(2/sup m/) elliptic curve cryptography processorsIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2006
- Customizable elliptic curve cryptosystemsIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2005
- Fast Elliptic Curve Multiplications with SIMD Operations2002
- A new addition formula for elliptic curves over GF(2/sup n/)IEEE Transactions on Computers, 2002
- A fast addition algorithm for elliptic curve arithmetic in using projective coordinatesInformation Processing Letters, 2000
- Efficient Arithmetic on Koblitz CurvesDesigns, Codes and Cryptography, 2000
- Software Implementation of Elliptic Curve Cryptography over Binary Fields2000
- Fast Multiplication on Elliptic Curves Over GF(2m) without precomputation1999
- A fast algorithm for computing multiplicative inverses in GF(2m) using normal basesInformation and Computation, 1988
- VLSI Architectures for Computing Multiplications and Inverses in GF(2m)IEEE Transactions on Computers, 1985