Paper 2020/1405

Grover on GIFT

Kyoungbae Jang, Hyunjun Kim, Siwoo Eum, and Hwajeong Seo

Abstract

Grover search algorithm can be used to find the $n$-bit secret key at the speed of $\sqrt{n}$, which is the most effective quantum attack method for block ciphers. In order to apply the Grover search algorithm, the target block cipher should be implemented in quantum circuits. Many recent research works optimized the expensive substitute layer to evaluate the need for quantum resources of AES block ciphers. Research on the implementation of quantum circuits for lightweight block ciphers such as SIMON, SPECK, HIGHT, CHAM, LEA, and Gimli, an active research field, is also gradually taking place. In this paper, we present optimized implementations of GIFT block ciphers for quantum computers. To the best of our knowledge, this is the first implementation of GIFT in quantum circuits. Finally, we estimate quantum resources for applying the Grover algorithm to the our optimized GIFT quantum circuit.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Preprint. MINOR revision.
Keywords
Quantum ComputersQuantum GatesGrover Search AlgorithmGIFTSPECKSIMONGimliLightweight Block Ciphers
Contact author(s)
starj1023 @ gmail com
khj930704 @ gmail com
shuraatum @ gmail com
hwajeong84 @ gmail com
History
2020-11-15: received
Short URL
https://ia.cr/2020/1405
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2020/1405,
      author = {Kyoungbae Jang and Hyunjun Kim and Siwoo Eum and Hwajeong Seo},
      title = {Grover on GIFT},
      howpublished = {Cryptology ePrint Archive, Paper 2020/1405},
      year = {2020},
      note = {\url{https://eprint.iacr.org/2020/1405}},
      url = {https://eprint.iacr.org/2020/1405}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.