Results 1 - 10 of 274

Efficient Linear Feedback Shift Registers with Maximal Period, Finite Fields and Their Applications 8(2

by Boaz Tsaban, Communicated Peter, Jau-shyong Shive , 2002
"... 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 efficien ..."
Abstract - Cited by 9 (2 self) - Add to MetaCart
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

Feedback Shift Register Sequences

by Hong-yeop Song
"... Feedback Shift Register (FSR) sequences have been successfully implemented in many communication systems for their randomness properties and ease of implementation. These include ranging and navigation systems, spread spectrum communication systems, CDMA mobile communication systems, and crypto syst ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Feedback Shift Register (FSR) sequences have been successfully implemented in many communication systems for their randomness properties and ease of implementation. These include ranging and navigation systems, spread spectrum communication systems, CDMA mobile communication systems, and crypto

On The Quadratic Feedback Shift Registers

by Elif Saygı
"... Abstract. In this paper, we survey the properties of sequences that are generated from quadratic feedback shift registers. The length of the shortest feedback shift register that generates a sequence is called the span of the sequence and if the feedback function is quadratic then the span of the se ..."
Abstract - Add to MetaCart
of the sequence is called the quadratic span of the sequence. It is known that, a sequence with large linear complexity (linear span) may be generated by a much shorter feedback shift register with quadratic or nonlinear feedback function. We will give some examples having large linear span but less quadratic

A New Class Of Linear Feedback Shift Register Generators

by Pierre L'Ecuyer, J. A. Joines, R. R. Barton, K. Kang, P. A. Fishwick, Francois Panneton
"... An efficient implementation of linear feedback shift register sequences with a given characteristic polynomial is obtained by a new method. It involves a polynomial linear congruential generator over the finite field with two elements. We obtain maximal equidistribution by constructing a suitable ou ..."
Abstract - Cited by 8 (5 self) - Add to MetaCart
An efficient implementation of linear feedback shift register sequences with a given characteristic polynomial is obtained by a new method. It involves a polynomial linear congruential generator over the finite field with two elements. We obtain maximal equidistribution by constructing a suitable

On the Linear Complexity of Feedback Registers

by A. H. Chan, M. Goresky, A. Klapper , 2002
"... In this paper, we study sequences generated by arbitrary feedback registers (not necessarily feedback shift register) with arbitrary feedforward functions. We generalize the definition of linear complexity of a sequence to the notions of strong and weak linear complexity of feedback registers. A te ..."
Abstract - Cited by 3 (3 self) - Add to MetaCart
technique for finding upper bounds for the strong linear complexities of such registers is developed. This technique is applied to several classes of registers. We prove that a feedback shift register whose feedback function is of the form x1 + h(x2; : : : ; xn) can generate long periodic sequences

On analysis and synthesis of (n,k)-non-linear feedback shift registers

by Elena Dubrova, Maxim Teslenko, Hannu Tenhunen - In Proceedings of the Conference on Design Automation and Test in Europe: DATE’08 , 2008
"... Abstract — Non-Linear Feedback Shift Registers (NLFSRs) have been proposed as an alternative to Linear Feedback Shift Registers (LFSRs) for generating pseudo-random sequences for stream ciphers. In this paper, we introduce (n,k)-NLFSRs which can be considered a generalization of the Galois type of L ..."
Abstract - Cited by 6 (5 self) - Add to MetaCart
Abstract — Non-Linear Feedback Shift Registers (NLFSRs) have been proposed as an alternative to Linear Feedback Shift Registers (LFSRs) for generating pseudo-random sequences for stream ciphers. In this paper, we introduce (n,k)-NLFSRs which can be considered a generalization of the Galois type

Generation Of Vector Patterns Through Reseeding Of Multiple-Polynomial Linear Feedback Shift Registers

by Sybille Hellebrand , Steffen Tarnick, Janusz Rajski, Bernard Courtois - PROC. OF INTERNATIONAL TEST CONFERENCE , 1992
"... In this paper we perform a comparative analysis of the encoding efficiency of BIST schemes based on reseeding of single polynomial LFSR's as well as LFSR's with fully programmable polynomials. Full programmability gives much better encoding efficiency. For a testcube with s carebits we ne ..."
Abstract - Cited by 91 (3 self) - Add to MetaCart
In this paper we perform a comparative analysis of the encoding efficiency of BIST schemes based on reseeding of single polynomial LFSR's as well as LFSR's with fully programmable polynomials. Full programmability gives much better encoding efficiency. For a testcube with s carebits we

High Efficiency Feedback Shift Register: σ−LFSR ⋆

by Guang Zeng, Wenbao Han, Kaicheng He
"... Abstract. We introduce a new kind of word-oriented linear feedback shift register called σ−LFSR which is constructed with the instructions of the modern processor and have fast software implementation. We offer an algorithm to search for good primitive σ−LFSR. In particular, we give two examples HHZ ..."
Abstract - Cited by 10 (0 self) - Add to MetaCart
Abstract. We introduce a new kind of word-oriented linear feedback shift register called σ−LFSR which is constructed with the instructions of the modern processor and have fast software implementation. We offer an algorithm to search for good primitive σ−LFSR. In particular, we give two examples

Fibonacci and Galois Representations of Feedback-With-Carry Shift Registers

by Mark Goresky, Andrew M. Klapper, Associate Member, Associate Member - IEEE Trans. Inform. Theory , 2002
"... A feedback-with-carry shift register (FCSR) with "Fibonacci" architecture is a shift register provided with a small amount of memory which is used in the feedback algorithm. Like the linear feedback shift register (LFSR), the FCSR provides a simple and predictable method for the fast gener ..."
Abstract - Cited by 34 (1 self) - Add to MetaCart
A feedback-with-carry shift register (FCSR) with "Fibonacci" architecture is a shift register provided with a small amount of memory which is used in the feedback algorithm. Like the linear feedback shift register (LFSR), the FCSR provides a simple and predictable method for the fast

Feedback shift registers, 2-adic span, and combiners with memory

by Andrew Klapper, Mark Goresky - JOURNAL OF CRYPTOLOGY , 1997
"... Feedback shift registers with carry operation (FCSR’s) are described, implemented, and analyzed with respect to memory requirements, initial loading, period, and distributional properties of their output sequences. Many parallels with the theory of linear feedback shift registers (LFSR’s) are presen ..."
Abstract - Cited by 59 (7 self) - Add to MetaCart
Feedback shift registers with carry operation (FCSR’s) are described, implemented, and analyzed with respect to memory requirements, initial loading, period, and distributional properties of their output sequences. Many parallels with the theory of linear feedback shift registers (LFSR
Results 1 - 10 of 274