Constructive problems for irreducible polynomials over finite fields

DOI10.1007/3-540-57936-2_27MaRDI QIDQ4382304zbMATH OpenFDO

Authors Shuhong Gao, Robert J. Lambert, Ian Blake

Publication date 31 August 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57936-2_27

zbMATH Keywords

finite fieldirreducible polynomialirreducible trinomialprimitive trinomialprimitivity testing algorithms

Mathematics Subject Classification ID

Polynomials over finite fields (11T06)

Review text

The authors address the question of constructing irreducible polynomials over the binary field, where particular emphasis is laid on irreducible trinomials, which are the sparsest irreducible binary polynomials. The paper contains a table of all irreducible trinomials \(T_{n,k} = x^n + x^k + 1\) (where \(k \leq n/2, 1 \leq n \leq 2000\)) and also discusses irreducibility and primitivity testing algorithms. Since the appearance of the paper, the authors have continued their work in experimentally studying irreducible and primitive trinomials. The interested reader should therefore also consult \textit{I. F. Blake, S. Gao} and \textit{R. Lambert} [Applications of finite fields. Based on the proceedings of the IMA conference, London, UK, July 5-7, 1994. Oxford: Clarendon Press. Inst. Math. Appl. Conf. Ser., New Ser. 59, 19-32 (1996; Zbl 0887.11051)]. For the entire collection see [Zbl 0875.94001].

Recommendations

• scientific article; zbMATH DE number 1047540
• Irreducible trinomials over finite fields
• Algorithms for Finding Almost Irreducible and Almost Primitive Trinomials
• Irreducible Polynomials Which Divide Trinomials Over GF$\,(2)$
• Some observations concerning irreducible trinomials and pentanomials over Z₂

Cited in

(15)

• The trace spectra of polynomial bases for \(\mathbb F_{2^n}\)
• Factorization of trinomials over Galois fields of characteristic 2
• On the distribution of irreducible trinomials over \(\mathbb F_3\)
• A note on the reducibility of binary affine polynomials
• On a problem of Sidon for polynomials over finite fields
• scientific article; zbMATH DE number 1047540 (Why is no real title available?)
• Gauss periods: orders and cryptographical applications
• Algorithms for Finding Almost Irreducible and Almost Primitive Trinomials
• A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377
• Which Irreducible Polynomials Divide Trinomials over GF(2)?
• Some observations concerning irreducible trinomials and pentanomials over Z₂
• A new direction on constructing irreducible polynomials over finite fields
• The inverse stability of Artin-Schreier polynomials over finite fields
• Efficient hardware implementation of finite fields with applications to cryptography
• An extension of TYT inversion algorithm in polynomial basis

This page was built for publication: Constructive problems for irreducible polynomials over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4382304)