Improving the Time Complexity of the Computation of Irreducible and Primitive Polynomials in Finite Fields

Translated title of the contribution: Improving the Time Complexity of the Computation of Irreducible and Primitive Polynomials in Finite Fields

    Research output: Contribution to journalArticleResearch

    4 Citations (Scopus)
    Translated title of the contributionImproving the Time Complexity of the Computation of Irreducible and Primitive Polynomials in Finite Fields
    Original languageMultiple languages
    Pages (from-to)352-359
    JournalLect. notes comput. sci.
    Volume1
    Issue number539
    Publication statusPublished - 1 Jan 1991

    Cite this