Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Cryptographic Standards for Random Number Generation

Leonardo Errati, Roberto La Scala, Mauro Patano

Published Jan 1, 2025• 0 citations
Publisher

Abstract

Random number generators (RNGs) are an often overlooked cornerstone for secure communications, cryptographic protocols, and scientific simulations. This workshop opens with an overview of the NIST framework for RNGs - from entropy sources to filters and test suites. An important conclusion is that the construction of secure, standardised Quantum RNGs is a multidisciplinary effort; this will be exemplified by an ongoing integration project for distributed IT infrastructures

DOI
10.69091/koine/vol-7-w39

Related papers

Quantum random number generators and their applications in cryptography

Mario Stipčević

Random number generators (RNG) are an important resource in many areas: cryptography (both quantum and classical), probabilistic computation (Monte Carlo methods), numerical simulations, industrial testing and labeling, hazard games, scientific research etc. Because today's computers are deterministic, they can not create random numbers unless complemented with a physical RNG. Randomness of a RNG can be defined and scientifically characterized and measured. Especially valuable is the information-theoretic provable RNG which, at state of the art, seem to be possible only by harvest of randomness inherent to certain (simple) quantum systems and such a generator we call Quantum RNG (QRNG). On the other hand, current industry standards dictate use of RNGs based on free running oscillators (FRO) whose randomness is derived from electronics noise present in logic circuits and which, although quantum in nature, cannot be strictly proven. This approach is currently used in FPGA and ASIC chips. We compare weak and strong aspects of the two approaches for use in cryptography and in general. We also give an alternative definition of randomness, discuss usage of single photon detectors in realization of QRNGs and give several examples where QRNG can significantly improve security of a cryptographic system.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 1, 2012•40 citations

Quantum Randomness in Cryptography—A Survey of Cryptosystems, RNG-Based Ciphers, and QRNGs

Anish Saini, Athanasios Tsokanos, Raimund Kirner

Cryptography is the study and practice of secure communication with digital data and focuses on confidentiality, integrity, and authentication. Random number generators (RNGs) generate random numbers to enhance security. Even though the cryptographic algorithms are public and their strength depends on the keys, cryptoanalysis of encrypted ciphers can significantly contribute to the unveiling of the cipher’s key. Therefore, to ensure high data security over a network, researchers need to improve the randomness of keys as they develop cryptosystems. Quantum particles have a leading edge in advancing RNG technology as they can provide true randomness, unlike pseudo-random numbers generators (PRNGs). In order to increase the level of the security of cryptographic systems based on random numbers, this survey focuses on three objectives: Cryptosystems with related cryptographic attacks, RNG-based cryptosystems, and the design of quantum random number generators (QRNGs). This survey aims to provide researchers with information about the importance of RNG-based ciphers and various research techniques for QRNGs that can incorporate quantum-based true randomness in cryptosystems.

Information•Jul 27, 2022•30 citations

On-line Entropy Estimation for Secure Information Reconciliation

Christian Zenger, Jan Zimmer, Jan-Felix Posielek +1 more

The random number generator (RNG) is a critical, if not in fact the most important, component in every cryptographic device. Introducing the symmetric radio channel, represented by estimations of location-specific, reciprocal, and time- variant channel characteristics, as a common RNG is not a trivi

EAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services (MobiQuitous)•Jan 1, 2015•10 citations

Quantum random number generators and their use in cryptography

Mario Stipčević

Random number generators (RNG) are an important resource in many areas: cryptography (both quantum and classical), probabilistic computation (Monte Carlo methods), numerical simulations, industrial testing and labeling, hazard games, scientific research, etc. Because today's computers are deterministic, they can not create random numbers unless complemented with a RNG. Randomness of a RNG can be precisely, scientifically characterized and measured. Especially valuable is the information-theoretic provable RNG (True RNG - TRNG) which, at state of the art, seem to be possible only by use of physical randomness inherent to certain (simple) quantum systems. On the other hand, current industry standard dictates use of RNG's based on free running oscillators (FRO) whose randomness is derived from electronics noise present in logic circuits and which cannot be strictly proven. This approach is currently used in 3-rd and 4-th generation FPGA and ASIC hardware, unsuitable for realization of quantum TRNG. We compare weak and strong aspects of the two approaches and discuss possibility of building quantum TRNG in the recently appeared Mixed Signal FPGA technology. Finally, we discuss several examples where use of a TRNG is critical and show how it can significantly improve security of cryptographic systems.

arXiv:1103.4381•International Convention on Information and Communication Technology, Electronics and Microelectronics•Mar 22, 2011•18 citations

A post-processing free Si nanocrystals based quantum random number generator

Zahra Bisadi, Alessio Meneghetti, Alessandro Tomasi +6 more

The generation of random numbers is, nowadays, of increasing importance. From economics to security and science, a number of applications require a large amount of random numbers generated with negligible correlation. Several (pseudo-)Random Number Generators (RNGs) are based on deterministic approaches that, in case of successful cryptographic attack, are subject to critical failure. A more secure source of randomness exploits quantum effects where the intrinsic uncertainty of the measured process renders the source truly random.

European Quantum Electronics Conference (EQEC)•Jun 21, 2015•0 citations

Kuantum Rastgele Sayı Üreteci Tasarımı ve Uygulaması

Safa Hanköylü

Randomness occurs in every kind of application in which random events should be experienced such as gambling, statistical calculations, computer simulations, information security and encryption. The quality of randomness is very important for the events using randomness. In particular, the need for random numbers used in the field of cryptology to be unpredictable increases the importance of random number generators. \n \nRandom Number Generators (RNGs) are software or hardware components that can be used to generate numbers that cannot be predicted in any pattern or relationship. Software-based RNGs are deterministic applications, while hardware-based RNGs are the devices that can be integrated into the system. \n \nEncryption using numbers generated by software-based RNG can be broken in varying times depending on the strength of the encryption because it was developed in deterministic ways. It is expected that the decoding time will be shortened considerably by the quantum computers which are tried to be developed today besides classic computers that takes a long time to analyze. The hardware RNGs are more powerful in randomness quality than software-based generators, but cost-effective and use-limited generators. \n \nQuantum Random Number Generators (QRNGs) is a kind of generator based on quantum physics laws instead of classical physics. In photonic based QRNGs are produced the random numbers after various software and hardware operations by taking advantage of the uncertainty of photons. These generated numbers are unpredictably strong random numbers. \n \nIn this study, a QRNG was obtained by using the RGB (Red-Green-Blue) values of the images taken from a white-single LED light source and the randomness tests of the produced numbers were carried out with the tests provided by NIST (National Institute of Standards and Technology). As a result, the numbers derived from the images successfully passed NIST tests and true random number sequences were obtained.

•Jan 1, 2019•0 citations
Random number generators (RNGs) are an often overlooked cornerstone for secure communications, cryptographic protocols, and scientific simulations. This workshop opens with an overview of the NIST framework for RNGs - from entropy sources to filters and test suites. An important conclusion is that the construction of secure, standardised Quantum RNGs is a multidisciplinary effort; this will be exemplified by an ongoing integration project for distributed IT infrastructures
Random number generators (RNG) are an important resource in many areas: cryptography (both quantum and classical), probabilistic computation (Monte Carlo methods), numerical simulations, industrial testing and labeling, hazard games, scientific research etc. Because today's computers are deterministic, they can not create random numbers unless complemented with a physical RNG. Randomness of a RNG can be defined and scientifically characterized and measured. Especially valuable is the information-theoretic provable RNG which, at state of the art, seem to be possible only by harvest of randomness inherent to certain (simple) quantum systems and such a generator we call Quantum RNG (QRNG). On the other hand, current industry standards dictate use of RNGs based on free running oscillators (FRO) whose randomness is derived from electronics noise present in logic circuits and which, although quantum in nature, cannot be strictly proven. This approach is currently used in FPGA and ASIC chips. We compare weak and strong aspects of the two approaches for use in cryptography and in general. We also give an alternative definition of randomness, discuss usage of single photon detectors in realization of QRNGs and give several examples where QRNG can significantly improve security of a cryptographic system.
Cryptography is the study and practice of secure communication with digital data and focuses on confidentiality, integrity, and authentication. Random number generators (RNGs) generate random numbers to enhance security. Even though the cryptographic algorithms are public and their strength depends on the keys, cryptoanalysis of encrypted ciphers can significantly contribute to the unveiling of the cipher’s key. Therefore, to ensure high data security over a network, researchers need to improve the randomness of keys as they develop cryptosystems. Quantum particles have a leading edge in advancing RNG technology as they can provide true randomness, unlike pseudo-random numbers generators (PRNGs). In order to increase the level of the security of cryptographic systems based on random numbers, this survey focuses on three objectives: Cryptosystems with related cryptographic attacks, RNG-based cryptosystems, and the design of quantum random number generators (QRNGs). This survey aims to provide researchers with information about the importance of RNG-based ciphers and various research techniques for QRNGs that can incorporate quantum-based true randomness in cryptosystems.
Random number generators (RNG) are an important resource in many areas: cryptography (both quantum and classical), probabilistic computation (Monte Carlo methods), numerical simulations, industrial testing and labeling, hazard games, scientific research, etc. Because today's computers are deterministic, they can not create random numbers unless complemented with a RNG. Randomness of a RNG can be precisely, scientifically characterized and measured. Especially valuable is the information-theoretic provable RNG (True RNG - TRNG) which, at state of the art, seem to be possible only by use of physical randomness inherent to certain (simple) quantum systems. On the other hand, current industry standard dictates use of RNG's based on free running oscillators (FRO) whose randomness is derived from electronics noise present in logic circuits and which cannot be strictly proven. This approach is currently used in 3-rd and 4-th generation FPGA and ASIC hardware, unsuitable for realization of quantum TRNG. We compare weak and strong aspects of the two approaches and discuss possibility of building quantum TRNG in the recently appeared Mixed Signal FPGA technology. Finally, we discuss several examples where use of a TRNG is critical and show how it can significantly improve security of cryptographic systems.
The generation of random numbers is, nowadays, of increasing importance. From economics to security and science, a number of applications require a large amount of random numbers generated with negligible correlation. Several (pseudo-)Random Number Generators (RNGs) are based on deterministic approaches that, in case of successful cryptographic attack, are subject to critical failure. A more secure source of randomness exploits quantum effects where the intrinsic uncertainty of the measured process renders the source truly random.
Randomness occurs in every kind of application in which random events should be experienced such as gambling, statistical calculations, computer simulations, information security and encryption. The quality of randomness is very important for the events using randomness. In particular, the need for random numbers used in the field of cryptology to be unpredictable increases the importance of random number generators. \n \nRandom Number Generators (RNGs) are software or hardware components that can be used to generate numbers that cannot be predicted in any pattern or relationship. Software-based RNGs are deterministic applications, while hardware-based RNGs are the devices that can be integrated into the system. \n \nEncryption using numbers generated by software-based RNG can be broken in varying times depending on the strength of the encryption because it was developed in deterministic ways. It is expected that the decoding time will be shortened considerably by the quantum computers which are tried to be developed today besides classic computers that takes a long time to analyze. The hardware RNGs are more powerful in randomness quality than software-based generators, but cost-effective and use-limited generators. \n \nQuantum Random Number Generators (QRNGs) is a kind of generator based on quantum physics laws instead of classical physics. In photonic based QRNGs are produced the random numbers after various software and hardware operations by taking advantage of the uncertainty of photons. These generated numbers are unpredictably strong random numbers. \n \nIn this study, a QRNG was obtained by using the RGB (Red-Green-Blue) values of the images taken from a white-single LED light source and the randomness tests of the produced numbers were carried out with the tests provided by NIST (National Institute of Standards and Technology). As a result, the numbers derived from the images successfully passed NIST tests and true random number sequences were obtained.