Table of contents

Practical infos

  • Date

    The cryptography seminar of Rennes takes place every Friday at 1:45 p.m. Any participant can suggest a guest or a talk subject by sending an email to one of the scientific committee members.
  • Location

    IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes Amphi Lebesgue
    Locate on Google Maps

Next sessions

  • Lie algebras and the security of cryptosystems based on classical varieties in disguise

    • November 07, 2025 (13:45 - 14:45)

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

    Speaker : 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

    • November 14, 2025 (13:45 - 14:45)

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

    Speaker : 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[…]
  • Wagner’s Algorithm Provably Runs in Subexponential Time for SIS^∞

    • November 21, 2025 (13:45 - 14:45)

    • Salle Guernesey à l'ISTIC

    Speaker : Johanna Loyer - Inria Saclay

    At CRYPTO 2015, Kirchner and Fouque claimed that a carefully tuned variant of the Blum-Kalai-Wasserman (BKW) algorithm (JACM 2003) should solve the Learning with Errors problem (LWE) in slightly subexponential time for modulus q = poly(n) and narrow error distribution, when given enough LWE samples. Taking a modular view, one may regard BKW as a combination of Wagner’s algorithm (CRYPTO 2002), run[…]
    • Cryptography

  • CryptoVerif: a computationally-sound security protocol verifier

    • November 28, 2025 (13:45 - 14:45)

    • Batiment 32B salle 12

    Speaker : Bruno Blanchet - Inria

    CryptoVerif is a security protocol verifier sound in the computational model of cryptography. It produces proofs by sequences of games, like those done manually by cryptographers. It has an automatic proof strategy and can also be guided by the user. It provides a generic method for specifying security assumptions on many cryptographic primitives, and can prove secrecy, authentication, and[…]
    • Cryptography

  • Structured-Seed Local Pseudorandom Generators and their Applications

    • December 05, 2025 (13:45 - 14:45)

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

    Speaker : Nikolas Melissaris - IRIF

    We introduce structured‑seed local pseudorandom generators (SSL-PRGs), pseudorandom generators whose seed is drawn from an efficiently sampleable, structured distribution rather than uniformly. This seemingly modest relaxation turns out to capture many known applications of local PRGs, yet it can be realized from a broader family of hardness assumptions. Our main technical contribution is a[…]
    • Cryptography

Show previous sessions

Subscribe to the mailing list

A mailing list is available for announcements concerning Cryptography seminar's talks. To subscribe, you just have to send an email to sympa@listes.univ-rennes1.fr with subscribe math-crypto as a subject.

Subscribe to the mailing list

Presentation of the seminar

  • Scientists welcome the renewed interest and original insight that cryptography brings to their disciplines, as well as the intellectual challenges posed to them.

    Multidisciplinary par excellence, cryptography constitutes a point of contact between number theory, algebraic geometry, algorithms and computer science. It brings whole sections of the most fundamental mathematics into contact with applications of great practical importance. 

  • Leader :

    Board :

    • The General Directorate of Armament (DGA) : state body responsible for the development of cryptographic algorithms, which depends on the the Ministry of the Armed Forces.
    • Rennes Mathematical Research Institute (IRMAR) : mathematics research laboratory associating the National Center for Scientific Research (CNRS), the University of Rennes, the École Normale Supérieure de Cachan (ENS Cachan), the National Institute of Applied Sciences of Rennes (INSA Rennes) and the University of Rennes 2.
    • Institute for Research in Computer Science and Random Systems (IRISA): computer science research laboratory in Rennes.

    DGA, IRISA and IRMAR wish, by organizing this cooperative seminar, to crystallize the interest of different actors in the Rennes region around cryptography and, beyond current fashion, to encourage fruitful and scientific collaboration. quality.