Multi-sequences with almost perfect linear complexity profile and function fields over finite fields

被引：25
|
作者：
Xing, CP [1 ]
机构：
[1] Natl Univ Singapore, Dept Math, Singapore 117543, Singapore
来源：
JOURNAL OF COMPLEXITY | 2000年 / 16卷 / 04期
关键词：
multi-sequences; linear complexity profile; perfect sequences; function fields;
D O I：
10.1006/jcom.2000.0560
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Sequences with almost perfect linear complexity profile defined by Niederreiter (1997, Lecture Notes in Computer Science, Vol. 304, pp. 37-51, Springer-Verlag, Berlin/New York) are guile important for stream ciphers. In this paper, we investigate multi-sequences with almost perfect linear complexity profile and obtain a construction of such multi-sequences by using function fields over finite fields. Some interesting examples from this construction are presented to illustrate our construction. (C) 2000 Academic Press.
引用
收藏
页码：661 / 675
页数：15
相关论文
共 50 条
  • [31] On the size of a linear combination of two linear recurrence sequences over function fields
    Sebastian Heintze
    Periodica Mathematica Hungarica, 2023, 87 : 283 - 292
  • [32] An algorithm for k-error joint linear complexity of binary multi-sequences
    Sethumadhavan, M.
    Sindhu, M.
    Srinivasan, Chungath
    Kavitha, C.
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2008, 11 (03): : 297 - 304
  • [33] A note on towers of function fields over finite fields
    Ozbudak, F
    Thomas, M
    COMMUNICATIONS IN ALGEBRA, 1998, 26 (11) : 3737 - 3741
  • [34] β-Expansions in algebraic function fields over finite fields
    Scheicher, Klaus
    FINITE FIELDS AND THEIR APPLICATIONS, 2007, 13 (02) : 394 - 410
  • [35] A note on towers of function fields over finite fields
    Özbudak, F
    Thomas, M
    COMMUNICATIONS IN ALGEBRA, 2000, 28 (10) : 4729 - 4733
  • [36] ON INVARIANTS OF TOWERS OF FUNCTION FIELDS OVER FINITE FIELDS
    Hess, Florian
    Stichtenoth, Henning
    Tutdere, Seher
    JOURNAL OF ALGEBRA AND ITS APPLICATIONS, 2013, 12 (04)
  • [37] Recursive Towers of Function Fields over Finite Fields
    Stichtenoth, Henning
    ARITHMETIC OF FINITE FIELDS, PROCEEDINGS, 2010, 6087 : 1 - 6
  • [38] Complexity of polynomial multiplication over finite fields
    Kaminski, Michael
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2006, 3967 : 2 - 2
  • [39] On the complexity of matrix reduction over finite fields
    Andren, Daniel
    Hellstrom, Lars
    Markstrom, Klas
    ADVANCES IN APPLIED MATHEMATICS, 2007, 39 (04) : 428 - 452
  • [40] Complexity transitions in global algorithms for sparse linear systems over finite fields
    Braunstein, A
    Leone, M
    Ricci-Tersenghi, F
    Zecchina, R
    JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 2002, 35 (35): : 7559 - 7574
12345