A fast phase-based enumeration algorithm for SVP challenge through y-sparse representations of short lattice vectors

DOI10.1007/978-3-319-15943-0_7MaRDI QIDQ2942829zbMATH OpenOpenAlexFDO

Authors Dan Ding, Guizhen Zhu, Yang Yu, Zhongxiang Zheng

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

zbMATH Keywords

\(y\)-sparse representationlattice-based cryptographyphase-based enumeration algorithmshortest vector problem (SVP)

Mathematics Subject Classification ID

Cryptography (94A60)

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

Cites work

• A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
• A hierarchy of polynomial time lattice basis reduction algorithms
• A sieve algorithm for the shortest lattice vector problem
• Algorithms to construct Minkowski reduced and Hermite reduced lattice bases
• Analyzing blockwise lattice algorithms using dynamical systems
• BKZ 2.0: Better lattice security estimates
• Factoring polynomials with rational coefficients
• Fast lattice point enumeration with minimal overhead
• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• scientific article; zbMATH DE number 1088230 (Why is no real title available?)
• scientific article; zbMATH DE number 1559544 (Why is no real title available?)
• scientific article; zbMATH DE number 1775383 (Why is no real title available?)
• scientific article; zbMATH DE number 2120513 (Why is no real title available?)
• Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
• Lattice enumeration using extreme pruning
• Lattice-based Cryptography
• Minkowski's Convex Body Theorem and Integer Programming
• New lattice-based cryptographic constructions
• Sieve algorithms for the shortest vector problem are practical
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942829)