On vectorial functions with maximal number of bent components

IF 1.4 2区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS Designs, Codes and Cryptography Pub Date : 2025-01-31 DOI:10.1007/s10623-025-01569-0
Xianhong Xie, Yi Ouyang, Honggang Hu
{"title":"On vectorial functions with maximal number of bent components","authors":"Xianhong Xie, Yi Ouyang, Honggang Hu","doi":"10.1007/s10623-025-01569-0","DOIUrl":null,"url":null,"abstract":"<p>We study vectorial functions with maximal number of bent components in this paper. We first study the Walsh transform and nonlinearity of <span>\\(F(x)=x^{2^e}h(\\textrm{Tr}_{2^{2m}/2^m}(x))\\)</span>, where <span>\\(e\\ge 0\\)</span> and <i>h</i>(<i>x</i>) is a permutation over <span>\\({\\mathbb {F}}_{2^m}\\)</span>. If <i>h</i>(<i>x</i>) is monomial, the nonlinearity of <i>F</i>(<i>x</i>) is shown to be at most <span>\\( 2^{2\\,m-1}-2^{\\lfloor \\frac{3\\,m}{2}\\rfloor }\\)</span> and some non-plateaued and plateaued functions attaining the upper bound are found. If <i>h</i>(<i>x</i>) is linear, the exact nonlinearity of <i>F</i>(<i>x</i>) is determined. Secondly, we give a construction of vectorial functions with maximal number of bent components from known ones, thus obtain two new classes from the Niho class and the Maiorana-McFarland class. Our construction gives a quadratic vectorial function that is not equivalent to the known functions of the form <i>xh</i>(<i>x</i>), and also contains vectorial functions outside the completed Maiorana-McFarland class. Finally, we show that the vectorial function <span>\\(F: {\\mathbb {F}}_{2^{2m}}\\rightarrow {\\mathbb {F}}_{2^{2m}}\\)</span>, <span>\\(x\\mapsto x^{2^m+1}+x^{2^i+1}\\)</span> has maximal number of bent components if and only if <span>\\(i=0\\)</span>.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"63 1","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2025-01-31","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-025-01569-0","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

We study vectorial functions with maximal number of bent components in this paper. We first study the Walsh transform and nonlinearity of \(F(x)=x^{2^e}h(\textrm{Tr}_{2^{2m}/2^m}(x))\), where \(e\ge 0\) and h(x) is a permutation over \({\mathbb {F}}_{2^m}\). If h(x) is monomial, the nonlinearity of F(x) is shown to be at most \( 2^{2\,m-1}-2^{\lfloor \frac{3\,m}{2}\rfloor }\) and some non-plateaued and plateaued functions attaining the upper bound are found. If h(x) is linear, the exact nonlinearity of F(x) is determined. Secondly, we give a construction of vectorial functions with maximal number of bent components from known ones, thus obtain two new classes from the Niho class and the Maiorana-McFarland class. Our construction gives a quadratic vectorial function that is not equivalent to the known functions of the form xh(x), and also contains vectorial functions outside the completed Maiorana-McFarland class. Finally, we show that the vectorial function \(F: {\mathbb {F}}_{2^{2m}}\rightarrow {\mathbb {F}}_{2^{2m}}\), \(x\mapsto x^{2^m+1}+x^{2^i+1}\) has maximal number of bent components if and only if \(i=0\).

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约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.
期刊最新文献
Construction of optimal flag codes by MRD codes The asymptotic existence of BIBDs having a nesting New models for the cryptanalysis of ASCON Can we beat three halves lower bound? (Im)possibility of reducing communication cost for garbled circuits New results on non-disjoint and classical strong external difference families
×
引用
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