Rigorous foundations for dual attacks in coding theory
From MaRDI portal
Publication:6587944
DOI10.1007/978-3-031-48624-1_1MaRDI QIDQ6587944
Jean-Pierre Tillich, Charles Meyer-Hilfiger
Publication date: 15 August 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes
- Weight distribution moments of random linear/coset codes
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- Lattice-based Cryptography
- Security Bounds for the Design of Code-Based Cryptosystems
- A Statistical Decoding Algorithm for General Linear Block Codes
- A Moment Ratio Bound for Polynomials and Some Extremal Properties of Krawchouk Polynomials and Hamming Spheres
- On the weight distribution of random binary linear codes
- Smaller Decoding Exponents: Ball-Collision Decoding
- On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL
- Statistical Decoding Revisited
- Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS
- Statistical decoding 2.0: reducing decoding to LPN
Related Items (5)
The hardness of LPN over any integer ring and field for PCG applications ⋮ Provable dual attacks on learning with errors ⋮ Reduction from sparse LPN to LPN, dual attack 3.0 ⋮ Further improvements of the estimation of key enumeration with applications to solving LWE ⋮ CryptAttackTester: high-assurance attack analysis
This page was built for publication: Rigorous foundations for dual attacks in coding theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587944)
