Comparison of Simple Power Analysis Attack Resistant Algorithms for an Elliptic Curve Cryptosystem - Archive ouverte HAL Access content directly
Journal Articles Journal of Computers (JCP) Year : 2007

Comparison of Simple Power Analysis Attack Resistant Algorithms for an Elliptic Curve Cryptosystem

(1) , (2) , (3) , (1) , (1)
1
2
3

Abstract

There has been a lot of interest in recent years in the problems faced by cryptosystems due to side channel attacks such as Simple Power Analysis (SPA) attacks. Algorithms for elliptic curve point scalar multiplication such as the double and add method are prone to these attacks. The protected double and add algorithm provides a simple solution to this problem but is costly in terms of performance. Another class of algorithm for point scalar multiplication that makes use of special addition chains can be used to protect against SPA attacks. A reconfigurable architecture for a cryptographic processor is presented and a number of algorithms for point multiplication are implemented and compared. These algorithms have a degree of parallelism within their operations where a number of multiplications can be executed in parallel. Sophisticated scheduling techniques can exploit this parallelism in order to optimize the performance of the calculation. Post place and route results for the processor are given.
Fichier principal
Vignette du fichier
jcp07.pdf (366.92 Ko) Télécharger le fichier
Loading...

Dates and versions

lirmm-00174648 , version 1 (11-01-2008)

Identifiers

  • HAL Id : lirmm-00174648 , version 1

Cite

Andrew Byrne, Nicolas Méloni, Arnaud Tisserand, Emanuel Popovici, William P. Marnane. Comparison of Simple Power Analysis Attack Resistant Algorithms for an Elliptic Curve Cryptosystem. Journal of Computers (JCP), 2007, 2 (10), pp.52-62. ⟨lirmm-00174648⟩
177 View
259 Download

Share

Gmail Facebook Twitter LinkedIn More