[cryptography] philosophical question about strengths and attacks at impossible levels

Samuel Neves sneves at dei.uc.pt
Thu Oct 14 15:49:29 EDT 2010


 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
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.randombit.net/pipermail/cryptography/attachments/20101014/96fb7942/attachment.html>


More information about the cryptography mailing list