报告名称：Linear complexity of new q-ary generalized cyclotomic sequences of periods pn and 2pn
主办单位：英国立博官网中文版
报告专家：Vladimir Edemskiy
专家所在单位：Department of Applied Mathematics and Informatics, Novgorod
State University
报告时间：2019.12.11上午9:30-11:00
报告地点：数统学院201报告厅
专家简介：Novgorod State University应用数学与信息系的Vladimir Edemskiy教授主要研究伪随机序列，序列的设计和密码，并发表多篇SCI论文，在该学术领域有一定的影响力。Vladimir Edemskiy教授是《IEEE Transactions on Information Theory》,《Designs, Codes and Cryptography》，《Information Sciences》,《Applicable Algebra in Engineering, Communication and Computing》,《Applicable Algebra in Engineering, Communication and Computing》,《Frontiers of Computer Science》等多种学术期刊的审稿人。
报告摘要：Linear complexity is a very important merit factor for measuring unpredictability of pseudo-random sequences, which are often used as key stream sequences in stream ciphers. One of the methods for constructing sequences with high linear complexity is to use cyclotomic and generalized cyclotomic classes.
First, we generalize the construction of Xiao at el. and study the linear complexity of new q-ary generalized cyclotomic sequences of period pn over a finite field of q elements. These sequences are constructed by new generalized cyclotomic classed prepared by Zeng at el. We show that these sequences have high linear complexity when n>2.
Next, we construct new q-ary generalized cyclotomic sequences of length 2pn. We also study the linear complexity of these sequences over the finite field of order q. Thus, it can be said that we develop the result presented of Ouyang et al. about the linear complexity of generalized cyclotomic binary sequences of period 2pn.
邀请人：孙志敏
