{"title":"在完整的 Maiorana-McFarland 类之外构建几类特殊的立方弯曲函数","authors":"Fengrong Zhang , Enes Pasalic , Amar Bapić , 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":"{\"title\":\"Constructions of several special classes of cubic bent functions outside the completed Maiorana-McFarland class\",\"authors\":\"Fengrong Zhang , Enes Pasalic , Amar Bapić , 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}","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}
Constructions of several special classes of cubic bent functions outside the completed Maiorana-McFarland class
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 (). 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 . 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 ). 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.
期刊介绍:
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