A wide family of nonlinear filter functions with a large linear span

被引:21
作者
Caballero-Gil, P [1 ]
Fúster-Sabater, A
机构
[1] Univ La Laguna, DEIOC, San Cristobal la Laguna 38271, Tenerife, Spain
[2] CSIC, DTIC, Inst Appl Phys, E-28006 Madrid, Spain
关键词
filter function; linear span; cryptography;
D O I
10.1016/j.ins.2003.06.002
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A broad collection of pseudorandom sequence generators is introduced. These generators are based on nonlinear functions applied to maximal-length LFSRs and are not constrained in the length L of the LFSRs or the nonlinear order k of the functions. The linear span of the resulting sequences is proved to be as large as the linear span of the sequences obtained from a product of equidistant phases, that is to say, at least ((L)(k)). A count of the number of functions is evaluated and compared with the corresponding count of products of equidistant phases. (C) 2003 Elsevier Inc. All rights reserved.
引用
收藏
页码:197 / 207
页数:11
相关论文
共 13 条
[1]  
[Anonymous], 1966, WEIGHT DISTRIBUTION
[2]  
CABALLEROGIL P, 1999, LECT NOTES COMPUTER, P161
[3]  
FusterSabater A, 1995, LECT NOTES COMPUT SC, V917, P80, DOI 10.1007/BFb0000426
[5]   ANALYSIS OF STRUCTURE AND COMPLEXITY OF NONLINEAR BINARY SEQUENCE GENERATORS [J].
KEY, EL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (06) :732-736
[6]   BOUNDS ON THE LINEAR SPAN OF BENT SEQUENCES [J].
KUMAR, PV ;
SCHOLTZ, RA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (06) :854-862
[7]   MAXIMAL FAMILIES OF BENT SEQUENCES [J].
LEMPEL, A ;
COHN, M .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1982, 28 (06) :865-868
[8]  
Lidl R., 1986, INTRO FINITE FIELDS
[9]  
MASSEY JL, 1969, IEEE T INFORM THEORY, V15, P122, DOI 10.1109/TIT.1969.1054260
[10]  
MASSEY JL, 1994, LECT NOTES COMPUTER, V839, P332