Coded-BKW: solving LWE using lattice codes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 108350 (Why is no real title available?)
- scientific article; zbMATH DE number 1024657 (Why is no real title available?)
- An Improved LPN Algorithm
- Averaging bounds for lattices and linear codes
- BKZ 2.0: Better lattice security estimates
- Better key sizes (and attacks) for LWE-based encryption
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- How Far Can We Go Beyond Linear Cryptanalysis?
- Lattice signatures without trapdoors
- Lattice-based Cryptography
- Lattices Which Are Good for (Almost) Everything
- Lazy modulus switching for the BKW algorithm on LWE
- New Algorithms for Learning in Presence of Errors
- Noise-tolerant learning, the parity problem, and the statistical query model
- On lattice quantization noise
- On lattices, learning with errors, random linear codes, and cryptography
- On probability of success in linear and differential cryptanalysis
- On the design of hardware building blocks for modern lattice-based encryption schemes
- Polly cracker, revisited
- Solving BDD by enumeration: an update
- Voronoi regions of lattices, second moments of polytopes, and quantization
Cited in
(22)- Memory-efficient BKW algorithm for solving the LWE problem
- Algebraic aspects of solving ring-LWE, including ring-based improvements in the Blum-Kalai-Wasserman algorithm
- Quantum key search for ternary LWE
- On the asymptotic complexity of solving LWE
- How to meet ternary LWE keys
- Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS
- scientific article; zbMATH DE number 7385926 (Why is no real title available?)
- SoK: on the security of cryptographic problems from linear algebra
- Making the BKW algorithm practical for LWE
- Predicting the concrete security of LWE against the dual attack using binary search
- Solving LPN using covering codes
- On the complexity of the BKW algorithm on LWE
- On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem
- Assessing the impact of a variant of MATZOV's dual attack on Kyber
- Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms
- On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
- A practical post-quantum public-key cryptosystem based on spLWE
- Further improvements of the estimation of key enumeration with applications to solving LWE
- On the success probability of solving unique SVP via BKZ
- Coded-BKW with sieving
- On algebraic homomorphic encryption and its applications to doubly-efficient PIR
- Parallel implementation of \textsf{BDD} enumeration for \textsf{LWE}
This page was built for publication: Coded-BKW: solving LWE using lattice codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457103)
