Title
A Meet In The Middle Attack On Reduced Round Kiasu-Bc
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 2(116) Iencryptions, memory complexity of 2(86) 128-bit blocks, and data complexity of 2(116) plaintext-tweak combinations.
Year
DOI
Venue
2016
10.1587/transfun.E99.A.1888
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
Keywords
Field
DocType
Kiasu-BC, tweak, cryptanalysis, meet-in-the-middle attacks, differential enumeration
Computer security,Cryptanalysis,Meet-in-the-middle attack,Mathematics
Journal
Volume
Issue
ISSN
E99A
10
1745-1337
Citations 
PageRank 
References 
1
0.49
2
Authors
3
Name
Order
Citations
PageRank
Mohamed Tolba1206.35
Ahmed Abdelkhalek2114.17
Amr Youssef323829.69