Application of the method of trigonometric sums for primality testing of integers (Q1866885)
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: Application of the method of trigonometric sums for primality testing of integers |
scientific article; zbMATH DE number 1899999
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Application of the method of trigonometric sums for primality testing of integers |
scientific article; zbMATH DE number 1899999 |
Statements
Application of the method of trigonometric sums for primality testing of integers (English)
0 references
23 April 2003
0 references
The paper deals with the problem of determining the primality of numbers by means of Gauss and Jacobi trigonometric sums for multiplicative and additive characters of finite fields in the Lenstra-Cohen algorithm. The paper follows the approach of \textit{H. Cohen} and \textit{H. W. Lenstra} jun. [Math. Comput. 42, 297--330 (1984; Zbl 0578.10004)].
0 references
prime number
0 references
primality testing
0 references
Gauss sums
0 references
Jacobi sums
0 references
Lenstra-Cohen algorithm
0 references
0 references
0.89477164
0 references
