High Speed Computing Pipe lined Architecture of Elliptic Curve Scalar Multiplication over GF (2m)
This paper proposes an efficient pipelined architecture of elliptic curve scalar multiplication (ECSM) over GF (2m). The architecture uses a bit-parallel finite field (FF) multiplier accumulator (MAC) based on the Karatsuba–Ofman algorithm. The Montgomery ladder algorithm is modified for better sharing of execution paths. The data path in the architecture is well designed, so that the critical path contains few extra logic primitives apart from the FF MAC. In order to find the optimal number of pipeline stages, scheduling schemes with different pipeline stages are proposed and the ideal placement of pipeline registers is thoroughly analyzed. We implement ECSM over the five binary fields recommended by the National Institute of
Standard and Technology on Xilinx Virtex-4 and Virtex-5 field-programmable Gate arrays. The three-stage pipelined architecture is shown to have the best performance, which achieves a scalar multiplication over GF(2163) in 6.1 µs Using 7354 Slices on sparton-3. Using sparton-3, the scalar multiplication for m = 163, 233, 283, 409, and 571 can be achieved in 4.6, 7.9, 10.9, 19.4, and 36.5 µs, respectively, which are faster than previous results.
Index Terms: Elliptic curve cryptography (ECC), field-programmable gate array (FPGA), Karatsuba–Ofman multiplier (KOM), and pipelining, scalar multiplication.
How to Cite
International Journal of Engineering Science and Generic Research (IJESAR) by Articles is licensed under a Creative Commons Attribution 4.0 International License.