On: Why 256 bit keys are large enough

[jacquesm]

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

[scott_weber → jacquesm]

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.