Proving primality in essentially quartic random time

Proving primality in essentially quartic random time (2003)

by Daniel J. Bernstein

Venue:	Math. Comp
Citations:	18 - 0 self

Datum	Value	Source
TITLE	Proving primality in essentially quartic random time	INFERENCE
AUTHOR NAME	Daniel J. Bernstein	SVM HeaderParse 0.2
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.	SVM HeaderParse 0.2
YEAR	2003	INFERENCE
VENUE	Math. Comp	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	389--403	INFERENCE
VOLUME	76	INFERENCE
CITATIONS	26 found	ParsCit 1.0