PRACTICAL SCHEME OF A HYBRID GENERATOR OF PSEUDORANDOMS BASED ON AUDIOENTROPY AND NONLINEAR BOOLEAN FUNCTIONS
DOI:
https://doi.org/10.28925/2663-4023.2025.30.959Keywords:
pseudorandom sequence generator, Boolean functions, nonlinearity, bilinear functions, audio entropy, Jiffy generator, cryptographic strength, NIST STS, cybersecurityAbstract
The article solves the urgent problem of generating crypto-resistant pseudorandom sequences (PRS) to ensure the cybersecurity of modern digital systems. PRS generators play a key role in the formation of encryption keys, initialization vectors, one-time authentication tokens, and other critical parameters of cryptographic protocols. Insufficient crypto-resistance of such generators can lead to the compromise of reliable protocols, which emphasizes the need to develop new methods that overcome the limitations of traditional deterministic approaches. Among these limitations are the predictability of sequences in the event of disclosure of the internal state, limited entropy of initial values, vulnerability to statistical attacks, and the absence of true randomness, which reduces efficiency in cryptographic applications. The article proposes and implements a practical scheme for constructing a hybrid pseudorandom sequence generator that combines audio entropy and nonlinear Boolean functions in algebraic normal form (ANF). The architecture is based on the dynamic synthesis of output sequences of modified Jiffy generators using ANF functions with high nonlinearity, which are generated randomly. Audio entropy obtained from natural microphone noise is used to initialize the initial states of the generators, which increases the unpredictability of the sequences. The architecture is based on a modified Jiffy generator with flexible shift register parameters (lengths of 47, 53 and 59 bits), fixed feedbacks based on characteristic polynomials with prime numbers and static configurations of the output function. Special emphasis is placed on the use of algebraic normal form (ANF) of Boolean functions, which allows for effective analysis and optimization of the properties of nonlinearity, correlation stability and cryptanalysis complexity. The proposed hybrid architecture combines physical sources of entropy with efficient pseudorandom generation algorithms, achieving a balance between unpredictability and performance. This is relevant for embedded devices and Internet of Things (IoT) systems, where computing resources are limited, classical sources of entropy are absent, and there are requirements for energy efficiency and real-time. Comprehensive testing using NIST SP 800-22 confirmed the high statistical quality of the generated sequences: for 7 configurations (nonlinearity 24–224) it showed 100% success.
Downloads
References
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
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
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
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
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(3), 18. https://doi.org/10.1007/s44443-025-00007-4
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
NIST Special Publication 800-22. "A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications." National Institute of Standards and Technology, 2010. https://csrc.nist.gov/ publications/detail/sp/800-22/rev-1a/final
Zurc, I. "HANDBOOK of APPLIED CRYPTOGRAPHY" . CRC Press, 1996. https://www.academia.edu/33795500/HANDBOOK_of_APPLIED_CRYPTOGRAPHY
Seberry, J., Zhang, X. M., & Zheng, Y. L. (1995). Nonlinearity and Propagation Characteristics of Balanced Boolean Functions. Information and Computation, 119(1), 1–13. https://doi.org/10.1006/inco.1995.1073
Carlet, C. "Boolean Functions for Cryptography and Error Correcting Codes." In: Crama, Y., Hammer, P. (eds) Boolean Models and Methods in Mathematics, Computer Science, and Engineering. Cambridge University Press, 2010. https://www.researchgate.net/publication/228720083_Boolean_Functions_for_Cryptography_and_Error_Correcting_Codes
Ferguson, N., Schneier, B., & Schneier, B. (2003). Practical cryptography. Wiley.
Cusick, T. W., & Stănică, P. (2009). Cryptographic Boolean functions and applications (1st edition). Academic Press.
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.