Depth-optimized quantum circuits for ASCON: AEAD and HASH †

Quantum computing advancements pose security challenges for cryptography. Specifically, Grover’s search algorithm affects the reduction in the search complexity of symmetric-key encryption and hash functions. Recent efforts have been made to estimate the complexity of Grover’s search and evaluate po...

Full description

Saved in:
Bibliographic Details
Main Authors: Oh, Yujin, Jang, Kyungbae, Baksi, Anubhab, Seo, Hwajeong
Other Authors: School of Physical and Mathematical Sciences
Format: Article
Language:English
Published: 2024
Subjects:
Online Access:https://hdl.handle.net/10356/179648
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-179648
record_format dspace
spelling sg-ntu-dr.10356-1796482024-08-19T15:35:01Z Depth-optimized quantum circuits for ASCON: AEAD and HASH † Oh, Yujin Jang, Kyungbae Baksi, Anubhab Seo, Hwajeong School of Physical and Mathematical Sciences Mathematical Sciences Grover’s search algorithm Post-quantum security Quantum computing advancements pose security challenges for cryptography. Specifically, Grover’s search algorithm affects the reduction in the search complexity of symmetric-key encryption and hash functions. Recent efforts have been made to estimate the complexity of Grover’s search and evaluate post-quantum security. In this paper, we propose a depth-optimized quantum circuit implementation for ASCON, including both symmetric-key encryption and hashing algorithms, as a part of the lightweight cryptography standardization by NIST (National Institute of Standards and Technology). As far as we know, this is the first implementation of a quantum circuit for the ASCON AEAD (Authenticated Encryption with Associated Data) scheme, which is a symmetric-key algorithm. Also, our quantum circuit implementation of the ASCON-HASH achieves a reduction of more than 88.9% in the Toffoli depth and more than 80.5% in the full depth compared to the previous work. As per our understanding, the most effective strategy against Grover’s search involves minimizing the depth of the quantum circuit for the target cipher. We showcase the optimal Grover’s search cost for ASCON and introduce a proposed quantum circuit optimized for depth. Furthermore, we utilize the estimated cost to evaluate post-quantum security strength of ASCON, employing the relevant evaluation criteria and the latest advancements in research. Nanyang Technological University Published version This research was financially supported by Hansung University for Hwajeong Seo. This project is partially supported by the Wallenberg-NTU Presidential Post-doctorate Fellowship for Anubhab Baksi. 2024-08-14T04:28:02Z 2024-08-14T04:28:02Z 2024 Journal Article Oh, Y., Jang, K., Baksi, A. & Seo, H. (2024). Depth-optimized quantum circuits for ASCON: AEAD and HASH †. Mathematics, 12(9), 1337-. https://dx.doi.org/10.3390/math12091337 2227-7390 https://hdl.handle.net/10356/179648 10.3390/math12091337 2-s2.0-85193005730 9 12 1337 en Mathematics © 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https:// creativecommons.org/licenses/by/ 4.0/). application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic Mathematical Sciences
Grover’s search algorithm
Post-quantum security
spellingShingle Mathematical Sciences
Grover’s search algorithm
Post-quantum security
Oh, Yujin
Jang, Kyungbae
Baksi, Anubhab
Seo, Hwajeong
Depth-optimized quantum circuits for ASCON: AEAD and HASH †
description Quantum computing advancements pose security challenges for cryptography. Specifically, Grover’s search algorithm affects the reduction in the search complexity of symmetric-key encryption and hash functions. Recent efforts have been made to estimate the complexity of Grover’s search and evaluate post-quantum security. In this paper, we propose a depth-optimized quantum circuit implementation for ASCON, including both symmetric-key encryption and hashing algorithms, as a part of the lightweight cryptography standardization by NIST (National Institute of Standards and Technology). As far as we know, this is the first implementation of a quantum circuit for the ASCON AEAD (Authenticated Encryption with Associated Data) scheme, which is a symmetric-key algorithm. Also, our quantum circuit implementation of the ASCON-HASH achieves a reduction of more than 88.9% in the Toffoli depth and more than 80.5% in the full depth compared to the previous work. As per our understanding, the most effective strategy against Grover’s search involves minimizing the depth of the quantum circuit for the target cipher. We showcase the optimal Grover’s search cost for ASCON and introduce a proposed quantum circuit optimized for depth. Furthermore, we utilize the estimated cost to evaluate post-quantum security strength of ASCON, employing the relevant evaluation criteria and the latest advancements in research.
author2 School of Physical and Mathematical Sciences
author_facet School of Physical and Mathematical Sciences
Oh, Yujin
Jang, Kyungbae
Baksi, Anubhab
Seo, Hwajeong
format Article
author Oh, Yujin
Jang, Kyungbae
Baksi, Anubhab
Seo, Hwajeong
author_sort Oh, Yujin
title Depth-optimized quantum circuits for ASCON: AEAD and HASH †
title_short Depth-optimized quantum circuits for ASCON: AEAD and HASH †
title_full Depth-optimized quantum circuits for ASCON: AEAD and HASH †
title_fullStr Depth-optimized quantum circuits for ASCON: AEAD and HASH †
title_full_unstemmed Depth-optimized quantum circuits for ASCON: AEAD and HASH †
title_sort depth-optimized quantum circuits for ascon: aead and hash †
publishDate 2024
url https://hdl.handle.net/10356/179648
_version_ 1814047204472520704