Cryptanalysis of the Chor-Rivest cryptosystem
Knapsack-based cryptosystems used to be popular in the beginning of public key cryptography before being all broken, all but the Chor-Rivest cryptosystem. In this paper, we show how to break this one with its suggested parameters: GF(p 24) and GF(25625). We also give direction on possible extensions of our attack.
- 1.P. Camion, H. Chabanne. On the Powerline system. In Advances in Cryptology, ICICS'97, Beijing, China, Lectures Notes in Computer Science 1334, pp. 381–385, Springer-Verlag, 1997.Google Scholar
- 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, U.S.A., Lectures Notes in Computer Science, pp. 54–65, Springer-Verlag, 1985.Google Scholar
- 6.A. Joux, J. Stern. Lattice Reduction: a Toolbox for the Cryptanalyst. To appear in Journal of Cryptology.Google Scholar
- 7.N. Koblitz. A Course in Number Theory and Cryptography, 2nd Edition, Graduate Texts in Mathematics 114, Springer-Verlag, 1994.Google Scholar
- 12.A. Shamir. A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem. In Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, Chicago, Illinois, U.S.A., pp. 145–152, IEEE, 1982.Google Scholar
- 13.C.P. Schnorr, H.H. Hörner. Attacking the Chor-Rivest Cryptosystem by improved lattice reduction. In Advances in Cryptology EUROCRYPT'95, Saint-Malo, France, Lectures Notes in Computer Science 921, pp. 1–12, Springer-Verlag, 1995.Google Scholar