On the multiplicity of eigenvalue of SLCE sequences

发布时间：2018-05-29 作者：浏览次数：

Speaker:	杨晶副教授	DateTime:	2018年06月01日（星期五）上午8:30—9:30
Brief Introduction to Speaker: 杨晶, 清华大学数学科学系, 副教授, 主要研究数论中指数和的各类计算问题，以及数论在编码密码学中的应用问题. 为IEEE Trans. IT, FFTA, Disr.Math, DCC，中国科学等杂志的审稿人. 丘成桐中学生数学奖审稿人和复赛评委，入选北京市高校青年英才计划. 主持国家自然基金2项，参加国家自然科学基金重大项目1项. 曾获第12届北京青年优秀科技论文奖.		Place:	六号楼二楼报告厅
Abstract: Binary Sidel'nikov-Lempel-Cohn-Eastman sequences (or SLCE sequences) over F_2 have even periods and almost perfect autocorrelation. However, the evaluation of the linear complexity of these sequences is a challenging task. In this talk, based on the study of S. Alaca and G. Millar (Cryptography and Communications, pp.1-18, 2016), the multiple roots of character polynomials of SLCE sequences is expressed into certain kinds of Jacobi sums. Then by making use of Gauss sums and Jacobi sums in the "semiprimitive" case, a new divisibility result for SLCE sequences is also derived.