The Cryptoanalysis of a New Public-Key Cryptosystem Based on Modular Knapsacks

Authors:
Yeow Meng Chee;Antoine Joux;Jacques Stern
Affiliations:
-;-;-
Venue:
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Year:
1991

Citing 5
Cited 0

Cryptanalysis of a public-key crptosystem based on approximations by rational numbers

EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
A new trapdoor in knapsacks

EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems

FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Secret linear congruential generators are not cryptographically secure

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

At the 1990 EuroCrypt Conference, Niemi proposed a new public-key cryptosystem based on modular knapsacks. Y.M. Chee in Singapore, A. Joux and J. Stern in Paris independently found that this cryptosystem is insecure. Our two cryptanalytic methods are slightly different, but they are both based on the LLL algorithm. This is one more example of a cryptosystem that can be broken using this powerful algorithm.