讲座题目👩🏿✈️：Permutation trinomials and quadrinomials with nontrivial coefficients over finite fields 主讲人：曾祥勇 教授 主持人🦴：李成举 副教授 开始时间🕺🤹🏻：2020-11-17 15:30:00 讲座地址：腾讯会议 ID：587 913 686 主办单位🪲：软件工程学院
报告人简介： 曾祥勇👩🏻🦯🤵，湖北大学教授，博士生导师，应用数学湖北省重点实验室主任，中国密码学会理事、湖北省重要领域国产密码应用专家，Cryptography and Communications 编委、《密码学报》编委。研究领域为密码学、代数学，发表论文八十多篇，主持国家自然科学基金项目六项，获湖北省自然科学二等奖一项（排名第一），享受国务院政府特殊津贴🔵🤸🏻♂️。
报告内容🏄🏼♂️： 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. |
