STATISTICAL PROPERTIES OF THE PSEUDORANDOM SEQUENCE GENERATION ALGORITHM
DOI:
https://doi.org/10.37943/18LYCW2723Keywords:
cryptography; algorithms; random sequence; pseudorandom sequence; statistical testing.Abstract
One of the most important issues in the design of cryptographic algorithms is studying their cryptographic strength. Among the factors determining the reliability of cryptographic algorithms, a good pseudorandom sequence generator, which is used for key generation, holds particular significance. The main goal of this work is to verify the normal distribution of pseudorandom sequences obtained using the generation algorithm and demonstrate that there is no mutual statistical correlation between the values of the resulting sequence. If these requirements are met, we will consider such a generator reliable. This article describes the pseudorandom sequence generation algorithm and outlines the steps for each operation involved in this algorithm. To verify the properties of the pseudorandom sequence generated by the proposed algorithm, it was programmatically implemented in the Microsoft Visual C++ integrated development environment. To assess the statistical security of the pseudorandom sequence generation algorithm, 1000 files with a block length of 10000 bits and an initial data length of 256 bits were selected. Statistical analysis was conducted using tests by D. Knuth and NIST. As shown in the works of researchers, the pseudorandom sequence generation algorithm, verified by these tests, can be considered among the reliable algorithms. The results of each graphical test by D. Knuth are presented separately. The graphical tests were evaluated using values obtained from each test, while the chi-squared criterion with degrees of freedom was used to analyze the evaluation tests. The success or failure of the test was determined using a program developed by the Information Security Laboratory. Analysis of the data from the D. Knuth tests showed good results. In the NIST tests, the P-value for the selected sequence was calculated, and corresponding evaluations were made. The output data obtained from the NIST tests also showed very good results. The proposed pseudorandom sequence generation algorithm allows generating and selecting a high-quality pseudorandom sequence of a specified length for use in the field of information security.
References
Popereshnyak, S. (2020). Technique of the testing of pseudorandom sequences, Svitlana Popereshnyak. International Journal of Computing, 19(3), 387-398.
Park, S., Kim, K., Kim, K., Nam, C. (2022). Dynamical Pseudo-Random Number Generator Using Reinforcement Learning. Appl. Sci., 12(3377). https://doi.org/10.3390/app12073377
Pasqualini, L., Parton, M. (2020). Pseudo Random Number Generation: a Reinforcement Learning approach. International Workshop on Statistical Methods and Artificial Intelligence (IWSMAI), Procedia Computer Science, 170, 1122–1127.
Kietzmann, P., Schmidt, T.C., Wählisch, M.A. (2022). Guideline on Pseudorandom Number Generation (PRNG) in the IoT. ACM Comput. Surv., 54, 1–38. https://doi.org/10.1145/3453159
Dichtl, M., Golić, J.D. (2007). High-Speed True Random Number Generation with Logic Gates Only. In Cryptographic Hardware and Embedded Systems—CHES 2007: Lecture Notes in Computer Science Book Series, 2007, 45–62. https://doi.org/10.1007/978-3-540-74735-2_4
Khalique, Aqeel & Lone, Auqib & Ashraf, Syed. (2015). A Novel Unpredictable Temporal based Pseudo Random Number Generator. International Journal of Computer Applications. 117. 23-28. http://doi.org/10.5120/20615-3301
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
Maksymovych, V., Shabatura, M., Harasymchuk, O., Shevchuk, R., Sawicki, P., Zajac, T. (2022). Combined Pseudo-Random Sequence Generator for Cybersecurity. Sensors, 22(24),9700. https://doi.org/10.3390/s22249700
Ofelius Laia et.al., (2019). Application of Linear Congruent Generator in Affine Cipher Algorithm to Produce Dynamic Encryption. International Conference of SNIKOM 2018. Journal of Physics: Conference Series, Vol. 1361.
AL-khatib, Mohammed & Lone, Auqib. (2018). Acoustic Lightweight Pseudo Random Number Generator based on Cryptographically Secure LFSR. International Journal of Computer Network and Information Security, 10. 38-45. http://doi.org/10.5815/ijcnis.2018.02.05
Feng, Yulong & Hao, Lingyi. (2020). Testing Randomness Using Artificial Neural Network. IEEE Access. 8. 163685-163693. http://doi.org/10.1109/ACCESS.2020.3022098
Savelov, M. (2023). The limit joint distributions of statistics of three tests of the NIST package. Discrete Mathematics and Applications, 33(4), 247-257. https://doi.org/10.1515/dma-2023-0022
Bassham, L., Rukhin, A., Soto, J., Nechvatal, J., Smid, M., Leigh, S., Levenson, M., Vangel, M., Heckert, N., Banks, D. (2022). A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications. Special Publication (NIST SP); National Institute of Standards and Technology: Available online: https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=906762
Popereshnyak, S. (2019). Analysis of pseudorandom small sequences using multidimensional statistics, Proceedings of the 2019 3rd IEEE International Conference on Advanced Information and Communication Technologies (AICT’2019), 541-544.
Pierre, L'Ecuyer., Richard, Simard. (2007). TestU01: A C library for empirical testing of random number generators. ACM Transactions on Mathematical Software, 33(4):22-39. http://doi.org/10.1145/1268776.1268777
Sun., Y., Lo, B. (2018). Random number generation using inertial measurement unit signals for on-body IoT devices, Living in the Internet of Things: Cybersecurity of the IoT - 2018, 1-9, http://doi.org/10.1049/cp.2018.0028
Koçak, Onur. (2018). Modifications of knuth randomness tests for integer and binary sequences. Communications Faculty Of Science University of Ankara Series A1, Mathematics and Statistics. 67. 64-81. https://doi.org/10.1501/Commua1_0000000862
Kapalova, N., Khompysh, A., Arici, M., Algazy, K., & Pham, D. (2020). A block encryption algorithm based on exponentiation transform. Cogent Engineering, 7(1). https://doi.org/10.1080/23311916.2020.1788292
Khompysh, A., Kapalova, N., Lizunov, O., Dilmukhanbet, D., Kairat, S. (2023). Development of a new lightweight encryption algorithm. International Journal of Advanced Computer Science and Applications, 14(5), 452-459. https://doi.org/10.14569/IJACSA.2023.0140548
Burciu, P., Simion, E. (2019). A systematic approach of NIST statistical tests dependencies. Journal of Electrical Engineering, Electronics, Control and Computer Science, 5(1), 1-6. https://jeeeccs.net/index.php/journal/article/view/113/93
Sulak F., Uğuz M., Koçak O., Doğanaksoy A. (2017). On the independence of statistical randomness tests included in the NIST test suite. Turkish Journal of Electrical Engineering & Computer Sciences, 5(25), 3673-3683. http://doi.org/10.3906/elk-1605-212
Kapalova, N., Algazy, K., Haumen, A., Sakan, K. (2023). Statistical analysis of the key scheduling of the new lightweight block cipher. International Journal of Electrical and Computer Engineering (IJECE), 13(6), 817-6826. http://doi.org/10.11591/ijece.v13i6.pp6817-6826
Pikuzа, M. O., & Mikhnеvich, S. Yu. (2012). Testing of hardware random number generator using a set of NIST statistical tests. Reports of BSUIR, 19(4), 37-42. https://doi.org/10.35596/1729-7648-2021-19-4-37-42
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2024 Articles are open access under the Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Authors who publish a manuscript in this journal agree to the following terms:
- The authors reserve the right to authorship of their work and transfer to the journal the right of first publication under the terms of the Creative Commons Attribution License, which allows others to freely distribute the published work with a mandatory link to the the original work and the first publication of the work in this journal.
- Authors have the right to conclude independent additional agreements that relate to the non-exclusive distribution of the work in the form in which it was published by this journal (for example, to post the work in the electronic repository of the institution or publish as part of a monograph), providing the link to the first publication of the work in this journal.
- Other terms stated in the Copyright Agreement.