A new algorithm for computing primitive elements in the field of Gaussian complex integers modulo a Mersenne prime (Q3870263)

From MaRDI portal
Revision as of 10:06, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references