Construction of Balanced Functions without Extending Their Number of Variables.docVIP

IAENG International Journal of Applied Mathematics, 39:3, IJAM_39_01 _____________________________________________________________________ Construction of Balanced Functions without Extending Their Number of Variables A?ssa. Belmeguena?, Noureddine. Doghmane, and Khaled. Mansouri AI ( f )?2?n ?1? ∑ ? ? ? Nf ≥ 2 Abstract— In this work, we first give a general method which ciphers. In [15], Lobanov proved that can get a large class of balanced Boolean functions with reasonably high nonlinearity, larger than that obtained by ? ?i ? i=0 for every n -variable Boolean functions. Moreover, by Lobanov. Then, we study the secondary construction of Boolean functions without extending their number of variables, introduced recently by Carlet. This gives interesting cryptographic properties in terms of balancedness, nonlinearity and algebraic immunity. We conclude the paper by proving that the algebraic immunity of constructing a family of Boolean function achieving the AI ( f )?2?n ?1? ∑ equality Nf = 2 ?, he proved that this lower ? ?i ? i=0 the constructed functions is better than among of the starting bound cannot be improved further. The result of [15] and functions. theorem 2 of [16] give a new reason why one should not use functions f with low nonlinearity, since in that case AI ( f ) Index nonlinearity, resiliency. Terms—Algebraic immunity, Boolean function, n would be low. However, they do not ensure that if f has high algebraic immunity (for instance an optimum ?n?) then its nonlinearity will be high. Indeed, AI ( f ) = ? ? n ?2? I. INTRODUCTION one Boolean functions, when used in stream cipher (combiner model or filter model), are required to have good cryptographic the result of [15] implies then that f has nonlinearity at properties. Some of the important properties are balancedness, a ?