Binary-Ternary Plus-Minus Modular Inversion in RNS - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles IEEE Transactions on Computers Year : 2016

Binary-Ternary Plus-Minus Modular Inversion in RNS

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.
Fichier principal
Vignette du fichier
article_tc.pdf (547.53 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01314268 , version 1 (11-05-2016)

Identifiers

Cite

Karim Bigou, Arnaud Tisserand. Binary-Ternary Plus-Minus Modular Inversion in RNS. IEEE Transactions on Computers, 2016, 65 (11), pp.3495-3501. ⟨10.1109/TC.2016.2529625⟩. ⟨hal-01314268⟩
279 View
287 Download

Altmetric

Share

Gmail Facebook X LinkedIn More