Some algorithms for generation of large prime numbers (Q1276025)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some algorithms for generation of large prime numbers |
scientific article; zbMATH DE number 1240184
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some algorithms for generation of large prime numbers |
scientific article; zbMATH DE number 1240184 |
Statements
Some algorithms for generation of large prime numbers (English)
0 references
14 January 1999
0 references
Some present-day methods of constructing large prime numbers \(n\) are based on the complete or partial decomposition of \(n-1\) into factors [see, for example, \textit{D. Plaisted}, Theor. Comput. Sci. 9, 1-16 (1979; Zbl 0421.10007)]. In this note the author shows how these methods may be refined in terms of the tests with Gauss and Jacobi sums.
0 references
large prime number
0 references
algorithm of construction
0 references
Gauss sums
0 references
Jacobi sums
0 references
0.7690438032150269
0 references
0.7638196349143982
0 references
0.7574313879013062
0 references
0.7535493969917297
0 references
