### Completion of Computation of Improved Upper Bound on the Maximum Average Linear Hull Probabilty for Rijndael

Liam Keliher, Henk Meijer, and Stafford Tavares

##### Abstract

This report presents the results from the completed computation of an algorithm introduced by the authors in [11] for evaluating the provable security of the AES (Rijndael) against linear cryptanalysis. This algorithm, later named KMT2, can in fact be applied to any SPN [8]. Preliminary results in [11] were based on 43\% of total computation, estimated at 200,000 hours on our benchmark machine at the time, a Sun Ultra 5. After some delay, we obtained access to the necessary computational resources, and were able to run the algorithm to completion. In addition to the above, this report presents the results from the dual version of our algorithm (KMT2-DC) as applied to the AES.

Available format(s)
Category
Secret-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
RijndaelAESSPNprovable securitylinear cryptanalysisdifferential cryptanalysis
Contact author(s)
lkeliher @ mta ca
History
Short URL
https://ia.cr/2004/074

CC BY

BibTeX

@misc{cryptoeprint:2004/074,
author = {Liam Keliher and Henk Meijer and Stafford Tavares},
title = {Completion of Computation of Improved Upper Bound on the Maximum Average Linear Hull Probabilty for Rijndael},
howpublished = {Cryptology ePrint Archive, Paper 2004/074},
year = {2004},
note = {\url{https://eprint.iacr.org/2004/074}},
url = {https://eprint.iacr.org/2004/074}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.