IEICE TRANSACTIONS on Fundamentals
Computing the k-Error Linear Complexity of q-Ary Sequences with Period 2pn
Summary :
The linear complexity and its stability of periodic sequences are of fundamental importance as measure indexes on the security of stream ciphers and the k-error linear complexity reveals the stability of the linear complexity properly. Recently, Zhou designed an algorithm for computing the k-error linear complexity of 2pn periodic sequences over GF(q). In this paper, we develop a genetic algorithm to confirm that one can't get the real k-error linear complexity for some sequenes by the Zhou's algorithm. Analysis indicates that the Zhou's algorithm is unreasonable in some steps. The corrected algorithm is presented. Such algorithm will increase the amount of computation, but is necessary to get the real k-error linear complexity. Here p and q are odd prime, and q is a primitive root (mod p2).
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E95-A No.9 pp.1637-1641
- Publication Date
- 2012/09/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E95.A.1637
- Type of Manuscript
- LETTER
- Category
- Cryptography and Information Security
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Zhihua NIU, Zhe LI, Zhixiong CHEN, Tongjiang YAN, "Computing the k-Error Linear Complexity of q-Ary Sequences with Period 2pn" in IEICE TRANSACTIONS on Fundamentals,
vol. E95-A, no. 9, pp. 1637-1641, September 2012, doi: 10.1587/transfun.E95.A.1637.
Abstract: The linear complexity and its stability of periodic sequences are of fundamental importance as measure indexes on the security of stream ciphers and the k-error linear complexity reveals the stability of the linear complexity properly. Recently, Zhou designed an algorithm for computing the k-error linear complexity of 2pn periodic sequences over GF(q). In this paper, we develop a genetic algorithm to confirm that one can't get the real k-error linear complexity for some sequenes by the Zhou's algorithm. Analysis indicates that the Zhou's algorithm is unreasonable in some steps. The corrected algorithm is presented. Such algorithm will increase the amount of computation, but is necessary to get the real k-error linear complexity. Here p and q are odd prime, and q is a primitive root (mod p2).
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E95.A.1637/_p
Copy
@ARTICLE{e95-a_9_1637,
author={Zhihua NIU, Zhe LI, Zhixiong CHEN, Tongjiang YAN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Computing the k-Error Linear Complexity of q-Ary Sequences with Period 2pn},
year={2012},
volume={E95-A},
number={9},
pages={1637-1641},
abstract={The linear complexity and its stability of periodic sequences are of fundamental importance as measure indexes on the security of stream ciphers and the k-error linear complexity reveals the stability of the linear complexity properly. Recently, Zhou designed an algorithm for computing the k-error linear complexity of 2pn periodic sequences over GF(q). In this paper, we develop a genetic algorithm to confirm that one can't get the real k-error linear complexity for some sequenes by the Zhou's algorithm. Analysis indicates that the Zhou's algorithm is unreasonable in some steps. The corrected algorithm is presented. Such algorithm will increase the amount of computation, but is necessary to get the real k-error linear complexity. Here p and q are odd prime, and q is a primitive root (mod p2).},
keywords={},
doi={10.1587/transfun.E95.A.1637},
ISSN={1745-1337},
month={September},}
Copy
TY - JOUR
TI - Computing the k-Error Linear Complexity of q-Ary Sequences with Period 2pn
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1637
EP - 1641
AU - Zhihua NIU
AU - Zhe LI
AU - Zhixiong CHEN
AU - Tongjiang YAN
PY - 2012
DO - 10.1587/transfun.E95.A.1637
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E95-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2012
AB - The linear complexity and its stability of periodic sequences are of fundamental importance as measure indexes on the security of stream ciphers and the k-error linear complexity reveals the stability of the linear complexity properly. Recently, Zhou designed an algorithm for computing the k-error linear complexity of 2pn periodic sequences over GF(q). In this paper, we develop a genetic algorithm to confirm that one can't get the real k-error linear complexity for some sequenes by the Zhou's algorithm. Analysis indicates that the Zhou's algorithm is unreasonable in some steps. The corrected algorithm is presented. Such algorithm will increase the amount of computation, but is necessary to get the real k-error linear complexity. Here p and q are odd prime, and q is a primitive root (mod p2).
ER -
English
