Paper
16 September 2005 Study of modular inversion in RNS
Jean Claude Bajard, Nicolas Meloni, Thomas Plantard
Author Affiliations +
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.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jean Claude Bajard, Nicolas Meloni, and Thomas Plantard "Study of modular inversion in RNS", Proc. SPIE 5910, Advanced Signal Processing Algorithms, Architectures, and Implementations XV, 59100T (16 September 2005); https://doi.org/10.1117/12.617543
Lens.org Logo
CITATIONS
Cited by 5 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Radon

Cryptography

Evolutionary algorithms

Signal processing

RELATED CONTENT

Fast regular 2D algorithms for trigonometric transforms
Proceedings of SPIE (January 10 1997)
Circulant preconditioners from B-splines
Proceedings of SPIE (October 24 1997)
Some improvements on RNS Montgomery modular multiplication
Proceedings of SPIE (November 13 2000)
Associative synthesis of geometrical scenes
Proceedings of SPIE (December 16 1992)

Back to Top