Combining Montgomery Ladder for Elliptic Curves Defined over $\F_p$ and RNS Representation

Abstract : In this paper, we combine the RNS representation and the Montgomery ladder on elliptic curves in Weierstrass form. These two techniques are relevant for implementation of elliptic curve cryptogra- phy on embedded devices since they have leak-resistance properties. We optimize formulae for addition and doubling of the Montgomery lad- der in terms of modular reductions to obtain a competitive and secure implementation. Afterwards, we explain the advantages of the RNS rep- resentation, especially in hardware and for embedded devices, and show that, contrary to other approaches, ours takes optimal advantage of a dedicated parallel architecture.
Type de document :
Rapport
[Research Report] 06041, LIR. 2006
Liste complète des métadonnées

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

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00102859
Contributeur : Christine Carvalho de Matos <>
Soumis le : lundi 2 octobre 2006 - 17:06:07
Dernière modification le : mardi 19 juin 2018 - 15:50:01
Document(s) archivé(s) le : mardi 6 avril 2010 - 01:20:21

Fichier

Identifiants

  • HAL Id : lirmm-00102859, version 1

Citation

Jean-Claude Bajard, Sylvain Duquesne, Nicolas Méloni. Combining Montgomery Ladder for Elliptic Curves Defined over $\F_p$ and RNS Representation. [Research Report] 06041, LIR. 2006. 〈lirmm-00102859〉

Partager

Métriques

Consultations de la notice

258

Téléchargements de fichiers

983