Paper 2012/677
What is the Effective Key Length for a Block Cipher: an Attack on Every Block Cipher
Jialin Huang and Xuejia Lai
Abstract
Recently, several important block ciphers are considered to
be broken by the bruteforce-like cryptanalysis, with a time complexity
faster than exhaustive key search by going over the entire key space but performing less than a full encryption for each possible key. Motivated by this observation, we describe a meet-in-the-middle attack that can always be successfully mounted against any practical block ciphers with success probability one. The data complexity of this attack is the smallest according to the unicity distance. The time complexity can be written as
Metadata
- Available format(s)
- Category
- Secret-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Contact author(s)
-
jlhuang cn @ gmail com
lai-xj @ cs sjtu edu cn - History
- 2012-11-30: received
- Short URL
- https://ia.cr/2012/677
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2012/677, author = {Jialin Huang and Xuejia Lai}, title = {What is the Effective Key Length for a Block Cipher: an Attack on Every Block Cipher}, howpublished = {Cryptology {ePrint} Archive, Paper 2012/677}, year = {2012}, url = {https://eprint.iacr.org/2012/677} }