COMPLEX CRYPTOGRAPHIC EVALUATION OF A HYBRID GENERATOR OF PSEUDORANDOMS BASED ON AUDIO ENTROPY AND NONLINEAR BOOLEAN FUNCTIONS
DOI:
https://doi.org/10.28925/2663-4023.2025.31.1020Keywords:
pseudorandom sequence generator, Boolean functions, nonlinearity, cryptographic analysis, cryptographic stability, NIST testing, Diehard, TestU01, audioentropy, Jiffy generator, cybersecurityAbstract
The article presents the results of a comprehensive cryptographic evaluation of a hybrid pseudorandom sequence generator (PRSG), which combines audio entropy as a source of initial randomness, multiple Jiffy generators and dynamically selected nonlinear Boolean functions in algebraic normal form (ANF). The key feature of the architecture is the use of stochastically synthesized ANF functions with guaranteed nonlinearity, which ensures the uniqueness of the combining function at each system launch. Multilevel statistical testing of the generated sequences was carried out using three independent test packages: NIST SP 800-22, Diehard and TestU01 SmallCrush. Seven generator configurations (from 6 to 9 basic generators) with different levels of nonlinearity of ANF functions (24-224) were investigated. The results of NIST testing showed successful passing of all 15 basic tests for each configuration with an average in the range of 0.341-0.531. Diehard tests confirmed the excellent quality of all 22 statistical checks without critical deviations. TestU01 SmallCrush confirmed passing of all 15 tests with minimum not lower than 0.0056. Cryptographic analysis of sequences revealed optimal indicators: linear complexity , Shannon entropy , autocorrelation , lack of periodicity. Analysis of ANF functions by the method of differential distribution tables (DDT) showed a maximum differential probability in the range of 0.59-0.66, which is typical for search functions. It was established that all studied configurations meet the requirements for cryptographically stable generators and can be used in information security systems. The optimal configuration was found to be a configuration with 7 generators and ANF nonlinearity , which provides the best balance between speed (0.01 s) and cryptographic stability. The results obtained confirm that the proposed hybrid approach is effective and suitable for practical use in a wide range of cryptographic applications in cybersecurity systems.
Downloads
References
Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A. (2018). Handbook of applied cryptography (5th ed.). CRC Press. https://doi.org/10.1201/9781439821916
Ferguson, N., & Schneier, B. (2003). Practical cryptography. John Wiley & Sons. ISBN 978-0471223573
Kikh, M. V., & Nemkova, O. A. (2024). Methodology for improving the process of generating pseudo-random sequences. Bulletin of the Lviv State University of Life Safety, 30, 123–133. https://doi.org/10.32447/20784643.30.2024.12
Wu, X., Han, Y., Zhang, M., Zhu, S., Cui, S., Wang, Y., & Peng, Y. (2025). Pseudorandom number generators based on neural networks: A review. Journal of King Saud University – Computer and Information Sciences, 37(1), 101904. https://doi.org/10.1016/j.jksuci.2024.101904
Picek, S., Jakobovic, D., Miller, J. F., Batina, L., & Cupic, M. (2016). Cryptographic Boolean functions: One output, many design criteria. Applied Soft Computing, 40, 635–653. https://doi.org/10.1016/j.asoc.2015.10.066
Carlet, C., Ðurasevic, M., Jakobovic, D., Mariot, L., & Picek, S. (2025). Degree is important: On evolving homogeneous Boolean functions (Version 1). arXiv. https://doi.org/10.48550/ARXIV.2501.18407
Ryan, C., Kshirsagar, M., Vaidya, G., Cunningham, A., & Sivaraman, R. (2022). Design of a cryptographically secure pseudo random number generator with grammatical evolution. Scientific Reports, 12(1), 8602. https://doi.org/10.1038/s41598-022-11613-x
Kikh, M., & Nyemkova, E. (2025). Practical scheme of a hybrid generator of pseudorandom sequences based on audio entropy and nonlinear Boolean functions. Cybersecurity: Education, Science, Technology, 2(30), 180–194. https://doi.org/10.28925/2663-4023.2025.30.959
Andreeva, E., & Weninger, A. (2024). A TPRF-based pseudo-random number generator. Journal of Surveillance, Security and Safety, 5(1), 36–51. https://doi.org/10.20517/jsss.2023.45
Lou, Y., & Wang, Q. (2024). New constructions of balanced Boolean functions with the maximum possible Walsh supports. Discrete Applied Mathematics, 355, 262–267. https://doi.org/10.1016/j.dam.2024.05.007
Almaraz Luengo, E., & Román Villaizán, J. (2023). Cryptographically secured pseudo-random number generators: Analysis and testing with NIST statistical test suite. Mathematics, 11(23), 4812. https://doi.org/10.3390/math11234812
Manzoni, L., Mariot, L., & Menara, G. (2025). Combinatorial designs and cellular automata: A survey (Version 1). arXiv. https://doi.org/10.48550/ARXIV.2503.10320
Haider, T., Blanco, S. A., & Hayat, U. (2024). A novel pseudo-random number generator based on multivariable optimization for image-cryptographic applications. Expert Systems with Applications, 240, 122446. https://doi.org/10.1016/j.eswa.2023.122446
Kikh, M. V., & Nemkova, O. A. (2024). Comparative study of tests for assessing statistical characteristics of random and pseudorandom sequence generators. Cybersecurity: Education, Science, Technology, 4(24), 115–132. https://doi.org/10.28925/2663-4023.2024.24.115132
Carlet, C. (2010). Boolean functions for cryptography and error correcting codes. In Y. Crama & P. Hammer (Eds.), Boolean models and methods in mathematics, computer science, and engineering. Cambridge University Press. https://doi.org/10.1017/CBO9780511780448.011
Cusick, T. W., & Stănică, P. (2009). Cryptographic Boolean functions and applications. Academic Press. https://www.researchgate.net/publication/329018296_Cryptographic_Boolean_Functions_and_Applications_Second_edition
Tho, H. D., Thang, N. T., Nga, N. T. T., & Hoang, P. Q. (2018). An algorithm for improving algebraic degree of S-box coordinate Boolean functions based on affine equivalence transformation. Journal of Informatics and Mathematical Sciences, 10(1–2), 339–350. https://doi.org/10.26713/jims.v10i1-2.662
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 Михайло Кіх, Олена Нємкова
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
