A note on the concrete hardness of the shortest independent vector in lattices
From MaRDI portal
Publication:2656338
DOI10.1016/j.ipl.2020.106065OpenAlexW3094676624MaRDI QIDQ2656338
Publication date: 11 March 2021
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.11654
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Worst-case complexity, average-case complexity and lattice problems
- Factoring polynomials with rational coefficients
- Some simplified NP-complete graph problems
- Lattice reduction: a toolbox for the cryptoanalyst
- A Decade of Lattice Cryptography
- On the complexity of computing short linearly independent vectors and short bases in a lattice
- Solving the Shortest Vector Problem in 2 n Time Using Discrete Gaussian Sampling
- Integer Programming with a Fixed Number of Variables
- A polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem
- Trapdoors for hard lattices and new cryptographic constructions
- An Efficient and Parallel Gaussian Sampler for Lattices
- Minkowski's Convex Body Theorem and Integer Programming
- (Gap/S)ETH hardness of SVP
- Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
- On lattices, learning with errors, random linear codes, and cryptography
- On the complexity of \(k\)-SAT
