? ?主讲人：?HASSAN ABDELTAWAB MOHAMED ALY
? ?主讲人工作单位：?Cairo University, Egypt
? ?时间：2019年6月26日 15:30
? ?主讲人简介：Hassan Aly received the B.S. degree and M.S. degree in Mathematics and Computer Science from Cairo University in Egypt, and the Ph.D. degree in Computer Science from the Klagenfurt University in Austria. He joined Computer Science Division at Department of Mathematics, Cairo University in Egypt as a lecture in 1997 and as a professor in 2010. His research interests include cryptography and network security. He has published many papers on sequences and functions in IEEE Transactions on Information Theory, Designs, Codes and Cryptography, Cryptography and Communications, and so on.
? ??讲座主要内容：?k-error linear complexity is one of the most important cryptography indexes of sequences. Exact values and bounds on the k-error linear complexity of p-periodic sequences which are constant on the cyclotomic classes are determined. This family of sequences includes sequences of discrete logarithms, Legendre sequences and Hall’s sextic residue sequence.