An Improved Low-Density Subset Sum Algorithm

DOI10.1007/3-540-46416-6_4zbMath0774.11075OpenAlexW2069842959MaRDI QIDQ4037449

B. A. LaMacchia, Matthijs J. Coster, Andrew M. Odlyzko, Claus Peter Schnorr

Publication date: 18 May 1993

Published in: Advances in Cryptology — EUROCRYPT ’91 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-46416-6_4

zbMATH Keywords

knapsack problemcryptosystemslattice basis reductionsubset sum problem

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Lattices and convex bodies (number-theoretic aspects) (11H06) Boolean programming (90C09)

Related Items

Distribution of Hermite's constant and the shortest vector in lattices of dimension two, A knapsack-based probabilistic encryption scheme, Preimage selective trapdoor function: how to repair an easy problem, Subset Sum Quantumly in 1.17 n ., Improved low-density subset sum algorithms, Cryptanalysis of a knapsack-based probabilistic encryption scheme, Simultaneous reduction of a lattice basis and its reciprocal basis, Search for combinatorial objects using lattice algorithms -- revisited