Publication View

Completion of computation of improved upper bound on the maximum average linear hull probability for Rijndael (2008)

Abstract
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.

Publication details
Download http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.74.6707
Source http://eprint.iacr.org/2004/074.pdf
Contributors CiteSeerX
Repository CiteSeerX - Scientific Literature Digital Library and Search Engine (United States)
Keywords Rijndael, AES, SPN, provable security, linear cryptanalysis, differential
Type text
Language English
Relation 10.1.1.99.2838, 10.1.1.31.2000, 10.1.1.34.1995, 10.1.1.132.5403, 10.1.1.118.9391, 10.1.1.24.2402, 10.1.1.17.5144, 10.1.1.89.4655, 10.1.1.28.7047, 10.1.1.130.1162, 10.1.1.90.5859