This Article 
 Bibliographic References 
 Add to: 
Cryptanalysis of a Diophantine Equation Oriented Public Key Cryptosystem
April 1997 (vol. 46 no. 4)
pp. 511-512

Abstract—Lin et al. proposed a new public-key cipher system whose security is based upon the Diophantine equations. In this note, we show that their scheme is insecure under the ciphertext only attack.

[1] Y.G. Desmedt, J.P. Vandewalle, and R.J.M. Govaerts, "A Critical Analysis of the Security of Knapsack Public-Key Algorithms," IEEE Trans. Information Theory, vol. 30, no. 4, pp. 601-611, 1984.
[2] C.H. Lin, C.C. Chang, and R.C.T. Lee, "A New Public-Key Cipher System Based Upon the Diophantine Equations," IEEE Trans. Computers, vol. 44, no. 1, pp. 13-19, Jan. 1995.
[3] R.C. Merkle and M.E. Hellman, Hiding Information and Signatures in Trapdoor Knapsack IEEE Trans. Information Theory, vol. 24, no. 5, pp. 525-530, Sept. 1978.
[4] K.H. Rosen, Elementary Number Theorem and Its Application, second edition. Reading, Mass.: Addison-Wesley, 1988.
[5] A. Shamir and R.E. Zipple, "On the Security of the Merkle-Hellman Cryptographic Scheme," IEEE Trans. Information Theory, vol. 26, no. 6, pp. 339-340, 1980.

Index Terms:
Public keys, knapsack cryptosystem, cryptography, cryptanalysis.
C.s. Laih, M.j. Gau, "Cryptanalysis of a Diophantine Equation Oriented Public Key Cryptosystem," IEEE Transactions on Computers, vol. 46, no. 4, pp. 511-512, April 1997, doi:10.1109/12.588074
Usage of this product signifies your acceptance of the Terms of Use.