Filtrer par type de contenu

Sélectionnez un ou plusieurs filtres. Ce choix permettra de recharger la page pour afficher les résultats filtrés.

Supprimer tous les filtres

749 résultats

    • Séminaire

    • Cryptographie

    PMNS for efficient arithmetic and small memory cost

    • 10 juin 2022

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

    Orateur : Fangan Yssouf Dosso - Ecole des Mines de Saint-Etienne

    The Polynomial Modular Number System (PMNS) is an integer number system which aims to speed up arithmetic operations modulo a prime p. Such a system is defined by a tuple (p, n, g, r, E), where p, n, g and r are positive integers, E is a monic polynomial with integer coefficients, having g as a root modulo p. Most of the work done on PMNS focus on polynomials E such that E(X) = X^n – l, where l is[…]

    • Séminaire

    • Cryptographie

    co-organisée avec le séminaire sécurité des systèmes électroniques embarqués

    • 23 avril 2021

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

    Orateur : mot de passe: 344005 - très classe le mot de passe en clair !

    https://seminaires-dga.inria.fr/securite-elec/<br/&gt; lien: https://bbb.irisa.fr/b/ger-mvp-9xd

    • Séminaire

    • Cryptographie

    TBA

    • 14 janvier 2022

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

    Orateur : Louiza Khati - Anssi

    TBA lien: https://univ-rennes1-fr.zoom.us/j/97066341266?pwd=RUthOFV5cm1uT0ZCQVh6QUcrb1drQT09

    • Séminaire

    • Cryptographie

    On the hardness of the NTRU problem

    • 08 octobre 2021

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

    Orateur : Alice Pellet-Mary - CNRS, Institut Mathématiques de Bordeaux

    The NTRU problem is an algorithmic problem over structured lattices that was introduced by Hoffstein, Pipher, and Silverman more than 20 years ago, and which has been used to construct various cryptographic primitives. However, its relation to other lattice problems is still not well understood.<br/> In this talk, we will describe different variants of the NTRU problem, and study how they compare[…]

    • Séminaire

    • Cryptographie

    The Revival of Quadratic Fields Cryptography

    • 17 janvier 2020

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

    Orateur : Guilhem Castagnos - Université Bordeaux 1

    More than 30 years ago, Buchmann and Williams proposed using ideal class groups of imaginary quadratic fields in cryptography with a Diffie-Hellman style key exchange protocol. After several twists, there has been in recent years a new interest in this area. This rebirth is mainly due to two features. First, class groups of imaginary quadratic fields allow the design of cryptographic protocols[…]

    • Séminaire

    • Cryptographie

    Implicit proofs of membership

    • 13 mars 2020

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

    Orateur : Olivier Blazy - Université Limoges

    Smooth hash proof systems have been introduced by Cramer and shoup to build compact efficient cca2 encryption in the standard model. Since then, they found applications in a broad range of protocols from oblivious transfer to authenticated key exchange, passing by witness examples.<br/> In this talk, we will start by a panorama of languages that can be managed by such a primitive and then show how[…]
Haut de page