A Scalable and High Performance Elliptic Curve Processor with Resistance to Timing Attacks

This paper presents a high performance and scalable elliptic curve processor which is designed to be resistant against timing attacks. The point multiplication algorithm (double-add-subtract) is modified so that the processor performs the same operations for every 3 bits of the scalar k independent of the bit pattern of the 3 bits. Therefore, it is not possible to extract the key pattern using a timing attack. The data flow graph of the modified algorithm is derived and the underlying Galois Field operators are scheduled so that the point multiplication delay is minimized. The architecture of this processor is based on the Galois Field of GF(2n ) and the bit-serial field multiplier and squarer are designed. The processor is configurable for any value of n and the delay of point multiplication is [18(n+3) + (n+3)/2 + 1]×(n/3) clock cycles. For the case of GF(2163 ) the point multiplication delay is 165888 clock cycles. Keywords Elliptic Curve Cryptography, side-channel attacks, Galois...

• Type: Conference
• Year: 2005
• Where: ITCC
• Authors: Alireza Hodjat, David Hwang, Ingrid Verbauwhede
• Keywords: Galois Fields, Information Technology, ITCC 2005, Point Multiplication, Point Multiplication Delay