 The AKS primality test has mathematically proven time complexity, but is slower than elliptic curve primality proving in practice.These methods can be used to generate large random prime numbers, by generating and testing random numbers until finding one that is prime;
when doing this, a faster probabilistic test can quickly eliminate most composite numbers before a guaranteed-correct algorithm is used to verify that the remaining numbers are prime.The following table lists some of these tests.