报告人：曾祥勇 教授(湖北大学)

报告题目：Constructions of Complete Permutation Polynomials

报告摘要：In this talk, we introduce several new constructions of complete permutation polynomials (CPPs) of the finite field $F_{2^n}^2$ for a positive integer n and three constructions of CPPs over $F_{p^n}^m$ for any prime p and positive integer $m\geq 2$. In addition, we investigate the upper bound on the algebraic degree of these CPPs and some of them can have nearly optimal algebraic degree.

报告人简介: 曾祥勇，国际SCI期刊《Cryptography and Communications》编委、《密码学报》编委。研究领域为密码学、代数学，发表论文八十多篇。

报告时间: 2019年5月30日（星期四）下午3:30

报告地点: 科技楼南楼702室