A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377

DOI10.1090/S0025-5718-02-01478-3MaRDI QIDQ4806397zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Richard P. Brent, Samuli Larvala, Paul Zimmermann

Publication date 14 May 2003

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

Full work available at URL https://doi.org/10.1090/s0025-5718-02-01478-3

zbMATH Keywords

primitive polynomialsirreducible polynomialsMersenne numbersrandom number generatorsirreducible trinomialsMersenne exponentsprimitive trinomials

Mathematics Subject Classification ID

Special sequences and polynomials (11B83) Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Ten new primitive binary trinomials
• Primitive t-Nomials (t = 3, 5) Over GF(2) Whose Degree is a Mersenne Exponent 44497
• A primitive trinomial of degree 6972593
• New primitive $t$-nomials $(t = 3,5)$ over $GF(2)$ whose degree is a Mersenne exponent
• scientific article; zbMATH DE number 872088

Cites work

• scientific article; zbMATH DE number 1305037 (Why is no real title available?)
• scientific article; zbMATH DE number 607286 (Why is no real title available?)
• scientific article; zbMATH DE number 1047540 (Why is no real title available?)
• scientific article; zbMATH DE number 1135075 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• scientific article; zbMATH DE number 3422259 (Why is no real title available?)
• Algebraic coding theory
• Factorization of polynomials over finite fields
• Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
• NEW PRIMITIVE TRINOMIALS OF MERSENNE-EXPONENT DEGREES FOR RANDOM-NUMBER GENERATION
• New primitive $t$-nomials $(t = 3,5)$ over $GF(2)$ whose degree is a Mersenne exponent
• On the Theorem of Gleason and Marsh
• On trinomials xn + x}2 + 1 and x8/ ± 3 + xk + 1 irreducible over GF(2)
• On xn + x + 1 over GF(2)
• Primitive Binary Polynomials
• Primitive Normal Bases for Finite Fields
• Primitive Polynomials (Mod 2)
• Primitive Trinomials of High Degree
• Primitive t-Nomials (t = 3, 5) Over GF(2) Whose Degree is a Mersenne Exponent 44497
• Primitive trinomials whose degree is a Mersenne exponent

Cited in

(8)

• On Mersenne polynomials over \(\mathbb{F}_2\)
• Algorithms for Finding Almost Irreducible and Almost Primitive Trinomials
• Primitive t-Nomials (t = 3, 5) Over GF(2) Whose Degree is a Mersenne Exponent 44497
• A primitive trinomial of degree 6972593
• A polynomial variant of perfect numbers
• NEW PRIMITIVE TRINOMIALS OF MERSENNE-EXPONENT DEGREES FOR RANDOM-NUMBER GENERATION
• Ten new primitive binary trinomials
• Computing special powers in finite fields

This page was built for publication: A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377

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