Development and analysis of massive parallelization of a lattice basis reduction algorithm
From MaRDI portal
Cites work
- A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths
- A survey of solving SVP algorithms and recent strategies for solving the SVP challenge
- A tutorial on high performance computing applied to cryptanalysis. (Invited talk abstract)
- Advanced lattice sieving on GPUs, with tensor cores
- Analysis of DeepBKZ reduction for finding short lattice vectors
- BKZ 2.0: Better lattice security estimates
- Bounds on packings of spheres in the Grassmann manifold
- Estimate all the \(\{\)LWE, NTRU\(\}\) schemes!
- Explicit formula for Gram-Schmidt vectors in LLL with deep insertions and its applications
- Factoring polynomials with rational coefficients
- Fast lattice basis reduction suitable for massive parallelization and its application to the shortest vector problem
- Hermite’s Constant and Lattice Algorithms
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1962809 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Improved algorithms for the approximate k-List problem in Euclidean norm
- Lattice attacks on NTRU and LWE: a history of refinements
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Lattice enumeration using extreme pruning
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
- Minkowski's Convex Body Theorem and Integer Programming
- New directions in nearest neighbor searching with applications to lattice sieving
- Numerical Methods for Computing Angles Between Linear Subspaces
- Parallel shortest lattice vector enumeration on graphics cards
- Predicting Lattice Reduction
- Progressive lattice sieving
- Second order statistical behavior of LLL and BKZ
- Shortest vector from lattice sieving: a few dimensions for free
- Statistics on special manifolds
- The general sieve kernel and new records in lattice reduction
- The Geometry of Algorithms with Orthogonality Constraints
- The ubiquity generator framework: 7 years of progress in parallelizing branch-and-bound
This page was built for publication: Development and analysis of massive parallelization of a lattice basis reduction algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6139332)
