525 results
-
Quantum cryptanalysis of block ciphers: beyond quadratic speedups
Speaker : André Schrottenloher - CWI
The security of modern cryptosystems relies on computational assumptions, which may be challenged by the advent of large-scale quantum computing devices.<br/> While Shor's algorithm is known to break today's most popular public-key schemes, secret-key cryptosystems are generally expected to retain half of their pre-quantum bits of security. However, the precise advantage of quantum attacks cannot[…] -
A Concrete Treatment of Efficient Continuous Group Key Agreement via Multi-Recipient PKEs
Speaker : Thomas Prest - PQShield
Continuous group key agreements (CGKAs) are a class of protocols that can provide strong security guarantees to secure group messaging protocols such as Signal and MLS. Protection against device compromise is provided by commit messages: at a regular rate, each group member may refresh their key material by uploading a commit message, which is then downloaded and processed by all the other members[…] -
Workshop mise en oeuvre de la cryptographie post-quantique
Speaker : European CyberWeek - Rennes
L'inscription est gratuite mais obligatoire, en particulier pour des raisons de jauges. Le nombre de places est limité. Le programme est disponible à l'adresse <a href="https://www.european-cyber-week.eu/cryptographie-post-quantique">https://www.european-cyber-week.eu/cryptographie-post-quantique</a><br/> -
Soutenance de thèse: Theoretical Hardness of Algebraically Structured Learning With Errors
Speaker : Katharina Boudgoust - Rennes
The main focus of this PhD thesis lies on the computational problem Learning With Errors (LWE). It is a core building block of lattice-based cryptography, which itself is among the most promising candidates to replace current cryptographic protocols once large-scale quantum computers may be available. The contributions of the present work are separated into two different parts. First, we study the[…] -
Decoding Supercodes of Gabidulin Codes and Applications to Cryptanalysis
Speaker : Maxime Bombar - Ecole Polytechnique
Error correcting codes are well known to provide possible candidates for building quantum safe cryptographic primitives. Besides the Hamming metric which has a long-standing history, one may consider other metrics such as the rank metric. Gabidulin codes are the rank metric analogue of Reed-Solomon codes and can be efficiently decoded up to half the minimum distance. However, beyond this radius,[…] -
https://seminaire-c2.inria.fr/
Speaker : Séminaire C2 - Paris