Skip to main content
SpringerLink
Log in

PWLCM-Based Random Search for Strong Substitution-Box Design

  • Conference paper
  • First Online:
Proceedings of the Second International Conference on Computer and Communication Technologies

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 379))

Abstract

Substitution-boxes are the only source of nonlinearity in various symmetric encryption systems and responsible for inducing confusion of plaintext data. The robustness of these systems exclusively depends on the potentiality of S-boxes. The design methods having fast and simple computations which can yield effective S-boxes are preferred. In this paper, a new chaos-based random search is applied to construct cryptographically potent 8 × 8 S-box. The method explores the features of piecewise linear chaotic map for candidate generation and random search. The optimized S-box obtained is tested against standard statistical tests like bijectivity, equiprobable I/O XOR distribution, nonlinearity, and strict avalanche criteria revealing its superior performance. The proffered substitution-box is further compared with some contemporary chaotic substitution-boxes. The results confirm a consistent design, suitable for building strong block encryption systems.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

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

    Article  MATH  MathSciNet  Google Scholar 

  2. Menezes, A.J., Oorschot, P.C.V., Vanstone S.A.: Handbook of Applied Cryptography, CRC Press (1997)

    Google Scholar 

  3. Ahmad, M., Khan, P.M., Ansari, M.Z.: A simple and efficient key-dependent S-box design using fisher-yates shuffle technique. In: Martínez, P.G., Thampi, S.M., Ko, R., Shu, L. (eds.) SNDS 2014. CCIS, vol. 420, pp. 540–550. Springer, Heidelberg (2014)

    Google Scholar 

  4. Ahmad, M., Chugh, H., Goel, A., Singla, P.: A chaos based method for efficient cryptographic S-box design. In: Thampi, S.M., Atrey, P.K., Fan, C.-I., Pérez, G.M. (eds.) SSCC 2013. CCIS, vol. 377, pp. 130–137. Springer, Heidelberg (2013)

    Google Scholar 

  5. Alvarez, G., Li, S.: Some basic cryptographic requirements for chaos-based cryptosystems. Int. J. Bifurcat. Chaos 16(8), 2129 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  6. Li, S., Chen, G., Mou, X.: On the dynamical degradation of digital piecewise linear chaotic maps. Int. J. Bifurcat. Chaos 15(10), 3119–3151 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  7. Kanso, A., Yahyaoui, H., Almulla, M.: Keyed hash function based on a chaotic map. Inf. Sci. 186(1), 249–264 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  8. Hermassi, H., Rhouma, R., Belghith, S.: Improvement of an image encryption algorithm based on hyper-chaos. Telecommun. Syst. 52(2), 539–549 (2013)

    Google Scholar 

  9. Webster, A.F., Tavares, S.E.: On the design of S-boxes. Adv. Cryptology Lect. Notes Comput. Sci. 218, 523–534 (1986)

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  11. Youssef, A.M., Tavares, S.E., Gong, G.: On some probabilistic approximations for AES-like S-boxes. Discrete Math. 306(16), 2016–2020 (2006)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  13. Cusick, T.W., Stanica, P.: Cryptographic Boolean Functions and Applications. Elsevier, Amsterdam (2009)

    Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  16. Wang, Y., Wong, K.W., Liao, X., Xiang, T.: A block cipher with dynamic S-boxes based on tent map. Commun. Nonlinear Sci. Numer. Simul. 14(7), 3089–3099 (2009)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  18. Khan, M., Shah, T., Mahmood, H., Gondal, M.A.: An efficient method for the construction of block cipher with multi-chaotic systems. Nonlinear Dyn. 71(3), 489–492 (2013)

    Article  MathSciNet  Google Scholar 

  19. Khan, M., Shah, T.: An efficient construction of substitution box with fractional chaotic system. SIViP (2013). doi:10.1007/s11760-013-0577-4

    Google Scholar 

  20. Gondal, M.A., Raheem, A., Hussain, I.: A scheme for obtaining secure S-boxes based on chaotic Baker’s map 3D. Research 5(3), 1–8 (2014)

    Google Scholar 

  21. Yin, R., Yuan, J., Wang, J., Shan, X., Wang, X.: Designing key-dependent chaotic S-box with large key space. Chaos, Solitons Fractals 42(4), 2582–2589 (2009)

    Article  MATH  Google Scholar 

  22. Szaban, M., Seredynski, F.: Designing cryptographically strong S-boxes with the use of cellular automata. Ann. UMCS Informatica Lublin-Polonia Sectio AI 8(2), 27–41 (2008)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Faculty of Engineering and Technology, Jamia Millia Islamia, New Delhi, 110025, India

    Musheer Ahmad, Danish Raza Rizvi & Zishan Ahmad

Authors
  1. Musheer Ahmad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Danish Raza Rizvi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zishan Ahmad
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Musheer Ahmad .

Editor information

Editors and Affiliations

  1. Dept. of Computer Science and Engineering, Anil Neerukonda Institute of Technology and Sciences, Visakhapatnam, India

    Suresh Chandra Satapathy

  2. Department of CSE, CMR Technical Campus, Hyderabad, India

    K. Srujan Raju

  3. Computer Science & Engineering, Kalyani University, Nadia, West Bengal, India

    Jyotsna Kumar Mandal

  4. Electronics and Communication Engineering, Shri Ramswaroop Memorial Group of Professional Colleges, Lucknow, Uttar Pradesh, India

    Vikrant Bhateja

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer India

About this paper

Cite this paper

Ahmad, M., Rizvi, D.R., Ahmad, Z. (2016). PWLCM-Based Random Search for Strong Substitution-Box Design. In: Satapathy, S., Raju, K., Mandal, J., Bhateja, V. (eds) Proceedings of the Second International Conference on Computer and Communication Technologies. Advances in Intelligent Systems and Computing, vol 379. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2517-1_45

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-2517-1_45

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-2516-4

  • Online ISBN: 978-81-322-2517-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation