Factorization and Primality Tests (Q3340912)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3873407
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Factorization and Primality Tests |
scientific article; zbMATH DE number 3873407 |
Statements
Factorization and Primality Tests (English)
0 references
1984
0 references
computational number theory
0 references
survey
0 references
primality testing
0 references
factoring methods
0 references
bibliography
0 references
factoring algorithm
0 references
group of points of finite elliptic curves
0 references
0.93424934
0 references
This paper is an excellent up-to-date survey of primality testing and factoring methods, including the recent primality testing method due to \textit{L. M. Adleman}, \textit{C. Pomerance} and \textit{R. S. Rumely} [Ann. Math. (2) 117, 173--206 (1983; Zbl 0526.10004)], and improved by \textit{H. W. Lenstra jun.} and the reviewer [Math. Comput. 42, No.165, 297--330 (1984; Zbl 0578.10004)]. An extensive and useful bibliography is given. I recommend this paper highly to someone wanting to introduce himself to this subject. [Note: the expression ``probabilistic primality testing algorithm'' is used with two completely different meanings.] Since this paper was written H. W. Lenstra (unpublished) discovered still another factoring algorithm based on the group of points of finite elliptic curves which may turn out to be the fastest known.
0 references