Description
Dans le cadre de l'étude de canaux dans un contexte non-coopératif, nous nous intéressons à la reconstruction des codes correcteurs d'erreurs. Dans ce contexte, un attaquant dispose d'une séquence interceptée provenant d'une communication codée et souhaite retrouver quel code correcteur d'erreur a été utilisé lors de la transmission. D'un point de vue de la théorie de l'information, nous nous intéresserons plus précisément au problème du nombre de mots de code bruités nécessaires à la reconstruction.
Prochains exposés
-
Dual attacks in code-based (and lattice-based) cryptography
Orateur : Charles Meyer-Hilfiger - Inria Rennes
The hardness of the decoding problem and its generalization, the learning with errors problem, are respectively at the heart of the security of the Post-Quantum code-based scheme HQC and the lattice-based scheme Kyber. Both schemes are to be/now NIST standards. These problems have been actively studied for decades, and the complexity of the state-of-the-art algorithms to solve them is crucially[…]-
Cryptography
-
-
Lie algebras and the security of cryptosystems based on classical varieties in disguise
Orateur : Mingjie Chen - KU Leuven
In 2006, de Graaf et al. proposed a strategy based on Lie algebras for finding a linear transformation in the projective linear group that connects two linearly equivalent projective varieties defined over the rational numbers. Their method succeeds for several families of “classical” varieties, such as Veronese varieties, which are known to have large automorphism groups. In this talk, we[…]-
Cryptography
-