Coded-BKW: Solving LWE Using Lattice Codes
From MaRDI portal
Publication:3457103
DOI10.1007/978-3-662-47989-6_2zbMath1336.94051OpenAlexW1953288577WikidataQ62041895 ScholiaQ62041895MaRDI QIDQ3457103
Qian Guo, Paul Stankovski, Thomas Johansson
Publication date: 10 December 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-47989-6_2
Related Items (14)
How to meet ternary LWE keys ⋮ Making the BKW algorithm practical for LWE ⋮ Predicting the concrete security of LWE against the dual attack using binary search ⋮ Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS ⋮ On the asymptotic complexity of solving LWE ⋮ Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms ⋮ A Practical Post-Quantum Public-Key Cryptosystem Based on $$\textsf {spLWE}$$ ⋮ On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL ⋮ Solving LPN using covering codes ⋮ On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem ⋮ Parallel Implementation of BDD Enumeration for LWE ⋮ On the success probability of solving unique SVP via BKZ ⋮ Algebraic Aspects of Solving Ring-LWE, Including Ring-Based Improvements in the Blum--Kalai--Wasserman Algorithm ⋮ Quantum key search for ternary LWE
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On probability of success in linear and differential cryptanalysis
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Lattice Signatures without Trapdoors
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- New Algorithms for Learning in Presence of Errors
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- BKZ 2.0: Better Lattice Security Estimates
- Polly Cracker, Revisited
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- An Improved LPN Algorithm
- Lattices Which Are Good for (Almost) Everything
- Lattice-based Cryptography
- Voronoi regions of lattices, second moments of polytopes, and quantization
- Averaging bounds for lattices and linear codes
- On the Design of Hardware Building Blocks for Modern Lattice-Based Encryption Schemes
- On lattice quantization noise
- Solving BDD by Enumeration: An Update
- Lazy Modulus Switching for the BKW Algorithm on LWE
- How Far Can We Go Beyond Linear Cryptanalysis?
- On lattices, learning with errors, random linear codes, and cryptography
- Noise-tolerant learning, the parity problem, and the statistical query model
This page was built for publication: Coded-BKW: Solving LWE Using Lattice Codes
