In this paper, we propose a quantum circuit implementation of AIM2. We apply optimization to reduce the circuit depth and introduce a method to reuse qubits by performing reverse operations in parallel. For all AIM2 variants (AIM2-I, AIM2-III, and AIM2-V), we design quantum circuits for \(\textsf{Mer}\) , \(\textsf{Mer}^{-1}\) , the linear layer, and feed-forward. We confirm that the \(\textsf{Mer}^{-1}\) operation dominates the overall cost of AIM2 constructions. Compared to the previous version of AIM, AIM2 requires significantly more quantum resources since it introduces \(\textsf{Mer}^{-1}\) before the linear layer. Based on the proposed circuits, we estimate the cost of Grover’s algorithm for key search and compare it with the NIST estimates for AES complexity. As a result, AIM2-I, AIM2-III, and AIM2-V achieve the post-quantum security levels of Level-1, Level-3, and Level-5, respectively.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Quantum Circuit Implementation and Resource Analysis of AIM2

  • Gyeongju Song,
  • Kyungbae Jang,
  • Seyoung Yoon,
  • Minwoo Lee,
  • Hwajeong Seo

摘要

In this paper, we propose a quantum circuit implementation of AIM2. We apply optimization to reduce the circuit depth and introduce a method to reuse qubits by performing reverse operations in parallel. For all AIM2 variants (AIM2-I, AIM2-III, and AIM2-V), we design quantum circuits for \(\textsf{Mer}\) , \(\textsf{Mer}^{-1}\) , the linear layer, and feed-forward. We confirm that the \(\textsf{Mer}^{-1}\) operation dominates the overall cost of AIM2 constructions. Compared to the previous version of AIM, AIM2 requires significantly more quantum resources since it introduces \(\textsf{Mer}^{-1}\) before the linear layer. Based on the proposed circuits, we estimate the cost of Grover’s algorithm for key search and compare it with the NIST estimates for AES complexity. As a result, AIM2-I, AIM2-III, and AIM2-V achieve the post-quantum security levels of Level-1, Level-3, and Level-5, respectively.