Towards a classification of permutation binomials of the form $$x^i+ax$$ over $${\mathbb {F}}_{2^n}$$

IF 1.4 2区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS Designs, Codes and Cryptography Pub Date : 2024-08-09 DOI:10.1007/s10623-024-01462-2
Yi Li, Xiutao Feng, Qiang Wang
{"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\).

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
对 $${mathbb {F}}_{2^n}$ 上 $$x^i+ax$ 形式的置换二项式进行分类
少项的置换多项式(尤其是置换二项式)因其简单的代数结构吸引着许多人。尽管人们对置换二项式的研究兴趣浓厚,但置换二项式的完整表征仍然是未知的。让 \(q=2^n\) 为一个正整数 n。在本文中,我们开始从指数的角度对 \({\mathbb {F}}_{q}\) 上的 \(x^i+ax\) 形式的置换二项式进行分类。在对\({\mathbb {F}}_{2^n}\) 上的这些置换二项式进行了 n 至 12 的穷举搜索之后,我们给出了三个新的无穷置换二项式类、对于任意正整数 n 的 \(q=2^n\) ,我们分别给出了 \({\mathbb {F}_{q^2}\), \({\mathbb {F}_{q^3}\) 和 \({\mathbb {F}_{q^4}\) 上的三个新的无穷类置换二项式。特别是,这些在 \({\mathbb {F}}_{q^3}\) 上的二项式具有相对较大的索引 \(\frac{q^2+q+1}{3})。作为应用,我们可以完全解释 \(n\le 8\) 的 \({\mathbb {F}}_{2^n}\) 上所有形式为 \(x^i+ax\) 的置换二项式。此外,我们证明不存在形式为\(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\) 的置换二项式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Designs, Codes and Cryptography
Designs, Codes and Cryptography 工程技术-计算机:理论方法
CiteScore
2.80
自引率
12.50%
发文量
157
审稿时长
16.5 months
期刊介绍: 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.
期刊最新文献
Quantum rectangle attack and its application on Deoxys-BC Almost tight security in lattices with polynomial moduli—PRF, IBE, all-but-many LTF, and more Breaking the power-of-two barrier: noise estimation for BGV in NTT-friendly rings A new method of constructing $$(k+s)$$ -variable bent functions based on a family of s-plateaued functions on k variables Further investigation on differential properties of the generalized Ness–Helleseth function
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1