Fermat Primality Test - Algorithm and Running Time

Algorithm and Running Time

The algorithm can be written as follows:

Inputs: n: a value to test for primality; k: a parameter that determines the number of times to test for primality Output: composite if n is composite, otherwise probably prime repeat k times: pick a randomly in the range if, then return composite return probably prime

Using fast algorithms for modular exponentiation, the running time of this algorithm is O(k × log2n × log log n × log log log n), where k is the number of times we test a random a, and n is the value we want to test for primality.

Read more about this topic:  Fermat Primality Test

Famous quotes containing the words running and/or time:

    “This our life, exempt from public haunt,
    Finds tongues in trees, books in the running brooks,
    Sermons in stones, and good in every thing.”
    —William Shakespeare (1564–1616)

    “The time to guard against corruption and tyranny, is before they shall have gotten hold on us. It is better to keep the wolf out of the fold, than to trust to drawing his teeth and talons after he shall have entered.”
    —Thomas Jefferson (1743–1826)