On primitive trinomials (Mod 2)

DOI10.1016/S0019-9958(68)90973-XMaRDI QIDQ5549897zbMATH OpenFDO

Authors Neal Zierler, John Brillhart

Publication date 1968

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(68)90973-X

zbMATH Keywords

number theory

Cited in

(16)

• Irreducible factors of psi-polynomials over finite fields
• Algebraic theory of block codes detecting independent errors
• A universal GFSR random number generator for personal computers
• A comparative study of some pseudorandom number generators
• Clues to the hidden nature of de Bruijn sequences
• Characterizations of generators for modified de Bruijn sequences
• Primitive polynomials testing methodology
• Generating Uniformly Distributed Random Numbers without Floating Point Operations
• Primitive Polynomials Over Finite Fields
• On the Use of Reducible Polynomials as Random Number Generators
• On the Periods of Generalized Fibonacci Recurrences
• Gauss periods: orders and cryptographical applications
• Primitive Binary Polynomials
• A construction of primitive polynomials over finite fields
• Maximally equidistributed combined Tausworthe generators
• Efficient hardware implementation of finite fields with applications to cryptography

This page was built for publication: On primitive trinomials (Mod 2)

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