Efficient linear feedback shift registers with maximal period

Boaz Tsaban; Uzi Vishne

Paper 2003/136

Efficient linear feedback shift registers with maximal period

Boaz Tsaban and Uzi Vishne

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 \cite{FSE94}. The classical theory of LFSR's is extended to provide efficient algorithms for generation of irreducible and primitive LFSR's of this new type.

Metadata

Available format(s): PS
Category: Foundations
Publication info: Published elsewhere. Finite Fields and their Applications 8 (2002), 256--267
Keywords: linear feedback shift registers linear transformation shift registers fast software encryption
Contact author(s): tsaban @ math huji ac il
History: 2003-07-17: received
Short URL: https://ia.cr/2003/136
License: CC BY

BibTeX

@misc{cryptoeprint:2003/136,
      author = {Boaz Tsaban and Uzi Vishne},
      title = {Efficient linear feedback shift registers with maximal period},
      howpublished = {Cryptology {ePrint} Archive, Paper 2003/136},
      year = {2003},
      url = {https://eprint.iacr.org/2003/136}
}