Analysis of the Linear Complexity and Its Stability for 2pn-Periodic Binary Sequences

Niu, Zhihua

doi:10.1093/ietfec/e88-a.9.2412

Cited by 6 publications

(3 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally the linear complexities are all more than 189. For example, when change 6 bits of original sequence at positions 11,12,15,79,125,198, and the linear complexity 190 is minimum.…”

Section: Examplementioning

confidence: 99%

See 1 more Smart Citation

The Tight Error Linear Complexity of Periodic Sequences

Zhou

Xiong

Zhao

et al. 2009

2009 International Conference on Computational Intelligence and Security

View full text Add to dashboard Cite

Based on linear complexity, k-error linear linear complexity, k-error linear complexity profile and minerror, the m-tight error linear complexity is presented to study the stability of the linear complexity of periodic sequences. The m-tight error linear complexity of sequence S is defined as a two tuple (km, LCm), which is the mth jump point of the k-error linear complexity profile of sequence S. The Wei-Xiao-Chen algorithm can not be generalized into a k-error linear linear complexity algorithm as it does not have a Stamp-Martin pattern. By using error vectors, an efficient approach for computing m-tight error linear complexity of binary sequences with period 2 n p m is given. One of our main contributions is to show that every fast algorithm for linear complexity can be generalized to a fast algorithm for m-tight error linear complexity for small m.

show abstract

“…Finally the linear complexities are all more than 189. For example, when change 6 bits of original sequence at positions 11,12,15,79,125,198, and the linear complexity 190 is minimum.…”

Section: Examplementioning

confidence: 99%

“…A fast algorithm for determining the minimal polynomial of a sequence with period 2p n over GF (q) is given in [18], where p is also an odd prime, q is an odd prime and q is a primitive root modulo p 2 . These works have drawn extensive attention [3], [13], [15], [21], [22], [23].…”

Section: Introductionmentioning

confidence: 99%

The Tight Error Linear Complexity of Periodic Sequences

Zhou

Xiong

Zhao

et al. 2009

2009 International Conference on Computational Intelligence and Security

View full text Add to dashboard Cite

show abstract

“…The linear complexity and the k-error linear complexity are such important security criteria of stream ciphers that the design of the algorithms [2]- [10] and the analysis of the theory [11]- [15] of them have been drawing wide attention.…”

Section: Introductionmentioning

confidence: 99%

Research on Excellent p^n-periodic Binary Sequence with Genetic Algorithm

Niu

Xin

et al. 2012

2012 IEEE 12th International Conference on Computer and Information Technology

View full text Add to dashboard Cite

Cryptographic sequences with high linear complexity and high k-error linear complexity are called excellent sequences. In this paper, we design a genetic algorithm to generate an excellent -periodic binary sequence. With the genetic algorithm, we do some numerical experiments to study the character of the excellent sequences. We get some interesting results when k satisfies = ( < < ), and give a conjecture that excellent sequences with = ( < < ) have a highest k-error linear complexity related to the period and k.

show abstract

Thek-error linear complexity and the linear complexity forpq n-periodic binary sequences

Fengxiang

2006

Wuhan Univ. J. Nat. Sci.

View full text Add to dashboard Cite

Analysis of the Linear Complexity and Its Stability for 2pn-Periodic Binary Sequences

Cited by 6 publications

References 0 publications

The Tight Error Linear Complexity of Periodic Sequences

The Tight Error Linear Complexity of Periodic Sequences

Research on Excellent p^n-periodic Binary Sequence with Genetic Algorithm

Thek-error linear complexity and the linear complexity forpq n-periodic binary sequences

Contact Info

Product

Resources

About