Alternative Tower Field Construction for Quantum Implementation of the AES S-Box
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chung, D. | - |
dc.contributor.author | Lee, S. | - |
dc.contributor.author | Choi, D. | - |
dc.contributor.author | Lee, J. | - |
dc.date.accessioned | 2022-12-11T14:40:18Z | - |
dc.date.available | 2022-12-11T14:40:18Z | - |
dc.date.created | 2022-12-08 | - |
dc.date.issued | 2022 | - |
dc.identifier.issn | 0018-9340 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/147021 | - |
dc.description.abstract | Grover's search algorithm allows a quantum adversary to find a kk-bit secret key of a block cipher by making O(2k/2) block cipher queries. Resistance of a block cipher to such an attack is evaluated by quantum resources required to implement Grover's oracle for the target cipher. The quantum resources are typically estimated by the T-depth of its circuit implementation and the number of qubits used by the circuit (width). Since the AES S-box is the only component which requires T-gates in a quantum implementation of AES, recent research has put its focus on efficient implementation of the AES S-box. However, any efficient implementation with low T-depth will not be practical in the real world without considering qubit consumption of the implementation. In this work, we propose three methods of trade-off between time and space for the quantum implementation of the AES S-box. In particular, one of our methods turns out to use the smallest number of qubits among the existing methods, significantly reducing its T-depth. © 1968-2012 IEEE. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | IEEE Computer Society | - |
dc.title | Alternative Tower Field Construction for Quantum Implementation of the AES S-Box | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Choi, D. | - |
dc.identifier.doi | 10.1109/TC.2021.3135759 | - |
dc.identifier.scopusid | 2-s2.0-85121811824 | - |
dc.identifier.bibliographicCitation | IEEE Transactions on Computers, v.71, no.10, pp.2553 - 2564 | - |
dc.relation.isPartOf | IEEE Transactions on Computers | - |
dc.citation.title | IEEE Transactions on Computers | - |
dc.citation.volume | 71 | - |
dc.citation.number | 10 | - |
dc.citation.startPage | 2553 | - |
dc.citation.endPage | 2564 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordAuthor | AES | - |
dc.subject.keywordAuthor | Grover&apos | - |
dc.subject.keywordAuthor | s algorithm | - |
dc.subject.keywordAuthor | multiplicative inversion | - |
dc.subject.keywordAuthor | quantum cryptanalysis | - |
dc.subject.keywordAuthor | Quantum implementation | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.