Primitive t-Nomials (t = 3, 5) Over GF(2) Whose Degree is a Mersenne Exponent 44497
From MaRDI portal
Publication:3204530
DOI10.2307/2008411zbMath0717.11003OpenAlexW4232983163MaRDI QIDQ3204530
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
finite fieldpolynomialssieveirreducibility testMersenne exponentsprimitive trinomialsprimitive pentanomial
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 ⋮ A universal GFSR random number generator for personal computers ⋮ On the Periods of Generalized Fibonacci Recurrences ⋮ New primitive $t$-nomials $(t = 3,5)$ over $GF(2)$ whose degree is a Mersenne exponent ⋮ Ten new primitive binary trinomials ⋮ Uniform random number generation
This page was built for publication: Primitive t-Nomials (t = 3, 5) Over GF(2) Whose Degree is a Mersenne Exponent 44497
