A scalable and high performance elliptic curve processor with resistance to timing attacks

Abstract

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

A Run Time Reconfigurable Co-processor for Elliptic Curve Scalar Multiplication

“…Some works [1], [4], [7], [3], [14], [10], [6] have reported parameterizable arithmetic units for scalar multiplication but those architectures need to be reconfigured out of line. It would be desired a real time adaptation of the co-processor to different security levels.…”

An efficient high performance scalar multiplication method with resistance against timing attacks

“…[22], [23] and [24], we assume GF(2 m ) field with normal basis representation [27]. Further, the Lopez-Dahab projective coordinate system [33] with 14 and 5 field multiplications needed to compute point addition and point doubling respectively is used.…”

“…al. in [23] proposed a new scalar multiplication algorithm that inspects three bits at a time to resist against Timing Attacks. The proposed work in [23] defined a new dataflow for point addition and point doubling.…”

“…in [23] proposed a new scalar multiplication algorithm that inspects three bits at a time to resist against Timing Attacks. The proposed work in [23] defined a new dataflow for point addition and point doubling. However, the proposed work in [23] uses two parallel field multipliers and a single field squarer.…”

“…The proposed work in [23] defined a new dataflow for point addition and point doubling. However, the proposed work in [23] uses two parallel field multipliers and a single field squarer. Recently, Al-Somani and Ibrahim in [24], presented an elliptic curve cryptoprocessor with resistance against Timing Attacks.…”