On primitive trinomials (Mod 2)
From MaRDI portal
Publication:5549897
DOI10.1016/S0019-9958(68)90973-XzbMath0165.06503MaRDI QIDQ5549897
Publication date: 1968
Published in: Information and Control (Search for Journal in Brave)
Related Items
Efficient hardware implementation of finite fields with applications to cryptography, A universal GFSR random number generator for personal computers, A comparative study of some pseudorandom number generators, Irreducible factors of psi-polynomials over finite fields, Algebraic theory of block codes detecting independent errors, A construction of primitive polynomials over finite fields, Maximally equidistributed combined Tausworthe generators, Gauss periods: orders and cryptographical applications, On the Use of Reducible Polynomials as Random Number Generators, On the Periods of Generalized Fibonacci Recurrences, Primitive Polynomials Over Finite Fields, Characterizations of generators for modified de Bruijn sequences, Primitive polynomials testing methodology, Clues to the hidden nature of de Bruijn sequences, Generating Uniformly Distributed Random Numbers without Floating Point Operations, Primitive Binary Polynomials