QIris: Quantum Implementation of Rainbow Table Attacks
Lee Jun Quan, Tan Jia Ye, Goh Geok Ling, and Vivek Balachandran

TL;DR
This paper presents a quantum-enhanced rainbow table attack leveraging Grover's Algorithm, demonstrating a prototype that could significantly accelerate password cracking and impact cybersecurity.
Contribution
It introduces a quantum rainbow table concept integrating quantum algorithms with classical cryptography, providing a proof-of-concept implementation.
Findings
Quantum rainbow table prototype developed
Quantum algorithms improve search efficiency
Potential for faster password cracking demonstrated
Abstract
This paper explores the use of Grover's Algorithm in the classical rainbow table, uncovering the potential of integrating quantum computing techniques with conventional cryptographic methods to develop a Quantum Rainbow Table Proof-of-Concept. This leverages on Quantum concepts and algorithms which includes the principle of qubit superposition, entanglement and teleportation, coupled with Grover's Algorithm to enable a more efficient search through the rainbow table. The paper also details on the hardware constraints and the work around to produce better results in the implementation stages. Through this work we develop a working prototype of quantum rainbow table and demonstrate how quantum computing could significantly improve the speed of cyber tools such as password crackers and thus impact the cyber security landscape.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
