Making the BKW algorithm practical for LWE
From MaRDI portal
Publication:2152043
DOI10.1007/978-3-030-65277-7_19zbMath1492.94071OpenAlexW3107222908MaRDI QIDQ2152043
Paul Stankovski Wagner, Qian Guo, Alessandro Budroni, Erik Mårtensson, Thomas Johansson
Publication date: 6 July 2022
Full work available at URL: https://hdl.handle.net/11250/2756518
Related Items
Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS ⋮ A non-heuristic approach to time-space tradeoffs and optimizations for BKW ⋮ Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- On the concrete hardness of learning with errors
- Fast correlation attacks on certain stream ciphers
- LPN decoded
- On the asymptotic complexity of solving LWE
- Dissection-BKW
- Improved low-memory subset sum and LPN algorithms via multiple collisions
- On the complexity of the BKW algorithm on LWE
- The general sieve kernel and new records in lattice reduction
- Solving LPN using covering codes
- Coded-BKW with sieving
- Solving LPN Using Covering Codes
- Better Algorithms for LWE and LWR
- New Algorithms for Learning in Presence of Errors
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Coded-BKW: Solving LWE Using Lattice Codes
- An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
- An Improved LPN Algorithm
- New directions in nearest neighbor searching with applications to lattice sieving
- On the Asymptotics of Solving the LWE Problem Using Coded-BKW With Sieving
- Lazy Modulus Switching for the BKW Algorithm on LWE
- The Conditional Correlation Attack: A Practical Attack on Bluetooth Encryption
- How Far Can We Go Beyond Linear Cryptanalysis?
- Noise-tolerant learning, the parity problem, and the statistical query model
- On lattices, learning with errors, random linear codes, and cryptography
