A lower bound on the linear span of an FCSR

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

Research output: Contribution to journalArticle

30 Citations (Scopus)

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.

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

Fingerprint

Shift registers
Feedback
Binary sequences

Keywords

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

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Information Systems

Cite this

A lower bound on the linear span of an FCSR. / Seo, Changho; Lee, Sangjin; Sung, Yeoulouk; Han, Keunhee; Kim, Sangchoon.

In: IEEE Transactions on Information Theory, Vol. 46, No. 2, 2000, p. 691-693.

Research output: Contribution to journalArticle

Seo, Changho ; Lee, Sangjin ; Sung, Yeoulouk ; Han, Keunhee ; Kim, Sangchoon. / A lower bound on the linear span of an FCSR. In: IEEE Transactions on Information Theory. 2000 ; Vol. 46, No. 2. pp. 691-693.
@article{d008d6006b0c4c188237ac30558bf740,
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.",
keywords = "2-adic span, Feedback with carry shift register (FCSR), Linear feedback shift register (LFSR), Linear span",
author = "Changho Seo and Sangjin Lee and Yeoulouk Sung and Keunhee Han and Sangchoon Kim",
year = "2000",
doi = "10.1109/18.825844",
language = "English",
volume = "46",
pages = "691--693",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - A lower bound on the linear span of an FCSR

AU - Seo, Changho

AU - Lee, Sangjin

AU - Sung, Yeoulouk

AU - Han, Keunhee

AU - Kim, Sangchoon

PY - 2000

Y1 - 2000

N2 - 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.

AB - 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.

KW - 2-adic span

KW - Feedback with carry shift register (FCSR)

KW - Linear feedback shift register (LFSR)

KW - Linear span

UR - http://www.scopus.com/inward/record.url?scp=0033886695&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033886695&partnerID=8YFLogxK

U2 - 10.1109/18.825844

DO - 10.1109/18.825844

M3 - Article

AN - SCOPUS:0033886695

VL - 46

SP - 691

EP - 693

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 2

ER -