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
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.