Xoodyak, a lightweight cryptographic scheme

Daemen, Joan; Hoffert, Seth; Peeters, Michael J.; Assche, Gilles Van; Keer, Ronny Van

doi:10.46586/tosc.v2020.is1.60-87

Cited by 56 publications

(26 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…For the sake of simplicity, we refer ppHCTR+[π, Poly K h ] as ppHCTR+ when the underlying primitives are assumed to be understood. By Theorem 2.2, we have (26) Adv tSPRP ppHCTR+ (D) ≤ Adv ±rnd ppHCTR+ (D) + q(q − 1) 2 n+1 , where recall that n is the minimum message length allowed for ppHCTR+. Therefore, we bound the ±rnd advantage of ppHCTR+.…”

Section: Proof Of Theorem 71mentioning

confidence: 99%

“…In fact, in the first round of the ongoing NIST lightweight competition [47], 24 out of 57 submitted constructions are based on cryptographic permutations, and out of 24, 16 permutation based proposals have qualified for round 2. These statistics, beyond any doubt, clearly depict the wide adoption of permutation based schemes [3,4,9,15,26,32] in parallel to the block cipher based designs. Apart from the modes, several cryptographic permutations have also been designed which are claimed to be efficient than standard block ciphers [8,13,4].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Designing tweakable enciphering schemes using public permutations

Chakraborty¹,

Dutta²,

Kundu³

2023

AMC

View full text Add to dashboard Cite

A tweakable enciphering scheme (TES) is a length preserving (tweakable) encryption scheme that provides (tweakable) strong pseudorandom permutation security on arbitrarily long messages. TES is traditionally built using block ciphers and the security of the mode depends on the strong pseudorandom permutation security of the underlying block cipher. In this paper, we construct TESs using public random permutations. Public random permutations are being considered as a replacement of block cipher in several cryptographic schemes including AEs, MACs, etc. However, to our knowledge, a systematic study of constructing TES using public random permutations is missing. In this paper, we give a generic construction of a TES which uses a public random permutation, a length expanding public permutation based PRF and a hash function which is both almost xor universal and almost regular. Further, we propose a concrete length expanding public permutation based PRF construction. We also propose a single keyed TES using a public random permutation and an AXU and almost regular hash function.

show abstract

Section: Proof Of Theorem 71mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Designing tweakable enciphering schemes using public permutations

Chakraborty¹,

Dutta²,

Kundu³

2023

AMC

View full text Add to dashboard Cite

show abstract

“…After eliminating 24 candidates, including the proposals in [48][49][50], 32 candidates were announced in April 2019 as round-2 candidates [47]. In March, 2021, NIST announced 10 finalists from the 32 candidates from round 2 in the final portfolio for standardization: Ascon [51], Elephant [52], GIFT-COFB [53], Grain128-AEAD [54], ISAP [55], Photon-Beetle [56], Romulus [57], Sparkle [58], TinyJambu [59], and Xoodyak [60]…”

Section: ) Ae Schemes In Nist Competitionmentioning

confidence: 99%

Authenticated Encryption Schemes: A Systematic Review

et al. 2022

View full text Add to dashboard Cite

Authenticated encryption (AE) is a cryptographic construction that simultaneously protects confidentiality and integrity. A considerable amount of research has been devoted to the area since its formal inception in 2000. Different lines of research have been proposed to enhance the available schemes in terms of security, efficiency, and design and to implement new ideas. However, a comprehensive systematic literature review (SLR) of the topic has not been provided to the best of the authors' knowledge. This study fills this gap in the literature by proposing a framework for classifying AE schemes and highlighting past contributions to help researchers familiarize themselves with the current state and directions for future research in the area. This SLR covered AE schemes proposed from 2000 to 2020. A total of 217 articles, selected from eight sources, were categorized into independent schemes, CAESAR competition schemes, and NIST lightweight competition schemes. These schemes were then classified according to their design approaches, security-related properties, and functional features. Our analysis reveals that a significant outstanding challenge in AE is to balance security, efficiency, and the provision of desirable features.

show abstract

“…We did not conduct experiments for four or more rounds, but can make use of available information. According to [15], there exist no differential or linear trails over four rounds of Xoodoo with weight below 74. In contrast, Saturnin has roughly 2 82 four-round differential trails with 25 active S-boxes and it has more than 2 94.5 such linear trails.…”

Section: Four Rounds and Beyondmentioning

confidence: 99%

“…In that paper, they have coined the term alignment to characterize this difference and supported it with some propagation experiments on Keccak-f . The Keccak-f line of design has also been refined and led to the 384-bit permutation that is used in Xoodyak [15], namely Xoodoo [16], a truly modern version of Keccak-f . This treatment is not exhaustive and other distinctive design strategies exist.…”

Section: Introductionmentioning

confidence: 99%

Thinking Outside the Superbox

Bordes

Daemen

Kuijsters

et al. 2021

Advances in Cryptology – CRYPTO 2021

Self Cite

View full text Add to dashboard Cite

Designing a block cipher or cryptographic permutation can be approached in many different ways. One such approach, popularized by AES, consists in grouping the bits along the S-box boundaries, e.g., in bytes, and in consistently processing them in these groups. This aligned approach leads to hierarchical structures like superboxes that make it possible to reason about the differential and linear propagation properties using combinatorial arguments. In contrast, an unaligned approach avoids any such grouping in the design of transformations. However, without hierarchical structure, sophisticated computer programs are required to investigate the differential and linear propagation properties of the primitive. In this paper, we formalize this notion of alignment and study four primitives that are exponents of different design strategies.We propose a way to analyze the interactions between the linear and the nonlinear layers w.r.t. the differential and linear propagation, and we use it to systematically compare the four primitives using non-trivial computer experiments. We show that alignment naturally leads to different forms of clustering, e.g., of active bits in boxes, of two-round trails in activity patterns, and of trails in differentials and linear approximations.

show abstract

Xoodyak, a lightweight cryptographic scheme

Cited by 56 publications

References 17 publications

Designing tweakable enciphering schemes using public permutations

Designing tweakable enciphering schemes using public permutations

Authenticated Encryption Schemes: A Systematic Review

Thinking Outside the Superbox

Contact Info

Product

Resources

About