{"title":"A class of weightwise almost perfectly balanced Boolean functions","authors":"Deepak Kumar Dalai, Krishna Mallick","doi":"10.3934/amc.2023048","DOIUrl":null,"url":null,"abstract":"Constructing Boolean functions with good cryptographic properties over a subset of vectors with fixed Hamming weight $ E_{n,k} \\subset {{\\rm{I\\!F}}}_2^n $ is significant in lightweight stream ciphers like FLIP [14]. In this article, we have given a construction for a class of $ n $-variable weightwise almost perfectly balanced (WAPB) Boolean functions from known support of an $ n_0 $-variable WAPB Boolean function where $ n_0 < n $. This is a generalization of constructing a weightwise perfectly balanced (WPB) Boolean function by Mesnager and Su [16]. We have studied some cryptographic properties like ANF, nonlinearity, weightwise nonlinearities, and algebraic immunity of the functions. The ANF of this function is obtained recursively, which would be a low-cost implementation in a lightweight stream cipher. Further, we have presented another class of WAPB Boolean functions by modifying the earlier function, and we studied some of its cryptographic properties. The nonlinearity and weightwise nonlinearities of the modified functions improve substantially.","PeriodicalId":50859,"journal":{"name":"Advances in Mathematics of Communications","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Mathematics of Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3934/amc.2023048","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
Constructing Boolean functions with good cryptographic properties over a subset of vectors with fixed Hamming weight $ E_{n,k} \subset {{\rm{I\!F}}}_2^n $ is significant in lightweight stream ciphers like FLIP [14]. In this article, we have given a construction for a class of $ n $-variable weightwise almost perfectly balanced (WAPB) Boolean functions from known support of an $ n_0 $-variable WAPB Boolean function where $ n_0 < n $. This is a generalization of constructing a weightwise perfectly balanced (WPB) Boolean function by Mesnager and Su [16]. We have studied some cryptographic properties like ANF, nonlinearity, weightwise nonlinearities, and algebraic immunity of the functions. The ANF of this function is obtained recursively, which would be a low-cost implementation in a lightweight stream cipher. Further, we have presented another class of WAPB Boolean functions by modifying the earlier function, and we studied some of its cryptographic properties. The nonlinearity and weightwise nonlinearities of the modified functions improve substantially.
期刊介绍:
Advances in Mathematics of Communications (AMC) publishes original research papers of the highest quality in all areas of mathematics and computer science which are relevant to applications in communications technology. For this reason, submissions from many areas of mathematics are invited, provided these show a high level of originality, new techniques, an innovative approach, novel methodologies, or otherwise a high level of depth and sophistication. Any work that does not conform to these standards will be rejected.
Areas covered include coding theory, cryptology, combinatorics, finite geometry, algebra and number theory, but are not restricted to these. This journal also aims to cover the algorithmic and computational aspects of these disciplines. Hence, all mathematics and computer science contributions of appropriate depth and relevance to the above mentioned applications in communications technology are welcome.
More detailed indication of the journal''s scope is given by the subject interests of the members of the board of editors.