Practical infos
Next sessions
-
THE SEMINAR IS CANCELLED
CryptoVerif: a computationally-sound security protocol verifierSpeaker : 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
-
-
Dual attacks in code-based (and lattice-based) cryptography
Speaker : 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
-
-
Lie algebras and the security of cryptosystems based on classical varieties in disguise
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
-
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.
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 :
- Sylvain Duquesne ( University of Rennes) (leader)
Board :
- Gwezenheg Robert (DGA)
- André Schrottenloher (INRIA)
-
- Sylvain Duquesne (IRMAR)
- Aurore Guillevic (IRISA)
- Antonin Leroux (DGA-MI & IRMAR)
- Pierre Loidreau (DGA-MI & IRMAR)
- David Lubicz (DGA-MI & IRMAR)
- Damien Marion (IRISA)
- Jade Nardi (IRMAR)
- Tuong-Huy Nguyen (DGA-MI & IRISA)
- Gwezenheg Robert (DGA-MI & IRMAR)
- André Schrottenloher (IRISA)
- YiXin Shen (IRISA)
-
- 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.