Efficient linear feedback shift registers with maximal period

Abstract

We introduce and analyze an efficient family of linear feedback shift registers (LFSR's) with maximal period. This family is word-oriented and is suitable for implementation in software, thus provides a solution to a recent challenge posed in FSE '94. The classical theory of LFSR's is extended to provide efficient algorithms for generation of irreducible and primitive LFSR's of this new type.

Cited by in corpus (8)

• Guaranteeing the diversity of number generators
• Block Companion Singer Cycles, Primitive Recursive Vector Sequences, and Coprime Polynomial Pairs over Finite Fields
• A note on the multiple-recursive matrix method for generating pseudorandom vectors
• An asymptotic formula for the number of irreducible transformation shift registers
• Enumeration of Linear Transformation Shift Registers
• Information Security and Privacy in the Digital World: Some Selected Topics
• Linear Recurrences over a Finite Field with Exactly Two Periods
• Primitive transformation shift registers over finite fields