A CLASSIFICATION–STRUCTURAL APPROACH TO RANDOMNESS EVALUATION OF SHORT BINARY SEQUENCES IN CRYPTOGRAPHIC PROTECTION SYSTEMS AND IOT TELEMETRY
Abstract
The article addresses the problem of evaluating the randomness of short binary sequences used in cryptographic protec- tion systems and IoT telemetry as keys, authentication tokens, service markers, and identifiers. It is shown that traditional sta- tistical randomness test suites (NIST STS, DIEHARD, TestU01) are designed for long samples and lose reliability when applied to sequences of 8–128 bits, which are typical for lightweight protocols such as ZigBee, LoRaWAN, RFID, and embedded con- trollers. To overcome these limitations, a classification-driven structural approach to randomness assessment is proposed, which relies on the analysis of non-overlapping k-bit blocks, the construction of empirical frequency vectors, and the use of a maximum deviation statistic from the theoretical distribution. A theoretical estimate of the probability of large deviations is derived using Hoeffding’s inequality, allowing one to specify a threshold value of the criterion for a predefined significance level and formally control the error probability in decision-making. The proposed approach formalizes the problem of randomness evaluation as a classification task, which makes it possible to compare generators and filter out non-random sequences based on quality metrics. The experimental framework includes four classes of sequence sources (algorithmic PRNGs, the cryptographic AES-CTR generator, and hardware noise sensors). For each source, short fragments of 8–128 bits were generated and evaluated in compari- son with ENT and basic NIST SP 800-22 tests using metrics such as classification accuracy, Type II error, ROC characteristics, and computational performance. The results demonstrate that the proposed method provides higher classification accuracy, superior ROC indicators, and lower variability of results on short fragments, while maintaining acceptable computational complexity for deployment on microcontrollers. Practical application scenarios are outlined for IoT sensors, smart home systems, embedded controllers, and telemetry-based IDS/IPS solutions, where the proposed criterion can serve as a lightweight randomness quality module and enhance the overall resilience of cryptographic protocols against the exploitation of structural defects in generators.
References
2. Klimushyn P., Solianyk T., Mozhaiev O., Gnusov Y., Manzhai O., Svitlychny V. Crypto-resistant methods and random number generators in Internet of Things (IoT) devices. Innovative Technologies and Scientific Solutions for Industries. 2022. Vol. 2, No. 20. P. 22–34. DOI: 10.30837/ITSSI.2022.20.022
3. Ullah I., Meratnia N., Havinga P. J. M. Entropy as a Service: A Lightweight Random Number Generator for Decentralized IoT Applications. 2020 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops). 2020. P. 1–6. DOI: 10.1109/PerComWorkshops48775.2020. 9156205
4. Yu F., Li L., Tang Q., та ін. A Survey on True Random Number Generators Based on Chaos. Discrete Dynamics in Nature and Society. 2019. 2019. Article ID 2545123. 10 p. DOI: 10.1155/2019/2545123
5. Abutaha M., Atawneh B., Hammouri L., Kaddoum G. Secure lightweight cryptosystem for IoT and pervasive computing. Scientific Reports. 2022. Vol. 12, No. 1. Article 19649. DOI: 10.1038/s41598-022-20373-7
6. Нємкова О., Кіх М. Порівняльне дослідження тестів для оцінки статистичних характеристик генераторів випадкових та псевдовипадкових послідовностей. Кібербезпека: освіта, наука, техніка. 2024. Т. 4, № 24. С. 115–132. DOI: 10.28925/2663-4023.2024.24.115132.
7. Kaner S., Garipcan A. M., Erdem E. A novel deep learning-based statistical randomness evaluation test methodology for cryptographic applications. Journal of King Saud University – Computer and Information Sciences. 2025. Vol. 37. Article 264. https://doi.org/10.1007/s44443-025-00271-4
8. Proskurin D., Okhrimenko T., Gnatyuk S., Zhaksigulova D., Korshun N. Hybrid RNN-CNN-based model for PRNG identification. Classic, Quantum, and Post-Quantum Cryptography 2024: CEUR Workshop Proceedings. 2024. Vol. 3829. P. 47–53. URL: https://ceur-ws.org/Vol-3829/short6.pdf
9. Seyhan K. Classification of random number generator applications in information security. Journal of Information Security and Applications. 2022. Vol. 68. Article 103365. DOI: 10.1016/j.jisa.2022.103365
10. Popereshnyak S. Technique of the testing of pseudorandom sequences. International Journal of Computing. 2020. Vol. 19(3). P. 387–398. DOI: https://doi.org/10.47839/ijc.19.3.1888
11. Popereshnyak S., Novikov Y., Zhdanova Y. Cryptographic system security approaches by monitoring the random numbers generation. CEUR Workshop Proceedings. 2024. Vol. 3826. P. 301–309. Germany. ISSN 1613-0073. URL: https://ceur-ws.org/Vol-3826/short21.pdf
12. Поперешняк С. В. Застосування генератора псевдовипадкових чисел для підвищення ефективності технології smart dust в управлінні розумним будинком. Телекомунікаційні та інформаційні технології. 2022. № 4(77). С. 53–62. DOI: https://doi.org/10.31673/2412-4338.2022.045362
13. Poperehnyak S., Bakaiev O., Shevchuk Y. Construction of a stable system of interaction of IoT devices in a smart home using a generator of pseudorandom numbers. CEUR Workshop Proceedings. 2025. Vol. 3991. P. 349–362. URL: https://ceur-ws.org/Vol-3991/paper25.pdf.
ISSN 



