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:

    “... with dozens of as yet
    Unrealized projects, and a strict sense
    Of time running out, of evening presenting
    The tactfully folded-over bill?”
    —John Ashbery (b. 1927)

    “Ah, that Time could touch a form
    That could show what Homer’s age
    Bred to be a hero’s wage.”
    —William Butler Yeats (1865–1939)