Nurdagül Anbar, Sadmir Kudin, Wilfried Meidl, Enes Pasalic, Alexandr Polujan
{"title":"矢量否定概念:相似性、差异性和概括性","authors":"Nurdagül Anbar, Sadmir Kudin, Wilfried Meidl, Enes Pasalic, Alexandr Polujan","doi":"arxiv-2402.05677","DOIUrl":null,"url":null,"abstract":"In Pasalic et al., IEEE Trans. Inform. Theory 69 (2023), 2702--2712, and in\nAnbar, Meidl, Cryptogr. Commun. 10 (2018), 235--249, two different vectorial\nnegabent and vectorial bent-negabent concepts are introduced, which leads to\nseemingly contradictory results. One of the main motivations for this article\nis to clarify the differences and similarities between these two concepts.\nMoreover, the negabent concept is extended to generalized Boolean functions\nfrom \\(\\mathbb{F}_2^n\\) to the cyclic group \\(\\mathbb{Z}_{2^k}\\). It is shown\nhow to obtain nega-\\(\\mathbb{Z}_{2^k}\\)-bent functions from\n\\(\\mathbb{Z}_{2^k}\\)-bent functions, or equivalently, corresponding\nnon-splitting relative difference sets from the splitting relative difference\nsets. This generalizes the shifting results for Boolean bent and negabent\nfunctions. We finally point to constructions of \\(\\mathbb{Z}_8\\)-bent functions\nemploying permutations with the \\((\\mathcal{A}_m)\\) property, and more\ngenerally we show that the inverse permutation gives rise to\n\\(\\mathbb{Z}_{2^k}\\)-bent functions.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"127 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Vectorial Negabent Concepts: Similarities, Differences, and Generalizations\",\"authors\":\"Nurdagül Anbar, Sadmir Kudin, Wilfried Meidl, Enes Pasalic, Alexandr Polujan\",\"doi\":\"arxiv-2402.05677\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In Pasalic et al., IEEE Trans. Inform. Theory 69 (2023), 2702--2712, and in\\nAnbar, Meidl, Cryptogr. Commun. 10 (2018), 235--249, two different vectorial\\nnegabent and vectorial bent-negabent concepts are introduced, which leads to\\nseemingly contradictory results. One of the main motivations for this article\\nis to clarify the differences and similarities between these two concepts.\\nMoreover, the negabent concept is extended to generalized Boolean functions\\nfrom \\\\(\\\\mathbb{F}_2^n\\\\) to the cyclic group \\\\(\\\\mathbb{Z}_{2^k}\\\\). It is shown\\nhow to obtain nega-\\\\(\\\\mathbb{Z}_{2^k}\\\\)-bent functions from\\n\\\\(\\\\mathbb{Z}_{2^k}\\\\)-bent functions, or equivalently, corresponding\\nnon-splitting relative difference sets from the splitting relative difference\\nsets. This generalizes the shifting results for Boolean bent and negabent\\nfunctions. We finally point to constructions of \\\\(\\\\mathbb{Z}_8\\\\)-bent functions\\nemploying permutations with the \\\\((\\\\mathcal{A}_m)\\\\) property, and more\\ngenerally we show that the inverse permutation gives rise to\\n\\\\(\\\\mathbb{Z}_{2^k}\\\\)-bent functions.\",\"PeriodicalId\":501433,\"journal\":{\"name\":\"arXiv - CS - Information Theory\",\"volume\":\"127 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-02-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2402.05677\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2402.05677","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Vectorial Negabent Concepts: Similarities, Differences, and Generalizations
In Pasalic et al., IEEE Trans. Inform. Theory 69 (2023), 2702--2712, and in
Anbar, Meidl, Cryptogr. Commun. 10 (2018), 235--249, two different vectorial
negabent and vectorial bent-negabent concepts are introduced, which leads to
seemingly contradictory results. One of the main motivations for this article
is to clarify the differences and similarities between these two concepts.
Moreover, the negabent concept is extended to generalized Boolean functions
from \(\mathbb{F}_2^n\) to the cyclic group \(\mathbb{Z}_{2^k}\). It is shown
how to obtain nega-\(\mathbb{Z}_{2^k}\)-bent functions from
\(\mathbb{Z}_{2^k}\)-bent functions, or equivalently, corresponding
non-splitting relative difference sets from the splitting relative difference
sets. This generalizes the shifting results for Boolean bent and negabent
functions. We finally point to constructions of \(\mathbb{Z}_8\)-bent functions
employing permutations with the \((\mathcal{A}_m)\) property, and more
generally we show that the inverse permutation gives rise to
\(\mathbb{Z}_{2^k}\)-bent functions.