Cryptanalysis of another knapsack cryptosystem
At the last Eurocrypt meeting, a cryptosystem based on modular knapsacks was proposed (see ). We show that this system is not secure, and we describe two different ways of breaking it using the LLL algorithm. This is one more example of a cryptosystem that can be broken using this powerful algorithm (see [1, 13, 14]). For more details, the reader should refer to .
Unable to display preview. Download preview PDF.
- L. Adleman. On breaking the iterated Merkle-Hellman public key cryptosystem. Proceedings of the ACM Symposium on the Theory of Computing (1982) 402–412.Google Scholar
- E. Brickell. Solving low density knapsacks. Proceedings of Crypto 83.Google Scholar
- E. Brickell. Breaking Iterated Knapsacks. Proceedings of Crypto 84. Lecture Notes in Computer Science 196.Google Scholar
- E. Brickell and A. M. Odlyzko. Cryptanalysis: A survey of recent results. Proceedings IEEE 1988.Google Scholar
- Y. M. Chee. The Cryptanalysis of a New Public-Key Cryptosystem based on Modular Knapsacks. Proceedings of Crypto 91. Lecture Notes in Computer Science, to appear.Google Scholar
- M. J. Coster, A. Joux, B. A. LaMacchia, A. Odlyzko, C. P. Schnorr and J. Stern. Improved Low-Density Subset Sum Algorithms. To appear.Google Scholar
- R. Kannan. Improved algorithms for integer programming and related lattice problems. Proceedings of the ACM Symposium on the Theory of Computing. (1983), 193–206.Google Scholar
- R. Kannan, A. K. Lenstra and L. Lovàsz. Polynomial factorisation and nonrandomness of bits of algebraic and some transcendental numbers, Carnegie-Mellon University. Computer Science Department Technical Report (1984).Google Scholar
- J. C. Lagarias and A. M. Odlyzko. Solving low-density subset sum problems. Proceedings of IEEE symposium on the foundations of Computer Science. (1983) 1–10.Google Scholar
- V. Niemi. A new trapdoor in knapsacks. Advances in Cryptography — Proceedings of EUROCRYPT 90, Lecture Notes in Computer Science, to appear.Google Scholar
- A. Shamir. A polynomial-time algorithm for breaking the basic Merkle-Hellman cryptosystem. Proceedings of th IEEE symposium on the foundations of Computer Science. (1982) 145–152.Google Scholar
- J. Stern. Secret linear congruential generators are not cryptographically secure. Proceedings of the IEEE symposium on the foundations of Computer Science. (1987) 421–426.Google Scholar
- J. Stern and P. Toffin. Crypanalysis of a public-key cryptosystem based on approximations by rational numbers. Advances in Cryptography — Proceedings of EUROCRYPT 90, Lecture Notes in Computer Science 473.Google Scholar