A polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem
From MaRDI portal
Publication:3346214
DOI10.1109/TIT.1984.1056964zbMath0552.94007MaRDI QIDQ3346214
Publication date: 1984
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (22)
Simultaneous diophantine approximation of rationals by rationals ⋮ Crypto Galore! ⋮ A knapsack-based probabilistic encryption scheme ⋮ A nonlinear public key cryptosystem ⋮ A Modified Technique for Reliable Image Encryption Method using Merkle-Hellman Cryptosystem and Rsa Algorithm ⋮ Mathematical problems in cryptology ⋮ A note on the concrete hardness of the shortest independent vector in lattices ⋮ Unnamed Item ⋮ Improved broadcast attacks against subset sum problems via lattice oracle ⋮ Convex hulls of superincreasing knapsacks and lexicographic orderings ⋮ Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP) ⋮ Preimage selective trapdoor function: how to repair an easy problem ⋮ A natural lattice basis problem with applications ⋮ Anonymous message communications with user hierarchy in a multicast system ⋮ Unnamed Item ⋮ Non-injective knapsack public-key cryptosystems ⋮ Quadratic compact knapsack public-key cryptosystem ⋮ Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems ⋮ Knapsack problems in groups ⋮ Computer algebra tales on Goppa codes and McEliece cryptography ⋮ Slide reduction, revisited -- filling the gaps in SVP approximation ⋮ A dynamic access control scheme based upon the knapsack problem
This page was built for publication: A polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem
