Ten new primitive binary trinomials

DOI10.1090/S0025-5718-08-02170-4zbMath1206.11010OpenAlexW2056180212WikidataQ56938975 ScholiaQ56938975MaRDI QIDQ3055140

Paul Zimmermann, Richard P. Brent

Publication date: 7 November 2010

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-08-02170-4

zbMATH Keywords

irreducible polynomialsprimitive polynomialsMersenne numberirreducible trinomialsGF(2)[x]Mersenne exponentsprimitive trinomials

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Software, source code, etc. for problems pertaining to number theory (11-04) Factorization; primality (11A51)

Related Items

Swan-like results for binomials and trinomials over finite fields of odd characteristic, The MIXMAX random number generator, A note on the multiple-recursive matrix method for generating pseudorandom vectors, A generalization of the Hansen-Mullen conjecture on irreducible polynomials over finite fields

Uses Software

• NTL

Cites Work

• Unnamed Item
• Factorization of polynomials over finite fields
• Primitive t-Nomials (t = 3, 5) Over GF(2) Whose Degree is a Mersenne Exponent 44497
• NEW PRIMITIVE TRINOMIALS OF MERSENNE-EXPONENT DEGREES FOR RANDOM-NUMBER GENERATION
• A primitive trinomial of degree 6972593
• A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377
• New primitive $t$-nomials $(t = 3,5)$ over $GF(2)$ whose degree is a Mersenne exponent
• Faster Multiplication in GF(2)[x]