Quantum Circuit Optimization for the S-Box of AES-128

被引：0

作者：

Liu J. ^{[1
,2
]}

Wang H. ^{[1
,2
]}

Ma Z. ^{[1
,2
]}

Duan Q. ^{[1
,2
]}

Fei Y. ^{[1
,2
]}

Meng X. ^{[1
,2
]}

机构：

[1] State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou

[2] Henan Key Laboratory of Network Cryptography Technology, Zhengzhou

来源：

Dianzi Keji Daxue Xuebao/Journal of the University of Electronic Science and Technology of China | 2024年 / 53卷 / 01期

关键词：

multiplication inverse; optimization; quantum circuit; S-box;

D O I：

10.12178/1001-0548.2022346

中图分类号：

学科分类号：

摘要：

With the help of the space-efficient quantum Karatsuba algorithm for multiplication, the quantum implementation for the 8 × 8 S-box of AES-128 has been optimized. At the same time, the product of the number of qubits and the depth of T gates has been introduced to measure the tradeoff between time resource cost and space resource cost. It has been shown in the analysis of the implementation of the 8 × 8 S-box transformation that the circuit using the space-efficient quantum Karatsuba multiplication to find the multiplication inverse has better performance, and all of the number of Toffoli gates, the number of qubits, and the product of the number of qubits and the depth of T gates are all better. Furthermore, the method of windowed quantum lookups has been used in this paper to optimize the resource cost for implementing the multiplication inverse and the S-box. Based on them, the resource needed has been analyzed and verified in Qiskit. © 2024 Univ. of Electronic Science and Technology of China. All rights reserved.

引用

页码：144 / 148

页数：4

共 14 条

[1] ITOH T, TSUJII S., A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases, Information and Computation, 78, 3, pp. 171-177, (1988)
[2] GRASSL M, LANGENBERG B, ROETTELER M, Et al., Applying grover’s algorithm to AES: Quantum resource estimates, 2016 7th International Conference on Post-Quantum Cryptography (PQCrypto 2016), pp. 29-43, (2016)
[3] MASLOV D, MATHEW J, CHEUNG D, Et al., An O(m2)depth quantum algorithm for the elliptic curve discrete logarithm problem over GF(2m)a, Quantum Information & Computation, 9, 7, pp. 610-621, (2009)
[4] KEPLEY S, STEINWANDT R., Quantum circuits for F2nmultiplication with subquadratic gate count, Quantum Information Processing, 14, 7, pp. 2373-2386, (2015)
[5] ALMAZROOIE M, SAMSUDIN A, ABDULLAH R, Et al., Quantum reversible circuit of AES-128, Quantum Information Processing, 17, 5, pp. 1-30, (2018)
[6] LANGENBERG B, PHAM H, STEINWANDT R., Reducing the cost of implementing the advanced encryption standard as a quantum circuit, IEEE Transactions on Quantum Engineering, 1, pp. 1-12, (2020)
[7] FOWLER A G., Time-optimal quantum computation
[8] HUANG Z, SUN S., Synthesizing quantum circuits of AES with lower T-depth and less qubits, 2022 28th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT 2022), pp. 614-644, (2023)
[9] JANG K, BAKSI A, SONG G, Et al., Quantum analysis of AES
[10] HOOF I., Space-efficient quantum multiplication of polynomials for binary finite fields with sub-quadratic Toffoli gate count, Quantum Information & Computation, 20, pp. 721-735, (2020)

← 1 2 →