Construction of 1-resilient Boolean functions with optimum algebraic immunity

In this paper, for an integer n≥10, two classes of n-variable Boolean functions with optimum algebraic immunity (AI) are constructed, and their nonlinearities are also determined. Based on non-degenerate linear transforms to the proposed functions, we can obtain 1-resilient n-variable Boolean functions with optimum AI and high nonlinearity if n?1 is never equal to any power of 2.     

On the 2<Superscript>m</Superscript>-variable symmetric Boolean functions with maximum algebraic immunity

The properties of the 2m-variable symmetric Boolean functions with maximum al- gebraic immunity are studied in this paper. Their value vectors, algebraic normal forms, and algebraic degrees and weights are all obtained. At last, some necessary conditions for a symmetric Boolean function on even number variables to have maximum algebraic immunity are introduced.     

Analysis of affinely equivalent Boolean functions

By some basic transforms and invariant theory, we give two results: 1) an algorithm, which can be used to judge if two Boolean functions are affinely equivalent and to obtain the equivalence relationship if they are equivalent. This is useful in studying Boolean functions and in engineering. For example, we classify all 8-variable homogeneous bent functions of degree 3 into two classes; 2) Reed-Muller codes R(4,6)/R(1,6), R(3,7)/R(1,7) are classified efficiently.     

Partitioning 1-variable Boolean functions for various classification of n-variable Boolean functions

This paper addresses all possible equivalence classes of 1-variable Boolean functions and from these classes using recursion and Cartesian product of sets, 15 different ways of classifications of n-variable Boolean functions are obtained. The properties with regard to the size and the number of classes for these 15 different ways are also elaborated.     

The autocorrelation distribution of balanced Boolean function

The global avalanche characteristics (the sum-of-squares indicator and the absolute indicator) measure the overall avalanche characteristics of a cryptographic Boolean function. Sung et al. (1999) gave the lower bound on the sum-of-squares indicator for a balanced Boolean function satisfying the propagation criterion with respect to some vectors. In this paper, if balanced Boolean functions satisfy the propagation criterion with respect to some vectors, we give three necessary and sufficient conditions on the auto-correlation distribution of these functions reaching the minimum the bound on the sum-of-squares indicator. And we also find all Boolean functions with 3-variable, 4-variable, and 5-variable reaching the minimum the bound on the sum-of-squares indicator.     

Power Minimization of FPRM Functions Based on Polarity Conversion

For an n-variable Boolean function,there are 2^n fixed polarity Reed -Muler(FPRM)forms.In this paper,a frame of power dissipation estimation for FPRM functions is presented and the polarity conversion is introduced to minimize the power for FPRM functions.Based on searching the best polarity for low power dissipation,an optimal algorithm is proposed and implemented in C.The algorithm is tested on seven single output functions from MCNC benchmark circuits.The experimenta results are shown in this paper.     

关于二阶代数免疫布尔函数的几个结果

关于布尔函数的代数免疫性与弹性、代数次数、非线性度之间的关系的结果至今仍然很少,饱和最优布尔函数在流密码领域具有较高的理论价值,通过计算证明文献[1]中命题8给出的5元最优布尔函数都是2阶代数免疫函数,并在此基础上对这个结果做了进一步推广。     

Upper bound for algebraic immunity on a subclass of Maiorana McFarland class of bent functions

Studying algebraic immunity of Boolean functions is recently a very important research topic in cryptography. It is recently proved by Courtois and Meier that for any Boolean function of n-variable the maximum algebraic immunity is . We found a large subclass of Maiorana McFarland bent functions on n-variable with a proven low level of algebraic immunity . To the best of our knowledge we provide for the first time a new upper bound for algebraic immunity for a nontrivial class of Boolean functions. We also discuss that this result has some fascinating implications.     

Recognition of interval Boolean functions

Interval functions constitute a special class of Boolean functions for which it is very easy and fast to determine their functional value on a specified input vector. The value of an n-variable interval function specified by interval [a,b] (where a and b are n-bit binary numbers) is true if and only if the input vector viewed as an n-bit number belongs to the interval [a,b]. In this paper we study the problem of deciding whether a given disjunctive normal form represents an interval function and if so then we also want to output the corresponding interval. For general Boolean functions this problem is co-NP-hard. In our article we present a polynomial time algorithm which works for monotone functions. We shall also show that given a Boolean function f belonging to some class which is closed under partial assignment and for which we are able to solve the satisfiability problem in polynomial time, we can also decide whether f is an interval function in polynomial time. We show how to recognize a “renamable” variant of interval functions, i.e., their variable complementation closure. Another studied problem is the problem of finding an interval extension of partially defined Boolean functions. We also study some other properties of interval functions.      

On affine (non)equivalence of Boolean functions

In this paper we construct a multiset S(f) of a Boolean function f consisting of the weights of the second derivatives of the function f with respect to all distinct two-dimensional subspaces of the domain. We refer to S(f) as the second derivative spectrum of f. The frequency distribution of the weights of these second derivatives is referred to as the weight distribution of the second derivative spectrum. It is demonstrated in this paper that this weight distribution can be used to distinguish affine nonequivalent Boolean functions. Given a Boolean function f on n variables we present an efficient algorithm having O(n2²ⁿ ) time complexity to compute S(f). Using this weight distribution we show that all the 6-variable affine nonequivalent bents can be distinguished. We study the subclass of partial-spreads type bent functions known as PS _ap type bents. Six different weight distributions are obtained from the set of PS _ap bents on 8-variables. Using the second derivative spectrum we show that there exist 6 and 8 variable bent functions which are not affine equivalent to rotation symmetric bent functions. Lastly we prove that no non-quadratic Kasami bent function is affine equivalent to Maiorana–MacFarland type bent functions.     

基于plateaued函数的平衡布尔函数构造

布尔函数在对称密码的设计和分析中起着重要的作用。通过对谱不相交函数集中子函数平衡性的问题的研究给出了包含4个plateaued函数的函数集中有3个为平衡函数的充分条件。在此基础上,基于3个平衡的谱不相交plateaued函数,一类特殊的布尔置换以及一个高非线性度平衡函数,提出了一个构造高非线性度平衡布尔函数的方法。通过分析可知,利用该方法可以构造代数次数达到最优、非线性度不小于2^2k-1-2^k-1-2^k/2-2^{⌈(k-1)/2⌉}的2k元平衡函数。     

Highly nonlinear balanced Boolean functions with good local and global avalanche characteristics

Here we deal with an interesting subset of n-variable balanced Boolean functions which satisfy strict avalanche criteria. These functions achieve the sum-of-square indicator value (a measure for global avalanche criteria) strictly less than 2²ⁿ⁺¹ and nonlinearity strictly greater than 2ⁿ⁻¹−2^⌊n/2⌋. These parameters are currently best known. Moreover, these functions do not possess any nonzero linear structure. The technique involves a well-known simple construction coupled with very good initial functions obtained by computer search, which were not known earlier.     

最优代数免疫布尔函数的完全构造

任意的布尔函数可以唯一地表示成有限域上的单变元多项式函数,利用布尔函数的单变元多项式表示和代数编码理论,讨论了布尔函数的代数免疫达到最优的判别条件,得到了布尔函数的变元个数为奇数时,布尔函数具有最优代数免疫(MAI)的等价判别条件。利用该等价判别条件,给出3元布尔函数满足MAI的等价判别条件,进而构造出所有3元的MAI布尔函数。     

Construction of highly nonlinear resilient Boolean functions satisfying strict avalanche criterion

Boolean functions with high nonlinearity, high resiliency and strict avalanche criterion （SAC） play an important role in the designs of conventional cryptographic systems. In this paper, a method is proposed to construct resilient Boolean functions on n variables （n even） satisfying SAC with nonlinearity 〉 2n-1 -2n/2. A large class of cryptographic Boolean functions that were not known earlier were obtained.     

On renamable Horn and generalized Horn functions

A Boolean function in disjunctive normal form (DNF) is aHorn function if each of its elementary conjunctions involves at most one complemented variable. Ageneralized Horn function is constructed from a Horn function by disjuncting a nested set of complemented variables to it. The satisfiability problem is solvable in polynomial time for both Horn and generalized Horn functions. A Boolean function in DNF is said to berenamable Horn if it is Horn after complementation of some variables. Succinct mathematical characterizations and linear-time algorithms for recognizing renamable Horn and generalized Horn functions are given in this paper. The algorithm for recognizing renamable Horn functions gives a new method to test 2-SAT. Some computational results are also given.The authors were supported in part by the Office of Naval Research under University Research Initiative grant number N00014-86-K-0689. Chandru was also supported by NSF grant number DMC 88-07550.The authors gratefully acknowledge the partial support of NSF (Grant DMS 89-06870) and AFOSR (Grant 89-0066 and 89-0512).     

Möbius transforms,coincident Boolean functions and non-coincidence property of Boolean functions

Boolean functions and their Möbius transforms are involved in logical calculation, digital communications, coding theory and modern cryptography. So far, little is known about the relations of Boolean functions and their Möbius transforms. This work is composed of three parts. In the first part, we present relations between a Boolean function and its Möbius transform so as to convert the truth table/algebraic normal form (ANF) to the ANF/truth table of a function in different conditions. In the second part, we focus on the special case when a Boolean function is identical to its Möbius transform. We call such functions coincident. In the third part, we generalize the concept of coincident functions and indicate that any Boolean function has the coincidence property even it is not coincident.     

On the correlation of symmetric functions

Thecorrelation between two Boolean functions ofn inputs is defined as the number of times the functions agree minus the number of times they disagree, all divided by 2 ⁿ . In this paper we compute, in closed form, the correlation between any twosymmetric Boolean functions. As a consequence of our main result, we get that every symmetric Boolean function having an odd period has anexponentially small correlation (inn) with the parity function. This improves a result of Smolensky [12] restricted to symmetric Boolean functions: the correlation between parity and any circuit consisting of a Mod _q gate over AND gates of small fan-in, whereq is odd and the function computed by the sum of the AND gates is symmetric, is bounded by 2^−Ω(n). In addition, we find that for a large class of symmetric functions the correlation with parity isidentically zero for infinitely manyn. We characterize exactly those symmetric Boolean functions having this property. This research was supported in part by NSF Grant CCR-9057486. Jin-Yi Cai was supported in part by an Alfred T. Sloan Fellowship in computer science. The work of F. Green was done in part while visiting Princeton University, while the work of T. Thierauf was done in part while visiting Princeton University and the University of Rochester. The third author was supported in part by DFG Postdoctoral Stipend Th 472/1-1 and by NSF Grant CCR-8957604.     

The complexity of monotone boolean functions

We study the realization of monotone Boolean functions by networks. Our main result is a precise version of the following statement: the complexity of realizing a monotone Boolean function ofn arguments is less by the factor (2/n)^1/2, where is the circular ratio, than the complexity of realizing an arbitrary Boolean function ofn arguments. The proof combines known results concerning monotone Boolean functions with new methods relating the computing abilities of networks and machines.     

5元饱和最优布尔函数的计数问题

同时达到代数次数上界n-m-1和非线性度上界2^n-1-2^m+1的n元m阶弹性布尔函数(m＞n/2-2)具有3个Walsh谱值:0,±2^m+2这样的函数被称为饱和最优函数(saturated best,简称SB).将利用(32,6)Reed-Muller码陪集重量的分布,从一种全新的构造角度出发,给出n=5的饱和最优函数的个数.     

On the equal-weight symmetric Boolean functions

Two important classes of symmetric Boolean functions are the equal-weight Boolean functions and the elementary (or homogeneous) symmetric Boolean functions. In this paper we studied the equal-weight symmetric Boolean functions. First the Walsh spectra of the equal-weight symmetric Boolean functions are given. Second the sufficient and necessary condition on correlation-immunity of the equal-weight symmetric Boolean function is derived and other cryptology properties such as the nonlinearity, balance and propagation criterion are taken into account. In particular, the nonlinearity of the equal-weight symmetric Boolean functions with n (n ≥ 10) variables is determined by their Hamming weight. Considering these properties will be helpful in further investigations of symmetric Boolean functions.