A fast phase-based enumeration algorithm for SVP challenge through y-sparse representations of short lattice vectors
DOI10.1007/978-3-319-15943-0_7zbMATH Open1356.94054OpenAlexW144050527MaRDI QIDQ2942829FDOQ2942829
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
Recommendations
- A survey of solving SVP algorithms and recent strategies for solving the SVP challenge
- Shortest vector from lattice sieving: a few dimensions for free
- Parallel Gauss sieve algorithm: solving the SVP challenge over a 128-dimensional ideal lattice
- A new lattice sieving algorithm base on angular locality-sensitive hashing
- Faster exponential time algorithms for the shortest vector problem
lattice-based cryptographyshortest vector problem (SVP)\(y\)-sparse representationphase-based enumeration algorithm
Cites Work
- BKZ 2.0: Better Lattice Security Estimates
- A hierarchy of polynomial time lattice basis reduction algorithms
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
- A sieve algorithm for the shortest lattice vector problem
- Factoring polynomials with rational coefficients
- Minkowski's Convex Body Theorem and Integer Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lattice-based Cryptography
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Title not available (Why is that?)
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- Title not available (Why is that?)
- Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
- New lattice-based cryptographic constructions
- Lattice Enumeration Using Extreme Pruning
- Fast Lattice Point Enumeration with Minimal Overhead
- Sieve algorithms for the shortest vector problem are practical
- Algorithms to construct Minkowski reduced and Hermite reduced lattice bases
This page was built for publication: A fast phase-based enumeration algorithm for SVP challenge through \(y\)-sparse representations of short lattice vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942829)
