Skip to main content
Log in

A novel method for designing S-box based on chaotic map and Teaching–Learning-Based Optimization

  • Original Paper
  • Published:
Nonlinear Dynamics Aims and scope Submit manuscript

Abstract

A new method for obtaining strong S-boxes based on chaotic map and Teaching–Learning-Based Optimization (TLBO) is presented in this paper. Our method presents eight rounds; each round contains two transformations: row left shifting and columnwise rotation. The vectors for the transformations are different from one round to another, and they are controlled by two keys to the logistic map. These two keys are optimized by using TLBO which aims to construct a strong S-box that satisfies to the criteria set in advance. Test for the following criteria such as bijectivity, nonlinearity, strict avalanche criteria, equiprobable inputs/outputs XOR distribution is analyzed. Additionally, we will provide many comparisons with other S-boxes and test of the sensitivity to keys. The results of performance test show that the proposed design S-boxes presents good cryptography proprieties and can resist to several attacks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Shannon, C.E.: Communication theory of secrecy system. Bell. Syst. Tech. J. 28, 656–715 (1949)

  2. Zkaynak, F., Yavuz, S.: Designing chaotic S-boxes based on time-delay chaotic system. Nonlinear Dyn. 74, 551–557 (2013)

  3. Hussain, I., Shah, T., Gondal, M.A., Mahmood, H.: An efficient approach for the construction of LET S-boxes using chaotic map. Nonlinear Dyn. 71, 133–140 (2013)

    Article  Google Scholar 

  4. Hussain, I., Shah, T., Gondal, M.A.: A novel approach for designing substitution-boxes based on nonlinear chaotic algorithm. Nonlinear Dyn. 70, 1791–1794 (2012)

    Article  MathSciNet  Google Scholar 

  5. Xiang, T., Wong, K., Liao, X., Tang, G., Chen, Y., Wong, K.: A novel block cryptosystem based on iterating a chaotic map. Phys. Lett. A 349, 109–115 (2006)

    Article  MATH  Google Scholar 

  6. Jakimoski, G., Kocarev, L.: Chaos and cryptography: block encryption ciphers. IEEE Trans. Circuits Syst. I Fundam. Theory Appl 48(2), 163–169 (2001)

    Article  MATH  Google Scholar 

  7. Lambic, D.: A novel method of S-box deseign based on chaptic map. Chaos Solitons Fractals 58, 16–21 (2014)

    Article  MATH  Google Scholar 

  8. Hussain, I., Shah, T., Gondal, M.A., Khan, W.A., Mahmood, H.: A group theoretic approach to construct cryptographically strong substitution boxes. Neural Comput Appl (2013). doi:10.1007/s00521-012-0914-5

    Google Scholar 

  9. Xiang, T., Wong, K., Lia, X.: A block cipher with symmetrical cryptosystem based on discretized two-dimensional chaotic map. Phys. Lett. A 364, 252–258 (2007)

    Article  Google Scholar 

  10. Wang, Y., Wong, K., Li, C., Li, Y.: A novel method to deseign S-box based on chaotic map and genetic algorithm. Phys. Lett. A 376, 827–833 (2012)

    Article  MATH  Google Scholar 

  11. Chen, G., Chen, Y., Liao, X.: An extended method for obtaining S-boxes based on 3-dimensional chaotic baker maps. Chaos Solitons Fractals 31, 571–579 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  12. Özkaynak, F., Özer, A.B.: A method for designing strong Sboxes based on chaotic Lorenz system. Phys. Lett. A 374, 3733–3738 (2010)

    Article  MATH  Google Scholar 

  13. Biham, E., Shamir, A.: Differential cryptanalysis of DESlike cryptosystems. J. Cryptol. 4(1), 3–72 (1991)

    Article  MATH  Google Scholar 

  14. Dawson, M., Tavares, S.: An expanded set of S-box design criteria based on information theory and its relation to differential-like attacks. In: Advances in Cryptology: Proceedings of EURO-CRYPT_91. Lecture Notes in Computer Science, pp. 352–367 (1991)

  15. Wang, Y., Xie, Q., Wu, Y., Du, B.: A software for S-box performance analysis and test. In: 2009 International Conference on Electronic Commerce and Business Intelligence, Beijing, China, pp. 125–128 (2009)

  16. Tang, G., Liao, X., Chen, Y.: A novel method for designing S-boxes based on chaotic maps. Chaos Solitons Fractals 23, 413–419 (2005)

    Article  MATH  Google Scholar 

  17. Khan, M., Shah, T., Mahmood, H., Gondal, M.A., Hussain, I.: A novel technique for the construction of strong S-boxes based on chaotic Lorenz systems. Nonlinear Dyn. 70, 2303–2311 (2012)

    Article  MathSciNet  Google Scholar 

  18. Hussain, I., Shah, T., Gondal, M.A., Mahmood, H.: A projective general linear group based algorithm for the construction of substitution box for block ciphers. Neural Comput Appl (2012). doi:10.1007/s00521-012-0870-0

    Google Scholar 

  19. Adams, C., Tavares, S.: Chapter-4.In: Advances in Cryptology: Proccedings of CRYPTO_89. Lecture Notes in Computer Science, pp. 612–615 (1989)

  20. Webster, A., Tavares, S.: On the design of S-boxes. In: Advances in Cryptology: Proc. of Crypto’85, Santa Barbara, USA. Lecture Notes in Computer Science, vol. 218, pp. 523–534 (1986)

  21. Pieprzyk, J., Finkelsten, G.: Towards effective nonlinear cryptosystem design. IEE Proc. Part E. Comput. Digit. Tech. 135, 325–335 (1988)

    Article  Google Scholar 

  22. Matsui, M.: Linear cryptanalysis method of DES cipher. In: Advances in Cryptology, Proc. Eurocrypt’93. LNCS, vol. 765, pp. 386–397. Springer, Berlin (1994)

  23. Henon, M.: A tow-dimensional mapping with strange attractor. Commun. math. Phys. 50, 69–77 (1976)

    Article  MATH  Google Scholar 

  24. Al-Shameri, W.: Dynamical properties of the Henon mapping. Int. J. Math. Anal. 6(49), 2419–2430 (2012)

    MathSciNet  MATH  Google Scholar 

  25. Mooney, A., Keating, John G., Heffernan, D.: A detailed study of the generation of optically detectable watermarks using the logistic map. Chaos Solitons and Fractals 30, 1088–1097 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  26. Marek, M., Schreiber, I.: Chaotic Behaviour of Deterministic Dissipative. Cambridge University Press, Cambridge (1991)

    Book  MATH  Google Scholar 

  27. Holland, J.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)

  28. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, Piscataway, NJ,1995, pp.1942–1948

  29. Akay, B., Karaboga, D.: A modified artificial bee colony (ABC) algorithm for constrained optimization problems. Chaos Applied Soft Computing (2010). doi:10.1016/j.asoc.2010.12.001

    MATH  Google Scholar 

  30. Karaboga, D.: An Idea Based on Honey Bee Swarm for Numerical Optimization. Chaos, Applied Soft Computing, technical REPORT-TR06, Erciyes University, Engineering Faculty,Computer Engineering Department (2005)

  31. Rao, R., Savsani, V., Vakharia, D.: Teaching–Learning-Based Optimization: an optimization methodfor continuous non-linear large scale problems. Inf. Sci. 183, 115 (2012)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tarek Farah.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Farah, T., Rhouma, R. & Belghith, S. A novel method for designing S-box based on chaotic map and Teaching–Learning-Based Optimization. Nonlinear Dyn 88, 1059–1074 (2017). https://doi.org/10.1007/s11071-016-3295-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11071-016-3295-y

Keywords

Navigation