Search of primitive polynomials over finite fields

DOI10.1016/0022-4049(90)90115-XzbMath0713.11085MaRDI QIDQ749611

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

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

Related Items (1)

The combinatorial power of the companion matrix

Cites Work

• Construction of Galois Fields of Characteristic Two and Irreducible Polynomials
• All Factors q < 10 8 in All Mersenne Numbers 2 p - 1, p Prime < 10 4
• Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials
• A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft)
• New directions in cryptography
• Computing in GF(q)
• Analysis and synthesis of polynomials and sequences over&lt;tex&gt;GF(2)&lt;/tex&gt;
• Primitive Roots in a Finite Field
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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