Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS
From MaRDI portal
Publication:6045071
DOI10.1007/978-3-030-92068-5_2zbMath1514.94093OpenAlexW3215125479MaRDI QIDQ6045071
Publication date: 26 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-92068-5_2
fast Fourier transformlattice-based cryptographyfully homomorphic encryptionlearning with errorsCRYSTALSdual attacksNIST post-quantum cryptography standardization
Related Items (2)
Does the dual-sieve attack on learning with errors even work? ⋮ Estimating the hidden overheads in the BDGL lattice sieving algorithm
Cites Work
- On the concrete hardness of learning with errors
- Measuring, simulating and exploiting the head concavity phenomenon in BKZ
- Progressive lattice sieving
- Shortest vector from lattice sieving: a few dimensions for free
- Estimate all the {LWE, NTRU} schemes!
- Making the BKW algorithm practical for LWE
- On the complexity of the BKW algorithm on LWE
- The general sieve kernel and new records in lattice reduction
- Solving LPN using covering codes
- Estimating quantum speedups for lattice sieves
- On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Better Algorithms for LWE and LWR
- New Algorithms for Learning in Presence of Errors
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- BKZ 2.0: Better Lattice Security Estimates
- On the Efficacy of Solving LWE by Reduction to Unique-SVP
- Coded-BKW: Solving LWE Using Lattice Codes
- An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
- Sieve algorithms for the shortest vector problem are practical
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- Lattice-based Cryptography
- Solving BDD by Enumeration: An Update
- Lattice Decoding Attacks on Binary LWE
- Public-key cryptosystems from the worst-case shortest vector problem
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Classical hardness of learning with errors
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL
- Noise-tolerant learning, the parity problem, and the statistical query model
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS
