Permutations of finite fields with prescribed properties

• Autores: Ayça Çesmelioglu, Wilfried Meidl, Alev Topuzoglu
• Localización: Journal of computational and applied mathematics, ISSN 0377-0427, Vol. 259, Nº 2, 2014, págs. 536-545
• Idioma: inglés
• DOI: 10.1016/j.cam.2013.07.036
• Texto completo no disponible (Saber más ...)
• Resumen

  • 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.