Meet‐in‐the‐middle attacks on round‐reduced CRAFT based on automatic search

Abstract CRAFT is a lightweight block cipher designed by Beierle et al. to effectively resist differential fault attacks at fast software encryption 2019. In this article, Demirci‐Selçuk meet‐in‐the‐middle (DS‐MITM) attacks on round‐reduced CRAFT based on automatic search are proposed. A DS‐MITM aut...

Full description

Saved in:
Bibliographic Details
Main Authors: Zhangjun Ma, Manman Li, Shaozhen Chen
Format: Article
Language:English
Published: Wiley 2023-05-01
Series:IET Information Security
Subjects:
Online Access:https://doi.org/10.1049/ise2.12114
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832546705435787264
author Zhangjun Ma
Manman Li
Shaozhen Chen
author_facet Zhangjun Ma
Manman Li
Shaozhen Chen
author_sort Zhangjun Ma
collection DOAJ
description Abstract CRAFT is a lightweight block cipher designed by Beierle et al. to effectively resist differential fault attacks at fast software encryption 2019. In this article, Demirci‐Selçuk meet‐in‐the‐middle (DS‐MITM) attacks on round‐reduced CRAFT based on automatic search are proposed. A DS‐MITM automatic search model for CRAFT was constructed, and then, the automatic search model was used to detect a 9‐round DS‐MITM distinguisher. The strong relations between the round‐subtweakeys were observed and the key‐dependent sieve technique was adopted to reduce the memory complexity of the attack. Based on the 9‐round distinguisher, a 19‐round DS‐MITM attack can be presented. Due to the strong key relations, the time complexity can be reduced by the key‐bridging technique and the equivalent round‐subtweakey. The time complexity of the 19‐round DS‐MITM attack is 2114.68 19‐round CRAFT encryption, the data complexity is 256 chosen plaintexts, and the memory complexity is 2109 64‐bit blocks. Adding one round to the end of the 19‐round DS‐MITM attack, a 20‐round DS‐MITM attack can be proposed. The time complexity of the 20‐round attack is 2126.94 20‐round CRAFT encryption, the data complexity is 256 chosen plaintexts, and the memory complexity is 2109 64‐bit blocks.
format Article
id doaj-art-edbe7b62eb814a2b92316753b269815a
institution Kabale University
issn 1751-8709
1751-8717
language English
publishDate 2023-05-01
publisher Wiley
record_format Article
series IET Information Security
spelling doaj-art-edbe7b62eb814a2b92316753b269815a2025-02-03T06:47:34ZengWileyIET Information Security1751-87091751-87172023-05-0117353454310.1049/ise2.12114Meet‐in‐the‐middle attacks on round‐reduced CRAFT based on automatic searchZhangjun Ma0Manman Li1Shaozhen Chen2PLA Strategic Support Force Information Engineering University Zhengzhou ChinaPLA Strategic Support Force Information Engineering University Zhengzhou ChinaPLA Strategic Support Force Information Engineering University Zhengzhou ChinaAbstract CRAFT is a lightweight block cipher designed by Beierle et al. to effectively resist differential fault attacks at fast software encryption 2019. In this article, Demirci‐Selçuk meet‐in‐the‐middle (DS‐MITM) attacks on round‐reduced CRAFT based on automatic search are proposed. A DS‐MITM automatic search model for CRAFT was constructed, and then, the automatic search model was used to detect a 9‐round DS‐MITM distinguisher. The strong relations between the round‐subtweakeys were observed and the key‐dependent sieve technique was adopted to reduce the memory complexity of the attack. Based on the 9‐round distinguisher, a 19‐round DS‐MITM attack can be presented. Due to the strong key relations, the time complexity can be reduced by the key‐bridging technique and the equivalent round‐subtweakey. The time complexity of the 19‐round DS‐MITM attack is 2114.68 19‐round CRAFT encryption, the data complexity is 256 chosen plaintexts, and the memory complexity is 2109 64‐bit blocks. Adding one round to the end of the 19‐round DS‐MITM attack, a 20‐round DS‐MITM attack can be proposed. The time complexity of the 20‐round attack is 2126.94 20‐round CRAFT encryption, the data complexity is 256 chosen plaintexts, and the memory complexity is 2109 64‐bit blocks.https://doi.org/10.1049/ise2.12114automatic searchblock cipherCRAFTcryptographymeet‐in‐the‐middle attack
spellingShingle Zhangjun Ma
Manman Li
Shaozhen Chen
Meet‐in‐the‐middle attacks on round‐reduced CRAFT based on automatic search
IET Information Security
automatic search
block cipher
CRAFT
cryptography
meet‐in‐the‐middle attack
title Meet‐in‐the‐middle attacks on round‐reduced CRAFT based on automatic search
title_full Meet‐in‐the‐middle attacks on round‐reduced CRAFT based on automatic search
title_fullStr Meet‐in‐the‐middle attacks on round‐reduced CRAFT based on automatic search
title_full_unstemmed Meet‐in‐the‐middle attacks on round‐reduced CRAFT based on automatic search
title_short Meet‐in‐the‐middle attacks on round‐reduced CRAFT based on automatic search
title_sort meet in the middle attacks on round reduced craft based on automatic search
topic automatic search
block cipher
CRAFT
cryptography
meet‐in‐the‐middle attack
url https://doi.org/10.1049/ise2.12114
work_keys_str_mv AT zhangjunma meetinthemiddleattacksonroundreducedcraftbasedonautomaticsearch
AT manmanli meetinthemiddleattacksonroundreducedcraftbasedonautomaticsearch
AT shaozhenchen meetinthemiddleattacksonroundreducedcraftbasedonautomaticsearch