Conditional Cube Key Recovery Attack on Round-Reduced Xoodyak

Mohammad Vaziri; Vesselin Velichkov

doi:10.1007/978-3-031-41181-6_3

Conditional Cube Key Recovery Attack on Round-Reduced Xoodyak

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract / Description of output

Since the announcement of the NIST call for a new lightweight cryptographic standard, a lot of schemes have been proposed in response. Xoodyak is one of these schemes and is among the finalists of the NIST competition with a sponge structure very similar to the Keccak hash function – the winner of the SHA3 NIST competition. In this paper with conditional cube attack technique, we fully recover the key of Xoodyak reduced to 6 and 7 rounds with time complexity resp. 2^{42.58} and 2^{76.003} in the nonce-reusing scenario. In our attack setting, we import the cube variables in the absorbing associated data phase, which has higher degree of freedom in comparison to data absorption phase. We use MILP tool for finding enough cube variables to perform the conditional key recovery attack. The 6-round attack is practical and has been implemented. To the best of our knowledge, this is the first proposed attack on 7-round Xoodyak.

Original language	English
Title of host publication	Applied Cryptography and Network Security Workshops
Subtitle of host publication	ACNS 2023 Satellite Workshops, ADSC, AIBlock, AIHWS, AIoTS, CIMSS, Cloud S&P, SCI, SecMT, SiMLA, Kyoto, Japan, June 19–22, 2023, Proceedings
Publisher	Springer
Pages	43-62
Number of pages	20
Volume	13907
ISBN (Electronic)	9783031411816
ISBN (Print)	9783031411809
DOIs	https://doi.org/10.1007/978-3-031-41181-6_3
Publication status	Published - 4 Oct 2023
Event	21st International Conference on Applied Cryptography and Network Security - Kyoto, Japan Duration: 19 Jun 2023 → 22 Jun 2023 Conference number: 21

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	13907
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	21st International Conference on Applied Cryptography and Network Security
Abbreviated title	ACNS 2023
Country/Territory	Japan
City	Kyoto
Period	19/06/23 → 22/06/23

Keywords / Materials (for Non-textual outputs)

Xoodyak
Symmetric-key
cryptanalysis
Conditional Cube Attack
Lightweight Cryptography
MILP

Access to Document

10.1007/978-3-031-41181-6_3Licence: All Rights Reserved

Conditional Cube Key_VAZIRI_DOA16032023_AFV_CC BYAccepted author manuscript, 1.12 MBLicence: Creative Commons: Attribution (CC-BY)

https://eprint.iacr.org/2023/936Licence: Creative Commons: Attribution (CC-BY)
https://link.springer.com/chapter/10.1007/978-3-031-41181-6_3#chapter-infoLicence: All Rights Reserved

Cite this

Vaziri, M., & Velichkov, V. (2023). Conditional Cube Key Recovery Attack on Round-Reduced Xoodyak. In Applied Cryptography and Network Security Workshops: ACNS 2023 Satellite Workshops, ADSC, AIBlock, AIHWS, AIoTS, CIMSS, Cloud S&P, SCI, SecMT, SiMLA, Kyoto, Japan, June 19–22, 2023, Proceedings (Vol. 13907, pp. 43-62). (Lecture Notes in Computer Science; Vol. 13907). Springer. https://doi.org/10.1007/978-3-031-41181-6_3

Vaziri, Mohammad ; Velichkov, Vesselin. / Conditional Cube Key Recovery Attack on Round-Reduced Xoodyak. Applied Cryptography and Network Security Workshops: ACNS 2023 Satellite Workshops, ADSC, AIBlock, AIHWS, AIoTS, CIMSS, Cloud S&P, SCI, SecMT, SiMLA, Kyoto, Japan, June 19–22, 2023, Proceedings. Vol. 13907 Springer, 2023. pp. 43-62 (Lecture Notes in Computer Science).

@inproceedings{bdd73b7570534ee7bda0b29422f37937,

title = "Conditional Cube Key Recovery Attack on Round-Reduced Xoodyak",

abstract = "Since the announcement of the NIST call for a new lightweight cryptographic standard, a lot of schemes have been proposed in response. Xoodyak is one of these schemes and is among the finalists of the NIST competition with a sponge structure very similar to the Keccak hash function – the winner of the SHA3 NIST competition. In this paper with conditional cube attack technique, we fully recover the key of Xoodyak reduced to 6 and 7 rounds with time complexity resp. 2^{42.58} and 2^{76.003} in the nonce-reusing scenario. In our attack setting, we import the cube variables in the absorbing associated data phase, which has higher degree of freedom in comparison to data absorption phase. We use MILP tool for finding enough cube variables to perform the conditional key recovery attack. The 6-round attack is practical and has been implemented. To the best of our knowledge, this is the first proposed attack on 7-round Xoodyak.",

keywords = "Xoodyak, Symmetric-key, cryptanalysis, Conditional Cube Attack, Lightweight Cryptography, MILP",

author = "Mohammad Vaziri and Vesselin Velichkov",

note = "Funding Information: The authors would like to thank Prof. Joan Daemen for drawing our attention to the associated data absorption phase of Xoodyak as a suitable target for analysis and for several fruitful discussions. We also thank Dr. Ling Song for explaining and clarifying some of the technical parts of her previous work. Publisher Copyright: {\textcopyright} 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.; 21st International Conference on Applied Cryptography and Network Security, ACNS 2023 ; Conference date: 19-06-2023 Through 22-06-2023",

year = "2023",

month = oct,

day = "4",

doi = "10.1007/978-3-031-41181-6_3",

language = "English",

isbn = "9783031411809",

volume = "13907",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "43--62",

booktitle = "Applied Cryptography and Network Security Workshops",

address = "United Kingdom",

}

Vaziri, M & Velichkov, V 2023, Conditional Cube Key Recovery Attack on Round-Reduced Xoodyak. in Applied Cryptography and Network Security Workshops: ACNS 2023 Satellite Workshops, ADSC, AIBlock, AIHWS, AIoTS, CIMSS, Cloud S&P, SCI, SecMT, SiMLA, Kyoto, Japan, June 19–22, 2023, Proceedings. vol. 13907, Lecture Notes in Computer Science, vol. 13907, Springer, pp. 43-62, 21st International Conference on Applied Cryptography and Network Security, Kyoto, Japan, 19/06/23. https://doi.org/10.1007/978-3-031-41181-6_3

Conditional Cube Key Recovery Attack on Round-Reduced Xoodyak. / Vaziri, Mohammad; Velichkov, Vesselin.
Applied Cryptography and Network Security Workshops: ACNS 2023 Satellite Workshops, ADSC, AIBlock, AIHWS, AIoTS, CIMSS, Cloud S&P, SCI, SecMT, SiMLA, Kyoto, Japan, June 19–22, 2023, Proceedings. Vol. 13907 Springer, 2023. p. 43-62 (Lecture Notes in Computer Science; Vol. 13907).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Conditional Cube Key Recovery Attack on Round-Reduced Xoodyak

AU - Vaziri, Mohammad

AU - Velichkov, Vesselin

N1 - Conference code: 21

PY - 2023/10/4

Y1 - 2023/10/4

N2 - Since the announcement of the NIST call for a new lightweight cryptographic standard, a lot of schemes have been proposed in response. Xoodyak is one of these schemes and is among the finalists of the NIST competition with a sponge structure very similar to the Keccak hash function – the winner of the SHA3 NIST competition. In this paper with conditional cube attack technique, we fully recover the key of Xoodyak reduced to 6 and 7 rounds with time complexity resp. 2^{42.58} and 2^{76.003} in the nonce-reusing scenario. In our attack setting, we import the cube variables in the absorbing associated data phase, which has higher degree of freedom in comparison to data absorption phase. We use MILP tool for finding enough cube variables to perform the conditional key recovery attack. The 6-round attack is practical and has been implemented. To the best of our knowledge, this is the first proposed attack on 7-round Xoodyak.

AB - Since the announcement of the NIST call for a new lightweight cryptographic standard, a lot of schemes have been proposed in response. Xoodyak is one of these schemes and is among the finalists of the NIST competition with a sponge structure very similar to the Keccak hash function – the winner of the SHA3 NIST competition. In this paper with conditional cube attack technique, we fully recover the key of Xoodyak reduced to 6 and 7 rounds with time complexity resp. 2^{42.58} and 2^{76.003} in the nonce-reusing scenario. In our attack setting, we import the cube variables in the absorbing associated data phase, which has higher degree of freedom in comparison to data absorption phase. We use MILP tool for finding enough cube variables to perform the conditional key recovery attack. The 6-round attack is practical and has been implemented. To the best of our knowledge, this is the first proposed attack on 7-round Xoodyak.

KW - Xoodyak

KW - Symmetric-key

KW - cryptanalysis

KW - Conditional Cube Attack

KW - Lightweight Cryptography

KW - MILP

U2 - 10.1007/978-3-031-41181-6_3

DO - 10.1007/978-3-031-41181-6_3

M3 - Conference contribution

SN - 9783031411809

VL - 13907

T3 - Lecture Notes in Computer Science

SP - 43

EP - 62

BT - Applied Cryptography and Network Security Workshops

PB - Springer

T2 - 21st International Conference on Applied Cryptography and Network Security

Y2 - 19 June 2023 through 22 June 2023

ER -

Vaziri M, Velichkov V. Conditional Cube Key Recovery Attack on Round-Reduced Xoodyak. In Applied Cryptography and Network Security Workshops: ACNS 2023 Satellite Workshops, ADSC, AIBlock, AIHWS, AIoTS, CIMSS, Cloud S&P, SCI, SecMT, SiMLA, Kyoto, Japan, June 19–22, 2023, Proceedings. Vol. 13907. Springer. 2023. p. 43-62. (Lecture Notes in Computer Science). doi: 10.1007/978-3-031-41181-6_3

Conditional Cube Key Recovery Attack on Round-Reduced Xoodyak

Abstract / Description of output

Publication series

Conference

Keywords / Materials (for Non-textual outputs)

Access to Document

Fingerprint

Cite this