Finding Shortest Lattice Vectors in the Presence of Gaps
From MaRDI portal
Publication:2790044
DOI10.1007/978-3-319-16715-2_13zbMath1332.94083OpenAlexW216855343MaRDI QIDQ2790044
Xiaoyun Wang, Wei Wei, Ming-Jie Liu
Publication date: 2 March 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-16715-2_13
Related Items (3)
Unnamed Item ⋮ A \(2^{n/2}\)-time algorithm for \(\sqrt{n} \)-SVP and \(\sqrt{n} \)-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP ⋮ Slide reduction, revisited -- filling the gaps in SVP approximation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factoring polynomials with rational coefficients
- Improved low-density subset sum algorithms
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
- A Three-Level Sieve Algorithm for the Shortest Vector Problem
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
- Sieve algorithms for the shortest vector problem are practical
- Trapdoors for hard lattices and new cryptographic constructions
- A Framework for Efficient and Composable Oblivious Transfer
- Lattice-based Cryptography
- Solving low-density subset sum problems
- On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
- Candidate Multilinear Maps from Ideal Lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- A sieve algorithm for the shortest lattice vector problem
- New lattice-based cryptographic constructions
- Predicting Lattice Reduction
- Classical hardness of learning with errors
- Multi-bit Cryptosystems Based on Lattice Problems
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Finding Shortest Lattice Vectors in the Presence of Gaps
