CryptoDB
Efficient linear feedback shift registers with maximal period
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2003-11851, title={Efficient linear feedback shift registers with maximal period}, booktitle={IACR Eprint archive}, keywords={foundations / linear feedback shift registers, linear transformation shift registers, fast software encryption}, url={http://eprint.iacr.org/2003/136}, note={Finite Fields and their Applications 8 (2002), 256--267 tsaban@math.huji.ac.il 12250 received 16 Jul 2003}, author={Boaz Tsaban and Uzi Vishne}, year=2003 }