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 Conference on Frontiers of Engineering and Emerging Technologies (FET)

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, Afroza Nahar

Published Apr 22, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1109/fet68771.2026.11601884

Related papers

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

A Hybrid Classical-Quantum Rainbow Table Attack on Human Passwords

MA. Khajeian

Long, human-generated passwords pose significant challenges to both classical and quantum attacks due to their irregular structure and large search space. In this work, we propose an enhanced classical-quantum hybrid attack specifically designed for this scenario. Our approach constructs rainbow tables using dictionary-based password generation augmented with transformation rules that better capture real-world user behavior. These tables are organized into buckets, enabling faster lookup and reduced space complexity. For the search within each bucket, we employ a distributed exact variant of Grover's algorithm. This method provides deterministic success and significantly lower circuit depth, enhancing robustness against noise-particularly depolarizing errors common in near-term quantum devices. Overall, our hybrid framework improves the efficiency and practicality of password recovery for long, human-readable passwords in realistic adversarial settings.

arXiv:2507.14600•Jul 19, 2025•0 citations

Assessing Quantum Threats to Cryptographic Hash Structures in Cyber Defense Systems Using Grover Based Oracle Modeling

Santi Amalia Ar-Nur, Teddy Mantoro

The advancement of quantum computing poses emerging challenges to cryptographic hash functions that underpin modern cyber defense systems. In particular, Grover’s algorithm theoretically offers a quadratic speedup for preimage search, potentially reducing the effective security margin of hash-based primitives used to protect long-lived strategic data. This study adopts a structure-oriented perspective to analyze ARX-like and sponge-like hash constructions using Grover-based oracle modeling. Reversible toy hash abstractions are employed to construct quantum oracles and simulate Grover attacks under both ideal (noise-free) and Noisy Intermediate-Scale Quantum (NISQ) conditions. The analysis evaluates success probability, oracle cost, and noise sensitivity. Results show non-monotonic amplitude amplification under ideal conditions, with structural differences affecting phase behavior. However, under realistic noise, amplitude amplification is significantly attenuated for both constructions, limiting practical quantum advantage. The findings further show that oracle complexity, reflected in circuit depth and multi-qubit gate usage, plays a dominant role in determining attack feasibility beyond asymptotic complexity reductions. This work provides a structure-level framework for assessing quantum risks to cryptographic hash functions and supports informed post-quantum cyber defense planning.

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

Performance Analysis of Grover’s Algorithm Under Noise: A Simulation-Driven Study with Error Mitigation and Hybrid Bloom–Grover Search

Souvik Ghosh, Amrita Kundu, Samya Muhuri

Classical database join operations are a significant performance bottleneck in data-intensive applications, typically requiring quadratic time proportional to the size of the input. Quantum search algorithms, such as Grover’s algorithm, promise asymptotic speedups for unstructured search and can be adapted to accelerate equality-based joins. In this paper, we present a systematic simulation study of a Grover-based quantum join primitive and a hybrid classical-quantum join scheme, comparing them with a baseline classical nested-loop join. Parameterised Grover circuits have been implemented for marked-item search, together with resource estimation (qubit count, circuit depth, and gate counts), using the Qiskit Aer simulator. The classical join is modelled as a nested-loop equality join over two arrays, while the hybrid scheme uses a classical Bloom filter to reduce the candidate space, followed by a Grover search over the remaining items. To approximate near term hardware, we incorporate depolarizing gate noise and readout noise via Aer noise models and investigate two mitigation techniques: readout error calibration and zero noise extrapolation. Our simulations, conducted in a Python environment without GPU acceleration, demonstrate that the Grover based and hybrid joins exhibit the expected sub-quadratic scaling in runtime compared to the classical nested-loop join for problem sizes up to N = 215. We additionally observe that realistic noise significantly degrades the raw success probability of the quantum join, while combining readout mitigation with zero noise extrapolation partially restores accuracy. These results provide a resource-aware and noise-aware baseline for evaluating quantum-accelerated joins on future fault-tolerant or high-fidelity noisy intermediate-scale quantum (NISQ) devices.

International Conference on Next-Gen Quantum and Advanced Computing: Algorithms, Security, and Beyond (NQComp)•Mar 5, 2026•0 citations

Accelerating Unstructured Text Search with Grover's Algorithm: A Performance Analysis on Simulated and Real-Time Quantum Computers

SaiPrasath B, SasiKumar R, A Dineshkumar

Target item searching in large-scale, unstructured text databases is a major computational task for traditional systems and usually requires algorithms whose time complexity is on the order of$O(N)$. Quantum computing presents a strong competitor by using Grover's algorithm, where theoretically the search complexity comes down to$O(\sqrt{N})$, making faster retrieval possible. This research considers the design and assessment of Grover's algorithm as it is used to find a target word in a paragraph. The process entails encoding a group of unique words into a quantum register and implementing a circuit that incorporates a bespoke oracle and a diffusion operator to amplify the probability amplitude of the target state. Performance was evaluated in two situations: an ideal noise-free simulation with Qiskit's AerSimulator and a real-world run on IBM's quantum hardware. Simulation results demonstrated always-high accuracy in identifying the target word. But tests on real quantum machines indicated that the reliability of the algorithm decreases with an increase in qubits. Though circuits of up to five qubits had tolerable accuracy, larger configurations were plagued by noise, gate errors, and decoherence effects. These results highlight both the potential of quantum search algorithms for text processing and the limitations of NISQ today.

International Conference on Applied Artificial Intelligence and Computing (ICAAIC)•Dec 17, 2025•0 citations

AI-Guided Grover Search for Simulation-Based Evaluation of Post-Quantum Security in CKKS Homomorphic Encryption

Howaida Allam, Sonal Trivedi

The emergence of quantum computing poses fundamental challenges to the security assumptions underlying modern cryptographic systems, particularly Fully Homomorphic Encryption (FHE) schemes that enable computation on encrypted data. While Grover's algorithm provides a theoretical framework for quantum attacks on symmetric cryptographic primitives, its practical application to complex parameter spaces like those in CKKS FHE has remained limited.This paper presents a simulation-based, exploratory hybrid framework that combines deep neural networks with a simplified quantum search model to evaluate the post-quantum security of CKKS bootstrapping parameters under idealised conditions. The AI-enhanced system learns to identify potentially vulnerable parameter configurations through pattern recognition, then uses this knowledge to optimize the quantum oracle construction in a 4-qubit Grover's algorithm simulator. Experiments conducted on 5,000 synthetically generated parameter sets, with evaluation on 100 boundary-region configurations, demonstrate that this hybrid approach achieves a 73.4\% success rate in identifying insecure parameters under the experimental setup, representing a 30.6\% improvement over standard quantum search in the same simulated environment.Within the experimental model, this analysis indicates that under the experimental model, parameter sets nominally targeting 128-bit quantum security may exhibit effective security levels of only 86–101 bits when subjected to AI-guided search, suggesting that current FHE parameter margins warrant further investigation as quantum capabilities mature. The findings are simulation-based and should not be directly extrapolated to real-world deployments without further validation; however, they indicate that security margins may need to be increased by approximately 2.3 times to maintain true 128-bit quantum resistance against intelligent adversaries. These results have implications for post-quantum cryptographic standards and motivate further study at realistic qubit scales.

Journal of Smart Algorithms and Applications (JSAA)•Apr 24, 2026•1 citation
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.
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.
Long, human-generated passwords pose significant challenges to both classical and quantum attacks due to their irregular structure and large search space. In this work, we propose an enhanced classical-quantum hybrid attack specifically designed for this scenario. Our approach constructs rainbow tables using dictionary-based password generation augmented with transformation rules that better capture real-world user behavior. These tables are organized into buckets, enabling faster lookup and reduced space complexity. For the search within each bucket, we employ a distributed exact variant of Grover's algorithm. This method provides deterministic success and significantly lower circuit depth, enhancing robustness against noise-particularly depolarizing errors common in near-term quantum devices. Overall, our hybrid framework improves the efficiency and practicality of password recovery for long, human-readable passwords in realistic adversarial settings.
The advancement of quantum computing poses emerging challenges to cryptographic hash functions that underpin modern cyber defense systems. In particular, Grover’s algorithm theoretically offers a quadratic speedup for preimage search, potentially reducing the effective security margin of hash-based primitives used to protect long-lived strategic data. This study adopts a structure-oriented perspective to analyze ARX-like and sponge-like hash constructions using Grover-based oracle modeling. Reversible toy hash abstractions are employed to construct quantum oracles and simulate Grover attacks under both ideal (noise-free) and Noisy Intermediate-Scale Quantum (NISQ) conditions. The analysis evaluates success probability, oracle cost, and noise sensitivity. Results show non-monotonic amplitude amplification under ideal conditions, with structural differences affecting phase behavior. However, under realistic noise, amplitude amplification is significantly attenuated for both constructions, limiting practical quantum advantage. The findings further show that oracle complexity, reflected in circuit depth and multi-qubit gate usage, plays a dominant role in determining attack feasibility beyond asymptotic complexity reductions. This work provides a structure-level framework for assessing quantum risks to cryptographic hash functions and supports informed post-quantum cyber defense planning.
Classical database join operations are a significant performance bottleneck in data-intensive applications, typically requiring quadratic time proportional to the size of the input. Quantum search algorithms, such as Grover’s algorithm, promise asymptotic speedups for unstructured search and can be adapted to accelerate equality-based joins. In this paper, we present a systematic simulation study of a Grover-based quantum join primitive and a hybrid classical-quantum join scheme, comparing them with a baseline classical nested-loop join. Parameterised Grover circuits have been implemented for marked-item search, together with resource estimation (qubit count, circuit depth, and gate counts), using the Qiskit Aer simulator. The classical join is modelled as a nested-loop equality join over two arrays, while the hybrid scheme uses a classical Bloom filter to reduce the candidate space, followed by a Grover search over the remaining items. To approximate near term hardware, we incorporate depolarizing gate noise and readout noise via Aer noise models and investigate two mitigation techniques: readout error calibration and zero noise extrapolation. Our simulations, conducted in a Python environment without GPU acceleration, demonstrate that the Grover based and hybrid joins exhibit the expected sub-quadratic scaling in runtime compared to the classical nested-loop join for problem sizes up to N = 215. We additionally observe that realistic noise significantly degrades the raw success probability of the quantum join, while combining readout mitigation with zero noise extrapolation partially restores accuracy. These results provide a resource-aware and noise-aware baseline for evaluating quantum-accelerated joins on future fault-tolerant or high-fidelity noisy intermediate-scale quantum (NISQ) devices.
Target item searching in large-scale, unstructured text databases is a major computational task for traditional systems and usually requires algorithms whose time complexity is on the order ofO(N)O(N)O(N). Quantum computing presents a strong competitor by using Grover's algorithm, where theoretically the search complexity comes down toO(N)O(\sqrt{N})O(N​), making faster retrieval possible. This research considers the design and assessment of Grover's algorithm as it is used to find a target word in a paragraph. The process entails encoding a group of unique words into a quantum register and implementing a circuit that incorporates a bespoke oracle and a diffusion operator to amplify the probability amplitude of the target state. Performance was evaluated in two situations: an ideal noise-free simulation with Qiskit's AerSimulator and a real-world run on IBM's quantum hardware. Simulation results demonstrated always-high accuracy in identifying the target word. But tests on real quantum machines indicated that the reliability of the algorithm decreases with an increase in qubits. Though circuits of up to five qubits had tolerable accuracy, larger configurations were plagued by noise, gate errors, and decoherence effects. These results highlight both the potential of quantum search algorithms for text processing and the limitations of NISQ today.
The emergence of quantum computing poses fundamental challenges to the security assumptions underlying modern cryptographic systems, particularly Fully Homomorphic Encryption (FHE) schemes that enable computation on encrypted data. While Grover's algorithm provides a theoretical framework for quantum attacks on symmetric cryptographic primitives, its practical application to complex parameter spaces like those in CKKS FHE has remained limited.This paper presents a simulation-based, exploratory hybrid framework that combines deep neural networks with a simplified quantum search model to evaluate the post-quantum security of CKKS bootstrapping parameters under idealised conditions. The AI-enhanced system learns to identify potentially vulnerable parameter configurations through pattern recognition, then uses this knowledge to optimize the quantum oracle construction in a 4-qubit Grover's algorithm simulator. Experiments conducted on 5,000 synthetically generated parameter sets, with evaluation on 100 boundary-region configurations, demonstrate that this hybrid approach achieves a 73.4\% success rate in identifying insecure parameters under the experimental setup, representing a 30.6\% improvement over standard quantum search in the same simulated environment.Within the experimental model, this analysis indicates that under the experimental model, parameter sets nominally targeting 128-bit quantum security may exhibit effective security levels of only 86–101 bits when subjected to AI-guided search, suggesting that current FHE parameter margins warrant further investigation as quantum capabilities mature. The findings are simulation-based and should not be directly extrapolated to real-world deployments without further validation; however, they indicate that security margins may need to be increased by approximately 2.3 times to maintain true 128-bit quantum resistance against intelligent adversaries. These results have implications for post-quantum cryptographic standards and motivate further study at realistic qubit scales.