A Meet in the Middle Attack on Reduced Round Kiasu-BC

Mohamed TOLBA; Ahmed ABDELKHALEK; Amr M. YOUSSEF

doi:10.1587/transfun.E99.A.1888

A Meet in the Middle Attack on Reduced Round Kiasu-BC

Mohamed TOLBA, Ahmed ABDELKHALEK, Amr M. YOUSSEF

Full Text Views

0

Share
Cite this

Summary :

Kiasu-BC is a recently proposed tweakable variant of the AES-128 block cipher. The designers of Kiasu-BC claim that no more than 7-round Meet-in-the-Middle (MitM) attack can be launched against it. In this letter, we present a MitM attack, utilizing the differential enumeration technique, on the 8-round reduced cipher. The attack has time complexity of 2¹¹⁶ encryptions, memory complexity of 2⁸⁶ 128-bit blocks, and data complexity of 2¹¹⁶ plaintext-tweak combinations.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E99-A No.10 pp.1888-1890

Publication Date: 2016/10/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E99.A.1888

Type of Manuscript: LETTER

Category: Cryptography and Information Security

Authors

Mohamed TOLBA
  Concordia University
Ahmed ABDELKHALEK
  Concordia University
Amr M. YOUSSEF
  Concordia University

Keyword

Kiasu-BC, tweak, cryptanalysis, meet-in-the-middle attacks, differential enumeration

Cite this

Copy

Mohamed TOLBA, Ahmed ABDELKHALEK, Amr M. YOUSSEF, "A Meet in the Middle Attack on Reduced Round Kiasu-BC" in IEICE TRANSACTIONS on Fundamentals, vol. E99-A, no. 10, pp. 1888-1890, October 2016, doi: 10.1587/transfun.E99.A.1888.
Abstract: Kiasu-BC is a recently proposed tweakable variant of the AES-128 block cipher. The designers of Kiasu-BC claim that no more than 7-round Meet-in-the-Middle (MitM) attack can be launched against it. In this letter, we present a MitM attack, utilizing the differential enumeration technique, on the 8-round reduced cipher. The attack has time complexity of 2¹¹⁶ encryptions, memory complexity of 2⁸⁶ 128-bit blocks, and data complexity of 2¹¹⁶ plaintext-tweak combinations.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E99.A.1888/_p

Copy

@ARTICLE{e99-a_10_1888,
author={Mohamed TOLBA, Ahmed ABDELKHALEK, Amr M. YOUSSEF, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Meet in the Middle Attack on Reduced Round Kiasu-BC},
year={2016},
volume={E99-A},
number={10},
pages={1888-1890},
abstract={Kiasu-BC is a recently proposed tweakable variant of the AES-128 block cipher. The designers of Kiasu-BC claim that no more than 7-round Meet-in-the-Middle (MitM) attack can be launched against it. In this letter, we present a MitM attack, utilizing the differential enumeration technique, on the 8-round reduced cipher. The attack has time complexity of 2¹¹⁶ encryptions, memory complexity of 2⁸⁶ 128-bit blocks, and data complexity of 2¹¹⁶ plaintext-tweak combinations.},
keywords={},
doi={10.1587/transfun.E99.A.1888},
ISSN={1745-1337},
month={October},}

Copy

TY - JOUR
TI - A Meet in the Middle Attack on Reduced Round Kiasu-BC
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1888
EP - 1890
AU - Mohamed TOLBA
AU - Ahmed ABDELKHALEK
AU - Amr M. YOUSSEF
PY - 2016
DO - 10.1587/transfun.E99.A.1888
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E99-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2016
AB - Kiasu-BC is a recently proposed tweakable variant of the AES-128 block cipher. The designers of Kiasu-BC claim that no more than 7-round Meet-in-the-Middle (MitM) attack can be launched against it. In this letter, we present a MitM attack, utilizing the differential enumeration technique, on the 8-round reduced cipher. The attack has time complexity of 2¹¹⁶ encryptions, memory complexity of 2⁸⁶ 128-bit blocks, and data complexity of 2¹¹⁶ plaintext-tweak combinations.
ER -