Description
The Polynomial Modular Number System (PMNS) is an integer number system that aims to speed up arithmetic operations modulo a prime number p. This system is defined by a tuple (p, n, g, r, E), where p, n, g and r are positive integers, and E is a polynomial with integer coefficients, having g as a root modulo p.
Arithmetic operations in PMNS rely heavily on Euclidean lattices. Modular reduction in this system is done using a lattice of zeros L (here, the set of polynomials in Z[X], with degrees smaller than n, having g as a root modulo p).
Many works have shown that the PMNS can be an efficient alternative to the classical representation for modular arithmetic and cryptographic size integers.
In this presentation, we first present the PMNS and its arithmetic. Next, we introduce new properties of the lattice L, regarding a Montgomery-like coefficient reduction method. Then, we study the redundancy in the PMNS and explain how to choose the parameters for the desired redundancy in the system. Finally, we show how to use some properties of Euclidean lattices for efficient modular arithmetic and equality test within the PMNS.
Reference: F. Y. Dosso, A. Berzati, N. El Mrabet, and J. Proy. PMNS revisited for consistent redundancy and equality test. Cryptology ePrint Archive, Paper 2023/1231, (\url{https://eprint.iacr.org/2023/1231})
Infos pratiques
Prochains exposés
-
Dual attacks in code-based (and lattice-based) cryptography
Orateur : Charles Meyer-Hilfiger - Inria Rennes
The hardness of the decoding problem and its generalization, the learning with errors problem, are respectively at the heart of the security of the Post-Quantum code-based scheme HQC and the lattice-based scheme Kyber. Both schemes are to be/now NIST standards. These problems have been actively studied for decades, and the complexity of the state-of-the-art algorithms to solve them is crucially[…]-
Cryptography
-
-
Présentations des nouveaux doctorants Capsule
Orateur : Alisée Lafontaine et Mathias Boucher - INRIA Rennes
2 nouveaux doctorants arrivent dans l'équipe Capsule et présenteront leurs thématiques de recherche. Alisée Lafontaine, encadrée par André Schrottenloher, présentera son stage de M2: "Quantum rebound attacks on double-block length hash functions" Mathias Boucher, encadré par Yixin Shen, parlera des algorithmes quantiques et des réseaux euclidiens. -
Design of fast AES-based Universal Hash Functions and MACs
Orateur : Augustin Bariant - ANSSI
Ultra-fast AES round-based software cryptographic authentication/encryption primitives have recently seen important developments, fuelled by the authenticated encryption competition CAESAR and the prospect of future high-profile applications such as post-5G telecommunication technology security standards. In particular, Universal Hash Functions (UHF) are crucial primitives used as core components[…]-
Cryptography
-
-
Lie algebras and the security of cryptosystems based on classical varieties in disguise
Orateur : Mingjie Chen - KU Leuven
In 2006, de Graaf et al. proposed a strategy based on Lie algebras for finding a linear transformation in the projective linear group that connects two linearly equivalent projective varieties defined over the rational numbers. Their method succeeds for several families of “classical” varieties, such as Veronese varieties, which are known to have large automorphism groups. In this talk, we[…]-
Cryptography
-
-
Some applications of linear programming to Dilithium
Orateur : Paco AZEVEDO OLIVEIRA - Thales & UVSQ
Dilithium is a signature algorithm, considered post-quantum, and recently standardized under the name ML-DSA by NIST. Due to its security and performance, it is recommended in most use cases. During this presentation, I will outline the main ideas behind two studies, conducted in collaboration with Andersson Calle-Vierra, Benoît Cogliati, and Louis Goubin, which provide a better understanding of[…]