Improving Modular Inversion in RNS using the Plus-Minus Method - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Improving Modular Inversion in RNS using the Plus-Minus Method

(1) , (1)
1

Abstract

The paper describes a new RNS modular inversion algorithm based on the extended Euclidean algorithm and the plus-minus trick. In our algorithm, comparisons over large RNS values are replaced by cheap computations modulo 4. Comparisons to an RNS version based on Fermat's little theorem were carried out. The number of elementary modular operations is signi cantly reduced: a factor 12 to 26 for multiplications and 6 to 21 for additions. Virtex 5 FPGAs implementations show that for a similar area, our plus-minus RNS modular inversion is 6 to 10 times faster.
Fichier principal
Vignette du fichier
article.pdf (527.64 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00825745 , version 1 (24-05-2013)

Identifiers

Cite

Karim Bigou, Arnaud Tisserand. Improving Modular Inversion in RNS using the Plus-Minus Method. CHES - 15th Workshop on Cryptographic Hardware and Embedded Systems - 2013, Aug 2013, Santa Barbara, United States. pp.233-249, ⟨10.1007/978-3-642-40349-1_14⟩. ⟨hal-00825745⟩
401 View
446 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More