A fast algorithm to compute irreducible and primitive polynomials in finite fields (Q4327377)

From MaRDI portal
scientific article; zbMATH DE number 741012
Language Label Description Also known as
English
A fast algorithm to compute irreducible and primitive polynomials in finite fields
scientific article; zbMATH DE number 741012

    Statements

    A fast algorithm to compute irreducible and primitive polynomials in finite fields (English)
    0 references
    0 references
    0 references
    0 references
    5 April 1995
    0 references
    0 references
    0 references
    0 references
    0 references
    irreducible polynomials
    0 references
    finite fields
    0 references
    Euclidean algorithm
    0 references
    Berlekamp-Massey algorithm
    0 references