On 14-10-2010 19:32, Marsh Ray wrote: > 3. There are quantum computer attacks theorized which appear to cut > the exponent in half again. Thus a 256 bit hash could possibly be > collided in 264 operations on some future machine. Is there a source for this? The only quantum approach I've heard of, the Brassard-Høyer-Tapp algorithm, takes 2^(n/3) time (and space!).
Best regards, Samuel Neves
_______________________________________________ cryptography mailing list [email protected] http://lists.randombit.net/mailman/listinfo/cryptography
