Paper 2023/775 Original: eprint.iacr.org/2023/775 ↗

Exact Security Analysis of ASCON

Bishwajit Chakraborty
Chandranan Dhar
Mridul Nandi
Abstract

The Ascon cipher suite, offering both authenticated encryption with associated data (AEAD) and hashing functionality, has recently emerged as the winner of the NIST Lightweight Cryptography (LwC) standardization process. The AEAD schemes within Ascon, namely Ascon-128 and Ascon-128a, have also been previously selected as the preferred lightweight authenticated encryption solutions in the CAESAR competition. In this paper, we present a tight and comprehensive security analysis of the Ascon AEAD schemes within the random permutation model. Existing integrity analyses of Ascon (and any Duplex AEAD scheme in general) commonly include the term $DT/2^c$, where $D$ and $T$ represent data and time complexities respectively, and $c$ denotes the capacity of the underlying sponge. In this paper, we demonstrate that Ascon achieves AE security when $T$ is bounded by $\min\{2^{\kappa}, 2^c\}$ (where $\kappa$ is the key size), and $DT$ is limited to $2^b$ (with $b$ being the size of the underlying permutation, which is 320 for Ascon). Our findings indicate that in accordance with NIST requirements, Ascon allows for a tag size as low as 64 bits while enabling a higher rate of 184 bits, surpassing the recommended rate.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Preprint.
History
2023-10-27: last updated
2023-05-27: published
Short URL
https://ia.cr/2023/775
License
https://creativecommons.org/licenses/by-sa/4.0/

BibTeX

@misc{cryptoeprint:2023/775,
      author = {Bishwajit Chakraborty and Chandranan Dhar and Mridul Nandi},
      title = {Exact Security Analysis of ASCON},
      howpublished = {Cryptology {ePrint} Archive, Paper 2023/775},
      year = {2023},
      url = {https://eprint.iacr.org/2023/775}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.