Efficient linear feedback shift registers with maximal period
type: Item
instance of: scholarly article
title: Efficient linear feedback shift registers with maximal period
zbMATH Open document ID: 1015.94005
author: Boaz Tsaban
author: Uzi Vishne
published in: Finite Fields and their Applications
publication date: 2002-08-15T00:00:00Z
full work available at URL: https://arxiv.org/abs/cs/0304010
review text: The paper suggests a solution to the problem posed in [\textit{B. Preneel} (ed.), Fast software encryption, 2nd international workshop, Leuven, Belgium 1994, Lect. Notes Comput. Sci. 1008 (1995; Zbl 0829.68005)] to design linear feedback shift registers that exploit the parallelism offered by the word oriented operations of modern processors. The idea lies in using a linear feedback shift register over the vector space \(F_2^m\) additionally equipped with a linear transformation \(T\). In some cases such a register, called linear tansformation shift register, can generate a sequence of vectors with very long period. The classical theory of binary linear feedback shift registers is extended to provide efficient algorithms for generation of irreducible and primitive linear transformation shift registers.
reviewed by: Jerzy Żurawiecki
Mathematics Subject Classification ID: 94A55
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 1781831
zbMATH Keywords: linear feedback shift registers
zbMATH Keywords: linear transformation shift registers
zbMATH Keywords: fast software encryption
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2085661788
arXiv ID: cs/0304010
cites work: An explicit similarity transform between cellular automata and LFSR matrices
cites work: Q5684568
cites work: On the minimal polynomial of the product of linear recurring sequences
cites work: On multisequence shift register synthesis and generalized-minimum- distance decoding of Reed-Solomon codes
cites work: Q3216750
cites work: Orthogonal arrays, primitive trinomials, and shift-register sequences
cites work: On shortest linear recurrences
cites work: Q4869527
cites work: Factorization of trinomials over Galois fields of characteristic 2
DOI: 10.1006/FFTA.2001.0339
description: scientific article