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.
Type de document :
Communication dans un congrès
ITNG'07: 4th International Conference on Information Technology, Apr 2007, Las Vegas, Nevada, U.S.A., IEEE, pp.995-1000, 2007, 〈10.1109/ITNG.2007.185〉
Liste complète des métadonnées

Littérature citée [12 références]  Voir  Masquer  Télécharger

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00153368
Contributeur : Arnaud Tisserand <>
Soumis le : dimanche 10 juin 2007 - 14:54:04
Dernière modification le : jeudi 24 mai 2018 - 15:59:21
Document(s) archivé(s) le : jeudi 8 avril 2010 - 19:29:36

Fichier

Identifiants

Collections

Citation

Andrew Byrne, Nicolas Meloni, Francis Crowe, William 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., IEEE, pp.995-1000, 2007, 〈10.1109/ITNG.2007.185〉. 〈lirmm-00153368〉

Partager

Métriques

Consultations de la notice

217

Téléchargements de fichiers

181