[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Log in

A novel method of S-box design based on discrete chaotic maps and cuckoo search algorithm

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

Substitution-boxes (S-boxes) are unique nonlinear elements, which are used to achieve the property of confusion in modern symmetric ciphers and offer resistance to cryptanalysis. The construction of strong S-boxes has gained considerable attention in the area of cryptography. In fact, the security of transmitted data is highly dependent on the strength of the S-boxes for the prevention of unauthorised access. Therefore, the creation of strong S-box with high nonlinearity score has been considered a significant challenge. This study presented a novel method for the designing of 8 × 8 S-boxes with selected cryptographic characteristics based on a cuckoo search (CS) algorithm and discrete-space chaotic map. Notably, the advantage of the proposed approach is indicated through the efficient randomisation and lower adjustable parameters in CS compared to GA and PSO. Also, this approach utilised a 1D discrete-space chaotic map with virtually unlimited key space to design initial S-boxes, which is another advantage over the methods based on continuous-space chaotic maps, which consist of the limited key space. Moreover, chaotic maps have a potential to overcome the trapping problem of a standard CS in the local optima, and they were used to generate initial S-boxes to achieve the desired quality and facilitate the metaheuristic search. Accordingly, the metaheuristic CS was used to find a notable S-box configuration which fulfilled the established criteria. This objective was achieved by searching for the optimal or near-optimal features which maximised the given fitness function. The performance of the proposed method was evaluated based on the established performance evaluation criteria, including bijectivity, nonlinearity, strict avalanche criteria, bit independence criteria, differential uniformity, and linear probability. Based on the results of proposed method performance was benchmarked against the results of the recently developed S-boxes, it was indicated that the S-boxes exhibited good cryptographic features and could resist various cryptanalysis attacks.

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

Access this article

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Ahmad M, Ahmad F, Nasim Z, Bano Z, Zafar S (2015) Designing chaos based strong substitution box. Paper presented at the eighth international conference on contemporary computing (IC3) (2015)

  2. Ahmad M, Bhatia D, Hassan Y (2015) A novel ant colony optimization based scheme for substitution box design. Proc Comput Sci 57:572–580

    Google Scholar 

  3. Ahmad M, Seeru F, Siddiqi AM, Masood S (2018) Dynamic 9× 9 substitution-boxes using Chaos-based heuristic search. In: soft computing: theories and applications. Springer, pp 839-851

  4. Ahmed HA, Zolkipli MF, Ahmad M (2018) A novel efficient substitution-box design based on firefly algorithm and discrete chaotic map. Neural Comput & Applic 31:7201–7210. https://doi.org/10.1007/s00521-018-3557-3

    Article  Google Scholar 

  5. Al Solami E, Ahmad M, Volos C, Doja M, Beg M (2018) A new hyperchaotic system-based design for efficient bijective substitution-boxes. Entropy 20(7):525

    Google Scholar 

  6. Alhadawi HS, Zolkipli MF, Ismail SM, Lambić D (2019) Designing a pseudorandom bit generator based on LFSRs and a discrete chaotic map. Cryptologia 43(3):190–211

    Google Scholar 

  7. Alzaidi AA, Ahmad M, Doja MN, Al Solami E, Beg MS (2018) A new 1D chaotic map and $\beta $-hill climbing for generating substitution-boxes. IEEE Access 6:55405–55418

    Google Scholar 

  8. Baronchelli A, Radicchi F (2013) Lévy flights in human behavior and cognition. Chaos, Solitons Fractals 56:101–105

    Google Scholar 

  9. Barthelemy P, Bertolotti J, Wiersma DS (2008) A Lévy flight for light. Nature 453(7194):495–498

    Google Scholar 

  10. Belazi A, El-Latif AAA (2017) A simple yet efficient S-box method based on chaotic sine map. Optik 130:1438–1444

    Google Scholar 

  11. Belazi A, El-Latif AAA, Rhouma R, Belghith S (2015) Selective image encryption scheme based on DWT, AES S-box and chaotic permutation. In: 2015 International Wireless Communications and Mobile Computing Conference (IWCMC). IEEE, pp 606–610

  12. Belazi A, El-Latif AAA, Belghith S (2016) A novel image encryption scheme based on substitution-permutation network and chaos. Signal Process 128:155–170

    Google Scholar 

  13. Belazi A, Khan M, El-Latif AAA, Belghith S (2017) Efficient cryptosystem approaches: S-boxes and permutation–substitution-based encryption. Nonlinear Dyn 87(1):337–361

    Google Scholar 

  14. Benrhouma O, Hermassi H, El-Latif AAA, Belghith S (2015) Cryptanalysis of a video encryption method based on mixing and permutation operations in the DCT domain. SIViP 9(6):1281–1286

    Google Scholar 

  15. Biham E, Shamir A (1991) Differential cryptanalysis of DES-like cryptosystems. J Cryptol 4(1):3–72

    MathSciNet  MATH  Google Scholar 

  16. Brown CT, Liebovitch LS, Glendon R (2007) Lévy flights in Dobe Ju/‘hoansi foraging patterns. Hum Ecol 35(1):129–138

    Google Scholar 

  17. Carlet C (2005) On highly nonlinear S-boxes and their inability to thwart DPA attacks. In: INDOCRYPT. Springer, pp 49–62

  18. Carlet C (2008) On the higher order nonlinearities of Boolean functions and S-boxes, and their generalizations. In: International Conference on Sequences and Their Applications. Springer, pp 345–367

  19. Çavuşoğlu Ü, Zengin A, Pehlivan I, Kaçar S (2017) A novel approach for strong S-box generation algorithm design based on chaotic scaled Zhongtang system. Nonlinear Dyn 87(2):1081–1094

    MATH  Google Scholar 

  20. Chen G (2008) A novel heuristic method for obtaining S-boxes. Chaos, Solitons Fractals 36(4):1028–1036

    MathSciNet  MATH  Google Scholar 

  21. Cui L, Cao Y (2007) A new S-box structure named affine-power-affine. Int J Innov Comput, Inform Control 3(3):751–759

    Google Scholar 

  22. Daemen J, Rijmen V (2013) The design of Rijndael: AES-the advanced encryption standard. Springer Science & Business Media

  23. Dawson M, Tavares SE (1991) An expanded set of S-box design criteria based on information theory and its relation to differential-like attacks. Workshop Theory Appl Cryptograph Techn 352–367

  24. El-Latif AAA, Li L, Wang N, Niu X (2011) Image encryption scheme of pixel bit based on combination of chaotic systems. In: 2011 Seventh International Conference on Intelligent Information Hiding and Multimedia Signal Processing. IEEE, pp 369–373

  25. El-Latif AAA, Li L, Wang N, Peng J-L, Shi Z-F, Niu X (2012) A new image encryption scheme for secure digital images based on combination of polynomial chaotic maps. Res J Appl Sci Eng Technol 4(4):322–328

    Google Scholar 

  26. El-Latif AAA, Li L, Wang N, Li Q, Niu X A (2012) new image encryption based on chaotic systems and singular value decomposition. In: Fourth International Conference on Digital Image Processing (ICDIP 2012). International Society for Optics and Photonics, p 83343F

  27. El-Latif AAA, Li L, Niu X (2014) A new image encryption scheme based on cyclic elliptic curve and chaotic system. Multimed Tools Appl 70(3):1559–1584

    Google Scholar 

  28. Farah T, Rhouma R, Belghith S (2017) A novel method for designing S-box based on chaotic map and teaching–learning-based optimization. Nonlinear Dyn 88(2):1059–1074

    Google Scholar 

  29. Huang L, Ding S, Yu S, Wang J, Lu K (2016) Chaos-enhanced cuckoo search optimization algorithms for global optimization. Appl Math Model 40(5–6):3860–3875

    MathSciNet  MATH  Google Scholar 

  30. Hussain I, Shah T, Gondal MA (2012) A novel approach for designing substitution-boxes based on nonlinear chaotic algorithm. Nonlinear Dynamics: 1–4

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

    MathSciNet  Google Scholar 

  32. Ivanov G, Nikolov N, Nikova S (2016) Reversed genetic algorithms for generation of bijective s-boxes with good cryptographic properties. Cryptogr Commun 8(2):247–276

    MathSciNet  MATH  Google Scholar 

  33. Jakimoski G, Kocarev L (2001) Chaos and cryptography: block encryption ciphers based on chaotic maps. IEEE Trans Circ Syst I: Fund Theory Appl 48(2):163–169

    MathSciNet  MATH  Google Scholar 

  34. Jamal SS, Khan MU, Shah T (2016) A watermarking technique with chaotic fractional S-box transformation. Wirel Pers Commun 90(4):2033–2049

    Google Scholar 

  35. Kanagaraj G, Ponnambalam S, Jawahar N (2013) A hybrid cuckoo search and genetic algorithm for reliability–redundancy allocation problems. Comput Ind Eng 66(4):1115–1124

    Google Scholar 

  36. Kazakevičius R, Ruseckas J (2014) Lévy flights in inhomogeneous environments and 1/f noise. Phys A: Stat Mech Appl 411:95–103

    MATH  Google Scholar 

  37. Khan M, Asghar Z (2018) A novel construction of substitution box for image encryption applications with Gingerbreadman chaotic map and S 8 permutation. Neural Comput & Applic 29(4):993–999

    Google Scholar 

  38. Khan M, Shah T (2015) An efficient construction of substitution box with fractional chaotic system. SIViP 9(6):1335–1338

    MathSciNet  Google Scholar 

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

    MathSciNet  Google Scholar 

  40. Khan M, Shah T, Gondal MA (2013) An efficient technique for the construction of substitution box with chaotic partial differential equation. Nonlinear Dyn 73(3):1795–1801

    MathSciNet  Google Scholar 

  41. Khan M, Shah T, Batool SI (2016) Construction of S-box based on chaotic Boolean functions and its application in image encryption. Neural Comput & Applic 27(3):677–685

    Google Scholar 

  42. Lambić D (2014) A novel method of S-box design based on chaotic map and composition method. Chaos, Solitons Fractals 58:16–21

    MATH  Google Scholar 

  43. Lambić D (2015) A new discrete chaotic map based on the composition of permutations. Chaos, Solitons Fractals 78:245–248

    MathSciNet  MATH  Google Scholar 

  44. Lambić D (2017) A novel method of S-box design based on discrete chaotic map. Nonlinear Dyn 87(4):2407–2413

    MathSciNet  Google Scholar 

  45. Lehmer DH (1960) Teaching combinatorial tricks to a computer. Proc Sympos Appl Math Combinatorial Anal 10:179–193

    MathSciNet  MATH  Google Scholar 

  46. Liu G, Yang W, Liu W, Dai Y (2015) Designing S-boxes based on 3-D four-wing autonomous chaotic system. Nonlinear Dyn 82(4):1867–1877

    MathSciNet  MATH  Google Scholar 

  47. Manjula G, Mohan H (2016) Constructing key dependent dynamic S-Box for AES block cipher system. In: 2016 2nd International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT). IEEE, pp 613–617

  48. Matsui M (1993) Linear cryptanalysis method for DES cipher. Workshop Theory Appl Cryptograph Techn 386–397

  49. Menezes AJ, Van Oorschot PC, Vanstone SA (1996) Handbook of applied cryptography. CRC press

  50. Mohamed NA, El-Azeim MA, Zaghloul A, El-Latif AAA (2015) Image encryption scheme for secure digital images based on 3D cat map and turing machine. In: 2015 7th International Conference of Soft Computing and Pattern Recognition (SoCPaR). IEEE, pp 230–234

  51. Mohanty PK, Parhi DR (2013) Cuckoo search algorithm for the mobile robot navigation. In: International Conference on Swarm, Evolutionary, and Memetic Computing. Springer, pp 527–536

  52. Murphy S, Robshaw MJB (2002) Key-dependent S-boxes and differential cryptanalysis. Des Codes Crypt 27(3):229–255

    MathSciNet  MATH  Google Scholar 

  53. Ouaarab A, Ahiod B, Yang X-S (2014) Discrete cuckoo search algorithm for the travelling salesman problem. Neural Comput & Applic 24(7–8):1659–1669

    Google Scholar 

  54. Özkaynak F (2017) Construction of robust substitution boxes based on chaotic systems. Neural Comput Appl 1–10

  55. Özkaynak F, Özer AB (2010) A method for designing strong S-boxes based on chaotic Lorenz system. Phys Lett A 374(36):3733–3738

    MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  57. Özkaynak F, Çelik V, Özer AB (2017) A new S-box construction method based on the fractional-order chaotic Chen system. SIViP 11(4):659–664

    Google Scholar 

  58. Pavlyukevich I (2007) Lévy flights, non-local search and simulated annealing. J Comput Phys 226(2):1830–1844

    MathSciNet  MATH  Google Scholar 

  59. Payne RB, Sorensen MD (2005) The cuckoos, vol 15. Oxford University Press,

  60. Peng J, El-Latif AAA, Belazi A, Kotulski Z (2017) Efficient chaotic nonlinear component for secure cryptosystems. In: 2017 Ninth International Conference on Ubiquitous and Future Networks (ICUFN). IEEE, pp 989–993

  61. Picek S, Marchiori E, Batina L, Jakobovic D (2014) Combining evolutionary computation and algebraic constructions to find cryptography-relevant Boolean functions. In: International Conference on Parallel Problem Solving from Nature. Springer, pp 822–831

  62. Pieprzyk J, Finkelstein G (1988) Towards effective nonlinear cryptosystem design. IEE Proc E-Comput Digit Tech 135(6):325–335

    Google Scholar 

  63. Reynolds AM, Frye MA (2007) Free-flight odor tracking in Drosophila is consistent with an optimal intermittent scale-free search. PLoS One 2(4):e354

    Google Scholar 

  64. Rodrigues D, Pereira LA, Almeida T, Papa JP, Souza A, Ramos CC, Yang X-S BCS (2013) A binary cuckoo search algorithm for feature selection. In: Circuits and Systems (ISCAS), 2013 IEEE International Symposium on. IEEE, pp 465–468

  65. Shannon CE (1949) Communication theory of secrecy systems. Bell Labs Tech J 28(4):656–715

    MathSciNet  MATH  Google Scholar 

  66. Shehab M, Khader AT, Al-Betar MA (2017) A survey on applications and variants of the cuckoo search algorithm. Appl Soft Comput 61:1041–1059

    Google Scholar 

  67. Shlesinger MF (2006) Mathematical physics: search research. Nature 443(7109):281–282

    Google Scholar 

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

    MATH  Google Scholar 

  69. Tian Y, Lu Z (2016) S-box: six-dimensional compound hyperchaotic map and artificial bee colony algorithm. J Syst Eng Electron 27(1):232–241

    Google Scholar 

  70. Tian Y, Lu Z (2017) Chaotic S-box: intertwining logistic map and bacterial foraging optimization. Math Probl Eng 2017:1–11

    MathSciNet  MATH  Google Scholar 

  71. ul Islam F, Liu G (2017) Designing S-Box Based on 4D-4Wing Hyperchaotic System. 3D Res 8(1):9

    Google Scholar 

  72. Wang Y, Xie Q, Wu Y, Du B (2009) A software for S-box performance analysis and test. Int Conf Elect Comm Bus Intel 125–128

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

    MATH  Google Scholar 

  74. Wang G-G, Deb S, Gandomi AH, Zhang Z, Alavi AH (2016) Chaotic cuckoo search. Soft Comput 20(9):3349–3362

    Google Scholar 

  75. Webster A, Tavares SE (1985) On the design of S-boxes. Conf Theory Appl Cryptograph Tech:523–534

  76. Yang X-S (2013) Bat algorithm and cuckoo search: a tutorial. In: Artificial Intelligence, Evolutionary Computing and Metaheuristics. Springer, pp. 421–434

  77. Yang X-S, Deb S (2009) Cuckoo search via Lévy flights. In: Nature & Biologically Inspired Computing. NaBIC 2009. World congress on, 2009. IEEE, pp 210–214

  78. Yang X-S, Deb S (2010) Engineering optimisation by cuckoo search. Int J Math Model Num Optim 1(4):330–343

    MATH  Google Scholar 

  79. Zaghloul A, Zhang T, Hou H, Amin M, El-Latif AAA, El-Wahab MSA (2014) A block encryption scheme for secure still visual data based on one-way coupled map lattice. Int J Sec Appl 8(4):89–100

    Google Scholar 

  80. Zahid AH, Arshad MJ, Ahmad M (2019) A novel construction of efficient substitution-boxes using cubic fractional transformation. Entropy 21(3):245

    MathSciNet  Google Scholar 

  81. Zhang T, El-Fatyany A, Li L, Amin M, El-Latif AAA (2015) Secret sharing-based chaotic image encryption. Int J Sec Appl 9(7):217–224

    Google Scholar 

  82. Zhang T, Chen CP, Chen L, Xu X, Hu B (2018) Design of highly nonlinear substitution boxes based on I-Ching operators. IEEE Trans Cybernet 48(12):3349–3358

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hussam S. Alhadawi.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Alhadawi, H.S., Majid, M.A., Lambić, D. et al. A novel method of S-box design based on discrete chaotic maps and cuckoo search algorithm. Multimed Tools Appl 80, 7333–7350 (2021). https://doi.org/10.1007/s11042-020-10048-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-020-10048-8

Keywords

Navigation