利用 $$P_\tau$ 属性设计弯曲函数,可证明其在已完成的马约拉纳-麦克法兰类之外

IF 1.4 2区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Enes Pasalic, Amar Bapić, Fengrong Zhang, Yongzhuang Wei
{"title":"利用 $$P_\\tau$ 属性设计弯曲函数,可证明其在已完成的马约拉纳-麦克法兰类之外","authors":"Enes Pasalic, Amar Bapić, Fengrong Zhang, Yongzhuang Wei","doi":"10.1007/s10623-024-01407-9","DOIUrl":null,"url":null,"abstract":"<p>In this article, we identify certain instances of bent functions, constructed using the so-called <span>\\(P_\\tau \\)</span> property, that are provably outside the completed Maiorana–McFarland (<span>\\({\\mathcal{M}\\mathcal{M}}^\\#\\)</span>) class. This also partially answers an open problem in posed by Kan et al. (IEEE Trans Inf Theory, https://doi.org/10.1109/TIT.2022.3140180, 2022). We show that this design framework (using the <span>\\(P_\\tau \\)</span> property), can provide instances of bent functions that are outside the known classes of bent functions, including the classes <span>\\({\\mathcal{M}\\mathcal{M}}^\\#\\)</span>, <span>\\({{\\mathcal {C}}},{{\\mathcal {D}}}\\)</span> and <span>\\({{\\mathcal {D}}}_0\\)</span>, where the latter three were introduced by Carlet in the early nineties. We provide two generic methods for identifying such instances, where most notably one of these methods uses permutations that may admit linear structures. For the first time, a set of sufficient conditions for the functions of the form <span>\\(h(y,z)=Tr(y\\pi (z)) + G_1(Tr_1^m(\\alpha _1y),\\ldots ,Tr_1^m(\\alpha _ky))G_2(Tr_1^m(\\beta _{k+1}z),\\ldots ,Tr_1^m(\\beta _{\\tau }z))+ G_3(Tr_1^m(\\alpha _1y),\\ldots ,Tr_1^m(\\alpha _ky))\\)</span> to be bent and outside <span>\\({\\mathcal{M}\\mathcal{M}}^\\#\\)</span> is specified without a strong assumption that the components of the permutation <span>\\(\\pi \\)</span> do not admit linear structures.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"5 1","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2024-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Using $$P_\\\\tau $$ property for designing bent functions provably outside the completed Maiorana–McFarland class\",\"authors\":\"Enes Pasalic, Amar Bapić, Fengrong Zhang, Yongzhuang Wei\",\"doi\":\"10.1007/s10623-024-01407-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In this article, we identify certain instances of bent functions, constructed using the so-called <span>\\\\(P_\\\\tau \\\\)</span> property, that are provably outside the completed Maiorana–McFarland (<span>\\\\({\\\\mathcal{M}\\\\mathcal{M}}^\\\\#\\\\)</span>) class. This also partially answers an open problem in posed by Kan et al. (IEEE Trans Inf Theory, https://doi.org/10.1109/TIT.2022.3140180, 2022). We show that this design framework (using the <span>\\\\(P_\\\\tau \\\\)</span> property), can provide instances of bent functions that are outside the known classes of bent functions, including the classes <span>\\\\({\\\\mathcal{M}\\\\mathcal{M}}^\\\\#\\\\)</span>, <span>\\\\({{\\\\mathcal {C}}},{{\\\\mathcal {D}}}\\\\)</span> and <span>\\\\({{\\\\mathcal {D}}}_0\\\\)</span>, where the latter three were introduced by Carlet in the early nineties. We provide two generic methods for identifying such instances, where most notably one of these methods uses permutations that may admit linear structures. For the first time, a set of sufficient conditions for the functions of the form <span>\\\\(h(y,z)=Tr(y\\\\pi (z)) + G_1(Tr_1^m(\\\\alpha _1y),\\\\ldots ,Tr_1^m(\\\\alpha _ky))G_2(Tr_1^m(\\\\beta _{k+1}z),\\\\ldots ,Tr_1^m(\\\\beta _{\\\\tau }z))+ G_3(Tr_1^m(\\\\alpha _1y),\\\\ldots ,Tr_1^m(\\\\alpha _ky))\\\\)</span> to be bent and outside <span>\\\\({\\\\mathcal{M}\\\\mathcal{M}}^\\\\#\\\\)</span> is specified without a strong assumption that the components of the permutation <span>\\\\(\\\\pi \\\\)</span> do not admit linear structures.</p>\",\"PeriodicalId\":11130,\"journal\":{\"name\":\"Designs, Codes and Cryptography\",\"volume\":\"5 1\",\"pages\":\"\"},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2024-04-22\",\"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-01407-9\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Designs, Codes and Cryptography","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10623-024-01407-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

摘要

在本文中,我们利用所谓的 \(P_\tau \) 属性构造出了弯曲函数的某些实例,这些实例可以证明是在完整的 Maiorana-McFarland (\({\mathcal{M}\mathcal{M}}^\#\)类之外。这也部分回答了 Kan 等人提出的一个开放问题(IEEE Trans Inf Theory, https://doi.org/10.1109/TIT.2022.3140180, 2022)。我们证明,这种设计框架(使用 \(P_\tau \) 属性)可以提供已知弯曲函数类之外的弯曲函数实例、包括\({\mathcal{M}\mathcal{M}}^\#)、\({{mathcal {C}}},{{\mathcal {D}}}\)和\({{mathcal {D}}}_0\) 类,其中后三个类是卡雷特在九十年代初引入的。我们提供了两种识别这类实例的通用方法,其中最值得注意的是,其中一种方法使用的是可能包含线性结构的排列组合。我们首次提出了一系列充分条件,用于计算形式为+ G_1(Tr_1^m(\alpha _1y),\ldots ,Tr_1^m(\alpha _ky))G_2(Tr_1^m(\beta _{k+1}z),\ldots ,Tr_1^m(\beta _{\tau }z))+ G_3(Tr_1^m(\alpha _1y),\ldots 、({\mathcal{M}\mathcal{M}}^\#\)的外部是弯曲的,而没有一个强有力的假设,即 permutation \(\pi \)的成分不承认线性结构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Using $$P_\tau $$ property for designing bent functions provably outside the completed Maiorana–McFarland class

In this article, we identify certain instances of bent functions, constructed using the so-called \(P_\tau \) property, that are provably outside the completed Maiorana–McFarland (\({\mathcal{M}\mathcal{M}}^\#\)) class. This also partially answers an open problem in posed by Kan et al. (IEEE Trans Inf Theory, https://doi.org/10.1109/TIT.2022.3140180, 2022). We show that this design framework (using the \(P_\tau \) property), can provide instances of bent functions that are outside the known classes of bent functions, including the classes \({\mathcal{M}\mathcal{M}}^\#\), \({{\mathcal {C}}},{{\mathcal {D}}}\) and \({{\mathcal {D}}}_0\), where the latter three were introduced by Carlet in the early nineties. We provide two generic methods for identifying such instances, where most notably one of these methods uses permutations that may admit linear structures. For the first time, a set of sufficient conditions for the functions of the form \(h(y,z)=Tr(y\pi (z)) + G_1(Tr_1^m(\alpha _1y),\ldots ,Tr_1^m(\alpha _ky))G_2(Tr_1^m(\beta _{k+1}z),\ldots ,Tr_1^m(\beta _{\tau }z))+ G_3(Tr_1^m(\alpha _1y),\ldots ,Tr_1^m(\alpha _ky))\) to be bent and outside \({\mathcal{M}\mathcal{M}}^\#\) is specified without a strong assumption that the components of the permutation \(\pi \) do not admit linear structures.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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.
×
引用
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学术官方微信