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 :
Article dans une revue
International Journal of High Performance Systems Architecture (IJHPSA), InterScience, 2007, 1 (2), pp.133-142. 〈10.1504/IJHPSA.2007.015399〉
Liste complète des métadonnées

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

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00176433
Contributeur : Arnaud Tisserand <>
Soumis le : mercredi 3 octobre 2007 - 15:10:45
Dernière modification le : jeudi 24 mai 2018 - 15:59:21
Document(s) archivé(s) le : jeudi 27 septembre 2012 - 12:40:42

Identifiants

Collections

Citation

Andrew Byrne, Francis Crowe, William Marnane, Nicolas Meloni, Arnaud Tisserand, et al.. SPA Resistant Elliptic Curve Cryptosystem Using Addition Chains. International Journal of High Performance Systems Architecture (IJHPSA), InterScience, 2007, 1 (2), pp.133-142. 〈10.1504/IJHPSA.2007.015399〉. 〈lirmm-00176433〉

Partager

Métriques

Consultations de la notice

300

Téléchargements de fichiers

590