527 résultats
-
Key Reinstallation Attacks: Forcing Nonce Reuse in WPA2
Orateur : Mathy Vanhoef - KU-Leuven
We introduce key reinstallation attacks (KRACKs). These attacks abuse features of a protocol to reinstall an already in-use key, thereby resetting nonces and/or replay counters associated to this key. We show that our novel attack technique breaks several handshakes that are used in a WPA2-protected network.<br/> All protected Wi-Fi networks use the 4-way handshake to generate fresh session keys.[…] -
Grost Distinguishing Attack: A new rebound attack of an AES-like permutation
Orateur : Victor Cauchois - DGA et IRMAR
Grostl est une fonction de hachage finaliste de la compétition SHA-3. Elle est dotée d'une preuve de sécurité qui assure sa résistance aux attaques en collision, pré-image et seconde pré-image sous l'hypothèse que deux permutations internes sont idéales. Ces permutations, 14 tours d'un SPN, calques de l'AES, présentent une structure sensible aux attaques rebond. Ces attaques sont des attaques[…] -
Learning With Errors and Extrapolated Dihedral Cosets Problem
Orateur : 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[…] -
Horizontal isogeny graphs of ordinary abelian varieties and the discrete logarithm problem
Orateur : Benjamin WESOLOWSKI - École Polytechnique Federale de Lausanne
An isogeny graph is a graph whose vertices are abelian varieties (typically elliptic curves, or Jacobians of genus 2 hyperelliptic curves) and whose edges are isogenies between them. Such a graph is "horizontal" if all the abelian varieties have the same endomorphism ring. We study the connectivity and the expander properties of these graphs. We use these results, together with a recent algorithm[…] -
Protocoles de PIR fondés sur des designs transversaux
Orateur : julien lavauzelle - INRIA X
Les protocoles de PIR (Private Information Retrieval) permettent à un utilisateur de récupérer des entrées d'une base de donnée externalisée, sans révéler d'information sur les entrées désirées. Si plusieurs serveurs sont utilisés pour le stockage, et s'ils ne coopèrent pas, une confidentialité inconditionnelle peut être atteinte grâce à des encodages spécifiques de la base de données.<br/> Dans[…] -
Short McEliece key from algebraic geometry codes with automorphism
Orateur : elise barelli - INRIA Saclay
In 1978, McEliece introduced a public key encryption scheme based on linear codes and suggested to use classical Goppa codes, ie: subfield subcodes of algebraic geometric (AG) codes built on a curve of genus 0. This proposition remains secure and in order to have a generalization of classical Goppa codes, in 1996, H. Janwa and O. Moreno suggested to use subfield subcode of AG codes, which we call[…]