News for hackers. Stuff that matters.
Re:A Short Guide to Hard Problems by SilasX on Tuesday July 17, 2018 @07:48PM (#17554525)
It's also worth mentioning that AKS didn't have much impact on practical cryptography. The probabilistic algorithms for checking primality are (and were) much faster, and have a tolerably-low chance of failure in selecting prime numbers for crypto.

I bring this up because, one (heuristic) reason to believe BPP=P is that, in practice, moving PRIMES from BPP to P didn't make a difference.

Re:A Short Guide to Hard Problems by ouid on Monday July 23, 2018 @02:06PM (#17594524)
someone (recently?) constructed a composite number which failed miller rabin for 400 iterations or something.