Proving primality in essentially quartic random time

Abstract

This paper presents an algorithm that, given a prime n n , finds and verifies a proof of the primality of n n in random time ( lg ⁡ n ) 4 + o ( 1 ) (\operatorname {lg} n)^{4+o(1)} . Several practical speedups are incorporated into the algorithm and discussed in detail.