[102772] in Cypherpunks

home help back first fref pref prev next nref lref last post

Re: The DES Analytic Crack Project

daemon@ATHENA.MIT.EDU (Mok-Kong Shen)
Wed Sep 16 03:54:28 1998

Date: Wed, 16 Sep 1998 09:40:24 +0100
From: Mok-Kong Shen <mok-kong.shen@stud.uni-muenchen.de>
To: cypherpunks@cyberpass.net
Reply-To: Mok-Kong Shen <mok-kong.shen@stud.uni-muenchen.de>

Jim Gillogly wrote:
> 
> In the early 1980's I started trying this approach.  I did the
> back-of-the-envelope estimate and realized it was too big, but
> I thought it worth trying, since if there were a back door in
> DES it might manifest itself by a massive collapse in the complexity
> of these expressions.  I didn't get far enough into it to decide one
> way or the other, since I didn't have a good tool for reducing the
> expressions to minimal form.

As far as I know Boolean minimization has been one of the central
themes of people doing circuit design from the beginning. I should
be surprised if there are spectacular breakthroughs recently.

M. K. Shen


home help back first fref pref prev next nref lref last post