New Classes of Permutation Quadrinomials Over Fq3

New Classes of Permutation Quadrinomials Over Fq3

Permutation polynomials have been studied for a long time and have important applications in cryptography, coding theory and combinatorial designs. In this paper, by means of the multivariate method and the resultant, we propose four new classes of permutation quadrinomials over Fq3, where q is a pr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Communications and Computer Sciences, 2024/08/01, Vol.E107.A(8), pp.1205-1211
Hauptverfasser: CHEN, Changhui, KAN, Haibin, PENG, Jie, WANG, Li
Format: Artikel
Sprache:eng
Schlagworte:
Combinatorial analysis
cryptography
finite field
permutation quadrinomial
Permutations
Polynomials
quasi-multiplicative equivalence
resultant
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Permutation polynomials have been studied for a long time and have important applications in cryptography, coding theory and combinatorial designs. In this paper, by means of the multivariate method and the resultant, we propose four new classes of permutation quadrinomials over Fq3, where q is a prime power. We also show that they are not quasi-multiplicative equivalent to known ones. Moreover, we compare their differential uniformity with that of some known classes of permutation trinomials for some small q.
ISSN:0916-8508
1745-1337
DOI:10.1587/transfun.2023EAP1113