SPA Resistant Elliptic Curve Cryptosystem using Addition Chains - Archive ouverte HAL Access content directly
Conference Papers Year : 2007

SPA Resistant Elliptic Curve Cryptosystem using Addition Chains

(1) , (2) , (1) , (1) , (3) , (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. Algorithms for elliptic curve point scalar multiplication such as the double and add method are prone to such attacks. By making use of special addition chains, it is possible to implement a Simple Power Analysis (SPA) resistant cryptosystem. In this paper a reconfigurable architecture for a cryptographic processor is presented. A SPA resistant algorithm for point multiplication is implemented and is shown to be faster than the double-and-add method. Post place and route results for the processor are given.
Fichier principal
Vignette du fichier
itng07.pdf (145.24 Ko) Télécharger le fichier
Loading...

Dates and versions

lirmm-00153368 , version 1 (10-06-2007)

Identifiers

Cite

Andrew Byrne, Nicolas Méloni, Francis Crowe, William P. Marnane, Arnaud Tisserand, et al.. SPA Resistant Elliptic Curve Cryptosystem using Addition Chains. ITNG'07: 4th International Conference on Information Technology, Apr 2007, Las Vegas, Nevada, U.S.A., pp.995-1000, ⟨10.1109/ITNG.2007.185⟩. ⟨lirmm-00153368⟩
130 View
389 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More