Paper 2013/288

Key Classification Attack on Block Ciphers

Maghsoud Parviz, Seyed Hassan Mousavi, and Saeed Mirahmadi

Abstract

In this paper, security analysis of block ciphers with key length greater than block length is proposed. For a well-designed block cipher with key length k and block length n s.t. k>n and for all P, C, there are 2^{k-n} keys which map P to C. For given block cipher, if there is an efficient algorithm that can classify such keys, we propose an algorithm will be able to recover the secret key with complexity O(max{2^n, 2^{k-n}}). We apply this method on 2-round block cipher KASUMI.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Unknown where it was published
Keywords
Block cipherKey classeskey lengthblock lengthKASUMI
Contact author(s)
shnmousavi_iut @ yahoo fr
History
2013-05-23: received
Short URL
https://ia.cr/2013/288
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2013/288,
      author = {Maghsoud Parviz and Seyed Hassan Mousavi and Saeed Mirahmadi},
      title = {Key Classification Attack on Block Ciphers},
      howpublished = {Cryptology {ePrint} Archive, Paper 2013/288},
      year = {2013},
      url = {https://eprint.iacr.org/2013/288}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.