Efficient and secure modular operations using the Adapted Modular Number System

The Adapted Modular Number System (AMNS) is a sytem of representation of integers to speed up arithmetic operations modulo a prime p. Such a system can be defined by a tuple (p, n, {\gamma}, {\rho}, E) where E is in Z[X]. In [13] conditions are given to build AMNS with E(X) = {X^n +1}. In this paper, we generalize their results and show how to generate multiple AMNS for a given prime p with E(X)={X^n-\lambda} and {\lambda} in Z. Moreover, we propose a complete set of algorithms without conditional branching to perform arithmetic and conversion operations in the AMNS, using a Montgomery-like method described in [15].

[1]  Laurent Imbert,et al.  a full RNS implementation of RSA , 2004, IEEE Transactions on Computers.

[2]  Marc Joye,et al.  Protections against Differential Analysis for Elliptic Curve Cryptography , 2001, CHES.

[3]  Julien Eynard,et al.  A Full RNS Variant of FV Like Somewhat Homomorphic Encryption Schemes , 2016, SAC.

[4]  Thomas Plantard,et al.  Arithmétique modulaire pour la cryptographie , 2005 .

[5]  Thomas Plantard,et al.  Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation , 2008, ACISP.

[6]  Nicolas Gama,et al.  Efficient Multiplication over Extension Fields , 2012, WAIFI.

[7]  Marco Baldi,et al.  QC-LDPC Code-Based Cryptography , 2014, Springer Briefs in Electrical and Computer Engineering.

[8]  Nadia El Mrabet,et al.  Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography , 2009, ACISP.

[9]  Harvey L. Garner,et al.  RESIDUE NUMBER SYSTEM ENHANCEMENTS FOR PROGRAMMABLE PROCESSORS , 2008 .

[10]  Milos D. Ercegovac,et al.  Combining leak-resistant arithmetic for elliptic curves defined over Fp and RNS representation , 2010, IACR Cryptol. ePrint Arch..

[11]  Leonel Sousa,et al.  RNS-Based Elliptic Curve Point Multiplication for Massive Parallel Architectures , 2012, Comput. J..

[12]  Laurent Imbert,et al.  Leak Resistant Arithmetic , 2004, CHES.

[13]  Anna M. Johnston,et al.  A generalized qth root algorithm , 1999, SODA '99.

[14]  Thomas Plantard,et al.  Modular Number Systems: Beyond the Mersenne Family , 2004, Selected Areas in Cryptography.

[15]  Thomas Plantard,et al.  Arithmetic operations in the polynomial modular number system , 2005, 17th IEEE Symposium on Computer Arithmetic (ARITH'05).