{"title":"Towards a classification of permutation binomials of the form $$x^i+ax$$ over $${\\mathbb {F}}_{2^n}$$","authors":"Yi Li, Xiutao Feng, Qiang Wang","doi":"10.1007/s10623-024-01462-2","DOIUrl":null,"url":null,"abstract":"<p>Permutation polynomials with few terms (especially permutation binomials) attract many people due to their simple algebraic structure. Despite the great interests in the study of permutation binomials, a complete characterization of permutation binomials is still unknown. Let <span>\\(q=2^n\\)</span> for a positive integer <i>n</i>. In this paper, we start classifying permutation binomials of the form <span>\\(x^i+ax\\)</span> over <span>\\({\\mathbb {F}}_{q}\\)</span> in terms of their indices. After carrying out an exhaustive search of these permutation binomials over <span>\\({\\mathbb {F}}_{2^n}\\)</span> for <i>n</i> up to 12, we gave three new infinite classes of permutation binomials over <span>\\({\\mathbb {F}}_{q^2}\\)</span>, <span>\\({\\mathbb {F}}_{q^3}\\)</span>, and <span>\\({\\mathbb {F}}_{q^4}\\)</span> respectively, for <span>\\(q=2^n\\)</span> with arbitrary positive integer <i>n</i>. In particular, these binomials over <span>\\({\\mathbb {F}}_{q^3}\\)</span> have relatively large index <span>\\(\\frac{q^2+q+1}{3}\\)</span>. As an application, we can completely explain all the permutation binomials of the form <span>\\(x^i+ax\\)</span> over <span>\\({\\mathbb {F}}_{2^n}\\)</span> for <span>\\(n\\le 8\\)</span>. Moreover, we prove that there does not exist permutation binomials of the form <span>\\(x^{2q^3+2q^2+2q+3}+ax\\)</span> over <span>\\({\\mathbb {F}}_{q^4}\\)</span> such that <span>\\(a\\in {\\mathbb {F}}_{q^4}^*\\)</span> and <span>\\(n=2\\,m\\)</span> with <span>\\(m\\ge 2\\)</span>.\n</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"72 1","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2024-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Designs, Codes and Cryptography","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10623-024-01462-2","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
Permutation polynomials with few terms (especially permutation binomials) attract many people due to their simple algebraic structure. Despite the great interests in the study of permutation binomials, a complete characterization of permutation binomials is still unknown. Let \(q=2^n\) for a positive integer n. In this paper, we start classifying permutation binomials of the form \(x^i+ax\) over \({\mathbb {F}}_{q}\) in terms of their indices. After carrying out an exhaustive search of these permutation binomials over \({\mathbb {F}}_{2^n}\) for n up to 12, we gave three new infinite classes of permutation binomials over \({\mathbb {F}}_{q^2}\), \({\mathbb {F}}_{q^3}\), and \({\mathbb {F}}_{q^4}\) respectively, for \(q=2^n\) with arbitrary positive integer n. In particular, these binomials over \({\mathbb {F}}_{q^3}\) have relatively large index \(\frac{q^2+q+1}{3}\). As an application, we can completely explain all the permutation binomials of the form \(x^i+ax\) over \({\mathbb {F}}_{2^n}\) for \(n\le 8\). Moreover, we prove that there does not exist permutation binomials of the form \(x^{2q^3+2q^2+2q+3}+ax\) over \({\mathbb {F}}_{q^4}\) such that \(a\in {\mathbb {F}}_{q^4}^*\) and \(n=2\,m\) with \(m\ge 2\).
期刊介绍:
Designs, Codes and Cryptography is an archival peer-reviewed technical journal publishing original research papers in the designated areas. There is a great deal of activity in design theory, coding theory and cryptography, including a substantial amount of research which brings together more than one of the subjects. While many journals exist for each of the individual areas, few encourage the interaction of the disciplines.
The journal was founded to meet the needs of mathematicians, engineers and computer scientists working in these areas, whose interests extend beyond the bounds of any one of the individual disciplines. The journal provides a forum for high quality research in its three areas, with papers touching more than one of the areas especially welcome.
The journal also considers high quality submissions in the closely related areas of finite fields and finite geometries, which provide important tools for both the construction and the actual application of designs, codes and cryptographic systems. In particular, it includes (mostly theoretical) papers on computational aspects of finite fields. It also considers topics in sequence design, which frequently admit equivalent formulations in the journal’s main areas.
Designs, Codes and Cryptography is mathematically oriented, emphasizing the algebraic and geometric aspects of the areas it covers. The journal considers high quality papers of both a theoretical and a practical nature, provided they contain a substantial amount of mathematics.