On primitive trinomials (mod 2), II

DOI10.1016/S0019-9958(69)90356-8MaRDI QIDQ5575685zbMATH OpenOpenAlexFDO

Authors Neal Zierler, John Brillhart

Publication date 1969

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

Full work available at URL https://doi.org/10.1016/s0019-9958(69)90356-8

zbMATH Keywords

number theory

Mathematics Subject Classification ID

Polynomials (irreducibility, etc.) (11R09)

Cited in

(13)

• Irreducible factors of psi-polynomials over finite fields
• A very fast shift-register sequence random number generator
• An analog to the discriminant over fields of characteristic two
• Factorization of trinomials over Galois fields of characteristic 2
• A universal GFSR random number generator for personal computers
• Maximum-length sequences, cellular automata, and random numbers
• Primitive polynomials testing methodology
• Generating Uniformly Distributed Random Numbers without Floating Point Operations
• Primitive Polynomials Over Finite Fields
• Gauss periods: orders and cryptographical applications
• Irreducible trinomials over finite fields
• Efficient hardware implementation of finite fields with applications to cryptography
• Random number generation with the recursion \(X_ t=X_{t-3p}\oplus X_{t-3q}\)

This page was built for publication: On primitive trinomials (mod 2), II

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