A new algorithm for computing primitive elements in the field of Gaussian complex integers modulo a Mersenne prime (Q3870263): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 13:03, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new algorithm for computing primitive elements in the field of Gaussian complex integers modulo a Mersenne prime |
scientific article |
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
