Path: utzoo!utgpu!water!watmath!clyde!rutgers!mit-eddie!uw-beaver!cornell!rochester!bbn!uwmcsd1!ig!agate!web5h.berkeley.edu!adamj
From: adamj@web5h.berkeley.edu (Adam J. Richter)
Newsgroups: sci.crypt
Subject: Re: Crypt() hackers
Keywords: DES, des, crypt()
Message-ID: <6931@agate.BERKELEY.EDU>
Date: 10 Feb 88 03:06:48 GMT
References: <538@ddsw1.UUCP> <8045@eddie.MIT.EDU> <980@sdcc13.ucsd.EDU> <22925@ucbvax.BERKELEY.EDU>
Sender: usenet@agate.BERKELEY.EDU
Reply-To: adamj@widow.berkeley.edu (Adam J. Richter)
Organization: University of California, Berkeley
Lines: 15


	Once upon a time I had some ideas similar to Keith Messer's
for trying to derive a direct formula for the 56 key bits of DES given
the 64 input bits and 64 output bits.  I wrote some C code to
manipulate big boolean expressions efficiently, and patched the source
to crypt(3) to deal with these expressions instead of ints.  The stuff
lives in the directory weaver.berkeley.edu:/usr/weaver/adamj/C/crypto,
which has anonymous ftp that connects to the top of the file system.

	I heard given an explanation similar Dave Wallace's, and gave up.
Adam J. Richter			adamj@widow.berkeley.edu
				....!ucbvax!widow!adamj
				Home: (415)549-6377
				Work: (415)523-9000
				Sun room: (415)642-7762