Synthesizing Quantum Circuits of AES with Lower T-depth and Less Qubits

The significant progress in the development of quantum computers has made the study of cryptanalysis based on quantum computing an active topic. To accurately estimate the resources required to carry out quantum attacks, the involved quantum algorithms have to be synthesized into quantum circuits wi...

Full description

Saved in:
Bibliographic Details
Published inAdvances in Cryptology - ASIACRYPT 2022 Vol. 13793; pp. 614 - 644
Main Authors Huang, Zhenyu, Sun, Siwei
Format Book Chapter
LanguageEnglish
Published Switzerland Springer 2023
Springer Nature Switzerland
SeriesLecture Notes in Computer Science
Subjects
Online AccessGet full text

Cover

Loading…
Abstract The significant progress in the development of quantum computers has made the study of cryptanalysis based on quantum computing an active topic. To accurately estimate the resources required to carry out quantum attacks, the involved quantum algorithms have to be synthesized into quantum circuits with basic quantum gates. In this work, we present several generic synthesis and optimization techniques for circuits implementing the quantum oracles of iterative symmetric-key ciphers that are commonly employed in quantum attacks based on Grover and Simon’s algorithms. Firstly, a general structure for implementing the round functions of block ciphers in-place is proposed. Then, we present some novel techniques for synthesizing efficient quantum circuits of linear and non-linear cryptographic building blocks. We apply these techniques to AES and systematically investigate the strategies for depth-width trade-offs. Along the way, we derive a quantum circuit for the AES S-box with provably minimal T-depth based on some new observations on its classical circuit. As a result, the T-depth and width (number of qubits) required for implementing the quantum circuits of AES are significantly reduced. Compared with the circuit proposed in EUROCRYPT 2020, the T-depth is reduced from 60 to 40 without increasing the width or 30 with a slight increase in width. These circuits are fully implemented in Microsoft Q# and the source code is publicly available. Compared with the circuit proposed in ASIACRYPT 2020, the width of one of our circuits is reduced from 512 to 371, and the Toffoli-depth is reduced from 2016 to 1558 at the same time. Actually, we can reduce the width to 270 at the cost of increased depth. Moreover, a full spectrum of depth-width trade-offs is provided, setting new records for the synthesis and optimization of quantum circuits of AES.
AbstractList The significant progress in the development of quantum computers has made the study of cryptanalysis based on quantum computing an active topic. To accurately estimate the resources required to carry out quantum attacks, the involved quantum algorithms have to be synthesized into quantum circuits with basic quantum gates. In this work, we present several generic synthesis and optimization techniques for circuits implementing the quantum oracles of iterative symmetric-key ciphers that are commonly employed in quantum attacks based on Grover and Simon’s algorithms. Firstly, a general structure for implementing the round functions of block ciphers in-place is proposed. Then, we present some novel techniques for synthesizing efficient quantum circuits of linear and non-linear cryptographic building blocks. We apply these techniques to AES and systematically investigate the strategies for depth-width trade-offs. Along the way, we derive a quantum circuit for the AES S-box with provably minimal T-depth based on some new observations on its classical circuit. As a result, the T-depth and width (number of qubits) required for implementing the quantum circuits of AES are significantly reduced. Compared with the circuit proposed in EUROCRYPT 2020, the T-depth is reduced from 60 to 40 without increasing the width or 30 with a slight increase in width. These circuits are fully implemented in Microsoft Q# and the source code is publicly available. Compared with the circuit proposed in ASIACRYPT 2020, the width of one of our circuits is reduced from 512 to 371, and the Toffoli-depth is reduced from 2016 to 1558 at the same time. Actually, we can reduce the width to 270 at the cost of increased depth. Moreover, a full spectrum of depth-width trade-offs is provided, setting new records for the synthesis and optimization of quantum circuits of AES.
Author Huang, Zhenyu
Sun, Siwei
Author_xml – sequence: 1
  givenname: Zhenyu
  surname: Huang
  fullname: Huang, Zhenyu
– sequence: 2
  givenname: Siwei
  surname: Sun
  fullname: Sun, Siwei
  email: sunsiwei@ucas.ac.cn
BookMark eNo1kMFOwzAQRA0URFv6Bxz8Awbb69jxsapKQYqEUMvZshOHBkoS4kQVfD1uC6fVzu6MRm-CRnVTe4RuGb1jlKp7rVIChAIjnGupSWI4O0OzKEMUj1pyjsZMMkYAhL5Ak_9DykZoTIFyopWAKzRhoJhKtAB5jWYhvFNKeYwRmo_Rav1d91sfqp-qfsMvg6374RMvqi4fqj7gpsTz5Rrvq36Ls2bvO7whhW_jZusCZz6E6HHx8wZdlnYX_OxvTtHrw3KzeCTZ8-ppMc-IA0V7Im2RSqXAxs7gFBdelZrG4gISapOkdIXPdepcGQcrpdNMWuqEpSxPeFrCFPFTbmi72Nh3xjXNRzCMmgM3EwEZMDHQHBmZA7doEidT2zVfgw-98QdX7uu-s7t8a9ved8EolkoOYARNjOQSfgGix2xg
CitedBy_id crossref_primary_10_1007_s12095_023_00666_y
crossref_primary_10_3390_app13063558
crossref_primary_10_1587_essfr_17_1_59
crossref_primary_10_1007_s11128_023_04002_4
crossref_primary_10_3390_electronics12214485
crossref_primary_10_1360_SSPMA_2023_0386
crossref_primary_10_3390_app13085156
crossref_primary_10_1007_s11128_023_03908_3
crossref_primary_10_3390_s23063156
crossref_primary_10_3390_app131810373
crossref_primary_10_3389_fphy_2023_1171753
crossref_primary_10_1007_s11128_024_04359_0
crossref_primary_10_1007_s11128_024_04394_x
crossref_primary_10_62056_anmmp_4c2h
crossref_primary_10_1007_s11128_023_04182_z
crossref_primary_10_1360_SSPMA_2022_0485
crossref_primary_10_3390_app12146870
crossref_primary_10_1109_TIFS_2024_3402970
ContentType Book Chapter
Copyright International Association for Cryptologic Research 2022
Copyright_xml – notice: International Association for Cryptologic Research 2022
DBID FFUUA
DEWEY 005.8
DOI 10.1007/978-3-031-22969-5_21
DatabaseName ProQuest Ebook Central - Book Chapters - Demo use only
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EISBN 9783031229695
303122969X
EISSN 1611-3349
Editor Lin, Dongdai
Agrawal, Shweta
Editor_xml – sequence: 1
  fullname: Lin, Dongdai
– sequence: 1
  givenname: Shweta
  surname: Agrawal
  fullname: Agrawal, Shweta
  email: shweta.a@cse.iitm.ac.in
– sequence: 2
  fullname: Agrawal, Shweta
– sequence: 2
  givenname: Dongdai
  surname: Lin
  fullname: Lin, Dongdai
  email: ddlin@iie.ac.cn
EndPage 644
ExternalDocumentID EBC7186233_405_626
GroupedDBID AABBV
AALIB
AAZWU
ABSVR
ABTHU
ABVND
ACHZO
ACPMC
ADNVS
AEDXK
AEJLV
AEKFX
AHVRR
ALMA_UNASSIGNED_HOLDINGS
BBABE
CZZ
FFUUA
IEZ
SBO
TPJZQ
TSXQS
Z7R
Z7X
Z7Z
Z81
Z83
Z84
Z88
ID FETCH-LOGICAL-b370t-6ad86773a3343b724e7f900314350a55fbdec98bbfec91f6b916a0b4a01c528f3
ISBN 3031229681
9783031229688
ISSN 0302-9743
IngestDate Wed Nov 06 06:45:32 EST 2024
Fri Jul 26 00:34:00 EDT 2024
IsPeerReviewed true
IsScholarly true
LCCallNum QA268
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-b370t-6ad86773a3343b724e7f900314350a55fbdec98bbfec91f6b916a0b4a01c528f3
OCLC 1371759436
PQID EBC7186233_405_626
PageCount 31
ParticipantIDs springer_books_10_1007_978_3_031_22969_5_21
proquest_ebookcentralchapters_7186233_405_626
PublicationCentury 2000
PublicationDate 2023
2022
PublicationDateYYYYMMDD 2023-01-01
2022-01-01
PublicationDate_xml – year: 2023
  text: 2023
PublicationDecade 2020
PublicationPlace Switzerland
PublicationPlace_xml – name: Switzerland
– name: Cham
PublicationSeriesTitle Lecture Notes in Computer Science
PublicationSeriesTitleAlternate Lect.Notes Computer
PublicationSubtitle 28th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, December 5-9, 2022, Proceedings, Part III
PublicationTitle Advances in Cryptology - ASIACRYPT 2022
PublicationYear 2023
2022
Publisher Springer
Springer Nature Switzerland
Publisher_xml – name: Springer
– name: Springer Nature Switzerland
RelatedPersons Hartmanis, Juris
Gao, Wen
Steffen, Bernhard
Bertino, Elisa
Goos, Gerhard
Yung, Moti
RelatedPersons_xml – sequence: 1
  givenname: Gerhard
  surname: Goos
  fullname: Goos, Gerhard
– sequence: 2
  givenname: Juris
  surname: Hartmanis
  fullname: Hartmanis, Juris
– sequence: 3
  givenname: Elisa
  surname: Bertino
  fullname: Bertino, Elisa
– sequence: 4
  givenname: Wen
  surname: Gao
  fullname: Gao, Wen
– sequence: 5
  givenname: Bernhard
  orcidid: 0000-0001-9619-1558
  surname: Steffen
  fullname: Steffen, Bernhard
– sequence: 6
  givenname: Moti
  orcidid: 0000-0003-0848-0873
  surname: Yung
  fullname: Yung, Moti
SSID ssj0002830492
ssj0002792
Score 2.2540886
Snippet The significant progress in the development of quantum computers has made the study of cryptanalysis based on quantum computing an active topic. To accurately...
SourceID springer
proquest
SourceType Publisher
StartPage 614
SubjectTerms AES
depth
Grover’s algorithm
Quantum circuit
Title Synthesizing Quantum Circuits of AES with Lower T-depth and Less Qubits
URI http://ebookcentral.proquest.com/lib/SITE_ID/reader.action?docID=7186233&ppg=626
http://link.springer.com/10.1007/978-3-031-22969-5_21
Volume 13793
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Nb9QwELVouUAPQAHRUpAP3CKjxHY-fFyiLaXaIspuUTlZcRJLe2Bb7SaH9tczEyfZTeilXJLISqKRnzWeGc-bIeST5VkGbgFWAPBDJkMVMWUDcFXyQgQmsbnkSE6--B6dXcnz6_B62-ezYZdU5nN-_yCv5H9QhTHAFVmyj0C2_ykMwDPgC1dAGK4j43cYZnXpxe70vslnTdd3t5WrpsS8yfzbJP35-8fC4z7nu2tifrcCe2-zvMf4wGUNk1r_8dLlOq-XLqVjMp27yOwMm6d5C1aUty33bYYq8bI2y2oQKeBiFCnoIoUDDxJ2sIBzFbneer1KFLHrW_iPgt3NqYBPGX6rWKgdzXlYzzrioyLXzbY5_ZLCfghWl9BgLGp4aY_sxQq009PJ9Hz2q4-QYWkyqdCV7oUMXMmkrdA7ZMiHZBq4DaOT7saAWLwkB0gqocj2AClfkSfl6pC86Fpq0FbDHpLnF30Z3c1r8nUXMNoCRjvA6I2lABhFwGgDGG0BowAYRcCoA-wNuTqdLtIz1na-YEbEfsWirMA6gyITQgoTc1nGFkPOaNz6WRhaU5S5SoyxcAtsZMDIz3wjMz_IQ55Y8Zbsr25W5TtCJZKlM99GpUykKnkWgoMcJIZLmwtVqCPCuinSzfl8mxScuwnZ6BFYR8Tr5lHj6xvdFb4GALTQIKRuANAIwPEj__6ePNuu3BOyX63r8gNYfZX52C6Pvwl_Tn8
link.rule.ids 782,783,787,796,27938
linkProvider Library Specific Holdings
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.title=Advances+in+Cryptology+-+ASIACRYPT+2022&rft.atitle=Synthesizing+Quantum+Circuits+of+AES+with+Lower+T-depth+and+Less+Qubits&rft.date=2023-01-01&rft.pub=Springer&rft.isbn=9783031229688&rft.volume=13793&rft_id=info:doi/10.1007%2F978-3-031-22969-5_21&rft.externalDBID=626&rft.externalDocID=EBC7186233_405_626
thumbnail_s http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Febookcentral.proquest.com%2Fcovers%2F7186233-l.jpg