Constructions of several special classes of cubic bent functions outside the completed Maiorana-McFarland class

IF 0.8 4区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Fengrong Zhang , Enes Pasalic , Amar Bapić , Baocang Wang
{"title":"Constructions of several special classes of cubic bent functions outside the completed Maiorana-McFarland class","authors":"Fengrong Zhang ,&nbsp;Enes Pasalic ,&nbsp;Amar Bapić ,&nbsp;Baocang Wang","doi":"10.1016/j.ic.2024.105149","DOIUrl":null,"url":null,"abstract":"<div><p>We show that the direct sum, under more relaxed conditions compared to those of Polujan and Pott (2020), can generate bent functions provably outside the completed Maiorana-McFarland class (<span><math><msup><mrow><mi>MM</mi></mrow><mrow><mi>#</mi></mrow></msup></math></span>). We also show that the indirect sum method of generating bent functions, by imposing certain conditions (which are completely absent if only the bentness of the resulting function is required) on the initial bent functions, can be employed in the design of bent functions outside <span><math><msup><mrow><mi>MM</mi></mrow><mrow><mi>#</mi></mrow></msup></math></span>. Furthermore, applying this method to suitably chosen bent functions we construct several generic classes of homogeneous cubic bent functions (considered as a difficult problem) that might possess additional properties (namely without affine derivatives and/or outside <span><math><msup><mrow><mi>MM</mi></mrow><mrow><mi>#</mi></mrow></msup></math></span>). Our results significantly improve upon the best known instances of this type of bent functions given by Polujan and Pott (2020), and additionally we provide a solution to an open problem presented in their paper.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"297 ","pages":"Article 105149"},"PeriodicalIF":0.8000,"publicationDate":"2024-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information and Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0890540124000142","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

We show that the direct sum, under more relaxed conditions compared to those of Polujan and Pott (2020), can generate bent functions provably outside the completed Maiorana-McFarland class (MM#). We also show that the indirect sum method of generating bent functions, by imposing certain conditions (which are completely absent if only the bentness of the resulting function is required) on the initial bent functions, can be employed in the design of bent functions outside MM#. Furthermore, applying this method to suitably chosen bent functions we construct several generic classes of homogeneous cubic bent functions (considered as a difficult problem) that might possess additional properties (namely without affine derivatives and/or outside MM#). Our results significantly improve upon the best known instances of this type of bent functions given by Polujan and Pott (2020), and additionally we provide a solution to an open problem presented in their paper.

在完整的 Maiorana-McFarland 类之外构建几类特殊的立方弯曲函数
弯曲函数的两种主要二次构造是直接求和法和间接求和法。我们证明,与波鲁扬和波特(2020)的方法相比,直接求和法在更宽松的条件下,可以在完整的马约拉纳-麦克法兰类(MM#)之外生成弯曲函数。我们还证明,通过对初始弯曲函数施加某些条件(如果只要求所生成函数的弯曲性,则完全不需要这些条件),生成弯曲函数的间接和方法可用于设计 MM# 以外的弯曲函数。此外,将此方法应用于适当选择的弯曲函数,我们构建了几类可能具有额外性质(即无仿射导数和/或在 MM# 以外)的同相立方弯曲函数(被视为难题)。我们的结果大大改进了 Polujan 和 Pott(2020 年)给出的这类弯曲函数的已知最佳实例,此外,我们还为他们论文中提出的一个未决问题提供了解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Information and Computation
Information and Computation 工程技术-计算机:理论方法
CiteScore
2.30
自引率
0.00%
发文量
119
审稿时长
140 days
期刊介绍: Information and Computation welcomes original papers in all areas of theoretical computer science and computational applications of information theory. Survey articles of exceptional quality will also be considered. Particularly welcome are papers contributing new results in active theoretical areas such as -Biological computation and computational biology- Computational complexity- Computer theorem-proving- Concurrency and distributed process theory- Cryptographic theory- Data base theory- Decision problems in logic- Design and analysis of algorithms- Discrete optimization and mathematical programming- Inductive inference and learning theory- Logic & constraint programming- Program verification & model checking- Probabilistic & Quantum computation- Semantics of programming languages- Symbolic computation, lambda calculus, and rewriting systems- Types and typechecking
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信