Journal ArticleDOI
A fast algorithm for determining the complexity of a binary sequence with period 2^n (Corresp.)
R. Games,Agnes Hui Chan +1 more
TLDR
The complexity of a periodic sequence is defined to be the least number of stages in a linear feedback shift register that generates periodic sequences.Abstract:
The complexity of a periodic sequence (s) is defined to be the least number of stages in a linear feedback shift register that generates (s) read more
Citations
More filters
Book
Handbook of Applied Cryptography
TL;DR: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols.
Journal ArticleDOI
An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
Mark Stamp,Clyde F. Martin +1 more
TL;DR: A generalized linear complexity that has application to the security of stream ciphers is proposed, and an efficient algorithm is given for the case in which the sequence is binary with period 2/sup n/.
Journal ArticleDOI
On the complexities of de Bruijn sequences
TL;DR: It is shown that the complexity of a binary de Bruijn sequence of span n is bounded by 2 n − 1 from above and 2 n + 1 + n from below.
Book ChapterDOI
Some Computable Complexity Measures for Binary Sequences
TL;DR: This paper will focus on complexity measures that are not only of theoretical interest, but that can also be obtained in an algorithmic manner, such as the linear complexity, thelinear complexity profile, and the tree complexity.
Journal ArticleDOI
An algorithm for the k -error linear complexity of sequences over GF ( p m ) with period p n , p a prime
TL;DR: An algorithm is given for the k-error linear complexity of sequences over GF(pm) with period pn, p a prime by using the modified cost different from that used in the Stamp?Martin algorithm for sequences overGF(2) withperiod 2n.
References
More filters
Journal ArticleDOI
Shift-register synthesis and BCH decoding
TL;DR: It is shown in this paper that the iterative algorithm introduced by Berlekamp for decoding BCH codes actually provides a general solution to the problem of synthesizing the shortest linear feedback shift register capable of generating a prescribed finite sequence of digits.
Journal ArticleDOI
An analysis of the structure and complexity of nonlinear binary sequence generators
TL;DR: A method of analysis is presented for the class of binary sequence generators employing linear feedback shift registers with nonlinear feed-forward operations, of special interest because the generators are capable of producing very long "unpredictable" sequences.
Journal ArticleDOI
Generation of binary sequences with controllable complexity
TL;DR: It is shown that, while maximum length sequences from r -stage linear logic feedback generators have minimum complexity, it is a simple matter to use such sequences as bases for deriving other more complex sequences of the same length.