Share Email Print

Proceedings Paper

Study of modular inversion in RNS
Author(s): Jean Claude Bajard; Nicolas Meloni; Thomas Plantard
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Residue Numbers System have some features which are fine for some implementations of cryptographic protocols. The main property of RNS is the distribution of the evaluation on large values on its small residues, allowing parallelization. This last property implies that we can randomize the distribution of the bases elements. Hence, the obtained arithmetic is leak resistant, it is robust against side channel attacks. But one drawback of RNS is that modular inversion is not obvious. Thus, RNS is well suited for RSA but not really for ECC. We analyze in this paper the features of the modular inversion in RNS over GF(P). We propose a RNS Extended Euclidean Algorithm which uses a quotient approximation module.

Paper Details

Date Published: 16 September 2005
PDF: 9 pages
Proc. SPIE 5910, Advanced Signal Processing Algorithms, Architectures, and Implementations XV, 59100T (16 September 2005); doi: 10.1117/12.617543
Show Author Affiliations
Jean Claude Bajard, LIRMM, CNRS (France)
Nicolas Meloni, LIRMM, CNRS (France)
Thomas Plantard, LIRMM, CNRS (France)

Published in SPIE Proceedings Vol. 5910:
Advanced Signal Processing Algorithms, Architectures, and Implementations XV
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top