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
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:25, 5 February 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
