RNS Arithmetic Approach in Lattice-based Cryptography Accelerating the " Rounding-off " Core Procedure

Abstract : —Residue Number Systems (RNS) are naturally considered as an interesting candidate to provide efficient arithmetic for implementations of cryptosystems such as RSA, ECC (El-liptic Curve Cryptography), pairings, etc. More recently, RNS have been used to accelerate fully homomorphic encryption as lattice-based cryptogaphy. In this paper, we present an RNS algorithm resolving the Closest Vector Problem (CVP). This algorithm is particularly efficient for a certain class of lattice basis. It provides a full RNS Babai round-off procedure without any costly conversion into alternative positional number system such as Mixed Radix System (MRS). An optimized Cox-Rower architecture adapted to the proposed algorithm is also presented. The main modifications reside in the Rower unit whose feature is to use only one multiplier. This allows to free two out of three multipliers from the Rower unit by reusing the same one with an overhead of 3 more cycles per inner reduction. An analysis of feasibility of implementation within FPGA is also given.
Document type :
Conference papers
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.sorbonne-universite.fr/hal-01170577
Contributor : Jean Claude Bajard <>
Submitted on : Wednesday, July 1, 2015 - 5:42:30 PM
Last modification on : Thursday, March 21, 2019 - 12:59:37 PM
Long-term archiving on : Tuesday, April 25, 2017 - 9:13:54 PM

File

article10avril2015.pdf
Files produced by the author(s)

Identifiers

Citation

Jean-Claude Bajard, Julien Eynard, Nabil Merkiche, Thomas Plantard. RNS Arithmetic Approach in Lattice-based Cryptography Accelerating the " Rounding-off " Core Procedure. 2015 IEEE 22nd Symposium on Computer Arithmetic, Jun 2015, Lyon, France. pp.113-120, ⟨10.1109/ARITH.2015.30⟩. ⟨hal-01170577⟩

Share

Metrics

Record views

502

Files downloads

436