A new method of constructing $$(k+s)$$ -variable bent functions based on a family of s-plateaued functions on k variables

IF 1.4 2区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS Designs, Codes and Cryptography Pub Date : 2024-11-13 DOI:10.1007/s10623-024-01520-9
Sihong Su, Xiaoyan Chen
{"title":"A new method of constructing $$(k+s)$$ -variable bent functions based on a family of s-plateaued functions on k variables","authors":"Sihong Su, Xiaoyan Chen","doi":"10.1007/s10623-024-01520-9","DOIUrl":null,"url":null,"abstract":"<p>It is important to study the new construction methods of bent functions. In this paper, we first propose a secondary construction method of <span>\\((k+s)\\)</span>-variable bent function <i>g</i> through a family of <i>s</i>-plateaued functions <span>\\(f_0,f_1,\\ldots ,f_{2^s-1}\\)</span> on <i>k</i> variables with disjoint Walsh supports, which can be obtained through any given <span>\\((k-s)\\)</span>-variable bent function <i>f</i> by selecting <span>\\(2^s\\)</span> disjoint affine subspaces <span>\\(S_0,S_1,\\ldots ,S_{2^s-1}\\)</span> of <span>\\({\\mathbb {F}}_2^k\\)</span> with dimension <span>\\(k-s\\)</span> to specify the Walsh support of these <i>s</i>-plateaued functions respectively, where <i>s</i> is a positive integer and <span>\\(k-s\\)</span> is a positive even integer. The dual functions of these newly constructed bent functions are determined. This secondary construction method of bent functions has a great improvement in counting. As a generalization, we find that the one initial <span>\\((k-s)\\)</span>-variable bent function <i>f</i> can be replaced by several different <span>\\((k-s)\\)</span>-variable bent functions. Compared to the first construction method, the latter one gives much more bent functions. It is worth mentioning that it can give all the 896 bent functions on 4 variables.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"9 1","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2024-11-13","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-01520-9","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

It is important to study the new construction methods of bent functions. In this paper, we first propose a secondary construction method of \((k+s)\)-variable bent function g through a family of s-plateaued functions \(f_0,f_1,\ldots ,f_{2^s-1}\) on k variables with disjoint Walsh supports, which can be obtained through any given \((k-s)\)-variable bent function f by selecting \(2^s\) disjoint affine subspaces \(S_0,S_1,\ldots ,S_{2^s-1}\) of \({\mathbb {F}}_2^k\) with dimension \(k-s\) to specify the Walsh support of these s-plateaued functions respectively, where s is a positive integer and \(k-s\) is a positive even integer. The dual functions of these newly constructed bent functions are determined. This secondary construction method of bent functions has a great improvement in counting. As a generalization, we find that the one initial \((k-s)\)-variable bent function f can be replaced by several different \((k-s)\)-variable bent functions. Compared to the first construction method, the latter one gives much more bent functions. It is worth mentioning that it can give all the 896 bent functions on 4 variables.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于 k 变量上 s 有板函数族构建 $$(k+s)$$ 变量弯曲函数的新方法
研究弯曲函数的新构造方法非常重要。在本文中,我们首先提出了一种通过 k 个变量上具有互不相交的 Walsh 支持的 s-plateaued 函数族 \(f_0,f_1,\ldots ,f_{2^s-1}\) 来二次构造 \((k+s)\)-变量弯曲函数 g 的方法、可以通过任何给定的((k-s))变量弯曲函数 f,选择 (2^s)个不相邻的仿射子空间 (S_0,S_1,\ldots 、维度为 \(k-s\) 的 \({\mathbb {F}}_2^k\) 的 S_{2^s-1} 子空间来分别指定这些 s 有板函数的沃尔什支持,其中 s 是正整数,\(k-s\) 是正偶数。这些新构建的弯曲函数的对偶函数被确定下来。这种二次构造弯曲函数的方法在计数方面有很大的改进。作为推广,我们发现一个初始的((k-s))可变弯曲函数 f 可以被多个不同的((k-s))可变弯曲函数代替。与第一种构造方法相比,后一种构造方法得到的弯曲函数要多得多。值得一提的是,它可以给出所有 896 个 4 变量弯曲函数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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.
期刊最新文献
On polynomials over finite fields that are free of binomials Polynomial reduction from syndrome decoding problem to regular decoding problem Symmetric (15, 8, 4)-designs in terms of the geometry of binary simplex codes of dimension 4 Blocking sets of secant and tangent lines with respect to a quadric of $$\text{ PG }(n,q)$$ Efficient information-theoretic distributed point functions with general output groups
×
引用
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