Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
633 results
-
-
Seminar
-
Cryptography
Generic Attack on Duplex-Bases AEAD Modes using Random Function Statistics
Speaker : Rachelle Heim Boissier - Inria
Duplex-based authenticated encryption modes with a sufficiently large key length are proven to be secure up to the birthday bound 2^(c/2), where c is the capacity. However this bound is not known to be tight and the complexity of the best known generic attack, which is based on multicollisions, is much larger: it reaches 2^c/α where α represents a small security loss factor. There is thus an[…] -
-
-
Seminar
-
Cryptography
Generic SCARE: reverse engineering without knowing the algorithm nor the machine
Speaker : Hélène LE BOUDER - IMT Atlantique
A novel side-channel-based reverse engineering technique is introduced, capable of reconstructing a procedure solely from inputs, outputs, and traces of execution. Beyond generic restrictions, no prior knowledge of the procedure or the chip it operates on is assumed. These restrictions confine the analysis to 8-bit RISC constant-time software implementations. Specifically, the feasibility of[…] -
-
-
Seminar
-
Cryptography
Finding short integer solutions when the modulus is small
Speaker : Eamonn Postlethwaite - King's College London
We present cryptanalysis of the inhomogenous short integer solution (ISIS) problem for anomalously small moduli by exploiting the geometry of BKZ reduced bases of q-ary lattices. We apply this cryptanalysis to examples from the literature where taking such small moduli has been suggested. A recent work [Espitau–Tibouchi–Wallet–Yu, CRYPTO 2022] suggests small versions of the lattice signature[…] -
-
-
Seminar
-
Cryptography
Quantum Linear Key-recovery Attacks Using the QFT
Speaker : André Schrottenloher - IRISA
The Quantum Fourier Transform is a fundamental tool in quantum cryptanalysis, not only as the building block of Shor's algorithm, but also in attacks against symmetric cryptosystems. Indeed, hidden shift algorithms such as Simon's (FOCS 1994), which rely on the QFT, have been used to obtain attacks on some very specific block cipher structures. The Fourier Transform is also used in classical[…] -
-
-
Seminar
-
Cryptography
TBD (To be decided closer to the date of the talk)
Speaker : Lisa Kohl - CWI
TBD (To be decided closer to the date of the talk) -
-
-
Seminar
-
Cryptography
How fast do you heal? A taxonomy for post-compromise security in secure-channel establishment.
Speaker : Léo Robert - Université d'Amiens
Post-Compromise Security (PCS) is a property of secure-channel establishment schemes, which limits the security breach of an adversary that has compromised one of the endpoint to a certain number of messages, after which the channel heals. An attractive property, especially in view of Snowden's revelation of mass-surveillance, PCS features in prominent messaging protocols such as Signal. In this[…] -