Chaotic Cipher Using Arnolds and Duffings Map

  • Mina Mishra
  • V. H. Mankar
Part of the Advances in Intelligent Systems and Computing book series (volume 167)


This paper deals with the application of concept of identifiability based on output equality approach on chaotic ciphers developed using 2-D chaotic maps, Duffings and Arnolds Cat map and they are named as Duffings and Arnold’s Cat, according to the map used. Due to the less key space generally many chaotic cryptosystem developed are found to be weak against Brute force attack which is an essential issue to be solved. Thus, concept of identifiability proved to be a necessary condition to be fulfilled by the designed chaotic cipher to resist brute force attack, which is an exhaustive search. As 2-D chaotic maps provide more key space than 1-D maps thus they are considered to be more suitable. This work is accompanied with analysis results obtained from these developed cipher. Moreover, identifiable keys are searched for different input texts at various key values. The ciphers are also analyzed for plaintext sensitivity and key sensitivity for its validity to provide security.


Arnolds Cat map Duffings map Identifiability Brute force attack linear cryptanalysis Differential cryptanalysis Output-Equality approach 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Jakimoski, G., Kocarev, L.: Chaos and Cryptography: Block Encryption Ciphers Based on Chaotic Maps. IEEE Transactions on Circuits and Systems-I: Fundamental Theory and Applications 48(2), 163–169 (2001)MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    Anstett, F., Millerioux, G., Bloch, G.: Global adaptive synchroniza¬tion based upon polytopic observers. In: Proc. IEEE Int. Symp. Circuits Syst., Vancouver, BC, Canada (May 2004)Google Scholar
  3. 3.
    Yang, T.: A survey of chaotic secure communication systems. Int. J. Comput. Cogn. 2(2) (2004)Google Scholar
  4. 4.
    de Oliveira, L.P., Sobottka, M.: Cryptography with chaotic mixing. Chaos, Solitons and Fractals 35, 466–471 (2008)MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    Alvarez, G., Li, S.: Some Basic Cryptographic Requirements for Chaos-based Cryptosystems. Int. J. Bifurc. Chaos (2006)Google Scholar
  6. 6.
    Millérioux, G., Hernandez, A., Amigó, J.: Conventional cryptog¬raphy and message-embedding. In: Proc. 2005 Int. Symp. Nonlinear Theory and its Applications (NOLTA 2005), Bruges, Belgium, October 18-21 (2005)Google Scholar
  7. 7.
    Anstett, F., Millerioux, G., Bloch, G.: Message-embedded cryp-tosystems: Cryptanalysis and identifiability. In: Proc. 44th IEEE Conf. Decision and Control, Sevilla, Spain, December 12-15 (2005)Google Scholar
  8. 8.
    Yin, R., Yuan, J., Yang, Q., Shan, X., Wang, X.: Linear Cryptanalysis for a Chaos-based Stream Cipher. World Academy of Science, Engineering and Technology 60 (2009)Google Scholar
  9. 9.
    Masuda, N., Aihara, K.: Cryptosystems with Discretized chaotic maps. IEEE Trans. Circuits and Syst. I 49, 28–40 (2002)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Anstett, F., Millerioux, G., Bloch, G.: Chaotic Cryptosystems: Cryptanalysis and Identifiability. IEEE Transactions on Circuits and Systems—I 53(12) (December 2006)Google Scholar
  11. 11.
    Alvarez, G., Montoya, F., Romera, M., Pastor, G.: Cryptanalysis of a chaotic encryption system. Physics Letters A 276, 191–196 (2000)MathSciNetMATHCrossRefGoogle Scholar
  12. 12.
    Beth, T., Lazic, D.E., Mathias, A.: Cryptanalysis of Cryptosystems Based on Remote Chaos Replication. Springer, New York (1994)Google Scholar

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Nagpur UniversityNagpurIndia
  2. 2.Department of Electronics EngineeringGovernment PolytechnicNagpurIndia

Personalised recommendations