Finding irreducible and primitive polynomials

Igor E. Shparlinski*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

13 Citations (Scopus)

Abstract

In the paper some new fast constructions of irreducible and primitive polynomials are presented. For instance, it is shown, that for any Q large enough one can design a finite field {Mathematical expression}q with q=Q + o(Q) elements in polynomial time (log Q)o(1).

Original languageEnglish
Pages (from-to)263-268
Number of pages6
JournalApplicable Algebra in Engineering, Communication and Computing
Volume4
Issue number4
DOIs
Publication statusPublished - Dec 1993

Keywords

  • Algorithms in finite fields
  • polynomials over finite fields

Fingerprint Dive into the research topics of 'Finding irreducible and primitive polynomials'. Together they form a unique fingerprint.

Cite this