Welcome to the resource topic for 2021/554
Title:
Grover on Caesar and Vigenère Ciphers
Authors: Gyeongju Song, Kyungbae Jang, Hyunji Kim, Wai-Kong Lee, Hwajeong Seo
Abstract:Quantum computers can solve or accelerate specific problems that were not possible with classical computers. Grover’s search algorithm, a representative quantum algorithm, finds a specific solution from N unsorted data with O(\sqrt{N}) queries. This quantum algorithm can be used to recover the key of symmetric cryptography. In this paper, we present a practical quantum attack using Grover’s search to recover the key of ciphers ({\tt Caesar} and {\tt Vigenère}). The proposed quantum attack is simulated with quantum programming tools (ProjectQ and Qiskit) provided by IBM. Finally, we minimize the use of quantum resources and recover the key with a high probability.
ePrint: https://eprint.iacr.org/2021/554
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .