Filtrer par type de contenu
Sélectionnez un ou plusieurs filtres. Ce choix permettra de recharger la page pour afficher les résultats filtrés.
673 résultats
-
-
Séminaire
-
Cryptographie
Updatable Public Key Encryption with Lattices
Orateur : Calvin Abou-Haidar - ENS Lyon
Updatable public key encryption has recently been introduced as a so- lution to achieve forward-security in the context of secure group messaging without hurting efficiency, but so far, no efficient lattice-based instantia- tion of this primitive is known. In this work, we construct the first LWE-based UPKE scheme with polynomial modulus-to-noise rate, which is CPA-secure in the standard model. At[…] -
-
-
Séminaire
-
Cryptographie
Generic Attack on Duplex-Bases AEAD Modes using Random Function Statistics
Orateur : 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[…] -
-
-
Séminaire
-
Cryptographie
Generic SCARE: reverse engineering without knowing the algorithm nor the machine
Orateur : 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[…] -
-
-
Séminaire
-
Cryptographie
Finding short integer solutions when the modulus is small
Orateur : 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[…] -
-
-
Séminaire
-
Cryptographie
Quantum Linear Key-recovery Attacks Using the QFT
Orateur : 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[…] -
-
-
Groupe de travail
Modélisation statistique et sécurité des générateurs d'aléa pour la cryptographie
Orateur : David Lubicz - DGA, IRMAR
Dans cet exposé on essaie d'expliquer ce que l'on entend pas méthodes statistiques et on donne des exemples concrets d'application dans la cybersécurité.-
Cryptography
-