Advertisement

A Chaotic Encryption Algorithm: Robustness against Brute-Force Attack

Part of the Advances in Intelligent Systems and Computing book series (volume 167)

Abstract

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.

Keywords

Non-Linear Shift Register Logistic map Brute-force attack Identifiability 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kocarev, L.: Chaos-based cryptography: A brief overview. IEEE Circuits Syst. Mag. 1(3), 6–21 (2001)CrossRefGoogle Scholar
  2. 2.
    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
  3. 3.
    Dachselt, F., Schwarz, W.: Chaos and cryptography. IEEE Trans. Circuits and Syst. I 48(6), 1498–1509 (2001)MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    de Oliveira, L.P., Sobottka, M.: Cryptography with chaotic mixing. Chaos, Solutions and Fractals 35(3), 466–471 (2008)MATHCrossRefGoogle Scholar
  5. 5.
    Alvarez, G., Montoya, F., Romera, M., Pastor, G.: Chaotic cryptosystems. In: Sanson, L.D. (ed.) Proc. 33rd Annual 1999 International Carnahan Conference on Security Technology, pp. 332–338. IEEE (1999)Google Scholar
  6. 6.
    Millérioux, G., Hernandez, A., Amigó, J.: Conventional cryptography and message-embedding. In: Proc. Int. Symp. Nonlinear Theory and its Applications, Bruges, vol. 35, pp. 469–472 (2005)Google Scholar
  7. 7.
    Guo, X., Zhang, J., Guo, X.: An Efficient Cryptanalysis of a Chaotic Cryptosystem and Its Improvement. In: IEEE Conference on Information Theory and Information Security, China, pp. 578–581 (2010)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, 799–804 (2009)Google Scholar
  9. 9.
    Alvarez, G., Li, S.: Some basic cryptographic requirements for chaos-based cryptosystems. Int. J. Bifurc. Chaos 16(8), 2129–2151 (2006)MathSciNetMATHCrossRefGoogle Scholar
  10. 10.
    Anstett, F., Millerioux, G., Bloch, G.: Message-embedded cryptosystems: Cryptanalysis and identifiability. In: Proc. 44th IEEE Conf. Decision and Control, vol. 44(3), pp. 2548–2553 (2005)Google Scholar

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Electronics & TelecommunicationNagpur UniversityNagpurIndia
  2. 2.Department of Electronics EngineeringGovernment PolytechnicNagpurIndia

Personalised recommendations