Search of primitive polynomials over finite fields (Q749611): Difference between revisions

A certain class of irreducible polynomials over GF(2) is introduced which turn out to be mostly primitive. Those which are not primitive seem to have orders of a special form. The author also presents an algorithm without proof to construct primitive elements of some extensions over GF(2).

0 references

zbMATH Keywords

primitive polynomials over finite fields

0 references

reviewed by

Joseph J. Liang

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

0 references

Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials

0 references

Primitive Roots in a Finite Field

0 references

A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft)

0 references

New directions in cryptography

0 references

0 references

0 references

0 references

0 references

Analysis and synthesis of polynomials and sequences over&lt;tex&gt;GF(2)&lt;/tex&gt;

0 references

Q5690468

0 references

Q3726006

0 references

Q4039755

0 references

All Factors q < 10 8 in All Mersenne Numbers 2 p - 1, p Prime < 10 4

0 references

Q4180420

0 references

Construction of Galois Fields of Characteristic Two and Irreducible Polynomials

0 references

Q3919800

0 references

Identifiers

zbMATH Open document ID

0713.11085

0 references

DOI

10.1016/0022-4049(90)90115-X

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:749611

@@ Property / reviewed by @@
+Joseph J. Liang
@@ Property / reviewed by: Joseph J. Liang / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4184967
@@ Property / cites work: Q4184967 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3267492
@@ Property / cites work: Q3267492 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing in GF(q)
@@ Property / cites work: Computing in GF(q) / rank @@
+Normal rank
@@ Property / cites work @@
+Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials
+Normal rank
@@ Property / cites work @@
+Primitive Roots in a Finite Field
@@ Property / cites work: Primitive Roots in a Finite Field / rank @@
+Normal rank
@@ Property / cites work @@
+A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft)
+Normal rank
@@ Property / cites work @@
+New directions in cryptography
@@ Property / cites work: New directions in cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+Q5531597
@@ Property / cites work: Q5531597 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5533821
@@ Property / cites work: Q5533821 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5628187
@@ Property / cites work: Q5628187 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5585021
@@ Property / cites work: Q5585021 / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis and synthesis of polynomials and sequences over&amp;lt;tex&amp;gt;GF(2)&amp;lt;/tex&amp;gt;
+Normal rank
@@ Property / cites work @@
+Q5690468
@@ Property / cites work: Q5690468 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3726006
@@ Property / cites work: Q3726006 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4039755
@@ Property / cites work: Q4039755 / rank @@
+Normal rank
@@ Property / cites work @@
+All Factors q &lt; 10 8 in All Mersenne Numbers 2 p - 1, p Prime &lt; 10 4
+Normal rank
@@ Property / cites work @@
+Q4180420
@@ Property / cites work: Q4180420 / rank @@
+Normal rank
@@ Property / cites work @@
+Construction of Galois Fields of Characteristic Two and Irreducible Polynomials
+Normal rank
@@ Property / cites work @@
+Q3919800
@@ Property / cites work: Q3919800 / rank @@
+Normal rank