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

arXiv:2507.14600

A Hybrid Classical-Quantum Rainbow Table Attack on Human Passwords

MA. Khajeian

Published Jul 19, 2025• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2507.14600

Related papers

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

Distributed Brute-Force Password Recovery with a Partitioned Quantum Grover's Algorithm

Ahcène Bounceur

In the booming field of quantum computing, Grover's Algorithm emerges as a pivotal quantum search algorithm, theoretically capable of outperforming classical brute-force search methods by exploiting the principles of superposition and quantum parallelism. However, the practical application of Grover's Algorithm to crack complex passwords is limited by the nascent stage of quantum technology, which is currently challenged by limitations in qubit count and coherence times. This paper proposes a novel distributed quantum computing framework that aims to circumvent these limitations by partitioning the search space for a complex password among an array of quantum processors. Each processor executes Grover's Algorithm on a fraction of the total search space, thereby reducing the complexity and quantum resource requirements for each individual computation. The partial results are then transmitted to a central classical computer, which synthesizes them into the final password. This distributed approach not only makes the task feasible for (with) present-day quantum systems but also presents a scalable model that could adapt to the rapid advancements in quantum technologies. By dissecting the complexity of the quantum brute-force problem into smaller, more manageable units, this method holds the potential to significantly reduce the time complexity of password recovery processes and thus presents a profound progress (implications) for the fields of cryptography and cybersecurity.

International Conference on Computational Intelligence and Network Systems (CINS)•Nov 28, 2024•4 citations

Quantum-Resistant Password Generation A Comprehensive Model with QNN, Simplified Entropy, and QKD Integration

Swati Shinde, Amogh Chandragiri, Akshay Chaudhari +2 more

Passwords remain a universal mechanism for user authentication, yet they are troubled by weak choices and vulnerabilities. The arrival of quantum computing threatens to worsen these issues by enabling faster password cracking. Conventional wisdom suggests using longer or more complex passwords to counter quantum attacks, but this approach can be impractical.In this paper, we propose a novel quantum-resistant password generation framework that leverages a Quantum Neural Network (QNN) to create highly secure passwords. Our approach combines quantum machine learning with entropy-based rigorous analysis to ensure that generated passwords are resilient even against adversaries equipped with quantum computing capabilities. We design and train a QNN using large-scale password datasets (including RockYou, Have I Been Pwned, and others) to learn the distribution of common passwords and then generate passwords that avoid these patterns. To rigorously quantify security, we replace simplistic entropy estimations with a von Neumann entropy analysis, measuring the quantum entropy of the password generation process. The experimental results demonstrate that our QNN-generated passwords achieve significantly higher entropy and resistance to guessing attacks compared to conventional methods. This research highlights how quantum computing can be harnessed not only as a threat but as a tool to enhance security.

Global Conference in Emerging Technology (GINOTECH)•May 9, 2025•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

Differentiable Architecture Search for Adversarially Robust Quantum Computer Vision

Mohamed Afane, Quanjiang Long, Haoting Shen +4 more

Current quantum neural networks suffer from extreme sensitivity to both adversarial perturbations and hardware noise, creating a significant barrier to real-world deployment. Existing robustness techniques typically sacrifice clean accuracy or require prohibitive computational resources. We propose a hybrid quantum-classical Differentiable Quantum Architecture Search (DQAS) framework that addresses these limitations by jointly optimizing circuit structure and robustness through gradient-based methods. Our approach enhances traditional DQAS with a lightweight Classical Noise Layer applied before quantum processing, enabling simultaneous optimization of gate selection and noise parameters. This design preserves the quantum circuit's integrity while introducing trainable perturbations that enhance robustness without compromising standard performance. Experimental validation on MNIST, FashionMNIST, and CIFAR datasets shows consistent improvements in both clean and adversarial accuracy compared to existing quantum architecture search methods. Under various attack scenarios, including Fast Gradient Sign Method (FGSM), Projected Gradient Descent (PGD), Basic Iterative Method (BIM), and Momentum Iterative Method (MIM), and under realistic quantum noise conditions, our hybrid framework maintains superior performance. Testing on actual quantum hardware confirms the practical viability of discovered architectures. These results demonstrate that strategic classical preprocessing combined with differentiable quantum architecture optimization can significantly enhance quantum neural network robustness while maintaining computational efficiency.

quant-pharXiv:2601.18058•Quantum Machine Intelligence•Jan 27, 2026•4 citations

Quantum Adiabatic Generation of Human-Like Passwords

Sascha Mücke, Raoul Heese, Thore Gerlach +3 more

Generative Artificial Intelligence (GenAI) for Natural Language Processing (NLP) is the predominant AI technology to date. An important perspective for Quantum Computing (QC) is the question whether QC has the potential to reduce the vast resource requirements for training and operating GenAI models. While large-scale generative NLP tasks are currently out of reach for practical quantum computers, the generation of short semantic structures such as passwords is not. Generating passwords that mimic real user behavior has many applications, for example to test an authentication system against realistic threat models. Classical password generation via deep learning have recently been investigated with significant progress in their ability to generate novel, realistic password candidates. In the present work we investigate the utility of adiabatic quantum computers for this task. More precisely, we study different encodings of token strings and propose novel approaches based on the Quadratic Unconstrained Binary Optimization (QUBO) and the Unit-Disk Maximum Independent Set (UD-MIS) problems. Our approach allows us to estimate the token distribution from data and adiabatically prepare a quantum state from which we eventually sample the generated passwords via measurements. Our results show that relatively small samples of$\mathbf{1 2 8}$passwords, generated on the QuEra Aquila 256-qubit neutral atom quantum computer, contain human-like passwords such as Tunas200992 or teedem28iglove.

arXiv:2506.08917•IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•0 citations
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.
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.
In the booming field of quantum computing, Grover's Algorithm emerges as a pivotal quantum search algorithm, theoretically capable of outperforming classical brute-force search methods by exploiting the principles of superposition and quantum parallelism. However, the practical application of Grover's Algorithm to crack complex passwords is limited by the nascent stage of quantum technology, which is currently challenged by limitations in qubit count and coherence times. This paper proposes a novel distributed quantum computing framework that aims to circumvent these limitations by partitioning the search space for a complex password among an array of quantum processors. Each processor executes Grover's Algorithm on a fraction of the total search space, thereby reducing the complexity and quantum resource requirements for each individual computation. The partial results are then transmitted to a central classical computer, which synthesizes them into the final password. This distributed approach not only makes the task feasible for (with) present-day quantum systems but also presents a scalable model that could adapt to the rapid advancements in quantum technologies. By dissecting the complexity of the quantum brute-force problem into smaller, more manageable units, this method holds the potential to significantly reduce the time complexity of password recovery processes and thus presents a profound progress (implications) for the fields of cryptography and cybersecurity.
Passwords remain a universal mechanism for user authentication, yet they are troubled by weak choices and vulnerabilities. The arrival of quantum computing threatens to worsen these issues by enabling faster password cracking. Conventional wisdom suggests using longer or more complex passwords to counter quantum attacks, but this approach can be impractical.In this paper, we propose a novel quantum-resistant password generation framework that leverages a Quantum Neural Network (QNN) to create highly secure passwords. Our approach combines quantum machine learning with entropy-based rigorous analysis to ensure that generated passwords are resilient even against adversaries equipped with quantum computing capabilities. We design and train a QNN using large-scale password datasets (including RockYou, Have I Been Pwned, and others) to learn the distribution of common passwords and then generate passwords that avoid these patterns. To rigorously quantify security, we replace simplistic entropy estimations with a von Neumann entropy analysis, measuring the quantum entropy of the password generation process. The experimental results demonstrate that our QNN-generated passwords achieve significantly higher entropy and resistance to guessing attacks compared to conventional methods. This research highlights how quantum computing can be harnessed not only as a threat but as a tool to enhance security.
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.
Current quantum neural networks suffer from extreme sensitivity to both adversarial perturbations and hardware noise, creating a significant barrier to real-world deployment. Existing robustness techniques typically sacrifice clean accuracy or require prohibitive computational resources. We propose a hybrid quantum-classical Differentiable Quantum Architecture Search (DQAS) framework that addresses these limitations by jointly optimizing circuit structure and robustness through gradient-based methods. Our approach enhances traditional DQAS with a lightweight Classical Noise Layer applied before quantum processing, enabling simultaneous optimization of gate selection and noise parameters. This design preserves the quantum circuit's integrity while introducing trainable perturbations that enhance robustness without compromising standard performance. Experimental validation on MNIST, FashionMNIST, and CIFAR datasets shows consistent improvements in both clean and adversarial accuracy compared to existing quantum architecture search methods. Under various attack scenarios, including Fast Gradient Sign Method (FGSM), Projected Gradient Descent (PGD), Basic Iterative Method (BIM), and Momentum Iterative Method (MIM), and under realistic quantum noise conditions, our hybrid framework maintains superior performance. Testing on actual quantum hardware confirms the practical viability of discovered architectures. These results demonstrate that strategic classical preprocessing combined with differentiable quantum architecture optimization can significantly enhance quantum neural network robustness while maintaining computational efficiency.
Generative Artificial Intelligence (GenAI) for Natural Language Processing (NLP) is the predominant AI technology to date. An important perspective for Quantum Computing (QC) is the question whether QC has the potential to reduce the vast resource requirements for training and operating GenAI models. While large-scale generative NLP tasks are currently out of reach for practical quantum computers, the generation of short semantic structures such as passwords is not. Generating passwords that mimic real user behavior has many applications, for example to test an authentication system against realistic threat models. Classical password generation via deep learning have recently been investigated with significant progress in their ability to generate novel, realistic password candidates. In the present work we investigate the utility of adiabatic quantum computers for this task. More precisely, we study different encodings of token strings and propose novel approaches based on the Quadratic Unconstrained Binary Optimization (QUBO) and the Unit-Disk Maximum Independent Set (UD-MIS) problems. Our approach allows us to estimate the token distribution from data and adiabatically prepare a quantum state from which we eventually sample the generated passwords via measurements. Our results show that relatively small samples of128\mathbf{1 2 8}128passwords, generated on the QuEra Aquila 256-qubit neutral atom quantum computer, contain human-like passwords such as Tunas200992 or teedem28iglove.