Cryptology ePrint Archive: Report 2013/050

Cryptanalysis and Improvement of Akleylek et al.'s cryptosystem

Roohallah Rastaghi

Abstract: Akleylek et al. [S. Akleylek, L. Emmungil and U. Nuriyev, A modified algorithm for peer-to-peer security, \textit{journal of Appl. Comput. Math.}, vol. 6(2), pp.258-264, 2007.], introduced a modified public-key encryption scheme with steganographic approach for security in peer-to-peer (P2P) networks. In this cryptosystem, Akleylek et al. attempt to increase security of the P2P networks by mixing ElGamal cryptosystem with knapsack problem. In this paper, we present a ciphertext-only attack against their system to recover message. In addition, we show that for their scheme \textit{completeness} property is not holds, and therefore, the receiver cannot \textit{uniquely} decrypts messages. Furthermore, we also show that this system is not chosen-ciphertext secure, thus the proposed scheme is vulnerable to man-in-the-middle-attack, one of the most pernicious attacks against P2P networks. Therefore, this scheme is not suitable to implement in the P2P networks.

We modify this cryptosystem in order to increase its security and efficiency. Our construction is the efficient CCA2-secure variant of the Akleylek et al.'s encryption scheme in the standard model, the \textit{de facto} security notion for public-key encryption schemes.

Category / Keywords: Cryptography, Cryptanalysis, Ciphertext-only attack, ElGamal cryptosystem, Knapsack problem, CCA2 security, Standard model.

Publication Info: This article is an extended/revised version of an ISCISC'12 paper.

Date: received 1 Feb 2013, last revised 25 Apr 2013

Contact author: r rastaghi59 at gmail com

Available formats: Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20130425:073524 (All versions of this report)

Discussion forum: Show discussion | Start new discussion