[Droid X Android Development] derekm_:
Good point about the ps3, I was just wondering if you guys wanted to do something new and challenging... anyways i decided to do some limited research on my own and...

"For cryptographers, a cryptographic "break" is anything faster than an exhaustive search. Thus, an 100 XSL attack against a 128-bit-key AES requiring 2 100 128 operations (compared to 2 128 possible keys) would possible keys) would be considered a break. The largest successfu publicly-known brute force attack has been against a 64-bit RC5 key by distributed.net.

Unlike most other block ciphers, AES has a very neat[ 10] algebraic description.[ 10] In 2002, a theoretica algebraic description In 2002, a theoretica attack, termed the "XSL attack", was announced by Nicolas Courtois and Josef Pieprzyk, purporting to show a weakness in the AES algorithm due to its[ 11] simple description.[ 11] Since then, other papers have simple description Since then, other papers have shown that the attack as originally presented is unworkable; see XSL attack on block ciphers.

O[ 14] n July 1, 2009, Bruce Schneier blogged[ 14] about a about a related-key attack on the 192-bit and 256-bit versions of AES, discovered by Alex Biryukov and[ 15] Dmitry Khovratovich,[ 15] which exploits AES's which exploits AES's somewhat simple key schedule and has a complexity 99.5 of 2 99.5. This is a follow-up to an attack discovered of 2. This is a follow-up to an attack discovered earlier in 2009 by Alex Biryukov, Dmitry Khovratovich, and Ivica Nikolić, with a complexity of 96 35[ 16] 2 96 for one out of every 2 35 keys.[ 16] Another 2 for one out of every 2 keys Another[ 17] attack was blogged by Bruce Schneier[ 17] on July 30 on July 30[ 18] 2009 and released as a preprint[ 18] on August 3 on August 3 2009. This new attack, by Alex Biryukov, Orr Dunkelman, Nathan Keller, Dmitry Khovratovich and Adi Shamir, is against AES-256 that uses only 39 two related keys and 2 39 time to recover the two related keys and 2 time to recover the 45 complete 256-bit key of a 9-round version, or 2 45 time for a 10-round version with a stronger type of 70 related subkey attack, or 2 70 time for a 11-round related subkey attack, or 2 time for a 11-round version. 256-bit AES uses 14 rounds, so thes

In November 2009, the first known-key distinguishing attack against a reduced 8-round[ 19] version of AES-128 was released as a preprint.[ 19] This known-key distinguishing attack is an mprovement of the rebound or the start-from-the- middle attacks for AES-like permutations, which view two consecutive rounds of permutation as the application of a so-called Super-Sbox. It works on the 8-round version of AES-128, with a computation 48 32 complexity of 2 48, and a memory complexity of 2 32. complexity of 2, and a memory complexity of 2. In July 2010 Vincent Rijmen published an ironic paper on "chosen-key-relations-in-the-middle"[ 20] attacks on AES-128[ 20] attacks on AES-128"

All of the numbers/powers are messed up, will fix once at a computer, or look at wikipedia.

If anything i take this info as good news. Says to me that cracking 8 round 128 AES is very possible,

Can somebody read this mans paper?

"In July 2010 Vincent Rijmen published an ironic paper on "chosen-key-relations-in-the-middle"[ 20] attacks on AES-128[ 20] attacks on AES-128"

My goal is that if this project would take 2 months, that means we will have the bootloader key by the first of october, which would be GREAT.