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

Global Congress on Emerging Technologies (GCET)

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

Maria Belkhir, Haroun Benkaouha, Elhadj Benkhelifa, Nebbali Khalida Meriem, Lamdani Hiba

Published Dec 9, 2024• 1 citation
Publisher

Abstract

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.

DOI
10.1109/gcet64327.2024.10934298

Related papers

Quantum Cryptography for Securing the Internet of Things: A Comprehensive Literature Survey

Gaurav Makkar, Suman Pant

The Internet of Things (IoT) now underpins critical systems like healthcare monitors, smart home, smart grids, automotive V2V & V2X networks, and industrial controls but it still relies on classical cryptography, whose security assumptions are vulnerable to quantum computers. A large quantum computer could run Shor’s algorithm to break RSA/ECC and use Grover’s algorithm to accelerate brute-forcing of symmetric keys, undermining the confidentiality and authentication of data in these IoT applications. Researchers have proposed quantum cryptographic solutions. Quantum key distribution (QKD) and quantum random number generators (QRNGs) exploit quantum mechanics to detect eavesdropping and deliver provably secure key material. For example, chip-scale QRNGs can be embedded in IoT sensors to generate true random keys, boosting resistance to brute-force attacks. These quantum techniques provide information-theoretic secrecy, for instance, QKD-generated keys have been used to authenticate smart-grid SCADA. However, most IoT devices are resource-constrained, making direct deployment of conventional QKD hardware challenging. Post-quantum cryptography (PQC) complements quantum methods by providing algorithms such as lattice-based, hash-based that resist quantum attacks on existing hardware. Standardized PQC can be deployed via software updates on legacy IoT nodes, enabling scalable and quantum-safe security within current constraints. Researchers are exploring lightweight PQC for connected cars and e-health sensors. Hybrid approaches combining QKD/QRNG with PQC offer a layered defense. Since QKD protocols are regarded as ‘future-proof’ and PQC standards mature, their combined use will be essential for robust, quantum-safe IoT security. Miniaturizing quantum components such as integrated QKD/QRNG modules and optimizing lightweight PQC schemes for low-power IoT devices are future research directions to secure IoT networks.

International Conference on Internet of Things: Smart Innovation and Usages (IoT-SIU)•Nov 27, 2025•1 citation

Hybrid Classical-Quantum Password Security Evaluation Using Grover’s Algorithm on Structured Search Spaces

Md. Abdul Malek Sobuj, Sadia Akter, Md. Faruk Abdullah Al Sohan +1 more

Grover’s algorithm provides a quadratic speedup for unstructured searches, making it a must-have when examining the security of password-based authentication systems in the face of potential quantum threats. But real-world passwords are rarely random and often exhibit patterning such as a combination of words and numbers, appended years, and common keyboard sequences. These patterns greatly reduce the effective entropy of the password and give rise to additional vulnerability when combined with quantum-assisted search strategies. Specifically, this paper introduces a hybrid classical-quantum method that incorporates classical preprocessing of password structures and Grover’s algorithm for evaluating password security in quantum-assisted threat models. Classically, structured password candidates are filtered with pattern-based heuristics to minimize the effective search space. In the quantum phase, Grover’s algorithm is applied to the smallest set of candidates in a simplified equality-check oracle and evaluated in a simulation of the amplitude amplification behavior. The Qiskit simulation results also show that the effective search complexity decreases from O(N) to $O(\sqrt N )$, and the probability of the target state increases to 81% after six Grover iterations for structured password spaces. These results indicate that classical preprocessing combined with quantum search significantly increases the efficiency of password security evaluation compared to brute force alone. These results point to the necessity of reevaluating password-based authentication in high-security industries such as banking and defense and suggest the need for quantum-resilient authentication policies and more stringent password design guidelines.

International Conference on Frontiers of Engineering and Emerging Technologies (FET)•Apr 22, 2026•0 citations

Quantum Computing and Its Implications for Cryptography: Assessing the Security and Efficiency of Quantum Algorithms

K. L. Sumathy, M. Megala, Sasanko Sekhar Gantayat +1 more

Quantum computing can be regarded as a disruptive enabling technology that can pose a threat to traditional cryptography as it invented new approaches to encrypt data. This paper will compare the level of security that accompanies quantum algorithms as well as the level of efficiency. Specifically, we examine the impact of efficient quantum computing on traditional cryptography and propose techniques against quantum invasions. Four quantum algorithms are analyzed for their efficiency and security benefits in the post-quantum era: Grover’s Algorithm, Shor’s Algorithm, The Quantum Key Distribution (QKD), Lattice-based cryptography. The results reveal that Grover’s algorithm improves search time complexity from O(n) to O(√n), which is advantageous over large data sets. As it will be clear shortly, Shor’s algorithm challenges RSA encryption because it outperforms classical algorithms in factoring large integers. QKD presents secure key exchange protocols that cannot be breached notwithstanding the attempts made using quantum computing. Lattice-based schemes are quantum-resistant alternatives based on the security of certain hard mathematical problems. Based on our experimental results, computational efficiency can be improved, but new cryptographic systems will have to be developed for the mitigation of quantum-related vulnerabilities. This research shows the importance of quantum-resistant cryptographic techniques to ensure data security in the emerging quantum computing era.

Nanotechnology Perceptions•Dec 1, 2024•0 citations

Enhancing Quantum Search: The Potential of Partitioned Grover's Algorithm

Ahcène Bounceur, Saadat Mehmood Alhashmi, Mohamed Abdalla Nour +1 more

Grover's Algorithm is a prominent quantum search algorithm in the rapidly advancing quantum computing study. By exploiting superposition and quantum parallelism, it has the potential to outperform classical brute-force approaches. Nevertheless, the current practical application of quantum technology in decrypting intricate passwords is restricted by its early stage, namely the restricted qubit quantities and short coherence durations. This work presents an innovative distributed quantum computing paradigm that addresses these difficulties by partitioning the password search space among several quantum processors. Each processor executes Grover's Algorithm on a subset of the search space, minimizing the computational complexity and quantum resource requirements for each individual processor. The partial findings are subsequently transmitted to a central classical computer, which amalgamates them to obtain the ultimate password. This distributed methodology not only allows for practicality with current quantum systems but also provides a scalable paradigm that can adapt to the progress of quantum computer technology. By decomposing the quantum brute-force search problem into smaller, more controllable elements, this approach can significantly decrease the time complexity of password retrieval, which has significant consequences for cryptography and cybersecurity.

International Conference on Innovative and Intelligent Information Technologies (IC3IT)•Dec 3, 2024•0 citations

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

Cybersecurity with Quantum Cryptography: An Analysis of Current Techniques and Future Trends

Edwin Juma Omol, Rachael Njeri Kibuku, Paul Anyango Abuonji

Using a systematic literature review methodology comprising the following stages: Identification of Relevant Literature, Screening and Selection, Data Extraction and Synthesis, Qualitative Analysis, and SWOT Analysis, this paper explores the role of quantum cryptography in enhancing cybersecurity. The analysis begins with an introduction to the vulnerabilities of classical cryptography in the context of quantum computing advancements. It delves into Quantum Key Distribution (QKD) protocols such as BB84 and E91, Quantum Random Number Generators (QRNGs), and post-quantum cryptography algorithms in detail. Real-world case studies are presented to illustrate the practical applications and advancements in quantum cryptographic techniques. Additionally, the paper addresses the challenges associated with implementing quantum cryptography and proposes strategies for its integration with existing cybersecurity frameworks. The discussion on future trends highlights anticipated technological advancements, potential applications in quantum internet and blockchain security, suggested research directions, and policy implications. The significance of quantum cryptography in securing sensitive data and establishing trust in critical sectors is thoroughly emphasized.

International Journal Of Science Technology & Management•Mar 20, 2025•3 citations
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.
The Internet of Things (IoT) now underpins critical systems like healthcare monitors, smart home, smart grids, automotive V2V & V2X networks, and industrial controls but it still relies on classical cryptography, whose security assumptions are vulnerable to quantum computers. A large quantum computer could run Shor’s algorithm to break RSA/ECC and use Grover’s algorithm to accelerate brute-forcing of symmetric keys, undermining the confidentiality and authentication of data in these IoT applications. Researchers have proposed quantum cryptographic solutions. Quantum key distribution (QKD) and quantum random number generators (QRNGs) exploit quantum mechanics to detect eavesdropping and deliver provably secure key material. For example, chip-scale QRNGs can be embedded in IoT sensors to generate true random keys, boosting resistance to brute-force attacks. These quantum techniques provide information-theoretic secrecy, for instance, QKD-generated keys have been used to authenticate smart-grid SCADA. However, most IoT devices are resource-constrained, making direct deployment of conventional QKD hardware challenging. Post-quantum cryptography (PQC) complements quantum methods by providing algorithms such as lattice-based, hash-based that resist quantum attacks on existing hardware. Standardized PQC can be deployed via software updates on legacy IoT nodes, enabling scalable and quantum-safe security within current constraints. Researchers are exploring lightweight PQC for connected cars and e-health sensors. Hybrid approaches combining QKD/QRNG with PQC offer a layered defense. Since QKD protocols are regarded as ‘future-proof’ and PQC standards mature, their combined use will be essential for robust, quantum-safe IoT security. Miniaturizing quantum components such as integrated QKD/QRNG modules and optimizing lightweight PQC schemes for low-power IoT devices are future research directions to secure IoT networks.
Grover’s algorithm provides a quadratic speedup for unstructured searches, making it a must-have when examining the security of password-based authentication systems in the face of potential quantum threats. But real-world passwords are rarely random and often exhibit patterning such as a combination of words and numbers, appended years, and common keyboard sequences. These patterns greatly reduce the effective entropy of the password and give rise to additional vulnerability when combined with quantum-assisted search strategies. Specifically, this paper introduces a hybrid classical-quantum method that incorporates classical preprocessing of password structures and Grover’s algorithm for evaluating password security in quantum-assisted threat models. Classically, structured password candidates are filtered with pattern-based heuristics to minimize the effective search space. In the quantum phase, Grover’s algorithm is applied to the smallest set of candidates in a simplified equality-check oracle and evaluated in a simulation of the amplitude amplification behavior. The Qiskit simulation results also show that the effective search complexity decreases from O(N) to O(N)O(\sqrt N )O(N​), and the probability of the target state increases to 81% after six Grover iterations for structured password spaces. These results indicate that classical preprocessing combined with quantum search significantly increases the efficiency of password security evaluation compared to brute force alone. These results point to the necessity of reevaluating password-based authentication in high-security industries such as banking and defense and suggest the need for quantum-resilient authentication policies and more stringent password design guidelines.
Quantum computing can be regarded as a disruptive enabling technology that can pose a threat to traditional cryptography as it invented new approaches to encrypt data. This paper will compare the level of security that accompanies quantum algorithms as well as the level of efficiency. Specifically, we examine the impact of efficient quantum computing on traditional cryptography and propose techniques against quantum invasions. Four quantum algorithms are analyzed for their efficiency and security benefits in the post-quantum era: Grover’s Algorithm, Shor’s Algorithm, The Quantum Key Distribution (QKD), Lattice-based cryptography. The results reveal that Grover’s algorithm improves search time complexity from O(n) to O(√n), which is advantageous over large data sets. As it will be clear shortly, Shor’s algorithm challenges RSA encryption because it outperforms classical algorithms in factoring large integers. QKD presents secure key exchange protocols that cannot be breached notwithstanding the attempts made using quantum computing. Lattice-based schemes are quantum-resistant alternatives based on the security of certain hard mathematical problems. Based on our experimental results, computational efficiency can be improved, but new cryptographic systems will have to be developed for the mitigation of quantum-related vulnerabilities. This research shows the importance of quantum-resistant cryptographic techniques to ensure data security in the emerging quantum computing era.
Grover's Algorithm is a prominent quantum search algorithm in the rapidly advancing quantum computing study. By exploiting superposition and quantum parallelism, it has the potential to outperform classical brute-force approaches. Nevertheless, the current practical application of quantum technology in decrypting intricate passwords is restricted by its early stage, namely the restricted qubit quantities and short coherence durations. This work presents an innovative distributed quantum computing paradigm that addresses these difficulties by partitioning the password search space among several quantum processors. Each processor executes Grover's Algorithm on a subset of the search space, minimizing the computational complexity and quantum resource requirements for each individual processor. The partial findings are subsequently transmitted to a central classical computer, which amalgamates them to obtain the ultimate password. This distributed methodology not only allows for practicality with current quantum systems but also provides a scalable paradigm that can adapt to the progress of quantum computer technology. By decomposing the quantum brute-force search problem into smaller, more controllable elements, this approach can significantly decrease the time complexity of password retrieval, which has significant consequences for cryptography and cybersecurity.
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.
Using a systematic literature review methodology comprising the following stages: Identification of Relevant Literature, Screening and Selection, Data Extraction and Synthesis, Qualitative Analysis, and SWOT Analysis, this paper explores the role of quantum cryptography in enhancing cybersecurity. The analysis begins with an introduction to the vulnerabilities of classical cryptography in the context of quantum computing advancements. It delves into Quantum Key Distribution (QKD) protocols such as BB84 and E91, Quantum Random Number Generators (QRNGs), and post-quantum cryptography algorithms in detail. Real-world case studies are presented to illustrate the practical applications and advancements in quantum cryptographic techniques. Additionally, the paper addresses the challenges associated with implementing quantum cryptography and proposes strategies for its integration with existing cybersecurity frameworks. The discussion on future trends highlights anticipated technological advancements, potential applications in quantum internet and blockchain security, suggested research directions, and policy implications. The significance of quantum cryptography in securing sensitive data and establishing trust in critical sectors is thoroughly emphasized.