Efficient linear feedback shift registers with maximal period

DOI10.1006/FFTA.2001.0339zbMATH Open1015.94005arXivcs/0304010OpenAlexW2085661788MaRDI QIDQ1609404FDOQ1609404

Boaz Tsaban, Uzi Vishne

Publication date: 15 August 2002

Published in: Finite Fields and their Applications (Search for Journal in Brave)

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 posed in FSE '94. The classical theory of LFSR's is extended to provide efficient algorithms for generation of irreducible and primitive LFSR's of this new type.

Full work available at URL: https://arxiv.org/abs/cs/0304010

zbMATH Keywords

linear feedback shift registersfast software encryptionlinear transformation shift registers

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Orthogonal arrays, primitive trinomials, and shift-register sequences
• On shortest linear recurrences
• Factorization of trinomials over Galois fields of characteristic 2
• On the minimal polynomial of the product of linear recurring sequences
• On multisequence shift register synthesis and generalized-minimum- distance decoding of Reed-Solomon codes
• An explicit similarity transform between cellular automata and LFSR matrices

Cited In (23)

• Построение скрученных ЛРП максимального периода над конечными полями с помощью определяющих наборов коэффициентов
• Разрядные последовательности скрученных линейных рекуррент максимального периода над кольцами Галуа
• Скрученные $\sigma$-разделимые линейные рекуррентные последовательности максимального периода
• Guaranteeing the diversity of number generators
• A note on the multiple-recursive matrix method for generating pseudorandom vectors
• Enumeration of linear transformation shift registers
• Скошенные ЛРП максимального периода над кольцами Галуа
• Representations of skew linear recurrent sequences of maximal period over finite field;Представления скрученных линейных рекуррентных последовательностей максимального периода над конечным полем
• Linear recurrences over a finite field with exactly two periods
• Specified sequence linear feedback shift registers
• Методы построения скрученных линейных рекуррентных последовательностей максимального периода, базирующиеся на факторизации многочленов Галуа в кольце матричных многочленов
• Primitive transformation shift registers over finite fields
• High-Speed Parallel Architectures for Linear Feedback Shift Registers
• Nonlinear vectorial primitive recursive sequences
• Title not available (Why is that?)
• Equidistant filters based on skew ML-sequences over fields
• Новые представления знаков скрученных ЛРП при помощи функции след, базирующиеся на некоммутативной теореме Гамильтона - Кэли
• Skew linear recurring sequences of maximal period over Galois rings
• An asymptotic formula for the number of irreducible transformation shift registers
• Block companion singer cycles, primitive recursive vector sequences, and coprime polynomial pairs over finite fields
• Описание скрученных линейных рекуррент максимального периода в терминах мультипликаторов
• The Software Performance of Authenticated-Encryption Modes
• On the number of irreducible linear transformation shift registers

This page was built for publication: Efficient linear feedback shift registers with maximal period

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1609404)