A knapsack type public key cryptosystem based on arithmetic in finite fields
Proceedings of CRYPTO 84 on Advances in cryptology
Proceedings of CRYPTO 84 on Advances in cryptology
An update on quantum cryptography
Proceedings of CRYPTO 84 on Advances in cryptology
The Cryptoanalysis of a New Public-Key Cryptosystem Based on Modular Knapsacks
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Provably Unforgeable Signatures
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
The Two Faces of Lattices in Cryptology
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
LR(k) Testing is Average Case Complete
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
About the XL algorithm over GF(2)
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Algorithms and theory of computation handbook
Using the inhomogeneous simultaneous approximation problem for cryptographic design
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
A public key cryptosystem based on three new provable problems
Theoretical Computer Science
| Hi-index | 0.00 |
The cryptographic security of the Merkle-Hellman cryptosystem has been a major open problem since 1976. In this paper we show that the basic variant of this cryptosystem, in which the elements of the public key are modular multiples of a superincreasing sequence, is breakable in polynomial time.