Filter by content type

Select one or more filters. This choice will reload the page to display the filtered results.

Remove all filters

633 results

    • Seminar

    • Cryptography

    Soutenance de thèse: Algebraic Cryptanalysis of the Shortest Vector Problem in Ideal Lattices

    • June 13, 2022

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

    Speaker : Olivier Bernard - Rennes

    • Seminar

    • Cryptography

    New uses in Symmetric Cryptography: from Cryptanalysis to Designing

    • May 20, 2022

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

    Speaker : Clémence Bouvier - INRIA

    New symmetric primitives are being designed to be run in abstract settings such as Multi-Party Computations (MPC) or Zero-Knowledge (ZK) proof systems. More particularly, these protocols have highlighted the need to minimize the number of multiplications performed by the primitive in large finite fields.<br/> As the number of such primitives grows, it is important to better understand the[…]

    • Seminar

    • Cryptography

    Binary codes, hyperelliptic curves, and the Serre bound

    • June 10, 2022

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

    Speaker : Ivan Pogildiakov - Rennes

    TBA lien: https://seminaire-c2.inria.fr/

    • Seminar

    • Cryptography

    The Revival of Quadratic Fields Cryptography

    • January 17, 2020

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

    Speaker : 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[…]

    • Seminar

    • Cryptography

    On the hardness of the NTRU problem

    • October 08, 2021

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

    Speaker : 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[…]

    • Seminar

    • Cryptography

    Implicit proofs of membership

    • March 13, 2020

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

    Speaker : 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[…]
Page top