Publication Details

Bajard, J., Eynard, J., Merkiche, N. & Plantard, T. (2015). RNS arithmetic approach in lattice-based cryptography: accelerating the 'rounding-off' core procedure. In J. Muller, A. Tisserand & J. Villalba (Eds.), Proceedings of the IEEE 22nd Symposium on Computer Arithmetic (pp. 113-120). Piscataway, New Jersey, United States: IEEE.


Residue Number Systems (RNS) are naturally considered as an interesting candidate to provide efficient arithmetic for implementations of cryptosystems such as RSA, ECC (Elliptic 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.



Link to publisher version (DOI)