## Proving primality in essentially quartic random time (2003)

by
Daniel J. Bernstein

Venue: | Math. Comp |

Citations: | 18 - 0 self |

### BibTeX

@ARTICLE{Bernstein03provingprimality,

author = {Daniel J. Bernstein},

title = {Proving primality in essentially quartic random time},

journal = {Math. Comp},

year = {2003},

volume = {76},

pages = {389--403}

}

### Years of Citing Articles

### OpenURL

### Abstract

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.