|
|||||
|
|
Proving primality in essentially quartic random time |
|
| Authors: | Daniel J. Bernstein. |
| Affiliation: | Department of Mathematics, Statistics, and Computer Science (M/C 249), The University of Illinois at Chicago, Chicago, Illinois 60607--7045 |
| Abstract: | This paper presents an algorithm that, given a prime  , finds and verifies a proof of the primality of  in random time  . Several practical speedups are incorporated into the algorithm and discussed in detail. |
| Keywords: | |
| 点击此处可从《Mathematics of Computation》浏览原始摘要信息 | |
| 点击此处可从《Mathematics of Computation》下载全文 | |