Improved Cryptanalysis of Rijndael

By N. Ferguson, John Kelsey, Stefan Lucks, Bruce Schneier, M. Stay, David A. Wagner, D. Whiting. Fast Software Encryption Workshop, 2000

493 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Hardware and Architecture

View Paper: https://www.semanticscholar.org/paper/0eeaf3d12c8f934d93893c9088868f34f04ab229

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Hardware and Architecture

Citations in the corpus

A Modified AES Based Algorithm for Image Encryption (2007, background): “2) Key Space Analysis A good encryption scheme should be sensitive to the secret keys, and the key space should be large enough to make bruteforce attacks infeasible [16, 5, 10].”
GIFT: A Small Present - Towards Reaching the Limit of Lightweight Encryption (2017, methodology): “Here the integral distinguisher is found by using the (bit-based) division property [40,42] and the key recovery is executed by using the partial-sum technique [19].”
Biclique Cryptanalysis of the Full AES (2011, background): “Though many papers have been published on the cryptanalysis of AES, the fastest single-key attacks on round-reduced AES variants [20,33] so far are only slightly more powerful than those proposed 10 years ago [23,24].”
Integral Cryptanalysis (2002, background): “We thank Ulrich Kühn for many helpful comments.”
Related-Key Cryptanalysis of the Full AES-192 and AES-256 (2009, background): “The best results until 2009 were attacks on 7-round AES-128 [8,9], 10-round AES192 [4,11], 10-round AES-256 [4,11] out of 10, 12 and 14 rounds respectively.”
Survey and benchmark of block ciphers for wireless sensor networks (2006, background): “[37] report a related-key attack of 9-round Rijndael-256 with time complexity 2(224), which is of course far from practical.”
A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications (2003, methodology): “Prior to the recent work of Courtois and Pieprzyk [5], the best (in terms of the number of rounds) known attack against Rijndael was a Φ⊕ k -restricted related key attack that uses 256 different related keys and that extends through nine (out of 14) rounds of Rijndael with 128-bit blocks and 256bit ”
Distinguisher and Related-Key Attack on the Full AES-256 (2009, unknown): “Partial sums 9 256 2(85) 2(226) 2(32) [6] Related-key rectangle 10 64 2(114) 2(173) ? [1,10]”