security vs performace

From: ark (ark.papers_at_gmail.com)
Date: 10/31/05 

Date: 31 Oct 2005 08:29:02 -0800

I have gone through the various papers on best cryptanalysis of aes,
when some one says it takes 2^44 known plaintext to crack the cipher,
how much of time does it takes for this attack?
can someone give me some pointers where my misunderstandings can be
cleared.

my doubts are about the feasibility of an attack in real world?
and again how to interpret the cryptanalysis result, for eg:

from schneier'work "Improved cryptanalysis of Rijndael"

Cipher Key Complexity Comments
            size [Data] [Time]
Rijndael-6 (all) 2^32 CP 2^72 [DR98] (previously known)
Rijndael-6 (all) 6.2^32 CP 2^44 partial sums (new)
Rijndael-7 (192) 19.2^32 CP 2^155 partial sums (new)

what i understand from this table is
1. 6 round rijndael for all keysizes, can be broken ,given 2^32 blocks
of chosen plaintext. and the time complexity is 2^72. ( am i wrong? ).

my difficulty is i am not able it correlate the time value to any real
life estimates(eg: in days of months on a x GHz processor), i shall be
very thankful if someone could correct me, and give me some pointers
from where i could get a better idea to interpret cryptanalysis
results.

thanks a lot
ark

Relevant Pages

  • Re: Can you decrypt this?
    ... in order for effective cryptanalysis the attacker must first ... cryptanalysis is how easy is it to go from the ciphertext to the plaintext ... ciphertext can remain unbroken if one of two things apply. ... see the above paragraph on enigma and the japanese purple code. ...
    (sci.crypt)
  • REPOST: security vs performace
    ... I have gone through the various papers on best cryptanalysis of aes, ... of chosen plaintext. ... very thankful if someone could correct me, and give me some pointers ... from where i could get a better idea to interpret cryptanalysis ...
    (sci.crypt)
  • Re: Historical Ciphers
    ... as cryptanalysis books appear in print. ... cipher systems. ... Code numbers assigned to plaintext tended to reflect the alphabetical ... order of the plaintext - so an unknown code group between two known code ...
    (sci.crypt)
  • determining differential characteristics
    ... between every possible plaintext under every possible key (in fact, ... I have been reading some of the papers on differential cryptanalysis, ... Obviously, every algorithm is ...
    (sci.crypt)
  • REPOST: security vs performace
    ... I have gone through the various papers on best cryptanalysis of aes, ... of chosen plaintext. ... Newsgroups: sci.crypt ... NNTP-Posting-Host: 70.189.185.72 ...
    (sci.crypt)