Hacker News new | comments | show | ask | jobs | submit login

Doesn't halving the search difficulty mean dropping 1 bit from the key length? So 256->255 rather than 256->128?



The numbers are correct, but it was written in an odd way. Grovers algorithm gives a speedup of sqrt(n), so the exponent gets halved.




Guidelines | FAQ | Support | API | Security | Lists | Bookmarklet | DMCA | Apply to YC | Contact

Search: