A lower bound on the linear span of an FCSR

Authors
Seo, C Lee, S Sung, K Han, K Kim, S
Citation
C. Seo et al., A lower bound on the linear span of an FCSR, IEEE INFO T, 46(2), 2000, pp. 691-693
Citations number
8
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
IEEE TRANSACTIONS ON INFORMATION THEORY
ISSN journal
00189448 → ACNP
Volume
46
Issue
2
Year of publication
2000
Pages
691 - 693
Database
ISI
SICI code
0018-9448(200003)46:2<691:ALBOTL>2.0.ZU;2-9
Abstract
We have derived a lower bound on the linear span of a binary sequence gener ated by a Feedback with Carry Shift Register (FCSR) under the following con dition: q is a power of a prime such that q = r(e)(e greater than or equal to 2) acid 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 S hift Register (LFSR) stream ciphers.