地点：行健楼学术活动室526
邀请人：周海燕教授
摘要：Nonlinear complexity, as an important measure of assessing the randomness/unpredictability of sequences, is defined as the length of the shortest feedback shift registers that can generate a given sequence. In this talk, we summarize some topics on sequences in view of nonlinear complexity: research on the calculation of nonlinear complexity of sequences, the construction and enumeration of sequences, the feedback functions of NFSR sequences and sequences with good pseudorandom properties. In short, we aim to develop the theoretical research of NFSRs such that one can provide new ideas and methods for the design and analysis of NFSR-based cryptography.
报告人简介：曾祥勇，湖北大学教授。主要研究领域为代数学、密码学和编码学，现为中国密码学会理事、《Cryptography and Communications》编委、《密码学报》编委，先后主持7项国家自然科学基金、1项国家重点研发计划课题、2项国家密码发展基金理论研究课题，2017年获湖北省自然科学奖二等奖、2018年获全国教育专业学位教学成果一等奖、2018年获国务院政府特殊津贴、2020年获全国密码算法设计竞赛三等奖、2022年获湖北省自然科学奖一等奖、2022年获湖北省高等学校教学成果一等奖。
