The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (2007 vol.56)
pp: 1269-1282
ABSTRACT
This paper presents a reconfigurable curve-based cryptoprocessor that accelerates scalar multiplication of Elliptic Curve Cryptography (ECC) and HyperElliptic Curve Cryptography (HECC) of genus 2 over GF(2<sup>n</sup>). By allocating &#x03B1; copies of processing cores that embed reconfigurable Modular Arithmetic Logic Units (MALUs) over GF(2^n), the scalar multiplication of ECC/HECC can be accelerated by exploiting Instruction-Level Parallelism (ILP). The supported field size can be arbitrary up to &#x03B1;(n + 1) - 1. The superscaling feature is facilitated by defining a single instruction that can be used for all field operations and point/divisor operations. In addition, the cryptoprocessor is fully programmable and it can handle various curve parameters and arbitrary irreducible polynomials. The cost, performance, and security trade-offs are thoroughly discussed for different hardware configurations and software programs. The synthesis results with a 0:13-&#x03BC;m CMOS technology show that the proposed reconfigurable cryptoprocessor runs at 292 MHz, whereas the field sizes can be supported up to 587 bits. The compact and fastest configuration of our design is also synthesized with a fixed field size and irreducible polynomial. The results show that the scalar multiplication of ECC over GF(2<sup>163</sup>) and HECC over GF(2<sup>83</sup>) can be performed in 29 and 63 &#x03BC;s, respectively.
INDEX TERMS
Multiprocessor systems, processor architectures, reconfigurable hardware, arithmetic and logic units, public key cryptosystems.
CITATION
Kazuo Sakiyama, Lejla Batina, Bart Preneel, Ingrid Verbauwhede, "Multicore Curve-Based Cryptoprocessor with Reconfigurable Modular Arithmetic Logic Units over GF(2^n)", IEEE Transactions on Computers, vol.56, no. 9, pp. 1269-1282, September 2007, doi:10.1109/TC.2007.1071
27 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool