Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2503.06097 · Quantum Information Processing

Quantum circuit for implementing AES S-box with low costs

Hui-Nan Chen, Bin‐Bin Cai, Fei Gao, Song Lin

Published Feb 11, 2026• 5 citations
arXivHTMLPDF
DOI
10.1007/s11128-026-05083-7

Related papers

Quantum Circuit Synthesis for AES with Low DW-Cost

Haoyu Liao, Qing-bin Luo

Lecture notes in computer science•Dec 7, 2025•1 citation

Towards Optimizing Quantum Implementation of AES S-box.

Doyoung Chung, Jooyoung Lee, Seungkwang Lee +1 more

•Jan 1, 2020•1 citation

Quantum Circuit Implementations of AES with Fewer Qubits

Jian Xiao Zou, Zihao Wei, Siwei Sun +2 more

Lecture notes in computer science•Jan 1, 2020•82 citations

Novel quantum circuit implementation of Advanced Encryption Standard with low costs

ZhenQiang Li, Bin‐Bin Cai, Hong-Wei Sun +5 more

Science China Physics Mechanics and Astronomy•Jul 25, 2022•54 citations

Quantum Circuits of AES with a Low-Depth Linear Layer and a New Structure

Haotian Shi, Xiutao Feng

Lecture notes in computer science•Dec 11, 2024•17 citations

Quantum circuit for implementing Camellia S-box with low costs

ZhenQiang Li, Gao Fei, Qin Su-Juan +1 more

Camellia, after AES, is one of the most competitive block cipher algorithms. It has been widely used in many fields of information security. Camellia's distinctive nonlinear component is the S-box. This paper studies how to build the quantum circuit of the Camellia S-box at lower costs. First, the multiplicative inversion in F_2^8can be obtained by the multiplicative inversion (and multiplication) in F_2^4via a mapping matrix, and the latter can be implemented by the automation tool LIGHTER-R. The affine transformation of the S-box is then implemented with CNOT and NOT gates using the PLU decomposition and elimination approach. Finally, the Camellia S-box quantum circuit is built with 20 qubits, 54 Toffoli gates, 196 CNOT gates, 13 NOT gates, and a Toffoli depth of 42. In comparison with the previous study, which required 23 qubits, 67 Toffoli, and 38 CNOT gates, and a Toffoli depth of 53, the S-box quantum circuit in this paper requires fewer resources. Furthermore, the S-box quantum circuit used in the study can reduce the quantum resources in implementing Camellia, reducing the quantum circuit scale required to attack Camellia by the Grover algorithm.

Zhongguo kexue. Wulixue Lixue Tianwenxue•Mar 2, 2023•7 citations
Camellia, after AES, is one of the most competitive block cipher algorithms. It has been widely used in many fields of information security. Camellia's distinctive nonlinear component is the S-box. This paper studies how to build the quantum circuit of the Camellia S-box at lower costs. First, the multiplicative inversion in F_2^8can be obtained by the multiplicative inversion (and multiplication) in F_2^4via a mapping matrix, and the latter can be implemented by the automation tool LIGHTER-R. The affine transformation of the S-box is then implemented with CNOT and NOT gates using the PLU decomposition and elimination approach. Finally, the Camellia S-box quantum circuit is built with 20 qubits, 54 Toffoli gates, 196 CNOT gates, 13 NOT gates, and a Toffoli depth of 42. In comparison with the previous study, which required 23 qubits, 67 Toffoli, and 38 CNOT gates, and a Toffoli depth of 53, the S-box quantum circuit in this paper requires fewer resources. Furthermore, the S-box quantum circuit used in the study can reduce the quantum resources in implementing Camellia, reducing the quantum circuit scale required to attack Camellia by the Grover algorithm.