[Cryptography] Dan Bernstein has a new blog entry on key breaking

[Perry E. Metzger]

On Sun, 22 Nov 2015 15:52:16 -0500 Jerry Leichter <leichter at lrw.com>
wrote:
> This comes back to Killian and Rogoway's result on DESX (DES with a
> fixed random whitener XOR's in before an after encryption):  DESX,
> when the only attack under consideration is a brute force attack,
> is about as strong as any pre- and post-whitened version of DES
> (where the whitener changes from block to block).  How to Protect
> DES Against Exhaustive Key Search (an analysis of DESX)
> <http://web.cs.ucdavis.edu/~rogaway/papers/desx.pdf>

Ah! I just posted about DES-X and hadn't seen your comment yet. (And I
should read that paper...)


Perry
-- 
Perry E. Metzger		perry at piermont.com