Solving low-density multiple subset sum problems with SVP oracle

DOI10.1007/S11424-015-3324-9MaRDI QIDQ2416533zbMATH OpenOpenAlexFDO

Authors Yanbin Pan, Feng Zhang

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)

Recommendations

• Solving random subset sum problem by l_p-norm SVP oracle
• Improved low-density subset sum algorithms
• Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach
• STACS 2005
• Solving low-density subset sum problems

Cites work

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

Cited in

(5)

• Solving random subset sum problem by l_p-norm SVP oracle
• Lower bounds for the rank of a matrix with zeros and ones outside the leading diagonal
• Effective lower bounds on the matrix rank and their applications
• Improved broadcast attacks against subset sum problems via lattice oracle
• MCS Extraction with Sublinear Oracle Queries

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

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