Estimation of the hardness of the learning with errors problem with a restricted number of samples
From MaRDI portal
Publication:2415419
DOI10.1515/jmc-2017-0040zbMath1458.94214OpenAlexW2604912388MaRDI QIDQ2415419
Markus Schmidt, Florian Göpfert, Nina Bindel, Johannes A. Buchmann
Publication date: 21 May 2019
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jmc-2017-0040
Uses Software
Cites Work
- On the concrete hardness of learning with errors
- Finding shortest lattice vectors faster using quantum search
- On Lovász' lattice reduction and the nearest lattice point problem
- Factoring polynomials with rational coefficients
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Revisiting TESLA in the quantum random oracle model
- On the complexity of the BKW algorithm on LWE
- High-Speed Signatures from Standard Lattices
- Better Algorithms for LWE and LWR
- Algorithms for the Shortest and Closest Lattice Vector Problems
- New Algorithms for Learning in Presence of Errors
- Integer Programming with a Fixed Number of Variables
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- BKZ 2.0: Better Lattice Security Estimates
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- On the Efficacy of Solving LWE by Reduction to Unique-SVP
- Trapdoors for hard lattices and new cryptographic constructions
- Lattice Enumeration Using Extreme Pruning
- Lattice-based Cryptography
- New directions in nearest neighbor searching with applications to lattice sieving
- Public-key cryptosystems from the worst-case shortest vector problem
- Floating-Point LLL Revisited
- An Improved Compression Technique for Signatures Based on Learning with Errors
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- On lattices, learning with errors, random linear codes, and cryptography
