TY - JOUR
T1 - Efficient linear feedback shift registers with maximal period
AU - Tsaban, Boaz
AU - Vishne, Uzi
PY - 2002
Y1 - 2002
N2 - We introduce and analyze an efficient family of linear feedback shift registers (LFSR) with maximal period. This family is word-oriented and is suitable for implementation in software, thus provides a solution to a recent challenge [8]. The classical theory of LFSR's is extended to provide efficient algorithms for generation of irreducible and primitive LFSR's of this new type.
AB - We introduce and analyze an efficient family of linear feedback shift registers (LFSR) with maximal period. This family is word-oriented and is suitable for implementation in software, thus provides a solution to a recent challenge [8]. The classical theory of LFSR's is extended to provide efficient algorithms for generation of irreducible and primitive LFSR's of this new type.
KW - Fast software encryption
KW - Linear feedback shift registers
KW - Linear transformation shift registers
UR - http://www.scopus.com/inward/record.url?scp=0036251431&partnerID=8YFLogxK
U2 - 10.1006/ffta.2001.0339
DO - 10.1006/ffta.2001.0339
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0036251431
SN - 1071-5797
VL - 8
SP - 256
EP - 267
JO - Finite Fields and Their Applications
JF - Finite Fields and Their Applications
IS - 2
ER -