关于举行湖北大学曾祥勇教授学术报告的通知

报告主题：Permutation trinomials and quadrinomials with nontrivial coefficients over finite fields

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

报告地点：腾讯会议，会议号167 584 376

报告时间：2022年3月27日(星期日)14：30-15：20。

邀 请人：陈博聪 教授

欢迎广大师生前往！

                                                                   数学学院

                                                     2022年3月25日

报告摘要：Permutation polynomials are important objects in the theory of finite fields, and they have been widely used in cryptography, coding theory and combinatorial design theory. In this talk, we will introduce several classes of permutation trinomials and quadrinomials with nontrivial coefficients over finite fields. Through transforming the permutation problem into studying some low-degree equations over finite fields and utilizing the knowledge of the algebraic curve, as well as some known results on the Kloosterman sum, the necessary and sufficient conditions on coefficients for these trinomials and quadrinomials being permutations are presented. In addition, we also show that one class of the presented permutation quadrinomials has Boomerang uniformity 4.

报告人简介：曾祥勇，湖北大学教授，研究领域为密码学、代数学。现为中国密码学会理事、湖北省重要领域国产密码应用专家、《Cryptography and Communications》编委、《密码学报》编委，先后主持七项国家自然科学基金、两项国家密码发展基金、一项国家重点研发计划课题，2017年获湖北省自然科学二等奖一项、2018年获全国教育专业学位教学成果一等奖一项、2018年获国务院政府特殊津贴。在《IEEE Transactions on Information Theory》、《IEEE Transactions on Communication》、《Designs, Codes and Cryptography》、《Finite Fields and Their Applications》等国学术刊物和FSE等国际会议上发表论文一百多篇。