The cr.yp.to microblog: 2014.12.25 13:20:24

2014.12.25 13:20:24 (548090884823474176) from Daniel J. Bernstein, replying to "Paulo Barreto (@pbarreto)" (547789157729587200):

It's true that BHT finds H collisions in just 2^(n/3) quantum queries. But the queries aren't the bottleneck for any reasonable H. @pbarreto

Context

2014.12.24 15:39:15 (547763437796085760) from "JP Aumasson (@veorq)":

"When Exactly Do Quantum Computers Provide A Speedup?" http://www.scottaaronson.com/talks/speedup-austin.ppt (ppt slides of Aaronson, not technical)

2014.12.24 17:21:27 (547789157729587200) from "Paulo Barreto (@pbarreto)", replying to "JP Aumasson (@veorq)" (547763437796085760):

@veorq I wonder what @hashbreaker would say of Aaronson's slide #19 (on Brassard-Høyer-Tapp) in that presentation...