Faster exponential time algorithms for the shortest vector problem
From MaRDI portal
Recommendations
- A sieve algorithm for the shortest lattice vector problem
- Solving the shortest vector problem in 2ⁿ time using discrete Gaussian sampling (extended abstract)
- Sieve algorithms for the shortest vector problem are practical
- scientific article; zbMATH DE number 3972987
- A sieve algorithm based on overlattices
Cited in
(75)- Improvements in the analysis of Kannan's CVP algorithm
- Algorithms for the densest sub-lattice problem
- Finding shortest lattice vectors faster using quantum search
- Quantum sieving for code-based cryptanalysis and its limitations for ISD
- Attacking ECDSA with nonce leakage by lattice sieving: bridging the gap with Fourier analysis-based attacks
- A survey of solving SVP algorithms and recent strategies for solving the SVP challenge
- Does the dual-sieve attack on learning with errors even work?
- A fast phase-based enumeration algorithm for SVP challenge through \(y\)-sparse representations of short lattice vectors
- On Polynomial-Factor Approximations to the Shortest Lattice Vector Length
- A Parallel Implementation of GaussSieve for the Shortest Vector Problem in Lattices
- Shortest vector from lattice sieving: a few dimensions for free
- Sieving for closest lattice vectors (with preprocessing)
- Lattice Sieving via Quantum Random Walks
- On pairwise Gaussian bases and LLL algorithm for three dimensional lattices
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Approximate Voronoi cells for lattices, revisited
- Advanced lattice sieving on GPUs, with tensor cores
- A new quantum oracle model for a hybrid quantum-classical attack on post-quantum lattice-based cryptosystems
- Sieve algorithms for the shortest vector problem are practical
- Approximate CVP_p in Time 2^{0.802 n}
- The worst-case behavior of Schnorr's algorithm approximating the shortest nonzero vector in a lattice
- Improved classical and quantum algorithms for the shortest vector problem via bounded distance decoding
- Concrete analysis of quantum lattice enumeration
- Algorithms for the shortest and closest lattice vector problems
- Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems
- Analyzing pump and jump BKZ algorithm using dynamical systems
- Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing
- Fast slicer for Batch-CVP: making lattice hybrid attacks practical
- Predicting module-lattice reduction
- Improved (provable) algorithms for the shortest vector problem via bounded distance decoding
- Structured ( ,+)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems
- Finding shortest lattice vectors in the presence of gaps
- Gauss sieve algorithm on GPUs
- Predicting the concrete security of LWE against the dual attack using binary search
- Improved algorithms for the approximate k-List problem in Euclidean norm
- Cryptanalysis of a quadratic compact knapsack public-key cryptosystem
- Better key sizes (and attacks) for LWE-based encryption
- Sieve algorithms for some orthogonal integer lattices
- Learning strikes again: the case of the DRS signature scheme
- Tight bounds on the expected number of holes in random point sets
- On the number of lattice points in a small sphere and a recursive lattice decoding algorithm
- Just take the average! An embarrassingly simple \(2^n\)-time algorithm for SVP (and CVP)
- Approximate CVP in time \(2^{0.802 n}\) -- now in any norm!
- Approximate CVP\(_p\) in time \(2^{0.802n}\)
- On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem
- Hermite’s Constant and Lattice Algorithms
- Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice
- Provable dual attacks on learning with errors
- Explicit Hard Instances of the Shortest Vector Problem
- Solving the shortest vector problem in 2ⁿ time using discrete Gaussian sampling (extended abstract)
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- New Results on the Remote Set Problem and Its Applications in Complexity Study
- Estimates of implementation complexity for quantum cryptanalysis of post-quantum lattice-based cryptosystems
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
- Formally verifying Kyber. Episode V: machine-checked IND-CCA security and correctness of ML-KEM in Easycrypt
- Accurate score prediction for Dual-Sieve attacks
- A sieve algorithm for the shortest lattice vector problem
- Classical and Quantum 3 and 4-Sieves to Solve SVP with Low Memory
- New NTRU Records with Improved Lattice Bases
- Development and comparison of quantum oracle models for the hybrid attack on post-quantum lattice-based cryptosystems
- Development and analysis of oracle for the hibrid attack on a cryptographic system NTRU using a quantum search algorithm
- A sieve algorithm based on overlattices
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- Analysis of Gauss-sieve for solving the shortest vector problem in lattices
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes
- Sieve, Enumerate, Slice, and Lift:
- Lower bounds on lattice sieving and information set decoding
- A lattice reduction algorithm based on sublattice BKZ
- The irreducible vectors of a lattice: some theory and applications
- Lattice Point Enumeration on Block Reduced Bases
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
- scientific article; zbMATH DE number 1670828 (Why is no real title available?)
- Finding shortest vector using quantum NV sieve on Grover
- The linear transformation that relates the canonical and coefficient embeddings of ideals in cyclotomic integer rings
- Improved combinatorial algorithms for the inhomogeneous short integer solution problem
This page was built for publication: Faster exponential time algorithms for the shortest vector problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5417723)
