Permutation Polynomials over Finite Fields and their application to Cryptography

The aim of the paper is the study of Permutation Polynomials over finite fields and their application to cryptography. In this paper, I will begin by a brief review of finite fields, define permutation polynomials over finite fields and their properties. I will present old results such as Hermite-Dickson’s Theorem as well as some most recent ones. After introducing cryptog- raphy, I will give a historical overview, by explaining some cryptosystems such as RSA and ElGamal. Finally, I will present some cryptographical protocols based on Permutation Polynomials over Finite Fields

A new family of semifields with 2 parameters

A new family of commutative semifields with two parameters is presented. Its left and middle nucleus are both determined. Furthermore, we prove that for any different pairs of parameters, these semifields are not isotopic. It is also shown that, for some special parameters, one semifield in this family can lead to two inequivalent planar functions. Finally, using similar construction, new APN functions are given