3 ms·
2^85 is for finding a collision; finding a preimage of a specific hash would take 2^128 steps of Grover's algorithm. That's thought to be beyond any possible fu
by gdavisson 7y ago
2^85 is for finding a collision; finding a preimage of a specific hash would take 2^128 steps of Grover's algorithm. That's thought to be beyond any possible future computer system.
- CiPHPerCoder 7y agoEither way, 85 bits of post-quantum security makes me feel safe.