RNS modular multiplication through reduced base extensions

Author

Bigou, Karim ; Tisserand, Arnaud

Author_Institution

INRIA Centre Rennes - Bretagne Atlantique, Lannion, France

fYear

2014

fDate

18-20 June 2014

Firstpage

57

Lastpage

62

Abstract

The paper describes a new RNS (residue number system) modular multiplication algorithm, for finite field arithmetic over F_P, 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.

Keywords

cryptography; residue number systems; DH cryptosystem; Diffie-Hellman cryptosystem; EMM; RNS modular multiplication algorithm; asymmetric cryptographic applications; base extensions; elementary modular multiplications; elliptic curve cryptography; finite field arithmetic; reduced base extensions; residue number system; Application specific integrated circuits; Barium; Elliptic curve cryptography; Graphics processing units; Memory; Standards;

fLanguage

English

Publisher

ieee

Conference_Titel

Application-specific Systems, Architectures and Processors (ASAP), 2014 IEEE 25th International Conference on

Conference_Location

Zurich

Type

conf

DOI

10.1109/ASAP.2014.6868631

Filename

6868631