Sommaire

Description

  • Orateur

    Fangan Yssouf Dosso - Laboratoire SAS, École des Mines de Saint-Étienne

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

  • Date

    31 janvier 2025 (13:45 - 14:45)
  • Emplacement

    IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes Amphi Lebesgue
    Localiser sur Google Maps
  • Ajouter l'exposé à mon agenda

  • Video meet

    The seminar is systematically visible by videoconference

    Accèder à la visio-conférence

Prochains exposés

  • Séminaire C2

    • 17 janvier 2025 (11:30 - 17:00)

    • Nancy

    11h30  Katharina Boudgoust (CR CNRS, LIRMM) : The Power of NAPs: Compressing OR-Proofs via Collision-Resistant HashingProofs of partial knowledge allow for proving the validity of t out of n different statements without revealing which ones those are. In this presentation, we describe a new approach for transforming certain proofs system into new ones that allows for proving partial knowledge. The[…]
  • Updatable Encryption from Group Actions

    • 24 janvier 2025 (13:45 - 14:45)

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Orateur : Maxime Romeas - ANSSI

    Updatable Encryption is a variant of symmetric encryption that allows to rotate the encryption key in the outsourced storage setting while minimizing the bandwith used. Indeed, any third party can update ciphertexts to the new key using a token provided by the key holder. UE schemes aim at providing strong confidentiality guarantees against adversaries that can corrupt keys and tokens.  In this[…]
  • Journées C2

    • 04 avril 2025 (00:00 - 18:00)

    • Pornichet

Voir les exposés passés