RNS Modular Multiplication through Reduced Base Extensions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

RNS Modular Multiplication through Reduced Base Extensions


The paper describes a new RNS (residue number system) modular multiplication algorithm, for finite field arithmetic over Fp, based on a reduced number of moduli in base extensions with only 3n/2 moduli instead of 2n for standard ones. Our algorithm reduces both the number of elementary modular multiplications EMMs and the number of stored precomputations for large asymmetric cryptographic applications such as elliptic curve cryptography or Diffie-Hellman (DH) cryptosystem. It leads to faster operations and smaller circuits.
Fichier principal
Vignette du fichier
article_asap2014.pdf (210.49 Ko) Télécharger le fichier
slides-asap.pdf (1.24 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Other

Dates and versions

hal-01010961 , version 1 (21-06-2014)



Karim Bigou, Arnaud Tisserand. RNS Modular Multiplication through Reduced Base Extensions. ASAP - 25th IEEE International Conference on Application-specific Systems, Architectures and Processors, Jun 2014, Zurich, Switzerland. pp.57-62, ⟨10.1109/ASAP.2014.6868631⟩. ⟨hal-01010961⟩
764 View
796 Download



Gmail Facebook X LinkedIn More