DocumentCode :
938958
Title :
Algorithms for the generation of full-length shift- register sequences
Author :
Etzion, Tuvi ; Lempel, Abraham
Volume :
30
Issue :
3
fYear :
1984
fDate :
5/1/1984 12:00:00 AM
Firstpage :
480
Lastpage :
484
Abstract :
Two algorithms are presented for the generation of full-length shift-register cycles, also referred to as de Bruijn sequences. The first algorithm generates 
full cycles of length 
, using 
bits of storage, where 
is a free parameter in the range 
, and 
is of the order of 
. The second algorithm generates about 
full cycles of length , using about 
bits of storage. In both algorithms, the time required to produce the next bit from the last 
bits is close to . A possible application to the construction of stream ciphers is indicated.
full cycles of length , using bits of storage, where is a free parameter in the range , and is of the order of . The second algorithm generates about full cycles of length , using about bits of storage. In both algorithms, the time required to produce the next bit from the last bits is close to . A possible application to the construction of stream ciphers is indicated.Keywords :
Shift-register sequences; Computer science; Cryptography; Registers; State feedback;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1984.1056919
Filename :
1056919
Link To Document :
