Affiliation:
1. Department of Information Engineering, University of Pisa, Via G. Caruso, 16, 56122 Pisa, Italy
Abstract
Random number generators are a key element for various applications, such as computer simulation, statistical sampling, and cryptography. They are used to generate/derive cryptographic keys and non-repeating values, e.g., for symmetric or public key cyphers. The strength of a data protection system against cyber attacks corresponds to the strength of the weakest point in the security chain. Therefore, from a mathematical point of view, the security chain can be compromised even if the strongest algorithm is implemented. In fact, if the system requires keys or other random values and the generation process shows a certain vulnerability, the security of the system itself can be compromised. In this article, we present the most reliable tools and methodologies and the main standardisation efforts in the field of computer security to assess the quality of random number generators and ensure that they can be applied to computer security applications by offering adequate security strength. We offer a comprehensive guide that can be used as a quick and practical reference by developers of random number generators of any type to evaluate the random bit streams generated by implemented modules and determine whether or not they can be used in cybersecurity applications. Finally, we also present some use cases to which we applied the presented approach.
Funder
European Union’s Horizon 2020 research and innovation programme European Processor Initiative EPI SGA2
Italian Ministry of University and Research
Italian Ministry of Education and Research
Subject
Electrical and Electronic Engineering,Computer Networks and Communications,Hardware and Architecture,Signal Processing,Control and Systems Engineering
Reference25 articles.
1. Entropy and Randomness: From Analogic to Quantum World;Simion;IEEE Access,2020
2. Random number generators for large-scale parallel Monte Carlo simulations on FPGA;Lin;J. Comput. Phys.,2018
3. Ergun, S. (2015, January 7–9). Security analysis of a chaos-based random number generator for applications in cryptography. Proceedings of the 2015 15th International Symposium on Communications and Information Technologies (ISCIT), Nara, Japan.
4. Ryabko, B. (2020). Time-adaptive statistical test for random number generators. Entropy, 22.
5. Marsaglia, G. (2023, January 02). The Marsaglia Random Number CDROM Including the Diehard Battery of Tests of Randomness. Available online: http://www.stat.fsu.edu/pub/diehard/.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献