A lower bound on the linear span of an FCSR

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

doi:10.1109/18.825844

A lower bound on the linear span of an FCSR

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

School of Cybersecurity

Research output: Contribution to journal › Article › peer-review

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 = r^e(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 language	English
Pages (from-to)	691-693
Number of pages	3
Journal	IEEE Transactions on Information Theory
Volume	46
Issue number	2
DOIs	https://doi.org/10.1109/18.825844
Publication status	Published - 2000

Keywords

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

Access to Document

10.1109/18.825844

Cite this

@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

U2 - 10.1109/18.825844

DO - 10.1109/18.825844

M3 - Article

AN - SCOPUS:0033886695

SN - 0018-9448

VL - 46

SP - 691

EP - 693

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 2

ER -

A lower bound on the linear span of an FCSR

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this