Description
Hard learning problems (e.g., LPN, LWE and their variants) are attractive topics recently in the cryptographic community due to the numerous cryptosystems (symmetric or public-key) based on them. Normally these systems employ an instantiation of the underlying problem with a large dimension and relatively small noise to ensure the security and the high decryption success probability, respectively. In the famous BKW algorithm, Blum et al. first pointed out that balancing these two parameters plays a key role in solving these hard instances. Along their path, I will present a new idea to form better dimension-bias trade-offs by using coding theory, thereby resulting in better solutions. Lattice codes are used for solving LWE, and covering codes for LPN. Moreover, I will also present an improved method if additional algebraic structures are provided (e.g., in the reducible Ring-LPN case).
Next sessions
-
Adelic reduction of module lattices
Speaker : Henry Bambury - DGA-MI et Inria Rennes
We give a strict generalisation of the LLL algorithm over number fields, based on the reduction theory of $GL(n)$ over the adele ring of a number field. Our algorithm is free of heuristics, with rigorous bounds on output quality and complexity. -- based on joint work with Seungki Kim, Changmin Lee and Phong Nguyen ---
Cryptography
-
-
European Cyber Week: atelier cryptographie post-quantique
Dans la continuité des éditions 2021, 2022 et 2024, la DGA — en partenariat avec CREACH LABS et avec le soutien de l'ANSSI, de l'IRISA, de l'IRMAR et du Pôle d'Excellence Cyber — organise la 4e édition de l'atelier consacré à la cryptographie post-quantique dans le cadre de l'European Cyber Week 2026. Attention, il faut s'inscrire (gratuitement) au préalable — s'inscrire à la conférence Les[…] -
Post-quantum day of the cryptography seminar
A scientific day devoted to post-quantum cryptography, held in the wake of the European Cyber Week, with talks more technical than those presented at the ECW.