Practical infos
Next sessions
-
On the average hardness of SIVP for module lattices of fixed rank
Speaker : Radu Toma - Sorbonne Université
In joint work with Koen de Boer, Aurel Page, and Benjamin Wesolowski, we study the hardness of the approximate Shortest Independent Vectors Problem (SIVP) for random module lattices. We use here a natural notion of randomness as defined originally by Siegel through Haar measures. By proving a reduction, we show it is essentially as hard as the problem for arbitrary instances. While this was[…] -
Attacks and Remedies for Randomness in AI: Cryptanalysis of PHILOX and THREEFRY
Speaker : Yevhen Perehuda - Ruhr-University Bochum
In this work, we address the critical yet understudied question of the security of the most widely deployed pseudorandom number generators (PRNGs) in AI applications. We show that these generators are vulnerable to practical and low-cost attacks. With this in mind, we conduct an extensive survey of randomness usage in current applications to understand the efficiency requirements imposed in[…]-
Cryptography
-
-
Lightweight (AND, XOR) Implementations of Large-Degree S-boxes
Speaker : Marie Bolzer - LORIA
The problem of finding a minimal circuit to implement a given function is one of the oldest in electronics. In cryptography, the focus is on small functions, especially on S-boxes which are classically the only non-linear functions in iterated block ciphers. In this work, we propose new ad-hoc automatic tools to look for lightweight implementations of non-linear functions on up to 5 variables for[…]-
Cryptography
-
Symmetrical primitive
-
Implementation of cryptographic algorithm
-
-
Algorithms for post-quantum commutative group actions
Speaker : Marc Houben - Inria Bordeaux
At the historical foundation of isogeny-based cryptography lies a scheme known as CRS; a key exchange protocol based on class group actions on elliptic curves. Along with more efficient variants, such as CSIDH, this framework has emerged as a powerful building block for the construction of advanced post-quantum cryptographic primitives. Unfortunately, all protocols in this line of work are[…] -
Endomorphisms via Splittings
Speaker : Min-Yi Shen - No Affiliation
One of the fundamental hardness assumptions underlying isogeny-based cryptography is the problem of finding a non-trivial endomorphism of a given supersingular elliptic curve. In this talk, we show that the problem is related to the problem of finding a splitting of a principally polarised superspecial abelian surface. In particular, we provide formal security reductions and a proof-of-concept[…]-
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 :
- Gwezheneg Robert (DGA)
- André Schrottenloher (INRIA)
-
- Philippe Chartier (IRMAR)
- Clément Dell'aiera (DGA-MI & IRISA)
- Sylvain Duquesne (IRMAR)
- Antonin Leroux (DGA-MI & IRMAR)
- Pierre Loidreau (DGA-MI & IRMAR)
- David Lubicz (DGA-MI & IRMAR)
- Jade Nardi (IRMAR)
- Gwezheneg Robert (DGA-MI & IRMAR)
- André Schrottenloher (IRISA)
- YiXin Shen (IRISA)
- Arnaud Tisserand
-
- 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.