Search of primitive polynomials over finite fields

DOI10.1016/0022-4049(90)90115-XMaRDI QIDQ749611zbMATH OpenFDO

Authors Marc Rybowicz

Publication date 1990

Published in Journal of Pure and Applied Algebra (Search for Journal in Brave)

zbMATH Keywords

primitive polynomials over finite fields

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Primitive Polynomials Over Finite Fields
• Fast algorithm for finding primitive polynomials over GF(q)
• Primitive polynomials over composite Galois fields
• Elements of provable high orders in finite fields
• Finding irreducible and primitive polynomials

Cites work

• scientific article; zbMATH DE number 3150090 (Why is no real title available?)
• scientific article; zbMATH DE number 3956969 (Why is no real title available?)
• scientific article; zbMATH DE number 3732191 (Why is no real title available?)
• scientific article; zbMATH DE number 192864 (Why is no real title available?)
• scientific article; zbMATH DE number 3616509 (Why is no real title available?)
• scientific article; zbMATH DE number 3621900 (Why is no real title available?)
• scientific article; zbMATH DE number 3244442 (Why is no real title available?)
• scientific article; zbMATH DE number 3245839 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• scientific article; zbMATH DE number 3353352 (Why is no real title available?)
• scientific article; zbMATH DE number 967590 (Why is no real title available?)
• A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft)
• All Factors q < 10 8 in All Mersenne Numbers 2 p - 1, p Prime < 10 4
• Analysis and synthesis of polynomials and sequences over&lt;tex&gt;GF(2)&lt;/tex&gt;
• Computing in GF(q)
• Construction of Galois Fields of Characteristic Two and Irreducible Polynomials
• Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials
• New directions in cryptography
• Primitive Roots in a Finite Field

Cited in

(4)

• Fast algorithm for finding primitive polynomials over GF(q)
• Algorithms for Finding Almost Irreducible and Almost Primitive Trinomials
• Primitive polynomials over composite Galois fields
• The combinatorial power of the companion matrix

This page was built for publication: Search of primitive polynomials over finite fields

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