Advertisement

Cryptanalysis of another knapsack cryptosystem

  • Antoine Joux
  • Jacques Stern
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 739)

Abstract

At the last Eurocrypt meeting, a cryptosystem based on modular knapsacks was proposed (see [11]). 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 [4].

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    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
  2. [2]
    E. Brickell. Solving low density knapsacks. Proceedings of Crypto 83.Google Scholar
  3. [3]
    E. Brickell. Breaking Iterated Knapsacks. Proceedings of Crypto 84. Lecture Notes in Computer Science 196.Google Scholar
  4. [4]
    E. Brickell and A. M. Odlyzko. Cryptanalysis: A survey of recent results. Proceedings IEEE 1988.Google Scholar
  5. [5]
    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
  6. [6]
    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
  7. [7]
    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
  8. [8]
    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
  9. [9]
    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
  10. [10]
    A. K. Lenstra, H. W. Lenstra and L. Lovàsz. Factoring polynomials with rational coefficients. Math. Annalen 261 (1982) 515–534.CrossRefGoogle Scholar
  11. [11]
    V. Niemi. A new trapdoor in knapsacks. Advances in Cryptography — Proceedings of EUROCRYPT 90, Lecture Notes in Computer Science, to appear.Google Scholar
  12. [12]
    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
  13. [13]
    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
  14. [14]
    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

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Antoine Joux
  • Jacques Stern

There are no affiliations available

Personalised recommendations