A Chaotic Encryption Algorithm: Robustness against Brute-Force Attack

An encryption method is proposed that uses self-invertible matrix, modular function, Non-Linear shift register and the chaotic map known as Logistic. Parameter of Logistic map act as secret key. As chaotic system used in this algorithm is 1-D system, the key space is lesser than 2100 which shows that the method is weak against Brute-force attack but identifiability property of the selected key from key space assures its strength against the attack. Key sensitivity and plaintext sensitivity of the key chosen from key space for the algorithm is analyzed and its strength against known-plaintext attack is also tested and conclusions are derived.

[1]  W. Schwarz,et al.  Chaos and cryptography , 2001 .

[2]  L. Kocarev.  Chaos-based cryptography: a brief overview , 2001 .

[3]  Gonzalo Alvarez,et al.  Chaotic cryptosystems , 1999, Proceedings IEEE 33rd Annual 1999 International Carnahan Conference on Security Technology (Cat. No.99CH36303).

[4]  L. Kocarev,et al.  Chaos and cryptography: block encryption ciphers based on chaotic maps , 2001 .

[5]  Jiashu Zhang,et al.  An efficient cryptanalysis of a chaotic cryptosystem and its improvement , 2010, 2010 IEEE International Conference on Information Theory and Information Security.

[6]  Gonzalo Álvarez,et al.  Some Basic Cryptographic Requirements for Chaos-Based Cryptosystems , 2003, Int. J. Bifurc. Chaos.

[7]  G. Bloch,et al.  Message-Embedded Cryptosystems: Cryptanalysis and Identifiability , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[8]  L. P. L. D. Oliveira,et al.  Cryptography with chaotic mixing , 2008 .

[9]  Xiqin Wang,et al.  Linear Cryptanalysis for a Chaos-Based Stream Cipher , 2009 .