Primality testing with Gaussian periods (2003)
Cached
Download Links
- [gauss.dartmouth.edu]
- [www.math.dartmouth.edu]
- DBLP
Other Repositories/Bibliography
by
H. W. Lenstra
,
Carl Pomerance
| Citations: | 14 - 0 self |
BibTeX
@TECHREPORT{Lenstra03primalitytesting,
author = {H. W. Lenstra and Carl Pomerance},
title = {Primality testing with Gaussian periods},
institution = {},
year = {2003}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The problem of quickly determining whether a given large integer is prime or composite has been of interest for centuries, if not longer. The past 30 years has seen a great deal of progress, leading up to the recent deterministic, polynomial-time algorithm of Agrawal, Kayal, and Saxena [2]. This new “AKS test ” for the primality of n involves verifying the
