Paper 2010/257

Feasible Attack on the 13-round AES-256

Alex Biryukov and Dmitry Khovratovich

Abstract

In this note we present the first attack with feasible complexity on the 13-round AES-256. The attack runs in the related-subkey scenario with four related keys, in 2^{76} time, data, and memory.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
aescryptanalysisrelated keysboomerang attack
Contact author(s)
khovratovich @ gmail com
alex cryptan @ gmail com
History
2010-05-05: received
Short URL
https://ia.cr/2010/257
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2010/257,
      author = {Alex Biryukov and Dmitry Khovratovich},
      title = {Feasible Attack on the 13-round AES-256},
      howpublished = {Cryptology ePrint Archive, Paper 2010/257},
      year = {2010},
      note = {\url{https://eprint.iacr.org/2010/257}},
      url = {https://eprint.iacr.org/2010/257}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.