Chaotic Encryption Scheme Using 1-D Chaotic Map
Mina Mishra, Vijay H. Mankar
DOI: 10.4236/ijcns.2011.47054   PDF    HTML     5,509 Downloads   9,504 Views   Citations


This paper proposes three different chaotic encryption methods using 1-D chaotic map known as Logistic map named as Logistic, NLFSR and Modified NLFSR according to the name of chaotic map and non-linear function involved in the scheme. The designed schemes have been crypt analyzed for five different methods for testing its strength. Cryptanalysis has been performed for various texts using various keys selected from domain of key space. Logistic and NLFSR methods are found to resist known plaintext attack for available first two characters of plaintext. Plaintext sensitivity of both methods is within small range along with medium key sensitivity. Identifiability for keys of first two of the scheme has not been derived concluding that methods may prove to be weak against brute-force attack. In the last modified scheme avalanche effect found to be improved compared to the previous ones and method is found to resist brute-force attack as it derives the conclusion for identifiability.

Share and Cite:

M. Mishra and V. Mankar, "Chaotic Encryption Scheme Using 1-D Chaotic Map," International Journal of Communications, Network and System Sciences, Vol. 4 No. 7, 2011, pp. 452-455. doi: 10.4236/ijcns.2011.47054.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] F. Dachselt and W. Schwarz, “Chaos and Cryptography,” IEEE Transactions on Circuits and Systems I, Vol. 48, No. 6, 2001, pp. 1498-1509. doi:10.1109/TCSI.2001.972857
[2] T. Yang, “A Survey of Chaotic Secure Communication Systems,” International Journal of Computational Cognition, Vol. 2, No. 2, 2004, pp. 3473-3749.
[3] G. Alvarez, F. Montoya, M. Romera and G. Pastor, 1999, “Chaotic Cryptosystems”, In: L. D. Sanson, Ed., ProCeedings of IEEE the 33rd 1999 Annual International Carnahan Conference on Security Technology, Madrid, 5-7 October 1999, pp. 332-338.
[4] G. Alvarez and S. Li, “Some Basic Cryptographic Requirements for Chaos-Based Cryptosystems,” International Journal of Bifurcation and Chaos, Vol. 16, No. 8, 2006, pp. 2129-2151. doi:10.1142/S0218127406015970
[5] S. N?mm and C. H. Moog, “Identifiability of Discrete-Time Nonlinear Systems,” Proceedings of the 6th IFAC Symposium on Nonlinear Control Systems, Stuttgart, Vol. 1, No. 3, 2004, pp. 477-489.
[6] F. Anstett, G. Millerioux and G. Bloch, “Chaotic Cryp- tosystems: Cryptanalysis and Identifiability”, IEEE Tran- sactions on Circuits and Systems, Vol. 53, No. 12, 2008, pp. 2673-2680.
[7] E. Solak, “On the Security of a Class of Discrete-Time Chaotic Cryptosys?tems,” Physics Letters A, Vol. 320, No. 5-6, 2004, pp. 389-395. doi:10.1016/j.physleta.2003.11.008
[8] N. Masuda and K. Aihara, “Cryptosystems with Discretized Chaotic Maps,” IEEE Transactions on Circuits and Systems I, Vol. 53, No. 6, 2002, pp. 1341-1352.
[9] F. Huang and Z. H. Guan, “Cryptosystem Using Chaotic Keys,” Chaos, Solitons and Fractals, Vol. 23, No. 3, 2005, pp. 851-855.doi:10.1016/j.chaos.2004.05.026

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.