Paper 2023/165

Optimizing the depth of quantum implementations of linear layers

Chengkai Zhu, SKLOIS, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China, School of Cyber Security, University of Chinese Academy of Sciences, Beijing, China
Zhenyu Huang, SKLOIS, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China, School of Cyber Security, University of Chinese Academy of Sciences, Beijing, China
Abstract

Synthesis and optimization of quantum circuits are important and fundamental research topics in quantum computation, due to the fact that qubits are very precious and decoherence time which determines the computation time available is very limited. Specifically in cryptography, identifying the minimum quantum resources for implementing an encryption process is crucial in evaluating the quantum security of symmetric-key ciphers. In this work, we investigate the problem of optimizing the depth of quantum circuits for linear layers while utilizing a small number of qubits and quantum gates. To this end, we present a framework for the implementation and optimization of linear Boolean functions, by which we significantly reduce the depth of quantum circuits for many linear layers used in symmetric-key ciphers without increasing the gate count.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Preprint.
Keywords
Quantum CircuitLinear layersSymmetric-key ciphers
Contact author(s)
zhuchengkai @ iie ac cn
huangzhenyu @ iie ac cn
History
2023-02-15: approved
2023-02-10: received
See all versions
Short URL
https://ia.cr/2023/165
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2023/165,
      author = {Chengkai Zhu and Zhenyu Huang},
      title = {Optimizing the depth of quantum implementations of linear layers},
      howpublished = {Cryptology {ePrint} Archive, Paper 2023/165},
      year = {2023},
      url = {https://eprint.iacr.org/2023/165}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.