| |||||||||||||
AES securityAES securityPosted Oct 16, 2009 20:08 UTC (Fri) by ABCD (subscriber, #53650)In reply to: AES security by pharm Parent article: Ubuntu to store copies of all users' address books
> Just using the same encryption algorithm twice with two different keys of
> size N does not increase the exhaustive search time from 2^n to 2^2n, > thanks to meet-in-the-middle attacks, which reduce the time to 4^n.
I think there is a mistake somewhere in there, because 2^(2n) = (2^2)^n = 4^n.
(Log in to post comments)
AES security Posted Oct 18, 2009 16:08 UTC (Sun) by pharm (guest, #22305) [Link]
Yes, a thinko on my part.
|
|||||||||||||