TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Open Access ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Open Access Research Article

Security analysis of cryptographic Boolean functions using a discrete mathematical model and machine learning

, * , , ,

* Corresponding author · click or hover a name for details

pp. 3219–3227Vol. 29Issue 8August 2026DOI: 10.47974/JDMSC-2748 Crossmark XML
Received:
01 Jan 2026
Published Online:
14 Aug 2026
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2748
Pages:
3219–3227

Abstract

Cryptographic security of symmetric primitives relies on the discrete mathematical properties of Boolean functions and S-boxes. While machine learning (ML) has shown effectiveness in cryptanalysis, many approaches lack theoretical grounding. This paper proposes an ML-based cryptanalysis framework rooted in Boolean function theory, integrating Walsh–Hadamard analysis, nonlinearity computation, and algebraic characterization. Boolean functions and S-boxes are modeled for precise evaluation of cryptographic strength. The study establishes theoretical links between nonlinearity and ML learnability, validated using neural classifiers. The framework is further extended to side-channel analysis under the Hamming weight model, enabling reliable key recovery. Results show that higher nonlinearity reduces ML learnability, though S-boxes may still exhibit vulnerabilities. Overall, ML-based cryptanalysis is shown to exploit inherent Boolean structural weaknesses, emphasizing the importance of discrete mathematical analysis in security evaluation.

Keywords

Subject Classifications

Primary 94A6006E30Secondary 68T0568Q3294A55

References

[1] C. Carlet, Boolean Functions for Cryptography and Coding Theory. Cambridge, U.K.: Cambridge University Press (2021).

[2] D. Jap and R. Picek, “Machine learning-based cryptanalysis: A survey,” IEEE Access, vol. 9, pp. 120245–120268 (2021).

[3] A. Gohr, “Improving attacks on round-reduced SPECK32/64 using deep learning,” in Advances in Cryptology – CRYPTO 2019, Lecture Notes in Computer Science. Cham, Switzerland: Springer (2019).

[4] K. Heuser and M. Zohner, “Spectral methods in cryptographic Boolean analysis,” Cryptography and Communications, vol. 13, no. 2, pp. 203–223 (2021).

[5] A. Canteaut, “Vector Boolean functions for cryptography,” in Encyclopedia of Cryptography and Security, 3rd ed. Berlin, Germany: Springer (2023).

[6] S. Bhasin, A. Chattopadhyay, D. Jap, S. Picek, and S. Guilley, “Deep learning for S-box and Boolean function cryptanalysis,” Designs, Codes and Cryptography, vol. 90, no. 8, pp. 1767–1792 (2022).

[7] M. Minsky and S. Papert, Perceptrons. Cambridge, MA, USA: MIT Press (1969).

[8] S. Baluja and M. Fischer, “Learning Boolean functions using neural networks,” Neural Computation, vol. 7, no. 3, pp. 505–524 (1995).

[9] T. Barthe, S. Belaïd, and F.-X. Standaert, “Security evaluation of deep learning-based side-channel attacks,” IACR Transactions on Cryptographic Hardware and Embedded Systems, no. 3, pp. 1–36 (2022).

[10] M. Rivain and E. Prouff, “Provable security of machine learning-based side-channel analysis,” Journal of Cryptographic Engineering, vol. 13, no. 1, pp. 1–19 (2023).

[11] Y. LeCun, Y. Bengio, and G. Hinton, “Deep learning,” Nature, vol. 521, no. 7553, pp. 436–444 (May 2015).

[12] P. Kocher, J. Jaffe, and B. Jun, “Differential power analysis,” in Advances in Cryptology – CRYPTO’99, Lecture Notes in Computer Science, vol. 1666. Berlin, Germany: Springer, pp. 388–397 (1999).

[13] R. Picek, A. Heuser, S. Guilley, and S. Bhasin, “Side-channel analysis and machine learning: A practical perspective,” ACM Computing Surveys, vol. 52, no. 4, pp. 1–37 (2020).

[14] D. Goyal, F. Sheth, P. Mathur, and A. K. Gupta, “Discrete mathematical models for enhancing cybersecurity: A mathematical and statistical analysis of machine learning approaches in phishing attack detection,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 27, no. 2-B, pp. 569–599 (2024).

[15] F. Sheth, P. Mathur, H. Shaikh, D. Kumar, S. Mishra, and A. K. Gupta, “Learning heat: High-fidelity experimental and Koo–Kleinstreuer–Li thermal conductivity predictions in nanofluids via advanced data augmentation and metaheuristic search,” International Communications in Heat and Mass Transfer, vol. 171, p. 110022 (2026).

[16] D. Goyal, A. Kumar, P. Mathur, F. Sheth, and A. K. Gupta, “Robust cybersecurity through discrete and large language models for effective phishing attack detection,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 28, no. 5-A, pp. 1621–1638 (2025).

Views: 56Downloads: 41Citations: 0