Proving primality in essentially quartic random time
Daniel J. Bernstein
SVM HeaderParse 0.2
Abstract. This paper presents an algorithm that, given a prime n, finds and verifies a proof of the primality of n in random time (lg n) 4+o(1). Several practical speedups are incorporated into the algorithm and discussed in detail. 1.