Optimization of Entropy Characteristics for Pseudorandom Number Sequences Based on Hybrid Cellular Automata
DOI:
https://doi.org/10.31861/sisiot2026.1.01015Keywords:
cryptography, cellular automata, random number generators, entropy, Internet of thingsAbstract
This paper investigates the problem of generating high-entropy pseudorandom number sequences with enhanced statistical properties for systems with limited computational resources, specifically Internet of things devices. It has been established through rigorous testing that classical chaotic Wolfram cellular automata (CA) rules, such as Rules 30, 45, and 86, exhibit significant spectral vulnerabilities. These defects are confirmed by failures in the fast Fourier transform spectral test within the NIST SP 800-22 suite, which identifies hidden deterministic patterns. To address these security gaps, a hybrid method called XOR-MIX is proposed, based on the bitwise mixing of streams from independent CA layers. The mathematical foundation of this approach relies on the Piling-up Lemma, which demonstrates that the bitwise addition of independent sources with distinct statistical profiles exponentially reduces probability bias and masks spectral peaks. Experimental results were obtained through a high-performance implementation in the Rust programming language, utilizing memory-safe mechanisms and look-up table optimization. The analysis demonstrates a significant increase in the NIST statistical test pass rate to a level of 0.99 and the stabilization of Shannon entropy at 7.999998 bits per byte. Furthermore, the system architecture utilizes a "thick client" model with React/Next.js and SHA-256 for deterministic initialization, ensuring data privacy and integrity. The proposed approach provides an optimal balance between cryptographic strength, high throughput, and low computational complexity, making it suitable for hardware-constrained environments and future field-programmable gate array integrations.
Downloads
References
B. Yogi and A. K. Khan, “CAChaIoT: Hybrid lightweight image encryption for IoT using cellular automata and chaotic maps,” Future Robotics, Automation and Open, 2025. doi: 10.1016/j.fraope.2025.100361.
S. Wolfram, A New Kind of Science. Champaign, IL, USA: Wolfram Media, 2002.
A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications, NIST Special Publication 800-22 Rev. 1a, National Institute of Standards and Technology, 2010.
I. G. A. Poornima, C. A. Yogaraja, R. Venkatesh, et al., “Pseudo Random Number Generator Based on Cellular Automata with Self Organized Criticality,” SN Computer Science, 2024. doi: 10.1007/s42979-024-02750-3.
H. Kılıç, “Performance analysis of pseudo-random number generations of two-dimensional linear uniform cellular automata that considers initial state densities,” Gazi University Journal of Science, 2024. doi: 10.17341/gazimmfd.989265.
V. Pless, Introduction to the Theory of Error-Correcting Codes, 3rd ed. New York, NY, USA: Wiley-Interscience, 1998.
E. Barker and J. Kelsey, Recommendation for Random Number Generation Using Deterministic Random Bit Generators, NIST Special Publication 800-90A Rev. 1, 2015.
C. E. Shannon, “A Mathematical Theory of Communication,” Bell Syst. Tech. J., vol. 27, no. 3, pp. 379–423, 1948. doi: 10.1002/j.1538-7305.1948.tb01338.x.
Recommendation for the Entropy Sources Used for Random Bit Generation, NIST Special Publication 800-90B, National Institute of Standards and Technology, 2018.
M. Matsui, “Linear Cryptanalysis Method for DES Cipher,” in Advances in Cryptology – EUROCRYPT ’93, vol. 765, T. Helleseth, Ed. Berlin, Germany: Springer, 1994, pp. 386–397. doi: 10.1007/3-540-48285-7_33.
A. Levy et al., “Ownership is Theft: Experiences Building an OS in Rust,” in Proc. 15th Workshop on Hot Topics in Operating Systems (HotOS XV), 2015.
S. Klabnik and S. Nichols, The Rust Programming Language. San Francisco, CA, USA: No Starch Press, 2023.
J. Blandy, J. Orendorff, and L. Tindall, Programming Rust: Fast, Safe Systems Development. Sebastopol, CA, USA: O’Reilly Media, 2021.
“Next.js Documentation: Rendering and Security,” Vercel, 2024. [Online]. Available: https://nextjs.org/docs
D. S. Punithavathani and K. Sujatha, “Privacy-Preserving Web-Based Systems Using Client-Side Encryption,” Int. J. Comput. Sci. Inf. Secur., 2015.
Web Workers: Multithreaded Processing in HTML, W3C Recommendation, World Wide Web Consortium, 2021.
J. Archibald, “The State of Web Workers,” Google Developers Blog, 2020.
Secure Hash Standard (SHS), FIPS PUB 180-4, National Institute of Standards and Technology, 2015.
P P. Ping, F. Xu, and Z.-J. Wang, “Generating High-Quality Random Numbers by Next Nearest-Neighbor Cellular Automata,” in Proc. Int. Conf. Softw. Eng. Modernization (ICSEM 2013), 2013, p. 173. doi: 10.2991/icsem.2013.173.
A. Levina, D. Mukhamedjanov, D. Bogaevskiy, et al., “High Performance Parallel Pseudorandom Number Generator on Cellular Automata,” Preprints, 2022. doi: 10.20944/preprints202208.0016.v1.
Published
Issue
Section
License
Copyright (c) 2026 Security of Infocommunication Systems and Internet of Things
This work is licensed under a Creative Commons Attribution 4.0 International License.
