Title
Construction of Boolean functions with excellent cryptographic criteria using bivariate polynomial representation
Abstract
A class of <inline-formula><inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink=\"gcom_a_999051_ilm0001.gif\"/</inline-formula>-variable Boolean functions with excellent cryptographic criteria is proposed in this paper, using bivariate polynomial representation BPR. By comparing known Boolean functions created by the ‘BPR-method’, three conjectures on the relationship between cryptographic criteria and parameter settings are given as guidelines to the research. Then on the basis of certain combinatorial facts and computer experiments, we prove that our functions possess the optimal algebraic immunity k, and validate that, at least for <inline-formula><inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink=\"gcom_a_999051_ilm0002.gif\"/</inline-formula>, the functions preserve almost perfect immunity against fast algebraic attacks. In addition, we show the functions to be 1-resilient with the maximum algebraic degree of <inline-formula><inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink=\"gcom_a_999051_ilm0003.gif\"/</inline-formula> and give a proof of the lower bound for nonlinearity by means of Gauss sum. Our functions demonstrate great performance in meeting the desired cryptographic criteria for use in the filter model of pseudorandom generators.
Year
DOI
Venue
2016
10.1080/00207160.2014.999051
International Journal of Computer Mathematics
Keywords
Field
DocType
nonlinearity,resiliency,boolean functions
Boolean function,Discrete mathematics,Addition theorem,Algebraic number,Gauss sum,Algebraic function,Security of cryptographic hash functions,Boolean expression,Mathematics,Pseudorandom number generator
Journal
Volume
Issue
ISSN
93
3
0020-7160
Citations 
PageRank 
References 
3
0.38
16
Authors
5
Name
Order
Citations
PageRank
zhao wang130.38
xiao zhang230.38
sitao wang330.38
Zhiming Zheng412816.80
wenhua wang531.06