On Sun, 2003-11-02 at 09:08, pineapple wrote: > Actually, I withdraw my last proposal. I think this > one would work much better. So the two proposals for > thwarting Toad's key DoS scenario are: > > 1) Hash-cash - works by making requesters pay a price > for each request. > > 2) Estimator keyspace reordering - works by scattering > requests across the entire estimator keyspace.
How does 2) differ from your last proposal? BTW a good random 1-1 function simply rearranges the bits in the key according to a permutation of the integers 1 .. keyLength. There are keyLength! such permutations, and how to pick one at random so that they are all equally likely is well known (but I don't remember exactly how to do it). -- Ed Huff
signature.asc
Description: This is a digitally signed message part
_______________________________________________ Devl mailing list [EMAIL PROTECTED] http://dodo.freenetproject.org/cgi-bin/mailman/listinfo/devl
