International Association for Cryptologic Research

International Association
for Cryptologic Research

IACR News item: 04 March 2015

Karim Bigou, Arnaud Tisserand
ePrint Report ePrint Report
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.

Expand

Additional news items may be found on the IACR news page.