linear complexity of binary sequences derived from polynomial quotients

ISCAS OpenIR

	linear complexity of binary sequences derived from polynomial quotients
	Chen Zhixiong; G&#; mez-P&#; rez Domingo
	2012
会议名称	7th International Conference on Sequences and Their Applications, SETA 2012
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	181-189
会议日期	June 4, 2012 - June 8, 2012
会议地点	Waterloo, ON, Canada
收录类别	EI
ISSN	0302-9743
ISBN	9783642306143
部门归属	(1) Department of Mathematics Putian University Putian Fujian 351100 China; (2) State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences Beijing 100049 China; (3) University of Cantabria Avd. Los Castros s/n Santander Spain
摘要	We determine the linear complexity of p ²-periodic binary threshold sequences derived from polynomial quotient, which is defined by the function . When w = (p - 1)/2 and , we show that the linear complexity is equal to one of the following values , depending whether . But it seems that the method can't be applied to the case of general w. © 2012 Springer-Verlag.; We determine the linear complexity of p ²-periodic binary threshold sequences derived from polynomial quotient, which is defined by the function . When w = (p - 1)/2 and , we show that the linear complexity is equal to one of the following values , depending whether . But it seems that the method can't be applied to the case of general w. © 2012 Springer-Verlag.
关键词	Cryptography Polynomials
主办者	Univ. Waterloo, Dep. Electr. Comput. Eng.; The Fields Institute for Research in Mathematical Sciences; The Mprime Network Inc.; The Ontario Research Fund Research Excellence
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/15766
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Chen Zhixiong,G&#,mez-P&#,et al. linear complexity of binary sequences derived from polynomial quotients[C],2012:181-189.