Cryptology ePrint Archive: Report 2004/074

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

Liam Keliher and 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.

Category / Keywords: secret-key cryptography / Rijndael, AES, SPN, provable security, linear cryptanalysis, differential cryptanalysis

Date: received 4 Mar 2004

Contact author: lkeliher at mta ca

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20040304:201455 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]