🚀 go-pugleaf

In article <7242@brl-smoke.ARPA> gwyn@brl.arpa (Doug Gwyn (VLD/VMB) <gwyn>) writes:
>In article <22925@ucbvax.BERKELEY.EDU> wallace@degas.Berkeley.EDU.UUCP (David E. Wallace) writes:
>>Hence any simplification algorithm you are likely to come up with either
>>won't be able to simplify all expressions all the way, or will take an
>>exponential amount of time (exponential in the size of the input expression),
>>or both.
>
>...
>
>I sent Keith a fair amount of information about how a
>practical Boolean simplification algorithm could be designed.  I don't
>particularly want to post it more generally, because if he gets his
>technique to work, he deserves the undoubtedly large proceeds from his
>invention.  (Just imagine how much you could ask for an effective
>automated DES-cracking box!)
>
>...

It should be pointed out that this idea for attacking DES is
not entirely new. Others in the past have used methods very similar
to this to attack ciphers. I am presently trying to apply these
methods with possible variations to attacking DES. I don't think
I should say any more than this (my prof. may be listening).

Good luck though.

				Bret

usenet:  ihnp4!pur-ee!youngb
ARPA:    youngb@eg.ecn.purdue.edu
UUCP:    youngb@pur-ee.UUCP