A class of weightwise almost perfectly balanced Boolean functions

IF 0.7 4区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Deepak Kumar Dalai, Krishna Mallick
{"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.
一类权重几乎完全平衡的布尔函数
在具有固定汉明权值的向量子集上构造具有良好密码性质的布尔函数$ E_{n,k} \子集{{\rm{I\!F}}}_2^n $在轻量级流密码中很重要,如FLIP[14]。在本文中,我们从已知的$ n_0 $变量WAPB布尔函数的支持中给出了一类$ n_0 $变量加权几乎完美平衡(WAPB)布尔函数的构造,其中$ n_0 <n美元。这是Mesnager和Su[16]构造加权完全平衡(WPB)布尔函数的推广。我们研究了一些密码学性质,如函数的ANF、非线性、权非线性和代数免疫。该函数的ANF是递归获得的,这将是轻量级流密码中的低成本实现。此外,我们通过修改前面的函数提出了另一类WAPB布尔函数,并研究了它的一些加密特性。修正后的函数的非线性和权值非线性得到了很大的改善。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Advances in Mathematics of Communications
Advances in Mathematics of Communications 工程技术-计算机:理论方法
CiteScore
2.20
自引率
22.20%
发文量
78
审稿时长
>12 weeks
期刊介绍: 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.
×
引用
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学术官方微信