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.
Type de document :
Communication dans un congrès
ASAP - 25th IEEE International Conference on Application-specific Systems, Architectures and Processors, Jun 2014, Zurich, Switzerland. IEEE, pp.57-62, 2014, 〈10.1109/ASAP.2014.6868631〉
Liste complète des métadonnées

Littérature citée [25 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01010961
Contributeur : Arnaud Tisserand <>
Soumis le : samedi 21 juin 2014 - 10:23:46
Dernière modification le : mercredi 2 août 2017 - 10:07:09
Document(s) archivé(s) le : dimanche 21 septembre 2014 - 10:36:50

Identifiants

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. IEEE, pp.57-62, 2014, 〈10.1109/ASAP.2014.6868631〉. 〈hal-01010961〉

Partager

Métriques

Consultations de la notice

375

Téléchargements de fichiers

511