> If you just make up a number claim it’s prime and nobody disputes it
You can test if a number is prime in polynomial time, much faster than a sieve. There’s no need to test every divisor to know whether a number is prime or not.
Algos like RSA generate large primes millions of times every day—-there’s nothing to take on faith.
You can test if a number is prime in polynomial time, much faster than a sieve. There’s no need to test every divisor to know whether a number is prime or not.
Algos like RSA generate large primes millions of times every day—-there’s nothing to take on faith.