Abstract:
The performance of Public Key Cryptosystems (PKC) based on elliptic curves is mostly dependent on the performance of the underlying field arithmetic. In this work, we pre...Show MoreMetadata
Abstract:
The performance of Public Key Cryptosystems (PKC) based on elliptic curves is mostly dependent on the performance of the underlying field arithmetic. In this work, we present high-speed and lightweight implementations of a fully scalable architecture of an Elliptic Curve Cryptography (ECC) scalar multiplier processor. The processor supports operations over GF(p) for arbitrary values of p, and field sizes up to 521 bits. The implementations perform modular multiplication operations using fully scalable Montgomery multiplier architectures, one tailored for high-speed and one for lightweight. Both designs support different bus widths to increase flexibility and allow for a wide range of applications. Our cores include countermeasures to side-channel attacks by using the Montgomery Ladder and Exponent Randomization methods to provide resistance to Simple Power Analysis (SPA) and Differential Power Analysis (DPA) respectively. We implemented the designs on FPGA platforms from different vendors and evaluated them based on NIST recommended field lengths - 192, 224, 256, 384, and 521 bits - using several arbitrary values of prime p.
Date of Conference: 04-06 December 2017
Date Added to IEEE Xplore: 05 February 2018
ISBN Information: