Skip to Main content Skip to Navigation
Conference papers

Improving Modular Inversion in RNS using the Plus-Minus Method

Karim Bigou 1 Arnaud Tisserand 1, *
* Corresponding author
1 CAIRN - Energy Efficient Computing ArchItectures with Embedded Reconfigurable Resources
Inria Rennes – Bretagne Atlantique , IRISA-D3 - ARCHITECTURE
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.
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/hal-00825745
Contributor : Arnaud Tisserand <>
Submitted on : Friday, May 24, 2013 - 2:36:36 PM
Last modification on : Friday, March 6, 2020 - 1:24:47 AM
Document(s) archivé(s) le : Tuesday, April 4, 2017 - 11:08:13 AM

File

article.pdf
Files produced by the author(s)

Identifiers

Citation

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⟩

Share

Metrics

Record views

789

Files downloads

594