Quantum Cryptography
By Kyril
As cybersecurity threats grow, quantum computing offers both solutions and challenges to encryption methods. My research explores Grover’s Algorithm, a quantum search algorithm that significantly accelerates brute-force attacks on cryptographic systems. Specifically, I am investigating how Grover’s Algorithm can be applied to password key encryption by reducing the search complexity from classical computing to using quantum superposition and amplitude amplification. Through theoretical analysis and quantum simulation, I am studying how this speedup affects the security of common encryption schemes, such as AES, and how cryptographic resilience must adapt in a post-quantum landscape. Additionally, I am experimenting with Qiskit to simulate quantum circuits, implementing Grover’s Algorithm on small-scale datasets to analyze its practical implications. By bridging quantum computing principles with real-world cryptographic challenges, this project aims to understand both the vulnerabilities and potential countermeasures needed for future encryption standards.