A new algorithm for computing primitive elements in the field of Gaussian complex integers modulo a Mersenne prime (Q3870263)
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: A new algorithm for computing primitive elements in the field of Gaussian complex integers modulo a Mersenne prime |
scientific article; zbMATH DE number 3673489
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new algorithm for computing primitive elements in the field of Gaussian complex integers modulo a Mersenne prime |
scientific article; zbMATH DE number 3673489 |
Statements
A new algorithm for computing primitive elements in the field of Gaussian complex integers modulo a Mersenne prime (English)
0 references
1979
0 references
algorithm
0 references
Gaussian complex integers
0 references
Galois field
0 references
primitive elements
0 references
Mersenne prime
0 references
