Title
A lower bound on the linear span of an FCSR
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
Year
DOI
Venue
2000
10.1109/18.825844
IEEE Transactions on Information Theory
Keywords
Field
DocType
fcsr stream,stream cipher,shift register,linear span,following condition,binary sequence,linear feedback shift register,random number generation,cryptography,feedback with carry shift register,lower bound,security,shift registers,computer science,prime,upper bound
Prime (order theory),Discrete mathematics,Combinatorics,Linear feedback shift register,Linear span,Feedback with Carry Shift Registers,Upper and lower bounds,Pseudorandom binary sequence,Stream cipher,Mathematics
Journal
Volume
Issue
ISSN
46
2
0018-9448
Citations 
PageRank 
References 
20
1.72
4
Authors
5
Name
Order
Citations
PageRank
Changho Seo19019.36
Sangjin Lee21189120.99
Yeoulouk Sung3212.12
Keunhee Han4223.50
sangchoon54611.91