A high performance pseudo-multi-core ECC processor over GF(2163)
Authors:
- 1 May 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 701-704
Abstract
In this paper, we propose a high performance processor for elliptic curve cryptography (ECC) over GF(2 163 ) by using polynomial presentation. It has three finite field (FF) RISC cores and a main controller to achieve instruction-level parallelism (ILP) with pipeline so that the largely parallelized algorithm for elliptic curve point multiplication can be well suited on this platform. Instructions for combined FF operation are proposed to decrease clock cycles in the instruction set. The interconnection among three FF cores and the main controller is obtained by analyzing the data dependency in the parallelized algorithm. The whole design is implemented on Xilinx XC4VLX80 FPGA device, and it can reach 185 MHz with 20,807 slices. The total time required for one ECC point scalar operation is 7.7μs in 1428 cycles.Keywords
This publication has 8 references indexed in Scilit:
- FPGA implementation of high performance elliptic curve cryptographic processor overJournal of Systems Architecture, 2008
- High-Performance Architecture of Elliptic Curve Scalar MultiplicationIEEE Transactions on Computers, 2008
- High-performance Public-key Cryptoprocessor for Wireless Mobile ApplicationsMobile Networks and Applications, 2007
- Use of Elliptic Curves in Cryptography2000
- 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
- Speeding the Pollard and elliptic curve methods of factorizationMathematics of Computation, 1987
- Elliptic curve cryptosystemsMathematics of Computation, 1987