Paper 2024/1221

Depth Optimized Quantum Circuits for HIGHT and LEA

Kyungbae Jang, Hansung University
Yujin Oh, Hansung University
Minwoo Lee, Hansung University
Dukyoung Kim, Hansung University
Hwajeong Seo, Hansung University
Abstract

Quantum computers can model and solve several problems that have posed challenges for classical super computers, leveraging their natural quantum mechanical characteristics. A large-scale quantum computer is poised to significantly reduce security strength in cryptography. In this context, extensive research has been conducted on quantum cryptanalysis. In this paper, we present optimized quantum circuits for Korean block ciphers, HIGHT and LEA. Our quantum circuits for HIGHT and LEA demonstrate the lowest circuit depth compared to previous results. Specifically, we achieve depth reductions of 48% and 74% for HIGHT and LEA, respectively. We employ multiple novel techniques that effectively reduce the quantum circuit depth with a reasonable increase in qubit count. Based on our depth-optimized quantum circuits for HIGHT and LEA block ciphers, we estimate the lowest quantum attack complexity for Grover’s key search. Our quantum circuit can be utilized for other quantum algorithms, not only for Grover’s algorithm. Furthermore, the optimization methods gathered in this work can be adopted for generic quantum implementations in cryptography.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Published elsewhere. Silicon Valley Cybersecurity Conference 2024
Keywords
Quantum ComputersHIGHTLEAGrover's Algorithm
Contact author(s)
starj1023 @ gmail com
oyj0922 @ gmail com
minunejip @ gmail com
dudejrdl123 @ gmail com
hwajeong84 @ gmail com
History
2024-07-31: approved
2024-07-31: received
See all versions
Short URL
https://ia.cr/2024/1221
License
No rights reserved
CC0

BibTeX

@misc{cryptoeprint:2024/1221,
      author = {Kyungbae Jang and Yujin Oh and Minwoo Lee and Dukyoung Kim and Hwajeong Seo},
      title = {Depth Optimized Quantum Circuits for {HIGHT} and {LEA}},
      howpublished = {Cryptology ePrint Archive, Paper 2024/1221},
      year = {2024},
      note = {\url{https://eprint.iacr.org/2024/1221}},
      url = {https://eprint.iacr.org/2024/1221}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.