AN ALGORITHM FOR THE K-ERROR LINEAR COMPLEXITY OF BINARY SEQUENCES WITH PERIOD-2(N)

被引：124

作者：

STAMP, M ^{[1
]}

MARTIN, CF ^{[1
]}

机构：

[1] TEXAS TECH UNIV,DEPT MATH,LUBBOCK,TX 79409

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1993年 / 39卷 / 04期

基金：

美国国家科学基金会; 美国国家航空航天局;

关键词：

LINEAR COMPLEXITY; K-ERROR LINEAR COMPLEXITY; ALGORITHM;

D O I：

10.1109/18.243455

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Certain applications require pseudo-random sequences which are unpredictable in the sense that recovering more of the sequence from a short segment must be computationally infeasible. It is shown that linear complexity is useful in determining such sequences. A generalized linear complexity which has application to the security of stream ciphers is proposed and an efficient algorithm is given for the case where the sequence is binary with period 2n. This new algorithm generalizes an algorithm due to Games and Chan.

引用

页码：1398 / 1401

页数：4

共 50 条

[1] A typical profile of the k-error linear complexity for balanced binary sequences with period 2n
Kaida, T
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2005, E88A (01) : 311 - 313
[2] On the computation of the linear complexity and the k-error linear complexity of binary sequences with period a power of two
Salagean, A
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (03) : 1145 - 1150
[3] On the computation of the linear complexity and the k-error linear complexity of binary sequences with period a power of two
Salagean, A
SEQUENCES AND THEIR APPLICATIONS - SETA 2004, 2005, 3486 : 179 - 184
[4] The k-Error Linear Complexity and the Linear Complexity for pq~n-Periodic Binary Sequences
ZHU Fengxiang
WuhanUniversityJournalofNaturalSciences, 2006, (06) : 1549 - 1553
[5] 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
[6] An Efficient Algorithm for Determining the k-error Linear Complexity of Binary Sequences with Periods 2p(n)
Wei, Shimin
INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2008, 8 (04): : 221 - 224
[7] Linear complexity and k-error linear complexity for 2mpn-periodic binary sequences
Tan, Lin
Qi, Wen-Feng
Tongxin Xuebao/Journal on Communications, 2008, 29 (07): : 44 - 49
[8] The k-error linear complexity distribution for -periodic binary sequences
Zhou, Jianqin
Liu, Wanquan
DESIGNS CODES AND CRYPTOGRAPHY, 2014, 73 (01) : 55 - 75
[9] Counting Functions for the k-Error Linear Complexity of 2n-Periodic Binary Sequences
Kavuluru, Ramakanth
Klapper, Andrew
SELECTED AREAS IN CRYPTOGRAPHY, 2009, 5381 : 151 - 164
[10] The Distribution of 2n-Periodic Binary Sequences with Fixed k-Error Linear Complexity
Pan, Wenlun
Bao, Zhenzhen
Lin, Dongdai
Liu, Feng
INFORMATION SECURITY PRACTICE AND EXPERIENCE, ISPEC 2016, 2016, 10060 : 13 - 36

← 1 2 3 4 5 →