Ascon v1.2: Lightweight Authenticated Encryption and Hashing

Dobraunig, Christoph; Eichlseder, Maria; Mendel, Florian; Schläffer, Martin

doi:10.1007/s00145-021-09398-9

Cited by 221 publications

(149 citation statements)

References 83 publications

Supporting

Mentioning

147

Contrasting

Unclassified

Order By: Relevance

“…Since then, the family has been extended by hashing schemes and is now a finalist in the NIST LWC lightweight cryptography standardization process [DEMS21a,DEMS21b]. The Ascon permutation underlying all these schemes of the Ascon family is also used in a second LWC finalist, Isap [DEM + 21, DEM + 20].…”

Section: Specification Of the Ascon Familymentioning

confidence: 99%

“…The round constant addition Xors an 8-bit constant to state word x 2 . Since it plays no further role for us, we refer to the design for a full specification [DEMS21b].…”

Section: Specification Of the Ascon Familymentioning

confidence: 99%

“…The circuit representation of the S-box is illustrated in Figure 2a. We refer to the design document [DEMS21b] for alternative representations, including the lookup table.…”

Section: Specification Of the Ascon Familymentioning

confidence: 99%

“…Ascon is one of the 10 NIST LWC finalists [DEMS21a] and the 'first choice' for lightweight authenticated encryption in the portfolio of the CAESAR competition [DEMS16,DEMS21b]. The Ascon suite includes authenticated ciphers and hash functions, all based on the same 320-bit Ascon permutation in different sponge [BDPV07,BDPV08] and duplex [BDPV11] constructions.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Bounds for the Security of Ascon against Differential and Linear Cryptanalysis

Erlacher

Mendel

Eichlseder

2022

ToSC

Self Cite

View full text Add to dashboard Cite

The NIST Lightweight Cryptography project aims to standardize symmetric cryptographic designs, including authenticated encryption and hashing, suitable for constrained devices. One essential criterion for the evaluation of the 10 finalists is the evidence for their security against attacks like linear and differential cryptanalysis. For Ascon, one of the finalists and previous winner of the CAESAR competition in the ‘lightweight’ category, there is a large gap between the proven bounds and the best known characteristics found with heuristic tools: The bounds only cover up to 3 rounds with 15 differentially and 13 linearly active S-boxes, insufficient for proving a level of security for the full constructions.In this paper, we propose a new modeling strategy for SAT solvers and derive strong bounds for the round-reduced Ascon permutation. We prove that 4 rounds already ensure that any single characteristic has a differential probability or squared correlation of at most 2−72, and 6 rounds at most 2−108. This is significantly below the bound that could be exploited within the query limit for keyed Ascon modes. These bounds are probably not tight. To achieve this result, we propose a new search strategy of dividing the search space into a large number of subproblems based on ‘girdle patterns’, and show how to exploit the rotational symmetry of Ascon using necklace theory. Additionally, we evaluate and optimize several aspects of the pure SAT model, including the counter implementation and parallelizability, which we expect to be useful for future applications to other models.

show abstract

Section: Specification Of the Ascon Familymentioning

confidence: 99%

“…The round constant addition Xors an 8-bit constant to state word x 2 . Since it plays no further role for us, we refer to the design for a full specification [DEMS21b].…”

Section: Specification Of the Ascon Familymentioning

confidence: 99%

“…The circuit representation of the S-box is illustrated in Figure 2a. We refer to the design document [DEMS21b] for alternative representations, including the lookup table.…”

Section: Specification Of the Ascon Familymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Bounds for the Security of Ascon against Differential and Linear Cryptanalysis

Erlacher

Mendel

Eichlseder

2022

ToSC

Self Cite

View full text Add to dashboard Cite

show abstract

“…Moreover, Dobraunig et al [8] proposed in 2016 an AE scheme, intuitively defined on words with 64-bit length, called Ascon. The words used in this scheme are only composed from the bitwise Boolean functions like OR, AND, XOR, ROT, and NOT [28]. The permutation of Ascon scheme is similar to this used in MonkeyDuplex construction.…”

Section: Related Workmentioning

confidence: 99%

Authenticated Encryption Based on Chaotic Neural Networks and Duplex Construction

Abdoun¹,

Assad²,

Hoang

et al. 2021

Symmetry

View full text Add to dashboard Cite

In this paper, we propose, implement and analyze an Authenticated Encryption with Associated Data Scheme (AEADS) based on the Modified Duplex Construction (MDC) that contains a chaotic compression function (CCF) based on our chaotic neural network revised (CNNR). Unlike the standard duplex construction (SDC), in the MDC there are two phases: the initialization phase and the duplexing phase, each contain a CNNR formed by a neural network with single layer, and followed by a set of non-linear functions. The MDC is implemented with two variants of width, i.e., 512 and 1024 bits. We tested our proposed scheme against the different cryptanalytic attacks. In fact, we evaluated the key and the message sensitivity, the collision resistance analysis and the diffusion effect. Additionally, we tested our proposed AEADS using the different statistical tests such as NIST, Histogram, chi-square, entropy, and correlation analysis. The experimental results obtained on the security performance of the proposed AEADS system are notable and the proposed system can then be used to protect data and authenticate their sources.

show abstract

Authenticated Encryption Schemes

EICHLSEDER

2023

Symmetric Cryptography 1

View full text Add to dashboard Cite

Ascon v1.2: Lightweight Authenticated Encryption and Hashing

Cited by 221 publications

References 83 publications

Bounds for the Security of Ascon against Differential and Linear Cryptanalysis

Bounds for the Security of Ascon against Differential and Linear Cryptanalysis

Authenticated Encryption Based on Chaotic Neural Networks and Duplex Construction

Authenticated Encryption Schemes

Contact Info

Product

Resources

About