SAT-based Cryptanalysis of Authenticated Ciphers from the CAESAR Competition

Ashutosh Dhar Dwivedi; Miloš Klouček; Pawel Morawiecki; Ivica Nikolić; Josef Pieprzyk; Sebastian Wójtowicz

doi:10.5220/0006387302370246

SAT-based Cryptanalysis of Authenticated Ciphers from the CAESAR Competition

Ashutosh Dhar Dwivedi, Miloš Klouček, Pawel Morawiecki, Ivica Nikolić, Josef Pieprzyk, Sebastian Wójtowicz

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

104 Downloads (Pure)

Abstract

We investigate six authenticated encryption schemes (ACORN, ASCON-128a, ICEPOLE-128a, Ketje Jr, MORUS, and NORX-32) from the CAESAR competition. We aim at state recovery attacks using a SAT solver as a main tool. Our analysis reveals that these schemes, as submitted to CAESAR, provide strong resistance against SAT-based state recoveries. To shed a light on their security margins, we also analyse modified versions of these algorithms, including round-reduced variants and versions with higher security claims. Our attacks on such variants require only a few known plaintext-ciphertext pairs and small memory requirements (to run the SAT solver), whereas time complexity varies from very practical (few seconds on a desktop PC) to 'theoretical' attacks.

Original language	English
Title of host publication	Proceedings of the 14th International Joint Conference on e-Business and Telecommunications (ICETE 2017) : Volume 4: SECRYPT
Editors	Pierangela Samarati, Mohammad S. Obaidat, Enrique Cabello
Number of pages	10
Publisher	SCITEPRESS Digital Library
Publication date	2017
Pages	237-246
ISBN (Electronic)	9789897582592
DOIs	https://doi.org/10.5220/0006387302370246
Publication status	Published - 2017
Externally published	Yes
Event	14th International Joint Conference on e-Business and Telecommunications. ICETE 2017 - Madrid, Spain Duration: 24 Jul 2017 → 26 Jul 2017 Conference number: 14

Conference

Conference	14th International Joint Conference on e-Business and Telecommunications. ICETE 2017
Number	14
Country/Territory	Spain
City	Madrid
Period	24/07/2017 → 26/07/2017
Sponsor	Institute for Systems and Technologies of Information, Control and Communication, Object Management Group, The Foundation for Intelligent Physical Agents, Workflow Management Coalition

Series	Proceedings of the 14th International Joint Conference on e-Business and Telecommunications (ICETE 2017)
Number	4
ISSN	2184-2825

Keywords

Authenticated Encryption
CAESAR
Logic Cryptanalysis
SAT Solvers
SAT-based Cryptanalysis

Access to Document

10.5220/0006387302370246Licence: CC BY-NC-ND

ashutosh_dhar_diwedi_et_al_sat_based_cryptanalysis_of_authenticated_ciphers_publishersversionFinal published version, 290 KBLicence: CC BY-NC-ND

Handle.net

Persistent link

Cite this

Dwivedi, A. D., Klouček, M., Morawiecki, P., Nikolić, I., Pieprzyk, J., & Wójtowicz, S. (2017). SAT-based Cryptanalysis of Authenticated Ciphers from the CAESAR Competition. In P. Samarati, M. S. Obaidat, & E. Cabello (Eds.), Proceedings of the 14th International Joint Conference on e-Business and Telecommunications (ICETE 2017): Volume 4: SECRYPT (pp. 237-246). SCITEPRESS Digital Library. https://doi.org/10.5220/0006387302370246

Dwivedi, Ashutosh Dhar ; Klouček, Miloš ; Morawiecki, Pawel et al. / SAT-based Cryptanalysis of Authenticated Ciphers from the CAESAR Competition. Proceedings of the 14th International Joint Conference on e-Business and Telecommunications (ICETE 2017): Volume 4: SECRYPT. editor / Pierangela Samarati ; Mohammad S. Obaidat ; Enrique Cabello. SCITEPRESS Digital Library, 2017. pp. 237-246 (Proceedings of the 14th International Joint Conference on e-Business and Telecommunications (ICETE 2017); No. 4).

@inproceedings{89ca6595d94d407b926200889b1d738c,

title = "SAT-based Cryptanalysis of Authenticated Ciphers from the CAESAR Competition",

abstract = "We investigate six authenticated encryption schemes (ACORN, ASCON-128a, ICEPOLE-128a, Ketje Jr, MORUS, and NORX-32) from the CAESAR competition. We aim at state recovery attacks using a SAT solver as a main tool. Our analysis reveals that these schemes, as submitted to CAESAR, provide strong resistance against SAT-based state recoveries. To shed a light on their security margins, we also analyse modified versions of these algorithms, including round-reduced variants and versions with higher security claims. Our attacks on such variants require only a few known plaintext-ciphertext pairs and small memory requirements (to run the SAT solver), whereas time complexity varies from very practical (few seconds on a desktop PC) to 'theoretical' attacks.",

keywords = "Authenticated Encryption, CAESAR, Logic Cryptanalysis, SAT Solvers, SAT-based Cryptanalysis",

author = "Dwivedi, {Ashutosh Dhar} and Milo{\v s} Klou{\v c}ek and Pawel Morawiecki and Ivica Nikoli{\'c} and Josef Pieprzyk and Sebastian W{\'o}jtowicz",

year = "2017",

doi = "10.5220/0006387302370246",

language = "English",

series = "Proceedings of the 14th International Joint Conference on e-Business and Telecommunications (ICETE 2017)",

number = "4",

pages = "237--246",

editor = "Pierangela Samarati and Obaidat, {Mohammad S.} and Enrique Cabello",

booktitle = "Proceedings of the 14th International Joint Conference on e-Business and Telecommunications (ICETE 2017)",

publisher = "SCITEPRESS Digital Library",

address = "Portugal",

note = "14th International Joint Conference on e-Business and Telecommunications. ICETE 2017, ICETE2017 ; Conference date: 24-07-2017 Through 26-07-2017",

}

Dwivedi, AD, Klouček, M, Morawiecki, P, Nikolić, I, Pieprzyk, J & Wójtowicz, S 2017, SAT-based Cryptanalysis of Authenticated Ciphers from the CAESAR Competition. in P Samarati, MS Obaidat & E Cabello (eds), Proceedings of the 14th International Joint Conference on e-Business and Telecommunications (ICETE 2017): Volume 4: SECRYPT. SCITEPRESS Digital Library, Proceedings of the 14th International Joint Conference on e-Business and Telecommunications (ICETE 2017), no. 4, pp. 237-246, 14th International Joint Conference on e-Business and Telecommunications. ICETE 2017, Madrid, Spain, 24/07/2017. https://doi.org/10.5220/0006387302370246

SAT-based Cryptanalysis of Authenticated Ciphers from the CAESAR Competition. / Dwivedi, Ashutosh Dhar; Klouček, Miloš; Morawiecki, Pawel et al.
Proceedings of the 14th International Joint Conference on e-Business and Telecommunications (ICETE 2017): Volume 4: SECRYPT. ed. / Pierangela Samarati; Mohammad S. Obaidat; Enrique Cabello. SCITEPRESS Digital Library, 2017. p. 237-246 (Proceedings of the 14th International Joint Conference on e-Business and Telecommunications (ICETE 2017); No. 4).

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

TY - GEN

T1 - SAT-based Cryptanalysis of Authenticated Ciphers from the CAESAR Competition

AU - Dwivedi, Ashutosh Dhar

AU - Klouček, Miloš

AU - Morawiecki, Pawel

AU - Nikolić, Ivica

AU - Pieprzyk, Josef

AU - Wójtowicz, Sebastian

N1 - Conference code: 14

PY - 2017

Y1 - 2017

N2 - We investigate six authenticated encryption schemes (ACORN, ASCON-128a, ICEPOLE-128a, Ketje Jr, MORUS, and NORX-32) from the CAESAR competition. We aim at state recovery attacks using a SAT solver as a main tool. Our analysis reveals that these schemes, as submitted to CAESAR, provide strong resistance against SAT-based state recoveries. To shed a light on their security margins, we also analyse modified versions of these algorithms, including round-reduced variants and versions with higher security claims. Our attacks on such variants require only a few known plaintext-ciphertext pairs and small memory requirements (to run the SAT solver), whereas time complexity varies from very practical (few seconds on a desktop PC) to 'theoretical' attacks.

AB - We investigate six authenticated encryption schemes (ACORN, ASCON-128a, ICEPOLE-128a, Ketje Jr, MORUS, and NORX-32) from the CAESAR competition. We aim at state recovery attacks using a SAT solver as a main tool. Our analysis reveals that these schemes, as submitted to CAESAR, provide strong resistance against SAT-based state recoveries. To shed a light on their security margins, we also analyse modified versions of these algorithms, including round-reduced variants and versions with higher security claims. Our attacks on such variants require only a few known plaintext-ciphertext pairs and small memory requirements (to run the SAT solver), whereas time complexity varies from very practical (few seconds on a desktop PC) to 'theoretical' attacks.

KW - Authenticated Encryption

KW - CAESAR

KW - Logic Cryptanalysis

KW - SAT Solvers

KW - SAT-based Cryptanalysis

U2 - 10.5220/0006387302370246

DO - 10.5220/0006387302370246

M3 - Article in proceedings

AN - SCOPUS:85029408098

T3 - Proceedings of the 14th International Joint Conference on e-Business and Telecommunications (ICETE 2017)

SP - 237

EP - 246

BT - Proceedings of the 14th International Joint Conference on e-Business and Telecommunications (ICETE 2017)

A2 - Samarati, Pierangela

A2 - Obaidat, Mohammad S.

A2 - Cabello, Enrique

PB - SCITEPRESS Digital Library

T2 - 14th International Joint Conference on e-Business and Telecommunications. ICETE 2017

Y2 - 24 July 2017 through 26 July 2017

ER -

Dwivedi AD, Klouček M, Morawiecki P, Nikolić I, Pieprzyk J, Wójtowicz S. SAT-based Cryptanalysis of Authenticated Ciphers from the CAESAR Competition. In Samarati P, Obaidat MS, Cabello E, editors, Proceedings of the 14th International Joint Conference on e-Business and Telecommunications (ICETE 2017): Volume 4: SECRYPT. SCITEPRESS Digital Library. 2017. p. 237-246. (Proceedings of the 14th International Joint Conference on e-Business and Telecommunications (ICETE 2017); No. 4). doi: 10.5220/0006387302370246