Title :
A lower bound on the linear span of an FCSR
Author :
Seo, Changho ; Lee, Sangjin ; Sung, Yeoulouk ; Han, Keunhee ; Kim, Sangchoon
Author_Institution :
Dept. of Appl. Math., Kongju Nat. Univ., South Korea
fDate :
3/1/2000 12:00:00 AM
Abstract :
We have derived a lower bound on the linear span of a binary sequence generated by a feedback with carry shift register (FCSR) under the following condition: q is a power of a prime such that q=re (e⩾2) and r(=2p+1), where both r and p are 2-prime. This allows us to design FCSR stream ciphers similar to previously proposed linear feedback shift register (LFSR) stream ciphers
Keywords :
arithmetic codes; binary sequences; cryptography; FCSR stream ciphers design; LFSR stream ciphers; arithmetic codes; binary sequence; cryptographic properties; feedback with carry shift register; linear feedback shift register; linear span; lower bound; prime; Binary sequences; Communication system control; Computer science; Cryptography; Linear feedback shift registers; Random number generation; Security; Shift registers; Springs; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
