RNS Approach in Lattice-Based Cryptography

Bajard, Jean-Claude; Eynard, Julien

doi:10.1007/978-3-319-49742-6_13

Cited by 1 publication

(1 citation statement)

References 29 publications

(32 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, modular reduction in RNS was not easy to carry out before it was replaced with Montgomery reduction (M-red) in [1]. Following proposal of the RNS M-red, promising results have been obtained for the RSA algorithm [2][3][4][5][6], Elliptic Curve Cryptosystem [7][8][9][10][11][12][13][14], Pairing-based Cryptosystem [15,16], modular inversion [17], Lattice-based Cryptosystem [18], and an architectural study [19]. In parallel with these applications, improvements in the RNS M-red algorithm have been proposed [3,5,6,9,[13][14][15].…”

Section: Introductionmentioning

confidence: 99%

RNS Montgomery reduction algorithms using quadratic residuosity

et al. 2018

View full text Add to dashboard Cite

The residue number system (RNS) is a method for representing an integer as an n-tuple of its residues with respect to a given base. Since RNS has inherent parallelism, it is actively researched to implement a faster processing system for public-key cryptography. This paper proposes new RNS Montgomery reduction algorithms, Q-RNSs, the main part of which is twice a matrix multiplication. Letting n be the size of a base set, the number of unit modular multiplications in the proposed algorithms is evaluated as (2n 2 + n). This is achieved by posing a new restriction on the RNS base, namely, that its elements should have a certain quadratic residuosity. This makes it possible to remove some multiplication steps from conventional algorithms, and thus the new algorithms are simpler and have higher regularity compared with conventional ones. From our experiments, it is confirmed that there are sufficient candidates for RNS bases meeting the quadratic residuosity requirements.

show abstract