On: Post-quantum encryption contender is taken out by single-core PC and 1 hour

[computerfriend]

Surprising contrast, since the security assumption of RSA is also not proven.

[cvccvroomvroom → computerfriend]

Prime factorization, matrix math, and elliptic curves are the primary "difficult" math problems we have to implement encryption.

If there are any others, I'd like to know.

[tgv → computerfriend]

Its properties are known. It’s safe until someone can efficiently factor large numbers.

[SAI_Peregrinus → tgv]

That statement relies on the unproven assumption that there's no faster way to solve the RSA problem than to factor the modulus.