Minimum Linear Complexity Approximation of Sequences with Period qn-1 over Fq

Minghui YANG; Dongdai LIN; Minjia SHI

doi:10.1587/transfun.E97.A.2667

Minimum Linear Complexity Approximation of Sequences with Period qⁿ-1 over F_q

Minghui YANG, Dongdai LIN, Minjia SHI

Full Text Views

0

Share
Cite this

Summary :

The stability theory of stream ciphers plays an important role in designing good stream cipher systems. Two algorithms are presented, to determine the optimal shift and the minimum linear complexity of the sequence, that differs from a given sequence over F_q with period qⁿ-1 by one digit. We also describe how the linear complexity changes with respect to one digit differing from a given sequence.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E97-A No.12 pp.2667-2670

Publication Date: 2014/12/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E97.A.2667

Type of Manuscript: LETTER

Category: Cryptography and Information Security

Authors

Minghui YANG
  Chinese Academy of Sciences
Dongdai LIN
  Chinese Academy of Sciences
Minjia SHI
  Anhui University

Keyword

linear complexity, weight complexity, the error position, the error bit

Cite this

Copy

Minghui YANG, Dongdai LIN, Minjia SHI, "Minimum Linear Complexity Approximation of Sequences with Period qn-1 over Fq" in IEICE TRANSACTIONS on Fundamentals, vol. E97-A, no. 12, pp. 2667-2670, December 2014, doi: 10.1587/transfun.E97.A.2667.
Abstract: The stability theory of stream ciphers plays an important role in designing good stream cipher systems. Two algorithms are presented, to determine the optimal shift and the minimum linear complexity of the sequence, that differs from a given sequence over F_q with period qⁿ-1 by one digit. We also describe how the linear complexity changes with respect to one digit differing from a given sequence.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E97.A.2667/_p

Copy

@ARTICLE{e97-a_12_2667,
author={Minghui YANG, Dongdai LIN, Minjia SHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Minimum Linear Complexity Approximation of Sequences with Period qn-1 over Fq},
year={2014},
volume={E97-A},
number={12},
pages={2667-2670},
abstract={The stability theory of stream ciphers plays an important role in designing good stream cipher systems. Two algorithms are presented, to determine the optimal shift and the minimum linear complexity of the sequence, that differs from a given sequence over F_q with period qⁿ-1 by one digit. We also describe how the linear complexity changes with respect to one digit differing from a given sequence.},
keywords={},
doi={10.1587/transfun.E97.A.2667},
ISSN={1745-1337},
month={December},}

Copy

TY - JOUR
TI - Minimum Linear Complexity Approximation of Sequences with Period qn-1 over Fq
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2667
EP - 2670
AU - Minghui YANG
AU - Dongdai LIN
AU - Minjia SHI
PY - 2014
DO - 10.1587/transfun.E97.A.2667
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E97-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2014
AB - The stability theory of stream ciphers plays an important role in designing good stream cipher systems. Two algorithms are presented, to determine the optimal shift and the minimum linear complexity of the sequence, that differs from a given sequence over F_q with period qⁿ-1 by one digit. We also describe how the linear complexity changes with respect to one digit differing from a given sequence.
ER -