Year: 2008
Type: preprint
Abstract: We present an algorithm to decide the primality of Proth numbers, N=2^e t+1, without assuming any unproven hypothesis. The expected running time and the worst case running time of the algorithm are O ((t log t + log N)log N) and O ((t log t + log N) log^2 N) bit operations, respectively.
Source: arXiv (Cornell University)
Author: Sze, Tsz-Wo
Language: English
Subfield: Algebra and Number Theory
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1590410857