Hacker News new | ask | show | jobs
by tannranger 3447 days ago
So there's a lot of talk about how encryption algorithms relying on the difficulty of factoring primes could be weakened by quantum computers in the near future.

Are there any technological advances or scenarios where the security of hash algorithms could be weakened (other than computers just getting fasters via ~Moore's Law).

1 comments

Surely you mean factoring numbers into primes as primes cannot be factored.
Right :X