Solving low-density multiple subset sum problems with SVP oracle

DOI10.1007/s11424-015-3324-9zbMath1461.90124OpenAlexW2341623690MaRDI QIDQ2416533

Feng Zhang, Yanbin Pan

Publication date: 23 May 2019

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-015-3324-9

zbMATH Keywords

latticemultiple subset sum problemlow-densitymultiple modular subset sum problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hierarchy of polynomial time lattice basis reduction algorithms
• Factoring polynomials with rational coefficients
• Improved low-density subset sum algorithms
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
• Lattice points in high-dimensional spheres
• Solving low-density subset sum problems
• Minkowski's Convex Body Theorem and Integer Programming
• Solving Simultaneous Modular Equations of Low Degree
• The hardness of the closest vector problem with preprocessing
• Adapting Density Attacks to Low-Weight Knapsacks
• Hiding information and signatures in trapdoor knapsacks

This page was built for publication: Solving low-density multiple subset sum problems with SVP oracle