Efficient Linear Feedback Shift Registers with Maximal Period

Authors:
Boaz Tsaban;Uzi Vishne
Affiliations:
Department of Mathematics, Bar-Ilan University, 52900, Ramat-Gan, Israelf1tsaban@macs.biu.ac.ilf1;Landau Research Center for Mathematical Analysis, Hebrew University of Jerusalem, Israelf2vishne@math.huji.ac.ilf2
Venue:
Finite Fields and Their Applications
Year:
2002

Citing 6
Cited 3

On shortest linear recurrences

Journal of Symbolic Computation
On the Minimal Polynomial of the Product of Linear Recurring Sequences

Finite Fields and Their Applications
Factorization of Trinomials over Galois Fields of Characteristic 2

Finite Fields and Their Applications
On Multisequence Shift Register Synthesis and Generalized-Minimum-Distance Decoding of Reed-Solomon Codes

Finite Fields and Their Applications
An Explicit Similarity Transform between Cellular Automata and LFSR Matrices

Finite Fields and Their Applications
Orthogonal Arrays, Primitive Trinomials, and Shift-Register Sequences

Finite Fields and Their Applications

Guaranteeing the diversity of number generators

Information and Computation
The software performance of authenticated-encryption modes

FSE'11 Proceedings of the 18th international conference on Fast software encryption
Word-Oriented transformation shift registers and their linear complexity

SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications

Quantified Score

Hi-index	0.00

Visualization

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 [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.