Primitive t-Nomials (t = 3, 5) Over GF(2) Whose Degree is a Mersenne Exponent 44497

DOI10.2307/2008411zbMATH Open0717.11003OpenAlexW4232983163MaRDI QIDQ3204530FDOQ3204530

Yoshiharu Kurita, Makoto Matsumoto

Publication date: 1991

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

Full work available at URL: https://doi.org/10.2307/2008411

zbMATH Keywords

finite fieldpolynomialssieveirreducibility testMersenne exponentsprimitive trinomialsprimitive pentanomial

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Polynomials in general fields (irreducibility, etc.) (12E05)

Cited In (7)

• A Table of Primitive Binary Polynomials
• New primitive $t$-nomials $(t = 3,5)$ over $GF(2)$ whose degree is a Mersenne exponent
• A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377
• Ten new primitive binary trinomials
• Uniform random number generation
• A universal GFSR random number generator for personal computers
• On the Periods of Generalized Fibonacci Recurrences

This page was built for publication: Primitive t-Nomials (t = 3, 5) Over GF(2) Whose Degree is a Mersenne Exponent 44497

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