Binary-Ternary Plus-Minus Modular Inversion in RNS

Karim Bigou 1 Arnaud Tisserand 1
1 CAIRN - Energy Efficient Computing ArchItectures with Embedded Reconfigurable Resources
Inria Rennes – Bretagne Atlantique , IRISA-D3 - ARCHITECTURE
Abstract : A fast RNS modular inversion for finite fields arithmetic has been published at CHES 2013 conference. It is based on the binary version of the plus-minus Euclidean algorithm. In the context of elliptic curve cryptography (i.e. 160–550 bits finite fields), it significantly speeds-up modular inversions. In this paper, we propose an improved version based on both radix 2 and radix 3. This new algorithm leads to 30 % speed-up for a maximal area overhead about 4 % on Virtex 5 FPGAs.
Type de document :
Article dans une revue
IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2016, 65 (11), pp.3495-3501. <10.1109/TC.2016.2529625>
Liste complète des métadonnées


https://hal.inria.fr/hal-01314268
Contributeur : Arnaud Tisserand <>
Soumis le : mercredi 11 mai 2016 - 09:53:19
Dernière modification le : vendredi 17 février 2017 - 16:11:35
Document(s) archivé(s) le : mercredi 16 novembre 2016 - 00:35:09

Fichier

article_tc.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Karim Bigou, Arnaud Tisserand. Binary-Ternary Plus-Minus Modular Inversion in RNS. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2016, 65 (11), pp.3495-3501. <10.1109/TC.2016.2529625>. <hal-01314268>

Partager

Métriques

Consultations de
la notice

247

Téléchargements du document

119