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:

    “All my life I have lived and behaved very much like [the] sandpiper—just running down the edges of different countries and continents, “looking for something” ... having spent most of my life timorously seeking for subsistence along the coastlines of the world.”
    —Elizabeth Bishop (1911–1979)

    “A moment in time but time was made through that moment: for without the meaning there is no time, and that moment of time gave the meaning.”
    —T.S. (Thomas Stearns)