Finding irreducible and primitive polynomials

Igor E. Shparlinski

doi:10.1007/BF01200150

Finding irreducible and primitive polynomials

Igor E. Shparlinski^*

^*Corresponding author for this work

School of Computing

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	263-268
Number of pages	6
Journal	Applicable Algebra in Engineering, Communication and Computing
Volume	4
Issue number	4
DOIs	https://doi.org/10.1007/BF01200150
Publication status	Published - Dec 1993

Keywords

Algorithms in finite fields
polynomials over finite fields

Access to Document

10.1007/BF01200150

Cite this

@article{82bb5894b9e547c48b1ebb0d08852505,

title = "Finding irreducible and primitive polynomials",

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).",

keywords = "Algorithms in finite fields, polynomials over finite fields",

author = "Shparlinski, {Igor E.}",

year = "1993",

month = dec,

doi = "10.1007/BF01200150",

language = "English",

volume = "4",

pages = "263--268",

journal = "Applicable Algebra in Engineering, Communication and Computing",

issn = "0938-1279",

publisher = "Springer, Springer Nature",

number = "4",

}

TY - JOUR

T1 - Finding irreducible and primitive polynomials

AU - Shparlinski, Igor E.

PY - 1993/12

Y1 - 1993/12

N2 - 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).

AB - 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).

KW - Algorithms in finite fields

KW - polynomials over finite fields

UR - http://www.scopus.com/inward/record.url?scp=0347097026&partnerID=8YFLogxK

U2 - 10.1007/BF01200150

DO - 10.1007/BF01200150

M3 - Article

AN - SCOPUS:0347097026

SN - 0938-1279

VL - 4

SP - 263

EP - 268

JO - Applicable Algebra in Engineering, Communication and Computing

JF - Applicable Algebra in Engineering, Communication and Computing

IS - 4

ER -

Finding irreducible and primitive polynomials

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this