On Fri, Sep 10, 2010 at 10:32:11AM -0400, [email protected] wrote: > First of all, half a bit per log2 isn't quite true. > > See "Random Mapping Statistics", Flajolet, A Odlyzko, Advances in > cryptology, EUROCRYPT'89, 1990 > <http://www.springerlink.com/index/32q2qh4n325evy7f.pdf>. > > The paper shows the bits of entropy lost is: > log2(1-t(k)) > where: > t(k+1) = e^(t(k)-1)
I have heard a similar analysis is in the HAC, which is also online for free, though I haven't looked at it and compared to these results. It (the short loop thing) came up in discussion of hash chains a while back. I wonder if there are any known identities under hash functions. -- I find your ideas intriguing and would like to subscribe to your newsletter. My emails do not have attachments; it's a digital signature that your mail program doesn't understand. | http://www.subspacefield.org/~travis/ If you are a spammer, please email [email protected] to get blacklisted.
pgpDSee8BUyaX.pgp
Description: PGP signature
_______________________________________________ cryptography mailing list [email protected] http://lists.randombit.net/mailman/listinfo/cryptography
