Solving low-density subset sum problems
From MaRDI portal
Recommendations
Cited in
(83)- Some results on an encryption method using subset-sums of pseudo-recursive sequences
- Solving low density knapsacks
- Finding shortest lattice vectors faster using quantum search
- Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations
- Worst-case to average-case hardness of LWE: an alternative perspective
- Search for combinatorial objects using lattice algorithms -- revisited
- An Improved Low-Density Subset Sum Algorithm
- Tightly secure signature schemes from the LWE and subset sum assumptions
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems
- Non-standard approaches to integer programming
- From approximate to exact integer programming
- The optimal LLL algorithm is still polynomial in fixed dimension.
- Lattice points in high-dimensional spheres
- The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem
- Non-injective knapsack public-key cryptosystems
- Subset-optimized BLS multi-signature with key aggregation
- Safer parameters for the Chor-Rivest cryptosystem
- Solving dense subset-sum problems by using analytical number theory
- On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem
- An improved BKW algorithm for LWE with applications to cryptography and lattices
- Simultaneous reduction of a lattice basis and its reciprocal basis
- Automated simplification of large symbolic expressions
- Predicting Lattice Reduction
- La réduction des réseaux. Autour de l'algorithme de Lenstra, Lenstra, Lovász
- Hardness of approximating the closest vector problem with pre-processing
- Quadratic compact knapsack public-key cryptosystem
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- LLL-solver
- The existence of simple \(6\text{-}(14,7,4)\) designs
- An Improved Multi-set Algorithm for the Dense Subset Sum Problem
- A note on BDD problems with _2-gap
- Improved classical and quantum algorithms for the shortest vector problem via bounded distance decoding
- Obfuscated fuzzy Hamming distance and conjunctions from subset product problems
- Self-masking for hardening inversions
- STACS 2005
- Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach
- Tightly secure signatures from lossy identification schemes
- Solving exponential diophantine equations using lattice basis reduction algorithms
- On the IO-complexity and approximation languages
- Subset Sum Quantumly in 1.17 n .
- Lattice Reduction for Modular Knapsack
- Algorithms to construct Minkowski reduced and Hermite reduced lattice bases
- Succinct Certificates for Almost All Subset Sum Problems
- Solving random subset sum problem by l_p-norm SVP oracle
- Improved (provable) algorithms for the shortest vector problem via bounded distance decoding
- Finding shortest lattice vectors in the presence of gaps
- Low-density attack revisited
- Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms
- Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme
- Distribution of Hermite's constant and the shortest vector in lattices of dimension two
- From approximate to exact integer programming
- A Summary of McEliece-Type Cryptosystems and their Security
- Lower bounds of shortest vector lengths in random NTRU lattices
- Extending Regev's quantum algorithm to elliptic curves
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
- scientific article; zbMATH DE number 4074814 (Why is no real title available?)
- A new fully polynomial time approximation scheme for the interval subset sum problem
- scientific article; zbMATH DE number 7525510 (Why is no real title available?)
- On Lovász' lattice reduction and the nearest lattice point problem
- \(k\)-SUM in the sparse regime: complexity and applications
- The hardness of approximate optima in lattices, codes, and systems of linear equations
- A knapsack-based probabilistic encryption scheme
- Generation of solved instances of Multiconstraint Knapsack problem and its applications to Private Key Cipher
- Does subset sum admit short proofs?
- scientific article; zbMATH DE number 3880121 (Why is no real title available?)
- Integer programming and cryptography
- Integer Sets with Distinct Subset-Sums
- Improved low-density subset sum algorithms
- Moment subset sums over finite fields
- About some features of the transformed problems images
- Modification of the Lagarias-Odlyzko method for solving the generalized knapsack problem and the systems of knapsack problems
- Solving low-density multiple subset sum problems with SVP oracle
- Simultaneous approximation problems of p-adic numbers and p-adic knapsack cryptosystems -- Alice in p-adic numberland
- Improved broadcast attacks against subset sum problems via lattice oracle
- Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard
- Balanced integer solutions of linear equations
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
- A polynomial-time algorithm for solving the hidden subset sum problem
- Generalization of the subset sum problem and cubic forms
- The hardness of solving subset sum with preprocessing
- New Definition of Density on Knapsack Cryptosystems
- An improved balanced algorithm for the subset-sum problem
- Improved combinatorial algorithms for the inhomogeneous short integer solution problem
This page was built for publication: Solving low-density subset sum problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3770433)
