A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Solving low density subset sum problems
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Generating hard instances of lattice problems (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
New Public-Key Cryptosystem Using Braid Groups
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Security-Related Comments Regarding McEliece's Public-Key Cryptosystem
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Cryptosystems Based on an Analog of Heat Flow
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Analyzing Encryption Protocols Using Formal Verification Authentication Schemes
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
The Two Faces of Lattices in Cryptology
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
ACM Transactions on Algorithms (TALG)
Designs, Codes and Cryptography
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions
Computational Complexity
Analysis of the efficiency of the Chor-Rivest cryptosystem implementation in a safe-parameter range
Information Sciences: an International Journal
Equivalent Goppa codes and trapdoors to McEliece's public key cryptosystem
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
The Multivariate Algorithmic Revolution and Beyond
Improved cryptanalysis of a knapsack-based probabilistic encryption scheme
Information Sciences: an International Journal
New attacks for knapsack based cryptosystems
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
| Hi-index | 0.00 |
This paper presents an outline of an attack that we have used successfully to break iterated knapsacks. Although we do not provide a proof that the attack almost always works, we do provide some heuristic arguments. We also give a detailed description of the examples we have broken.