A lower bound on the linear span of an FCSR

Changho Seo, Sangjin Lee, Yeoulouk Sung, Keunhee Han, Sangchoon Kim

Research output: Contribution to journalArticlepeer-review

30 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)691-693
Number of pages3
JournalIEEE Transactions on Information Theory
Issue number2
Publication statusPublished - 2000


  • 2-adic span
  • Feedback with carry shift register (FCSR)
  • Linear feedback shift register (LFSR)
  • Linear span

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


Dive into the research topics of 'A lower bound on the linear span of an FCSR'. Together they form a unique fingerprint.

Cite this