A Differential Boomerang Attack Against 7-round Rijndael
Publish place: 9th Annual Conference of Computer Society of Iran
Publish Year: 1382
نوع سند: مقاله کنفرانسی
زبان: English
View: 2,619
This Paper With 9 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ACCSI09_059
تاریخ نمایه سازی: 4 بهمن 1386
Abstract:
In this paper, we report on our design of a choosen plaintext attack with work factor 2252 to recover of the first and the last subkeys of a 7-round Rijndael, while differential cryptanalysis against Rijndael have been done for up to 6 rounds and reported in published papers. We found a 5-round boomerang characteristic for Rijndael, and designed a choosen plaintext attack based on this characteristic ,with work factor 2249 to recover the 32 bits of the 1st round subkey and the 32 bits of the 7th round subkey. We also designed some simmilar attacks to recover other bits of subkeys of the first round and the last round. Therefore the work factor of this choosen plaintext attack to recover all bits of the first and the last subkeys of a 7-round Rijndael will be 2252, that is less than exhaustive search. It meanes that a 7-round Rijndael will be compromised with differential boomerang cryptanalysis.
Keywords:
Cryptography , Block Cipher , Differential Cryptanalysis , Differential Model , Rijndael , and Ant Colony Technique
Authors
Abbas Ghaemi Bafghi
Data Security Laboratory, Computer Engineering Department Amirkabir University of Technology,Tehran , Iran
Babak Sadeghiyan
Data Security Laboratory, Computer Engineering Department Amirkabir University of Technology,Tehran , Iran