Cryptographic Hardware and Embedded Systems - CHES 2013

Volume 8086 of the series Lecture Notes in Computer Science pp 233-249

Improving Modular Inversion in RNS Using the Plus-Minus Method

  • Karim BigouAffiliated withINRIA Centre Rennes - Bretagne AtlantiqueIRISA
  • , Arnaud TisserandAffiliated withCNRS, University Rennes 1IRISA

* Final gross prices may vary according to local VAT.

Get Access


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 significantly 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.


Residue Number System Modular Representation Extended Euclidean Algorithm Hardware Implementation ECC RSA