RNS Modular Multiplication through Reduced Base Extensions

Karim Bigou 1 Arnaud Tisserand 1
1 CAIRN - Energy Efficient Computing ArchItectures with Embedded Reconfigurable Resources
Inria Rennes – Bretagne Atlantique , IRISA-D3 - ARCHITECTURE
Abstract : 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.
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.inria.fr/hal-01010961
Contributor : Arnaud Tisserand <>
Submitted on : Saturday, June 21, 2014 - 10:23:46 AM
Last modification on : Thursday, October 10, 2019 - 10:49:15 AM
Long-term archiving on : Sunday, September 21, 2014 - 10:36:50 AM

Identifiers

Citation

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⟩

Share

Metrics

Record views

957

Files downloads

781