Solving low density knapsacks

DOI10.1007/978-1-4684-4730-9_2MaRDI QIDQ5019315zbMATH OpenOpenAlexFDO

Authors Ernest F. Brickell

Publication date 8 January 2022

Published in Advances in cryptology. Proceedings of CRYPTO '84 (a workshop on the theory and application of cryptographic techniques held at the University of California, Santa Barbara, August 19--22, 1984) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4684-4730-9_2

zbMATH Keywords

basis reductionknapsack problemmodular mappingshort basis

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Solving low-density subset sum problems
• scientific article; zbMATH DE number 3880121
• An Improved Low-Density Subset Sum Algorithm
• A deterministic algorithm for modular knapsack problems
• Extension of Brickell’S Algorithm for Breaking High Density Knapsacks

Cites work

• Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature scheme
• Factoring polynomials with rational coefficients
• Hiding information and signatures in trapdoor knapsacks
• scientific article; zbMATH DE number 3856984 (Why is no real title available?)
• scientific article; zbMATH DE number 3880121 (Why is no real title available?)
• scientific article; zbMATH DE number 3693147 (Why is no real title available?)
• scientific article; zbMATH DE number 3533716 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• New directions in cryptography
• Reducibility among combinatorial problems
• Solving low-density subset sum problems

Cited in

(27)

• A pseudorandom number generator based on worst-case lattice problems
• A new fully polynomial time approximation scheme for the interval subset sum problem
• Improved broadcast attacks against subset sum problems via lattice oracle
• A knapsack-based probabilistic encryption scheme
• Safer parameters for the Chor-Rivest cryptosystem
• LLL-solver
• A new non-Merkle-Damgård structural hash function with provable security
• A public key cryptoscheme using bit-pairs with provable semantical security
• scientific article; zbMATH DE number 3880121 (Why is no real title available?)
• scientific article; zbMATH DE number 4199638 (Why is no real title available?)
• A semantically secure public key cryptoscheme using bit-pair shadows
• A provably secure non-iterative hash function resisting birthday attack
• An Improved Low-Density Subset Sum Algorithm
• A public key cryptosystem based on three new provable problems
• scientific article; zbMATH DE number 1339968 (Why is no real title available?)
• Modification of the Lagarias-Odlyzko method for solving the generalized knapsack problem and the systems of knapsack problems
• Adapting Density Attacks to Low-Weight Knapsacks
• Hiding information and signatures in trapdoor knapsacks
• Subset Sum Quantumly in 1.17 n .
• Worst-case to average-case hardness of LWE: an alternative perspective
• Subset-optimized BLS multi-signature with key aggregation
• Self-masking for hardening inversions
• Towards a modern LLL implementation
• Integer programming and cryptography
• A deterministic algorithm for modular knapsack problems
• Sums of lexicographically ordered sets
• Quadratic compact knapsack public-key cryptosystem

This page was built for publication: Solving low density knapsacks

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