Slashdot Mirror

← Back to Stories (view on slashdot.org)

New AES Attack Documented

Posted by timothy on from the ponder-don't-panic dept.

avxo writes "Bruce Schneier covers a new cryptanalytic related-key attack on AES that is better than brute force with a complexity of 2^119. According to an e-mail by the authors: 'We also expect that a careful analysis may reduce the complexities. As a preliminary result, we think that the complexity of the attack on AES-256 can be lowered from 2^119 to about 2^110.5 data and time. We believe that these results may shed a new light on the design of the key-schedules of block ciphers, but they pose no immediate threat for the real world applications that use AES.'"

10 of 236 comments (clear)

  1. Furthers my stand on crypto, which is: DON'T by Anonymous Coward · · Score: 4, Funny

    Crypto is broken. It's not IF, but WHEN. That's why crypto is pointless to use. this is why I use open source, and even keep all doors unlocked. It's pointless to try and protect propery, real or intellectual/imaginary.

  2. Complexity. by girlintraining · · Score: 4, Funny

    For those who don't have a degree in oh-shit-that's-a-big-number, can someone give a comparative analysis of what "2^119" complexity means? I mean what else is "2^119" hard to solve? And yes, the math nerds are undoubtedly either dying of laughter or yelling at the screen for my abuse of powers of two... I don't care.

    --
    #fuckbeta #iamslashdot #dicemustdie
    1. Re:Complexity. by Anonymous Coward · · Score: 2, Funny

      that's what she said.

    2. Re:Complexity. by DriedClexler · · Score: 2, Funny

      Note to self: never try to tell a cryptography joke.

      --
      Information theory is life. The rest is just the KL divergence.
    3. Re:Complexity. by Anonymous Coward · · Score: 1, Funny

      Why limit yourself to electrons? Photons man, photons - they're the new "it" particle for computation!

  3. Re:Complexity by jcwayne · · Score: 2, Funny

    ... 2^137 times better is half a metric asston.

    I measure algorithmic complexity in imperial asstons, you insensitive clod.

    --
    Failure to follow this advice may result in non-deterministic behavior.
  4. Obligatory XKCD quote by snikulin · · Score: 5, Funny

    Security

  5. Re:Complexity by dotgain · · Score: 2, Funny

    Imperial Asstons are non-migratory

  6. Sigh... I'll repeat again: by snikulin · · Score: 4, Funny

    Lord Farquaad: I've tried to be fair to you creatures, now my patience has reached it's end! Tell me or I'll...
    Gingerbread Man: NO! Not the buttons! Not my gumdrop buttons!
    Lord Farquaad: Alright then! Who's hiding them?
    Gingerbread Man: Ok. I'll tell you. Do you know... the muffin man?

  7. Re:Complexity by Joce640k · · Score: 2, Funny

    ...and when I say "strongest" I mean in a pure math sort of way.

    Any attack which starts with things like "first you encrypt 2^128 carefully chosen plaintexts and store them in a hash table" isn't really an attack you should worry about.

    --
    No sig today...