Markus Grassl, Ferruh Özbudak, Buket Özkaya, Burcu Gülmez Temür
{"title":"特性五中一类置换三项式的完整表征","authors":"Markus Grassl, Ferruh Özbudak, Buket Özkaya, Burcu Gülmez Temür","doi":"10.1007/s12095-024-00705-2","DOIUrl":null,"url":null,"abstract":"<p>In this paper, we address an open problem posed by Bai and Xia in [2]. We study polynomials of the form <span>\\(f(x)=x^{4q+1}+\\lambda _1x^{5q}+\\lambda _2x^{q+4}\\)</span> over the finite field <span>\\({\\mathbb F}_{5^{k}}\\)</span>, which are not quasi-multiplicative equivalent to any of the known permutation polynomials in the literature. We find necessary and sufficient conditions on <span>\\(\\lambda _1, \\lambda _2 \\in {\\mathbb F}_{5^{k}}\\)</span> so that <i>f</i>(<i>x</i>) is a permutation monomial, binomial, or trinomial of <span>\\({\\mathbb F}_{5^{2k}}\\)</span>.</p>","PeriodicalId":10788,"journal":{"name":"Cryptography and Communications","volume":"8 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Complete characterization of a class of permutation trinomials in characteristic five\",\"authors\":\"Markus Grassl, Ferruh Özbudak, Buket Özkaya, Burcu Gülmez Temür\",\"doi\":\"10.1007/s12095-024-00705-2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In this paper, we address an open problem posed by Bai and Xia in [2]. We study polynomials of the form <span>\\\\(f(x)=x^{4q+1}+\\\\lambda _1x^{5q}+\\\\lambda _2x^{q+4}\\\\)</span> over the finite field <span>\\\\({\\\\mathbb F}_{5^{k}}\\\\)</span>, which are not quasi-multiplicative equivalent to any of the known permutation polynomials in the literature. We find necessary and sufficient conditions on <span>\\\\(\\\\lambda _1, \\\\lambda _2 \\\\in {\\\\mathbb F}_{5^{k}}\\\\)</span> so that <i>f</i>(<i>x</i>) is a permutation monomial, binomial, or trinomial of <span>\\\\({\\\\mathbb F}_{5^{2k}}\\\\)</span>.</p>\",\"PeriodicalId\":10788,\"journal\":{\"name\":\"Cryptography and Communications\",\"volume\":\"8 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-02-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Cryptography and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s12095-024-00705-2\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cryptography and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s12095-024-00705-2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Complete characterization of a class of permutation trinomials in characteristic five
In this paper, we address an open problem posed by Bai and Xia in [2]. We study polynomials of the form \(f(x)=x^{4q+1}+\lambda _1x^{5q}+\lambda _2x^{q+4}\) over the finite field \({\mathbb F}_{5^{k}}\), which are not quasi-multiplicative equivalent to any of the known permutation polynomials in the literature. We find necessary and sufficient conditions on \(\lambda _1, \lambda _2 \in {\mathbb F}_{5^{k}}\) so that f(x) is a permutation monomial, binomial, or trinomial of \({\mathbb F}_{5^{2k}}\).