Simulating Quantum Attacks on Classical Cryptography with CUDA-Q


Kurtaran Özbudak E., Yılmaz E.

2026 5th International Informatics and Software Engineering Conference (IISEC), Ankara, Türkiye, 5 - 06 Şubat 2026, ss.672-677, (Tam Metin Bildiri)

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Doi Numarası: 10.1109/iisec69317.2026.11418518
  • Basıldığı Şehir: Ankara
  • Basıldığı Ülke: Türkiye
  • Sayfa Sayıları: ss.672-677
  • TED Üniversitesi Adresli: Evet

Özet

Quantum Computing introduces a new computational power that can overcome the problems considered infeasible with classical computational power and challenges the security foundations of classical cryptographic systems. This paper analyzes the impact of algorithms leveraging quantum properties on classical cryptographic solutions. Cryptographic systems are classified into two main types as symmetric and asymmetric encryption and quantum algorithms affect both. Shor’s algorithm implies that sufficiently large quantum computers could efficiently break widely deployed public-key schemes. Grover’s algorithm provides a quadratic speedup for brute-force search that reduces the effective security of symmetric ciphers. In this paper, we implemented a hybrid quantum-classical computing simulation environment using the CUDA-Q framework to investigate the effect of quantum computing on cryptographic protocols and evaluate the scalability of these quantum attacks. Our experiments have shown that while the GPU's parallel processing capability is much better choice than the CPU's sequential processing capability in simulations of quantum environments and quantum algorithms, its memory requirements still make it infeasible for attacking classical cryptological solutions.