A sieve algorithm for the shortest lattice vector problem
From MaRDI portal
Recommendations
Cites work
Cited in
(only showing first 100 items - show all)- Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
- Sampling methods for shortest vectors, closest vectors and successive minima
- An algorithm for finding a shortest vector in a two-dimensional modular lattice
- Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
- Lattice-based key exchange on small integer solution problem
- Shortest vector from lattice sieving: a few dimensions for free
- On the asymptotic complexity of solving LWE
- Sieving for closest lattice vectors (with preprocessing)
- On lattice-based algebraic feedback shift registers synthesis for multisequences
- Approximate short vectors in ideal lattices of \(\mathbb{Q}(\zeta_{p^e})\) with precomputation of \({\mathrm {Cl}}(\mathcal{O}_K)\)
- FPT-algorithms for some problems related to integer programming
- On the complexity of the discrete logarithm and Diffie-Hellman problems
- Noisy Chinese remaindering in the Lee norm
- Security of most significant bits of \(g^{x^{2}}\).
- Computing sparse multiples of polynomials
- Greedy algorithm computing Minkowski reduced lattice bases with quadratic bit complexity of input vectors
- Approximate Voronoi cells for lattices, revisited
- Noisy polynomial interpolation modulo prime powers
- Approximate CVP\(_p\) in time \(2^{0.802n}\)
- The randomized slicer for CVPP: sharper, faster, smaller, batchier
- A \(2^{n/2}\)-time algorithm for \(\sqrt{n} \)-SVP and \(\sqrt{n} \)-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP
- On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem
- Advanced lattice sieving on GPUs, with tensor cores
- Slide reduction, revisited -- filling the gaps in SVP approximation
- Improved lattice enumeration algorithms by primal and dual reordering methods
- Lower bounds on lattice sieving and information set decoding
- Covering convex bodies and the closest vector problem
- Approximate CVP in time \(2^{0.802 n}\) -- now in any norm!
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Pseudorandom functions in NC class from the standard LWE assumption
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes
- The remote set problem on lattices
- On the complexity of quasiconvex integer minimization problem
- Fast LLL-type lattice reduction
- Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
- Scalable revocable identity-based signature over lattices in the standard model
- Estimating quantum speedups for lattice sieves
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting)
- An improved method for predicting truncated multiple recursive generators with unknown parameters
- Finding shortest lattice vectors in the presence of gaps
- Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem
- How (not) to instantiate ring-LWE
- A sieve algorithm based on overlattices
- Approximating the densest sublattice from Rankin's inequality
- A \(O(1/\epsilon ^{2})^{n }\)-time sieving algorithm for approximate integer programming
- Solving the shortest vector problem in 2ⁿ time using discrete Gaussian sampling (extended abstract)
- A fast phase-based enumeration algorithm for SVP challenge through \(y\)-sparse representations of short lattice vectors
- Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing
- Lattice Point Enumeration on Block Reduced Bases
- A three-level sieve algorithm for the shortest vector problem
- Fast heuristic algorithms for computing relations in the class group of a quadratic order, with applications to isogeny evaluation
- Gauss sieve algorithm on GPUs
- Optimal lower bounds for the Korkine-Zolotareff parameters of a lattice and for Schnorr's algorithm for the shortest vector problem
- Algorithms for the shortest and closest lattice vector problems
- Better key sizes (and attacks) for LWE-based encryption
- Analysis of Gauss-sieve for solving the shortest vector problem in lattices
- Approximating the closest vector problem using an approximate shortest vector oracle
- A Parallel Implementation of GaussSieve for the Shortest Vector Problem in Lattices
- Some sieving algorithms for lattice problems
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- scientific article; zbMATH DE number 3870586 (Why is no real title available?)
- Approximate common divisor problem and lattice sieving
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
- Explicit Hard Instances of the Shortest Vector Problem
- Sieve algorithms for the shortest vector problem are practical
- Finding short lattice vectors within Mordell's inequality
- The worst-case behavior of Schnorr's algorithm approximating the shortest nonzero vector in a lattice
- Cryptanalysis of General Lu-Lee Type Systems
- Rigorous and Efficient Short Lattice Vectors Enumeration
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- scientific article; zbMATH DE number 4045845 (Why is no real title available?)
- scientific article; zbMATH DE number 1313325 (Why is no real title available?)
- scientific article; zbMATH DE number 1354122 (Why is no real title available?)
- The extended \(k\)-tree algorithm
- scientific article; zbMATH DE number 1962809 (Why is no real title available?)
- On Polynomial-Factor Approximations to the Shortest Lattice Vector Length
- Predicting nonlinear pseudorandom number generators
- scientific article; zbMATH DE number 1852132 (Why is no real title available?)
- Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation
- A randomized sieving algorithm for approximate integer programming
- Short bases of lattices over number fields
- scientific article; zbMATH DE number 1445397 (Why is no real title available?)
- A survey of solving SVP algorithms and recent strategies for solving the SVP challenge
- Meta-heuristic approaches to solve shortest lattice vector problem
- Untraceability of partial blind and blind signature schemes
- Sieve, Enumerate, Slice, and Lift:
- Improved algorithms for the shortest vector problem and the closest vector problem in the infinity norm
- Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors
- Hermite’s Constant and Lattice Algorithms
- LLL: a tool for effective Diophantine approximation
- Cryptographic functions from worst-case complexity assumptions
- Just take the average! An embarrassingly simple \(2^n\)-time algorithm for SVP (and CVP)
- Faster exponential time algorithms for the shortest vector problem
- Lattice-Based Identification Schemes Secure Under Active Attacks
- A Digital Signature Scheme Based on CVP ∞
- Asymptotically Efficient Lattice-Based Digital Signatures
- Algorithmic Problems for Metrics on Permutation Groups
- Predicting Lattice Reduction
- Improved algorithms for the approximate k-List problem in Euclidean norm
This page was built for publication: A sieve algorithm for the shortest lattice vector problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176018)
