Boolean function analysis for enhancing nonlinearity and resistance against linear and differential cryptanalysis
Aitha SrividyaAithaSrividya@rediffmail.comCentre for Multidisciplinary ResearchAnurag UniversityHyderabad, Telangana, 500088, IndiaView full profile → , Samaksh Goyalsamaksha.law@quantumeducation.inQuantum University Research CenterQuantum UniversityRoorkee, Uttarakhand, 247667, IndiaView full profile → , *Yazdani HasanCorresponding authoryazdani.hasan@niu.edu.inDepartment of Computer SciencesNoida International UniversityGreater Noida, Uttar Pradesh, 203201, IndiaView full profile → , Sanjesh Sadanand Pawalesanjesh.pawale@vupune.ac.inDepartment of Computer EngineeringVishwakarma UniversityPune, Maharashtra, 411048, IndiaView full profile → , Shakhboz Meylikulovshaxboz_meyliqulov@tues.uzDepartment of Information Technology and Exact SciencesTermez University of Economics and ServiceTermez, 190111, UzbekistanView full profile → , Chetansinh R. Vaghelacrvaghela.maths.gsc@gokuluniversity.ac.inFaculty of ScienceGokul Global UniversitySidhpur, Gujarat, 384151, IndiaView full profile → , Umidjon Musaevmusayev_umidjon@mamunedu.uzDepartment of General Professional SciencesMamun UniversityKhiva, 220900, UzbekistanView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 Apr 2026
- Published Online:
- 31 Oct 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-3046
- Pages:
- 4225–4236
Abstract
The analysis of Boolean functions is a core part of the design of secure cryptographic primitives, especially to make them more resistant to linear and differential cryptanalysis. This work explores further analytical methods in enhancing nonlinearity, correlation immunity and algebraic complexity of Boolean functions. The paper focuses on using the representations of algebraic normal forms, Walsh Hadamard spectral analysis and optimization techniques to create strong functions which can be applied to modern ciphering systems. An evaluation framework is created based on systematic evaluation to determine resistance to statistical and structural attacks. The experimental findings show that optimized Boolean functions attain a greater nonlinearity and lower correlation biases and thus improve cryptographic security. Comparative analysis shows the superiority of the constructions in comparison with the conventional ones on the level of resilience, efficiency and the ability to implement it. The discoveries are used to design safe substitution boxes and stream cipher elements of modern cryptographic designs.
Keywords
Subject Classifications
References
[1] L. Rovito, A. De Lorenzo, and L. Manzoni, “Discovering non-linear Boolean functions by evolving Walsh transforms with genetic programming,” Algorithms, vol. 16, no. 11, Art. no. 499 (2023), doi: 10.3390/a16110499.
[2] I. López-López, G. Sosa-Gómez, C. Segura, D. Oliva, and R. Rojas, “Metaheuristics in the optimization of cryptographic Boolean functions,” Entropy, vol. 22, no. 9, Art. no. 1052 (2020), doi: 10.3390/e22091052.
[3] S. Marochok and P. Zajac, “Algorithm for generating S-boxes with prescribed differential properties,” Algorithms, vol. 16, no. 3, Art. no. 157 (2023), doi: 10.3390/a16030157.
[4] E. Özçekiç, S. Kavut, and H. Kutucu, “Genetic approach to improve cryptographic properties of balanced Boolean functions using bent functions,” Computers, vol. 12, no. 8, Art. no. 159 (2023), doi: 10.3390/computers12080159.
[5] L. Li, L. Wang, Q. Zhao, and D. Zheng, “On resilient Boolean and vectorial Boolean functions with high nonlinearity,” Mathematics, vol. 10, no. 24, Art. no. 4822 (2022), doi: 10.3390/math10244822.
[6] N. Kim, W. Song, S. Baek, Y. Jeon, G. Kim, C. Lee, and J. Kim, “Differential and linear cryptanalysis of the IoT-friendly MGFN block cipher,” Electronics, vol. 15, no. 5, Art. no. 1126 (2026), doi: 10.3390/electronics15051126.
[7] A. A. Kale, A. M. Narad, S. R. Taywade, C. R. Digraskar, and A. Nanwatkar, “Navigating the digital frontier: Security and privacy challenges in India,” International Journal on Advanced Computer Theory and Engineering, vol. 14, no. 1, pp. 231–235 (2025), doi: 10.65521/ijacte.v14i1.471.
[8] I. El Gaabouri, M. Belkasmi, M. Senhadji, and B. E. Bhiri, “An in-depth analytical cryptanalysis for substitution boxes: Odd size case study,” Engineering Proceedings, vol. 112, no. 1, Art. no. 38 (2025), doi: 10.3390/engproc2025112038.
[9] O. Kuznetsov, N. Poluyanenko, E. Frontoni, S. Kandiy, M. Karpinski, and R. Shevchuk, “Enhancing cryptographic primitives through dynamic cost function optimization in heuristic search,” Electronics, vol. 13, no. 10, Art. no. 1825 (2024), doi: 10.3390/electronics13101825.
[10] F. A. Sadiq, H. A. Ramadhan, and A. A. Aubad, “Some results on the non-zero divisor graphs of Zn,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 28, no. 4-B, pp. 1301–1307 (2025), doi: 10.47974/JDMSC-2268.
[11] A. H. Zahid and M. J. Arshad, “An innovative design of substitution-boxes using cubic polynomial mapping,” Symmetry, vol. 11, no. 3, Art. no. 437 (2019), doi: 10.3390/sym11030437.
[12] P. Sahane, M. Gulhane, N. Rakesh, S. M. M. Naidu, M. Grover, and V. Mahajan, “Evaluating lightweight encryption schemes for resource-constrained devices in wireless sensor networks,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 28, no. 5-A, pp. 1803–1812 (2025).
[13] M. Jain, R. Verma, S. Kumar, A. Srivastava, A. Pillai, and V. S. Sharma, “Securing the future of wireless communications: Utilizing a blend of deep learning techniques for identifying risks in advanced communication networks,” Journal of Information and Optimization Sciences, vol. 46, no. 4-A, pp. 939–948 (2025), doi: 10.47974/JIOS-1819.
