Permutations of finite fields with prescribed properties

Çeşmelioğlu, Ayça and Meidl, Wilfried and Topuzoğlu, Alev (2014) Permutations of finite fields with prescribed properties. Journal of Computational and Applied Mathematics, 259 (Part B). pp. 536-545. ISSN 0377-0427 (Print) 1879-1778 (Online)

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1016/j.cam.2013.07.036


Classes of permutations of finite fields with various specific properties are often needed for applications. We use a recent classification of permutation polynomials using their Carlitz rank with advantage, to produce examples of classes of permutations of Fp, for odd p, which for instance are “random”, have low differential uniformity, prescribed cycle structure, high polynomial degree, large weight and large dispersion. They are also easy to implement. We indicate applications in coding and cryptography.

Item Type:Article
Uncontrolled Keywords:Permutation polynomial; Cycle decomposition; APN permutation; Differential uniformity; Dispersion; Costas permutation
Subjects:Q Science > QA Mathematics > QA150-272.5 Algebra
ID Code:23156
Deposited By:Alev Topuzoğlu
Deposited On:17 Jan 2014 15:19
Last Modified:01 Aug 2019 14:40

Repository Staff Only: item control page