Rigorous foundations for dual attacks in coding theory
From MaRDI portal
Publication:6587944
DOI10.1007/978-3-031-48624-1_1MaRDI QIDQ6587944FDOQ6587944
Authors: Charles Meyer-Hilfiger, Jean-Pierre Tillich 
Publication date: 15 August 2024
Recommendations
Cites Work
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
- Security bounds for the design of code-based cryptosystems
- Title not available (Why is that?)
- Smaller decoding exponents: ball-collision decoding
- Lattice-based Cryptography
- Title not available (Why is that?)
- On computing nearest neighbors with applications to decoding of binary linear codes
- A Statistical Decoding Algorithm for General Linear Block Codes
- Weight distribution moments of random linear/coset codes
- On the weight distribution of random binary linear codes
- On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
- A Moment Ratio Bound for Polynomials and Some Extremal Properties of Krawchouk Polynomials and Hamming Spheres
- 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
- Statistical Decoding Revisited
- Statistical decoding 2.0: reducing decoding to LPN
- Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS
Cited In (6)
- The hardness of LPN over any integer ring and field for PCG applications
- Does the dual-sieve attack on learning with errors even work?
- 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)
