Solving Low Density Knapsacks

DOI10.1007/978-1-4684-4730-9_2zbMath1486.94082OpenAlexW1576694326MaRDI QIDQ5019315

Ernest F. Brickell

Publication date: 8 January 2022

Published in: Advances in Cryptology (Search for Journal in Brave)

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

zbMATH Keywords

knapsack problembasis reductionmodular mappingshort basis

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

A knapsack-based probabilistic encryption scheme ⋮ Safer parameters for the Chor-Rivest cryptosystem ⋮ A semantically secure public key cryptoscheme using bit-pair shadows ⋮ A provably secure non-iterative hash function resisting birthday attack ⋮ A New Non-Merkle-Damgård Structural Hash Function with Provable Security ⋮ A Public Key Cryptoscheme Using Bit-Pairs with Provable Semantical Security ⋮ 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 public key cryptosystem based on three new provable problems ⋮ Subset Sum Quantumly in 1.17 n . ⋮ Quadratic compact knapsack public-key cryptosystem ⋮ Unnamed Item

Cites Work

• Factoring polynomials with rational coefficients
• Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature scheme
• Solving low-density subset sum problems
• New directions in cryptography
• Reducibility among Combinatorial Problems
• Hiding information and signatures in trapdoor knapsacks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving Low Density Knapsacks