Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
633 results
-
-
Seminar
-
Cryptography
TBA
Speaker : Louiza Khati - Anssi
TBA lien: https://univ-rennes1-fr.zoom.us/j/97066341266?pwd=RUthOFV5cm1uT0ZCQVh6QUcrb1drQT09 -
-
-
Seminar
-
Cryptography
The Revival of Quadratic Fields Cryptography
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
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
Some new results on cube attacks against Trivium
Speaker : Tian Tian - Université de Zhengzhou
Trivium is a bit oriented synchronous stream cipher designed by Cannière and Preneel. It is one of the eSTREAM hardware-oriented finalists and an International Standard under ISO/IEC 29192-3:2012. Cube attacks are an important type of key recovery attack against Trivium. First, I will give a survey on cube attacks against Trivium. Second, I will present our recent results including an algebraic[…] -
-
-
Seminar
-
Cryptography
Supersingular isogeny Diffie-Hellman
Speaker : Leonardo Colo - Univesité Aix-Marseille
Supersingular isogeny graphs have been used in the Charles–Goren–Lauter cryptographic hash function and the supersingular isogeny Diffie–Hellman (SIDH) protocole of De\,Feo and Jao. A recently proposed alternative to SIDH is the commutative supersingular isogeny Diffie–Hellman (CSIDH) protocole, in which the isogeny graph is first restricted to $\FF_p$-rational curves $E$ and $\FF_p$-rational[…] -
-
-
Seminar
-
Cryptography
Learning With Errors and Extrapolated Dihedral Cosets Problem
Speaker : Weiqiang Wen - ENS de Lyon
The hardness of the learning with errors (LWE) problem is one of the most fruitful resources of modern cryptography. In particular, it is one of the most prominent candidates for secure post-quantum cryptography. Understanding its quantum complexity is therefore an important goal. We show that under quantum polynomial time reductions, LWE is equivalent to a relaxed version of the dihedral coset[…] -