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

International Journal of Quantum Information

Quantum noise-driven randomness for password generation: Analysis via simulation and FakeProvider

Rounak Biswas, Utpal Roy

Published Sep 4, 2025• 0 citations
Publisher

Abstract

This study introduces a quantum-enhanced approach to password generation using two distinct quantum randomness sources: classical measurement of superposition states and depolarizing noise. These sources overcome the shortcomings of classical pseudo-random number generators. Notably, this work pioneers integrating depolarizing noise as a controlled entropy source alongside superposition, offering a novel alternative to conventional quantum randomness methods. Quantum circuits, implemented via Qiskit, were executed on AerSimulator (idealized simulation) and FakeProvider (hardware-inspired noise model) backends, producing binary sequences through XOR and Concatenation modes. These sequences were converted into passwords of lengths 16 and 25 across datasets of 10K, 100K, and 500K, using Binary Character Mapping and Randomized reseeding methods. Binary entropy’s randomness was verified by the NIST Statistical Test Suite, with all p-values above 0.01. Generated password strength was evaluated through Clustering (Levenshtein distance), Entropy (3.84 to 4.40 bits per character), Hamming Distance, Uniqueness (100 percent), and ZXCVBN scoring (Score 4). Results from both backend-based password datasets were nearly identical, confirming simulated and hardware-based quantum randomness as a reliable and scalable alternative to systems. This work positions quantum noise-driven password generation as a robust cryptographic tool with the potential for real-world security applications.This research investigates the effectiveness of quantum noise, derived from superposition states and depolarizing channels, as a high-entropy source for generating cryptographically secure passwords. Quantum circuits implemented on the AerSimulator and FakeProvider backends produce random binary sequences, which are processed through chaotic mixing and rejection sampling to ensure uniform randomness. These sequences are rigorously evaluated using Shannon entropy, min-entropy and the NIST statistical test suite, alongside password strength assessments via tools like ZXCVBN. Results indicate exceptional randomness, with an average Shannon entropy of 3.84 ± 0.4 bits per character and 100% uniqueness across datasets of 20,000 passwords. The FakeProvider backend slightly outperforms the AerSimulator, achieving full compliance with NIST tests, while both produce passwords with top-tier strength scores (ZXCVBN Score 4). Comparative analyses demonstrate that quantum noise surpasses classical pseudo-random number generators in entropy density and resistance to brute-force and dictionary-based attacks. This study validates quantum noise as a superior entropy source, offering significant potential for enhancing password security in cryptographic applications and paving the way for quantum-enhanced cybersecurity solutions.

DOI
10.1142/s021974992550025x

Related papers

Pseudo-Random Number Generation Based on Quantum Kicked Rotor Dynamics

Taukhid Wisnu Broto, Supriadi Rustad, Ahmad Zainul Fanani +2 more

Generating high-quality random numbers is essential for cryptography, statistical simulations, and cybersecurity. While pseudo-random number generators (PRNGs) are computationally efficient, their deterministic nature introduces potential security vulnerabilities. Recent research has explored chaotic systems as entropy sources due to their sensitivity to initial conditions-a key property for randomness generation. An emerging direction involves leveraging chaos in quantum systems. This paper proposes a quantum-inspired PRNG based on the Quantum Kicked Rotor (QKR), a well-known model in quantum chaos exhibiting complex dynamics such as dynamical localization. The method simulates the QKR and extracts pseudo-random sequences through momentum basis measurements. The generated sequences are evaluated for statistical quality, including the NIST 800-22 standard, which passed all 15 test. The sequences exhibit strong non-periodicity, a critical property for secure cryptographic applications. The proposed approach combines the unpredictability of quantum chaos with the scalability of classical simulation, offering a practical and efficient alternative for secure random number generation.

IEEE International Conference on Cryptography, Informatics, and Cybersecurity (ICoCICs)•Oct 22, 2025•1 citation

Refining the Impact of Quantum Noise: From Chaotic Effects to Contribution in Randomness Generation

Rounak Biswas, Utpal Roy

Abstract Quantum noise, typically considered an obstacle in quantum computing, provides novel prospects in random number generation. This research investigates the possibility of several forms of quantum noise as significant resources for producing high-quality randomness. The study employed simulations of random quantum circuits to examine the effects of bit-flips, phase-flips, and depolarizing noise at different intensities. We conducted the simulations in a controlled setting using the Qiskit Aer simulator, which we selected for its ability to accurately mimic noise effects and replicate the behaviour of actual quantum gear. The research indicated that bit-flip and depolarizing noise consistently produced more significant amounts of unpredictability than phase-flip and noiseless circuits. Applying the produced binary sequences to the NIST Statistical Test Suite corroborated the discovery, confirming their superior quality and appropriateness for applications requiring random numbers. The study suggests that we can efficiently use quantum noise to create safe randomness, which offers significant benefits for encryption, simulations, and other domains that demand genuine unpredictability.

•Dec 19, 2024•1 citation

Analysis of a Programmable Quantum Annealer as a Random Number Generator

Elijah Pelofske

Quantum devices offer a highly useful function - that is generating random numbers in a non-deterministic way since the measurement of a quantum state is not deterministic. This means that quantum devices can be constructed that generate qubits in a uniform superposition and then measure the state of those qubits. If the preparation of the qubits in a uniform superposition is unbiased, then quantum computers can be used to create high entropy, secure random numbers. Typically, preparing and measuring such quantum systems requires more time compared to classical pseudo random number generators (PRNGs) which are inherently deterministic algorithms. Therefore, the typical use of quantum random number generators (QRNGs) is to provide high entropy secure seeds for PRNGs. Quantum annealing (QA) is a type of analog quantum computation that is a relaxed form of adiabatic quantum computation and uses quantum fluctuations in order to search for ground state solutions of a programmable Ising model. Here we present extensive experimental random number results from a D-Wave 2000Q quantum annealer, totaling over 20 billion bits of QA measurements, which is significantly larger than previous D-Wave QA random number generator studies. Current quantum annealers are susceptible to noise from environmental sources and calibration errors, and are not in general unbiased samplers. Therefore, it is of interest to quantify whether noisy quantum annealers can effectively function as an unbiased QRNG. The amount of data that was collected from the quantum annealer allows a comprehensive analysis of the random bits to be performed using the NIST SP 800-22 Rev 1a testsuite, as well as min-entropy estimates from NIST SP 800-90B. The randomness tests show that the generated random bits from the D-Wave 2000Q are biased, and not unpredictable random bit sequences. With no server-side sampling post-processing, the 1 microsecond annealing time measurements had a min-entropy of 0.824.

arXiv:2307.02573•IEEE Transactions on Information Forensics and Security•Jan 1, 2024•4 citations

Quantum-Inspired Algorithmic Randomness Generation

Jincheng Zhang

This paper explores the potential of harnessing quantum mechanical principles, specifically superposition and entanglement, to generate truly random numbers. Current classical random number generators rely on entropy sources that, while statistically random, are fundamentally predictable. We propose a novel algorithmic approach termed "Quantum-Inspired Algorithmic Randomness Generation" (Q-IARG) that utilizes controlled quantum decoherence and measurement processes to generate high-entropy random numbers. The core concept involves mapping the probabilistic outcomes of these processes—defined by equations and mathematical models—to a sequence of random numbers. This approach moves beyond merely simulating quantum phenomena and aims for a practically demonstrable improvement in randomness quality. The system is envisioned as a hybrid hardware/software solution, offering a pathway to surpass the limitations of traditional entropy sources. The system's effectiveness will be assessed through the analysis of the statistical properties of the generated sequences, focusing on metrics such as entropy, autocorrelation, and uniformity. This work provides a foundational framework for exploring quantum-inspired randomness generation and its potential applications.

•Sep 5, 2026•0 citations

Quantum Computing and Password Security: Applying Grover’s Algorithm and QRNG with Qiskit

Maria Belkhir, Haroun Benkaouha, Elhadj Benkhelifa +2 more

The digitization of our daily lives, driven by the Internet of Things (IoT) and other applications, has heightened the importance of data security. This paper explores the impact of quantum computing on password security, specifically focusing on Grover’s algorithm’s application to password cracking. We compare classical brute-force methods with quantum search techniques, utilizing real-world password data from significant breaches such as LinkedIn, 000webhost, and RockYou. Our study involves the development of a tool that tests password robustness using both classical and quantum simulations, and also generates secure passwords based on quantum randomness. The results obtained provide an insight into the application of quantum simulators for the implementation of quantum algorithms. They also illustrate how quantum random number generation helps to improve password security.

Global Congress on Emerging Technologies (GCET)•Dec 9, 2024•1 citation

IMPLEMENTATION AND EVALUATION OF A QUANTUM RANDOM NUMBER GENERATOR BASED ON ANU QRNG FOR CRYPTOGRAPHIC APPLICATION

Софія Парфило, Віталій Вікторович Коваль

Topicality. Reliable random number generation is one of the key requirements for modern cryptographic systems and cybersecurity applications. Traditional pseudo-random number generators are based on deterministic algorithms and may exhibit limited entropy and predictability, which can negatively affect information security. The subject of study in the article is methods of quantum random number generation and approaches to evaluating the quality of generated random sequences. The purpose of the article is to analyze modern methods of quantum random number generation, develop a software tool for obtaining quantum random numbers based on the ANU Quantum Random Number Generator service, perform statistical testing of the generated sequences, and analyze the obtained results. The following results were obtained. Modern quantum random number generation systems were analyzed and compared. A software tool was implemented in Python for automatic retrieval of quantum random numbers through the ANU QRNG API. The generated binary sequences were evaluated using Frequency Test and Block Frequency Test from the NIST SP 800-22 statistical test suite. The obtained p-values were 0.977181 and 0.200659 respectively, confirming successful completion of both tests. Additionally, visual analysis of the generated sequences revealed no noticeable patterns or repetitive structures. Conclusion. The obtained results confirm the high quality of quantum random sequences generated using ANU QRNG and demonstrate the applicability of the developed software tool for cryptographic and cybersecurity applications requiring high-quality randomness.

Terra security•Jul 4, 2026•0 citations
This study introduces a quantum-enhanced approach to password generation using two distinct quantum randomness sources: classical measurement of superposition states and depolarizing noise. These sources overcome the shortcomings of classical pseudo-random number generators. Notably, this work pioneers integrating depolarizing noise as a controlled entropy source alongside superposition, offering a novel alternative to conventional quantum randomness methods. Quantum circuits, implemented via Qiskit, were executed on AerSimulator (idealized simulation) and FakeProvider (hardware-inspired noise model) backends, producing binary sequences through XOR and Concatenation modes. These sequences were converted into passwords of lengths 16 and 25 across datasets of 10K, 100K, and 500K, using Binary Character Mapping and Randomized reseeding methods. Binary entropy’s randomness was verified by the NIST Statistical Test Suite, with all p-values above 0.01. Generated password strength was evaluated through Clustering (Levenshtein distance), Entropy (3.84 to 4.40 bits per character), Hamming Distance, Uniqueness (100 percent), and ZXCVBN scoring (Score 4). Results from both backend-based password datasets were nearly identical, confirming simulated and hardware-based quantum randomness as a reliable and scalable alternative to systems. This work positions quantum noise-driven password generation as a robust cryptographic tool with the potential for real-world security applications.This research investigates the effectiveness of quantum noise, derived from superposition states and depolarizing channels, as a high-entropy source for generating cryptographically secure passwords. Quantum circuits implemented on the AerSimulator and FakeProvider backends produce random binary sequences, which are processed through chaotic mixing and rejection sampling to ensure uniform randomness. These sequences are rigorously evaluated using Shannon entropy, min-entropy and the NIST statistical test suite, alongside password strength assessments via tools like ZXCVBN. Results indicate exceptional randomness, with an average Shannon entropy of 3.84 ± 0.4 bits per character and 100% uniqueness across datasets of 20,000 passwords. The FakeProvider backend slightly outperforms the AerSimulator, achieving full compliance with NIST tests, while both produce passwords with top-tier strength scores (ZXCVBN Score 4). Comparative analyses demonstrate that quantum noise surpasses classical pseudo-random number generators in entropy density and resistance to brute-force and dictionary-based attacks. This study validates quantum noise as a superior entropy source, offering significant potential for enhancing password security in cryptographic applications and paving the way for quantum-enhanced cybersecurity solutions.
Generating high-quality random numbers is essential for cryptography, statistical simulations, and cybersecurity. While pseudo-random number generators (PRNGs) are computationally efficient, their deterministic nature introduces potential security vulnerabilities. Recent research has explored chaotic systems as entropy sources due to their sensitivity to initial conditions-a key property for randomness generation. An emerging direction involves leveraging chaos in quantum systems. This paper proposes a quantum-inspired PRNG based on the Quantum Kicked Rotor (QKR), a well-known model in quantum chaos exhibiting complex dynamics such as dynamical localization. The method simulates the QKR and extracts pseudo-random sequences through momentum basis measurements. The generated sequences are evaluated for statistical quality, including the NIST 800-22 standard, which passed all 15 test. The sequences exhibit strong non-periodicity, a critical property for secure cryptographic applications. The proposed approach combines the unpredictability of quantum chaos with the scalability of classical simulation, offering a practical and efficient alternative for secure random number generation.
Abstract Quantum noise, typically considered an obstacle in quantum computing, provides novel prospects in random number generation. This research investigates the possibility of several forms of quantum noise as significant resources for producing high-quality randomness. The study employed simulations of random quantum circuits to examine the effects of bit-flips, phase-flips, and depolarizing noise at different intensities. We conducted the simulations in a controlled setting using the Qiskit Aer simulator, which we selected for its ability to accurately mimic noise effects and replicate the behaviour of actual quantum gear. The research indicated that bit-flip and depolarizing noise consistently produced more significant amounts of unpredictability than phase-flip and noiseless circuits. Applying the produced binary sequences to the NIST Statistical Test Suite corroborated the discovery, confirming their superior quality and appropriateness for applications requiring random numbers. The study suggests that we can efficiently use quantum noise to create safe randomness, which offers significant benefits for encryption, simulations, and other domains that demand genuine unpredictability.
Quantum devices offer a highly useful function - that is generating random numbers in a non-deterministic way since the measurement of a quantum state is not deterministic. This means that quantum devices can be constructed that generate qubits in a uniform superposition and then measure the state of those qubits. If the preparation of the qubits in a uniform superposition is unbiased, then quantum computers can be used to create high entropy, secure random numbers. Typically, preparing and measuring such quantum systems requires more time compared to classical pseudo random number generators (PRNGs) which are inherently deterministic algorithms. Therefore, the typical use of quantum random number generators (QRNGs) is to provide high entropy secure seeds for PRNGs. Quantum annealing (QA) is a type of analog quantum computation that is a relaxed form of adiabatic quantum computation and uses quantum fluctuations in order to search for ground state solutions of a programmable Ising model. Here we present extensive experimental random number results from a D-Wave 2000Q quantum annealer, totaling over 20 billion bits of QA measurements, which is significantly larger than previous D-Wave QA random number generator studies. Current quantum annealers are susceptible to noise from environmental sources and calibration errors, and are not in general unbiased samplers. Therefore, it is of interest to quantify whether noisy quantum annealers can effectively function as an unbiased QRNG. The amount of data that was collected from the quantum annealer allows a comprehensive analysis of the random bits to be performed using the NIST SP 800-22 Rev 1a testsuite, as well as min-entropy estimates from NIST SP 800-90B. The randomness tests show that the generated random bits from the D-Wave 2000Q are biased, and not unpredictable random bit sequences. With no server-side sampling post-processing, the 1 microsecond annealing time measurements had a min-entropy of 0.824.
This paper explores the potential of harnessing quantum mechanical principles, specifically superposition and entanglement, to generate truly random numbers. Current classical random number generators rely on entropy sources that, while statistically random, are fundamentally predictable. We propose a novel algorithmic approach termed "Quantum-Inspired Algorithmic Randomness Generation" (Q-IARG) that utilizes controlled quantum decoherence and measurement processes to generate high-entropy random numbers. The core concept involves mapping the probabilistic outcomes of these processes—defined by equations and mathematical models—to a sequence of random numbers. This approach moves beyond merely simulating quantum phenomena and aims for a practically demonstrable improvement in randomness quality. The system is envisioned as a hybrid hardware/software solution, offering a pathway to surpass the limitations of traditional entropy sources. The system's effectiveness will be assessed through the analysis of the statistical properties of the generated sequences, focusing on metrics such as entropy, autocorrelation, and uniformity. This work provides a foundational framework for exploring quantum-inspired randomness generation and its potential applications.
The digitization of our daily lives, driven by the Internet of Things (IoT) and other applications, has heightened the importance of data security. This paper explores the impact of quantum computing on password security, specifically focusing on Grover’s algorithm’s application to password cracking. We compare classical brute-force methods with quantum search techniques, utilizing real-world password data from significant breaches such as LinkedIn, 000webhost, and RockYou. Our study involves the development of a tool that tests password robustness using both classical and quantum simulations, and also generates secure passwords based on quantum randomness. The results obtained provide an insight into the application of quantum simulators for the implementation of quantum algorithms. They also illustrate how quantum random number generation helps to improve password security.
Topicality. Reliable random number generation is one of the key requirements for modern cryptographic systems and cybersecurity applications. Traditional pseudo-random number generators are based on deterministic algorithms and may exhibit limited entropy and predictability, which can negatively affect information security. The subject of study in the article is methods of quantum random number generation and approaches to evaluating the quality of generated random sequences. The purpose of the article is to analyze modern methods of quantum random number generation, develop a software tool for obtaining quantum random numbers based on the ANU Quantum Random Number Generator service, perform statistical testing of the generated sequences, and analyze the obtained results. The following results were obtained. Modern quantum random number generation systems were analyzed and compared. A software tool was implemented in Python for automatic retrieval of quantum random numbers through the ANU QRNG API. The generated binary sequences were evaluated using Frequency Test and Block Frequency Test from the NIST SP 800-22 statistical test suite. The obtained p-values were 0.977181 and 0.200659 respectively, confirming successful completion of both tests. Additionally, visual analysis of the generated sequences revealed no noticeable patterns or repetitive structures. Conclusion. The obtained results confirm the high quality of quantum random sequences generated using ANU QRNG and demonstrate the applicability of the developed software tool for cryptographic and cybersecurity applications requiring high-quality randomness.