Cryptology ePrint Archive: Report 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.

Category / Keywords: foundations / linear feedback shift registers, linear transformation shift registers, fast software encryption

Publication Info: Finite Fields and their Applications 8 (2002), 256--267

Date: received 16 Jul 2003

Contact author: tsaban at math huji ac il

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | BibTeX Citation

Version: 20030717:170327 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]