1996-07-24 - Re: Distributed DES crack

Header Data

From: Simon Spero <ses@tipper.oit.unc.edu>
To: “Perry E. Metzger” <perry@piermont.com>
Message Hash: 68dbf7d9da4bdecc6208e92ef69e1614a6a15f06c57f4be4b9be02b30b7bc557
Message ID: <Pine.SUN.3.91.960723093316.28197A@tipper.oit.unc.edu>
Reply To: <199607222314.TAA12858@jekyll.piermont.com>
UTC Datetime: 1996-07-24 12:01:08 UTC
Raw Date: Wed, 24 Jul 1996 20:01:08 +0800

Raw message

From: Simon Spero <ses@tipper.oit.unc.edu>
Date: Wed, 24 Jul 1996 20:01:08 +0800
To: "Perry E. Metzger" <perry@piermont.com>
Subject: Re: Distributed DES crack
In-Reply-To: <199607222314.TAA12858@jekyll.piermont.com>
Message-ID: <Pine.SUN.3.91.960723093316.28197A@tipper.oit.unc.edu>
MIME-Version: 1.0
Content-Type: text/plain


On Mon, 22 Jul 1996, Perry E. Metzger wrote:

> Ben Holiday writes:
> > I've a few machines around that could be dedicated almost full time to the
> > task. What are the bandwidth requirements?
> 
> Probably near zero. People can get sections of the search space
> parceled out to them.

I've always wondered whether chinese lotterys could be made more reliable by 
having each player check random keys rather than searching within a 
block. That way it becomes a lot harder to spoof by volunteering for a 
block and reporting incorrect results. 

 ---
Cause maybe  (maybe)		      | In my mind I'm going to Carolina
you're gonna be the one that saves me | - back in Chapel Hill May 16th.
And after all			      | Email address remains unchanged
You're my firewall -    	      | ........First in Usenet.........





Thread