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

DOI10.1007/BF01294593MaRDI QIDQ4327377zbMATH OpenFDO

Authors Joan Borrell, Josep Rifà

Publication date 5 April 1995

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01294593

zbMATH Keywords

Berlekamp-Massey algorithmEuclidean algorithmfinite fieldsirreducible polynomials

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16) Symbolic computation and algebraic computation (68W30)

Recommendations

• Fast algorithm for finding primitive polynomials over GF(q)
• Finding irreducible and primitive polynomials
• scientific article; zbMATH DE number 177888
• On arithmetical algorithms over finite fields
• Fast construction of irreducible polynomials over finite fields

Cites work

• A method for solving key equation for decoding goppa codes
• Constructing normal bases in finite fields
• Finding Isomorphisms Between Finite Fields
• scientific article; zbMATH DE number 4023423 (Why is no real title available?)
• scientific article; zbMATH DE number 4033059 (Why is no real title available?)
• scientific article; zbMATH DE number 177888 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• Shift-register synthesis and BCH decoding
• Systolic VLSI Arrays for Polynomial GCD Computation
• VLSI Architectures for Computing Multiplications and Inverses in GF(2^m)

Cited in

(10)

• Algorithm for studying polynomial maps and reductions modulo prime number
• Fast Computation of the Nth Term of an Algebraic Series over a Finite Prime Field
• scientific article; zbMATH DE number 5733040 (Why is no real title available?)
• scientific article; zbMATH DE number 5630829 (Why is no real title available?)
• Fast algorithm for finding primitive polynomials over GF(q)
• scientific article; zbMATH DE number 177888 (Why is no real title available?)
• Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)
• An algorithm for finding the minimum degree of a polynomial over a finite field for a function over a vector space depending on the choice of an irreducible polynomial
• A polynomial time algorithm for computing the HNF of a module over the integers of a number field
• On obtaining long m-sequences from low-degree primitive polynomials

This page was built for publication: A fast algorithm to compute irreducible and primitive polynomials in finite fields

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