报告题目：Permutation Trinomials and Quadrinomials with Nontrivial Coefficients over Finite Fields

报告摘要：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.

报告人简介：曾祥勇，湖北大学二级教授，博士生导师。获国务院政府特殊津贴、全国密码算法设计竞赛三等奖、湖北省高等学校（本科）教学成果一等奖、湖北省高等学校（研究生）教学成果一等奖、湖北省自然科学奖一等奖。主要研究领域为代数学和密码学，先后主持国家自然科学基金项目和国家重点研发计划课题10余项。

报告时间：2026年5月22日（星期五）下午14:30

报告地点： 数学与统计学院四楼会议室

主办单位：湖北民族大学数学与统计学院

联系人：唐利明

欢迎广大师生参加！