Cryptanalysis of the chor-rivest cryptosystem

Journal of Cryptology

Volumn 14, Issue 2, 2001, Pages 87-100

  Vaudenay, Serge ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

Finite fields; Knapsack cryptosystem

Indexed keywords

EID: 33646790786     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001450010005     Document Type: Article

References (13)

1. P. Camion, H. Chabanne. On the Powerline system. In Advances in Cryptology, ICICS '97, Beijing, Lectures Notes in Computer Science 1334, pp. 381-385, Springer-Verlag, Berlin, 1997.
2. B. Chor, R. L. Rivest. A knapsack-type public key cryptosystem based on arithmetic in finite fields. In Advances in Cryptology, CRYPTO '84, Santa Barbara, California, Lectures Notes in Computer Science 196, pp. 54-65, Springer-Verlag, Berlin, 1985.
3. B. Chor, R. L. Rivest. A knapsack-type public key cryptosystem based on arithmetic in finite fields. IEEE Transactions on Information Theory, vol. IT-34, pp. 901-909, 1988.
4. D. Coppersmith, J. Stern, S. Vaudenay. The security of the birational permutation signature schemes. Journal of Cryptology,vol. 10, pp. 207-221, 1997.
5. K. Huber. Specialised attack on Chor-Rivest public key cryptosystem. Electronics Letters,vol. 27, no. 23, p. 2130, 1991.
6. A. Joux, J. Stern. Lattice reduction: a toolbox for the cryptanalyst. Journal of Cryptology,vol. 11, pp. 161-185, 1998.
7. N. Koblitz. A Course in Number Theory and Cryptography,2nd edition, Graduate Texts in Mathematics 114, Springer-Verlag, New York, 1994.
8. H. W. Lenstra, Jr. On the Chor-Rivest knapsack cryptosystem. Journal of Cryptology,vol. 3, pp. 149-155, 1991.
9. A. K. Lenstra, H. W. Lenstra, Jr., L. Lovasz. Factoring polynomials with rational coefficients. Mathematische Annaler,vol. 261, pp. 515-534, 1982.
10. R. C. Merkle, M. Hellman. Hiding information and signatures in trap-door knapsacks. IEEE Transactions on Information Theory; vol. IT-24, pp. 525-530, 1978.
11. S. Pohlig, M. Hellman. An improved algorithm for computing logarithms over GF(q) and its cryptographic significance. IEEE Transactions on Information Theory, vol. IT-24, pp. 106-110, 1978.
12. C. P. Schnorr, H. H. Hörner. Attacking the Chor-Rivest cryptosystem by improved lattice reduction. In Advances in Cryptology, EUROCRYPT '95, Saint-Malo, Lectures Notes in Computer Science, 921, pp. 1-12, Springer-Verlag, Berlin, 1995.
13. A. Shamir. A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem. In Proceedings of the23rd IEEE Symposium on Foundations of Computer Science, Chicago, Illinois, pp. 145152, IEEE, New York, 1982.