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

IEEE International Conference for Convergence in Technology (I2CT)

Evaluation of Cryptographically Secure Pseudo Random Number Generators for Post Quantum Era

Atul Kumar, Arun Mishra

Published Apr 7, 2022• 10 citations
Publisher

Abstract

The construction of a Pseudo-Random Number Generator (PRNG) is an extremely decisive task in the field of Cryptography, Gaming, Computational statistics, Simulation processes, Gambling, and other fields. But many of the PRNGs are not cryptographically secure so various kinds of models have been presented to generate Pseudo-Random numbers. As generators are used in the field of cryptography too therefore it is inescapable to assess it among scientists and researchers. In this study, we would evaluate different kinds of RNGs against quantum attacks including the one which is based on lattice-based cryptography. In the end, we would contrive to wind up how the lattice-based PRNGS are pragmatic for the Post Quantum Cryptography.

DOI
10.1109/i2ct54291.2022.9824543

Related papers

Quantum Random Number Generator-Based Cryptographic Algorithm Design

Jincheng Zhang

This paper explores the design of cryptographic algorithms leveraging the inherent randomness of quantum random number generators (QRNGs). Traditional cryptographic algorithms often rely on pseudo-random number generators (PRNGs), which are deterministic and therefore vulnerable to attacks if their internal state is compromised. QRNGs, on the other hand, derive their randomness from quantum mechanical phenomena, offering a fundamentally unpredictable source of numbers. This research investigates the application of QRNGs to enhance cryptographic security, focusing on constructing algorithms that exploit this unique property. The core claim is that utilizing QRNG characteristics allows for the design of more secure cryptographic algorithms. The proposed mechanism involves capitalizing on the non-deterministic nature of QRNGs to build algorithms with heightened security levels. This approach presents a novel security guarantee method by incorporating true randomness into cryptographic processes. We examine specific algorithm designs and analyze their security implications compared to traditional PRNG-based approaches. The paper concludes with a discussion on the challenges and future directions of utilizing QRNGs in cryptography.

•Sep 1, 2026•0 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

Enhancing the operational efficiency of quantum random number generators

Botond L. Márton, Dóra Istenes, László Bacsárdi

Random numbers are of vital importance in today’s world and used for example in many cryptographical protocols to secure the communication over the internet. The generators producing these numbers are Pseudo Random Number Generators (PRNGs) or True Random Number Generators (TRNGs). A subclass of TRNGs are the Quantum based Random Number Generators (QRNGs) whose generation processes are based on quantum phenomena. However, the achievable quality of the numbers generated from a practical implementation can differ from the theoretically possible. To ease this negative effect post-processing can be used, which contains the use of extractors. They extract as much entropy as possible from the original source and produce a new output with better properties. The quality and the different properties of a given output can be measured with the help of statistical tests. In our work we examined the effect of different extractors on two QRNG outputs and found that witg the right extractor we can improve their quality.

Híradástechnika/Infocommunications journal•Jan 1, 2021•5 citations

Non Deterministic Pseudorandom Generator for Quantum Key Distribution

Arun Mishra, Kanaka Raju P., Anupama Arjun Pandit +1 more

Quantum Key Distribution(QKD) thrives to achieve perfect secrecy of One time Pad (OTP) through quantum processes. One of the crucial components of QKD are Quantum Random Number Generators(QRNG) for generation of keys. Unfortunately, these QRNG does not immediately produce usable bits rather it produces raw bits with high entropy but low uniformity which can be hardly used by any cryptographic system. A lot of pre-processing is required before the random numbers generated by QRNG to be usable. This causes a bottle neck in random number generation rate as well as QKD system relying on it. To avoid this lacuna of post-processing methods employed as a central part of Quantum Random Number Generators alternative approaches that satisfy the entropy(non determinism) and quantum security is explored. Pseudorandom generators based on quantum secure primitives could be an alternative to the post-processing problem as PRNGs are way more faster than any random number generator employing physical randomness (quantum mechanical process in QRNG) as well as it can provide uniform bits required for cryptography application. In this work we propose a pseudorandom generator based on post quantum primitives. The central theme of this random number generator is designing PRNG with non deterministic entropy generated through hard lattice problem - Learning with errors. We leverage the non determinism by Gaussian errors of LWE to construct non-deterministic PRNG satisfying the entropy requirement of QKD. Further, the paper concludes by evaluating the PRNG through Die-Harder Test.

arXiv:2311.03024•Nov 6, 2023•0 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

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
The construction of a Pseudo-Random Number Generator (PRNG) is an extremely decisive task in the field of Cryptography, Gaming, Computational statistics, Simulation processes, Gambling, and other fields. But many of the PRNGs are not cryptographically secure so various kinds of models have been presented to generate Pseudo-Random numbers. As generators are used in the field of cryptography too therefore it is inescapable to assess it among scientists and researchers. In this study, we would evaluate different kinds of RNGs against quantum attacks including the one which is based on lattice-based cryptography. In the end, we would contrive to wind up how the lattice-based PRNGS are pragmatic for the Post Quantum Cryptography.
This paper explores the design of cryptographic algorithms leveraging the inherent randomness of quantum random number generators (QRNGs). Traditional cryptographic algorithms often rely on pseudo-random number generators (PRNGs), which are deterministic and therefore vulnerable to attacks if their internal state is compromised. QRNGs, on the other hand, derive their randomness from quantum mechanical phenomena, offering a fundamentally unpredictable source of numbers. This research investigates the application of QRNGs to enhance cryptographic security, focusing on constructing algorithms that exploit this unique property. The core claim is that utilizing QRNG characteristics allows for the design of more secure cryptographic algorithms. The proposed mechanism involves capitalizing on the non-deterministic nature of QRNGs to build algorithms with heightened security levels. This approach presents a novel security guarantee method by incorporating true randomness into cryptographic processes. We examine specific algorithm designs and analyze their security implications compared to traditional PRNG-based approaches. The paper concludes with a discussion on the challenges and future directions of utilizing QRNGs in cryptography.
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 numbers are of vital importance in today’s world and used for example in many cryptographical protocols to secure the communication over the internet. The generators producing these numbers are Pseudo Random Number Generators (PRNGs) or True Random Number Generators (TRNGs). A subclass of TRNGs are the Quantum based Random Number Generators (QRNGs) whose generation processes are based on quantum phenomena. However, the achievable quality of the numbers generated from a practical implementation can differ from the theoretically possible. To ease this negative effect post-processing can be used, which contains the use of extractors. They extract as much entropy as possible from the original source and produce a new output with better properties. The quality and the different properties of a given output can be measured with the help of statistical tests. In our work we examined the effect of different extractors on two QRNG outputs and found that witg the right extractor we can improve their quality.
Quantum Key Distribution(QKD) thrives to achieve perfect secrecy of One time Pad (OTP) through quantum processes. One of the crucial components of QKD are Quantum Random Number Generators(QRNG) for generation of keys. Unfortunately, these QRNG does not immediately produce usable bits rather it produces raw bits with high entropy but low uniformity which can be hardly used by any cryptographic system. A lot of pre-processing is required before the random numbers generated by QRNG to be usable. This causes a bottle neck in random number generation rate as well as QKD system relying on it. To avoid this lacuna of post-processing methods employed as a central part of Quantum Random Number Generators alternative approaches that satisfy the entropy(non determinism) and quantum security is explored. Pseudorandom generators based on quantum secure primitives could be an alternative to the post-processing problem as PRNGs are way more faster than any random number generator employing physical randomness (quantum mechanical process in QRNG) as well as it can provide uniform bits required for cryptography application. In this work we propose a pseudorandom generator based on post quantum primitives. The central theme of this random number generator is designing PRNG with non deterministic entropy generated through hard lattice problem - Learning with errors. We leverage the non determinism by Gaussian errors of LWE to construct non-deterministic PRNG satisfying the entropy requirement of QKD. Further, the paper concludes by evaluating the PRNG through Die-Harder Test.
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.
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.