Predicting the concrete security of LWE against the dual attack using binary search

Uses Software

Cites Work

Unnamed Item
Unnamed Item
On the concrete hardness of learning with errors
Shortest vector from lattice sieving: a few dimensions for free
Estimate all the {LWE, NTRU} schemes!
Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes
On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes
The general sieve kernel and new records in lattice reduction
Revisiting the expected cost of solving uSVP and applications to LWE
New Algorithms for Learning in Presence of Errors
Better Key Sizes (and Attacks) for LWE-Based Encryption
BKZ 2.0: Better Lattice Security Estimates
Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
Coded-BKW: Solving LWE Using Lattice Codes
An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
Lattice Enumeration Using Extreme Pruning
A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
Lattice-based Cryptography
New directions in nearest neighbor searching with applications to lattice sieving
Lattice Decoding Attacks on Binary LWE
Lazy Modulus Switching for the BKW Algorithm on LWE
Random Sampling Revisited: Lattice Enumeration with Discrete Pruning
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: Predicting the concrete security of LWE against the dual attack using binary search