[RC5] Tree search algorithms and the next d.net

Ivo Janssen ivo at ricardis.tudelft.nl
Wed Apr 21 10:44:25 EDT 1999


On Mon, 19 Apr 1999, Greg Hewgill wrote:

<snip>
> 
> The first three items are relatively easy to solve. Public-key digital
> signatures can provide participants with the required level of confidence that
> the code they are running comes from a trusted source (and therefore presumably
> does not contain a trojan or virus). With code distribution, a suitably general
> network infrastructure, and a good place for the master server(s), the only
> remaining issue is results verification.
> 
> Results verification is a tricky issue. There are various ways this can be
> done, but it mostly boils down to redoing some or all of the work. For example,
> GIMPS (http://www.mersenne.org/prime.htm) performs full double checking of
> all results, though double checking lags a couple of years behind first-
> time checking. Today distributed.net does effectively the same thing - if we
> were to reach the very end of the keyspace and the key was not found, we
> would have to start over (whether we would actually do this for RC5-64 would
> remain to be seen :). But it could happen for a future DES contest, with the
> speed of d.net approximately doubling every six months.

Hmm, there must be a better way to trust results that are coming back
in than just duplicating work (or duplicating a little bit as a
doublecheck). Is there someone out there with enough crypto knowledge
who knows a better way?

Ivo

--
+---------------------------------------------------------------------
| IVO JANSSEN - ivo at ricardis.tudelft.nl - http://ivo.nu/
| Delft University of Technology - the Netherlands
| finger ivo at server.ricardis.tudelft.nl for PGP and more info
| Part of the world's largest computer: http://www.distributed.net/


--
To unsubscribe, send 'unsubscribe rc5' to majordomo at lists.distributed.net
rc5-digest subscribers replace rc5 with rc5-digest



More information about the rc5 mailing list