SPA Resistant Elliptic Curve Cryptosystem using Addition Chains - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier
Conference Papers Year : 2007

SPA Resistant Elliptic Curve Cryptosystem using Addition Chains

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.

Domains

Cryptography and Security [cs.CR] Computer Arithmetic
Fichier principal
Vignette du fichier
itng07.pdf (145.24 Ko) Télécharger le fichier

Arnaud TISSERAND  : Connect in order to contact the contributor

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00153368

Submitted on : Sunday, June 10, 2007-2:54:04 PM

Last modification on : Friday, March 24, 2023-2:52:48 PM

Long-term archiving on : Thursday, April 8, 2010-7:29:36 PM

Download

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS LIRMM MIPS UNIV-MONTPELLIER AXESECULIRMM
173 View
565 Download

Altmetric

Share

More