A relationship between linear complexity and k-error linear complexity

被引：65
作者：
Kurosawa, K
Sato, F
Sakata, T
Kishimoto, W
机构：
[1] Tokyo Inst Technol, Fac Engn, Dept Elect & Elect Engn, Meguro Ku, Tokyo 152, Japan
[2] Chiba Univ, Fac Engn, Dept Informat & Image Sci, Inage Ku, Chiba 2638522, Japan
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2000年 / 46卷 / 02期
关键词：
cryptology; linear complexity; stream cipher;
D O I：
10.1109/18.825845
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The k-error linear complexity of a periodic sequence of period N is defined as the smallest linear complexity that can be obtained by changing k or fewer bits of the sequence per period. This correspondence shows a relationship between the linear complexity and the minimum value k for which the k-error linear complexity is strictly less than the linear complexity.
引用
收藏
页码：694 / 698
页数：5
相关论文
共 6 条
  • [1] DING C, 1991, LECT NOTES COMPUTER, P561
  • [2] Mac Williams F., 1977, THEORY ERROR CORRECT
  • [3] POLYNOMIAL WEIGHTS AND CODE CONSTRUCTIONS
    MASSEY, JL
    COSTELLO, DJ
    JUSTESEN, J
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1973, 19 (01) : 101 - 110
  • [4] MASSEY JL, 1969, IEEE T INFORM THEORY, V15, P122, DOI 10.1109/TIT.1969.1054260
  • [5] Rueppel R. A., 1986, ANAL DESIGN STREAM C
  • [6] AN ALGORITHM FOR THE K-ERROR LINEAR COMPLEXITY OF BINARY SEQUENCES WITH PERIOD-2(N)
    STAMP, M
    MARTIN, CF
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (04) : 1398 - 1401
1