[RC5] First Impressions

gindrup at okway.okstate.edu gindrup at okway.okstate.edu
Tue Mar 3 17:52:20 EST 1998

     It has previously been suggested that servers use a perfect hash to 
     turn sequential block numbers into wildly non-sequential block 
     numbers.  This would require no more bookkeeping than the current 
     method and large strips of hashes could be precomputed during 
     "quieter" times.
     The question about block assignment ordering was answered (by me at 
     least) a little while ago for the three contests to date.  (Of 
     course, I saw my reply twice so I'm wondering whose mail system is 
            -- Eric Gindrup ! gindrup at okway.okstate.edu

______________________________ Reply Separator _________________________________
Subject: Re: [RC5] First Impressions 
Author:  <rc5 at llamas.net > at SMTP
Date:    3/3/98 9:31 PM

I was thinking about that a while ago.   Would one way to combat that sneaky 
(not that I'm suggesting it would be employed of course!) be to search the keys 
in a
sort of 0-1%, 10-11%, 20-21%, etc, then 1-2%, 11-12%, or just randomly of course
How do d.net do it ?   Did we go from 0% towards 100% trusting it was randomly 
picked ?
     Nick Pearce http://wkweb5.cableinet.co.uk/Npearce/ 
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