BS: Blockwise Sieve Algorithm for Finding Short Vectors from Sublattices
From MaRDI portal
Publication:6487348
DOI10.1007/978-3-031-15777-6_1zbMATH Open1512.94069MaRDI QIDQ6487348FDOQ6487348
Authors: Jinzheng Cao, Qingfeng Cheng, Xing-Hua Li, Yanbin Pan 
Publication date: 9 December 2022
Recommendations
- A sieve algorithm for the shortest lattice vector problem
- scientific article; zbMATH DE number 1852132
- Sieving for shortest vectors in ideal lattices: a practical perspective
- Sieving for shortest vectors in ideal lattices
- Sieve algorithms for the shortest vector problem are practical
- A three-level sieve algorithm for the shortest vector problem
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes
- Analysis of Gauss-sieve for solving the shortest vector problem in lattices
- Shortest vector from lattice sieving: a few dimensions for free
- An algorithm for finding a shortest vector in a two-dimensional modular lattice
Cites Work
- BKZ 2.0: Better lattice security estimates
- Title not available (Why is that?)
- Factoring polynomials with rational coefficients
- Better key sizes (and attacks) for LWE-based encryption
- Title not available (Why is that?)
- Predicting Lattice Reduction
- On lattices, learning with errors, random linear codes, and cryptography
- The LLL algorithm. Survey and applications
- Analyzing blockwise lattice algorithms using dynamical systems
- Finding short lattice vectors within Mordell's inequality
- Lattice enumeration using extreme pruning
- On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
- Title not available (Why is that?)
- Fast Lattice Point Enumeration with Minimal Overhead
- Title not available (Why is that?)
- New directions in nearest neighbor searching with applications to lattice sieving
- Practical, Predictable Lattice Basis Reduction
- Shortest vector from lattice sieving: a few dimensions for free
- The general sieve kernel and new records in lattice reduction
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
- Revisiting the expected cost of solving uSVP and applications to LWE
- Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
- Slide reduction, revisited -- filling the gaps in SVP approximation
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
Cited In (2)
This page was built for publication: BS: Blockwise Sieve Algorithm for Finding Short Vectors from Sublattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487348)
