Cryptography General Question:
How do You Know if a Number is Prime?
Answer:
It is generally recommended to use probabilistic primality testing, which is much quicker than actually proving that a number is prime. One can use a probabilistic test that determines whether a number is prime with arbitrarily small probability of error, say, less than 2-100.
| Previous Question | Next Question |
| Can Users of RSA run out of Distinct Primes? | How is RSA Used for Authentication in Practice? What are RSA Digital Signatures? |