Does the dual-sieve attack on learning with errors even work?
From MaRDI portal
Publication:6145940
DOI10.1007/978-3-031-38548-3_2OpenAlexW4385654504MaRDI QIDQ6145940
Publication date: 2 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38548-3_2
Artificial neural networks and deep learning (68T07) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Numerical methods for discrete and fast Fourier transforms (65T50)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dual lattice attacks for closest vector problems (with preprocessing)
- Fast Fourier transforms: A tutorial review and a state of the art
- Dual vectors and lower bounds for the nearest lattice point problem
- Shortest vector from lattice sieving: a few dimensions for free
- 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
- The general sieve kernel and new records in lattice reduction
- Tuple lattice sieving
- Sieve algorithms for the shortest vector problem are practical
- An Improved LPN Algorithm
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- Lattice-based Cryptography
- A Statistical Decoding Algorithm for General Linear Block Codes
- New directions in nearest neighbor searching with applications to lattice sieving
- IX. On the problem of the most efficient tests of statistical hypotheses
- Improved Algorithms for the Approximate k-List Problem in Euclidean Norm
- 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
- A study of error floor behavior in QC-MDPC codes
