A Fast Phase-based Enumeration Algorithm for SVP Challenge Through $$y$$-Sparse Representations of Short Lattice Vectors
From MaRDI portal
Publication:2942829
DOI10.1007/978-3-319-15943-0_7zbMath1356.94054OpenAlexW144050527MaRDI QIDQ2942829
Zhongxiang Zheng, Guizhen Zhu, Dan Ding, Yang Yu
Publication date: 11 September 2015
Published in: Information Security and Cryptology - ICISC 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-15943-0_7
lattice-based cryptographyshortest vector problem (SVP)\(y\)-sparse representationphase-based enumeration algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms to construct Minkowski reduced and Hermite reduced lattice bases
- A hierarchy of polynomial time lattice basis reduction algorithms
- Factoring polynomials with rational coefficients
- A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
- BKZ 2.0: Better Lattice Security Estimates
- Sieve algorithms for the shortest vector problem are practical
- Lattice Enumeration Using Extreme Pruning
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- Lattice-based Cryptography
- Minkowski's Convex Body Theorem and Integer Programming
- A sieve algorithm for the shortest lattice vector problem
- Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
- Fast Lattice Point Enumeration with Minimal Overhead
- New lattice-based cryptographic constructions
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
This page was built for publication: A Fast Phase-based Enumeration Algorithm for SVP Challenge Through $$y$$-Sparse Representations of Short Lattice Vectors
