Results 1 
1 of
1
Proving primality in essentially quartic random time
 Math. Comp
, 2003
"... 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. ..."
Abstract

Cited by 25 (0 self)
 Add to MetaCart
(Show Context)
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.