The linear complexity and k-error linearcomplexity of cyclotomic and generalizedcyclotomic sequences

发布时间：2018-09-04 作者：浏览次数：

Speaker:	Vladimir Edmskiy 教授	DateTime:	2018年9月6日（星期四）下午4:00—5:00
Brief Introduction to Speaker: Vladimir Edmskiy 教授，诺夫哥罗德国立大学（俄罗斯）。		Place:	六号楼二楼报告厅
Abstract:Cyclotomic sequences are widely used in many areas of cryptography and communication. We will discuss main notations and the some results about the linear complexity and the k-error linear complexity of cyclotomic and generalized cyclotomic sequences. We consider two approaches in studying the linear complexity of cyclotomic sequences. Our main focus will be on computational method for studying Discrete Fourier transform (the Gauss periods) of the cyclotomic sequences with using the cyclotomic numbers.