On the complexity of the BKW algorithm on LWE
From MaRDI portal
Publication:2256097
Recommendations
- An improved BKW algorithm for LWE with applications to cryptography and lattices
- Making the BKW algorithm practical for LWE
- On the asymptotic complexity of solving LWE
- Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms
- On the Asymptotics of Solving the LWE Problem Using Coded-BKW With Sieving
- Lazy modulus switching for the BKW algorithm on LWE
- On the complexity of the LWR-solving BKW algorithm
- Coded-BKW: solving LWE using lattice codes
- Revisiting the hardness of binary error LWE
- On the hardness of module-LWE with binary secret
Cites work
- Algorithms for the shortest and closest lattice vector problems
- An Improved LPN Algorithm
- Analyzing blockwise lattice algorithms using dynamical systems
- Better key sizes (and attacks) for LWE-based encryption
- BKZ 2.0: Better lattice security estimates
- Classical hardness of learning with errors
- Discrete Gaussian leftover hash lemma over infinite domains
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fully homomorphic encryption using ideal lattices
- H-LLL: using Householder inside LLL
- How Far Can We Go Beyond Linear Cryptanalysis?
- Lattice enumeration using extreme pruning
- Lattice Reduction Algorithms: Theory and Practice
- Lattice-based Cryptography
- Low-dimensional lattice basis reduction revisited
- New Algorithms for Learning in Presence of Errors
- Noise-tolerant learning, the parity problem, and the statistical query model
- On lattices, learning with errors, random linear codes, and cryptography
- Polly cracker, revisited
- Solving BDD by enumeration: an update
- SWIFFT: A Modest Proposal for FFT Hashing
- Trapdoors for hard lattices and new cryptographic constructions
Cited in
(36)- On the asymptotic complexity of solving LWE
- On the complexity of the LWR-solving BKW algorithm
- Practical analysis of key recovery attack against search-LWE problem
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
- MPSign: a signature from small-secret middle-product learning with errors
- On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem
- Shortest vectors in lattices of Bai-Galbraith's embedding attack on the LWR problem
- Making the BKW algorithm practical for LWE
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption
- Security estimates of a ring-LWE symmetric cryptosystem against chosen plaintext attack
- TFHE: fast fully homomorphic encryption over the torus
- Coded-BKW with sieving
- Estimation of the hardness of the learning with errors problem with a restricted number of samples
- On solving LPN using BKW and variants, Implementation and analysis
- Parallel implementation of \textsf{BDD} enumeration for \textsf{LWE}
- Better algorithms for LWE and LWR
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- Coded-BKW: solving LWE using lattice codes
- An improved BKW algorithm for LWE with applications to cryptography and lattices
- Algebraic aspects of solving ring-LWE, including ring-based improvements in the Blum-Kalai-Wasserman algorithm
- Lazy modulus switching for the BKW algorithm on LWE
- On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
- 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
- Finding and evaluating parameters for BGV
- Revisiting security estimation for LWE with hints from a geometric perspective
- Accelerating Lattice Based Proxy Re-encryption Schemes on GPUs
- The complexity of algebraic algorithms for LWE
- Further improvements of the estimation of key enumeration with applications to solving LWE
- A systematic study of sparse LWE
- Memory-efficient BKW algorithm for solving the LWE problem
- DAWN: smaller and faster NTRU encryption via double encoding
- SoK: on the security of cryptographic problems from linear algebra
- Cool + cruel = dual, and new benchmarks for sparse LWE
- Optimizing c-sum BKW and faster quantum variant for LWE
This page was built for publication: On the complexity of the BKW algorithm on LWE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256097)
