This paper presents a construction for a class of 1-resilient functions with optimal algebraic immunity on an even number of variables. The construction is based on the concatenation of two balanced functions in assoc...This paper presents a construction for a class of 1-resilient functions with optimal algebraic immunity on an even number of variables. The construction is based on the concatenation of two balanced functions in associative classes. For some n, a part of 1-resilient functions with maximum algebraic immunity constructed in the paper can achieve almost optimal nonlinearity. Apart from their high nonlinearity, the functions reach Siegenthaler's upper bound of algebraic degree. Also a class of l-resilient functions on any number n 〉 2 of variables with at least sub-optimal algebraic immunity is provided.展开更多
For an odd integer n ≥ 7, this paper presented a class of n-variable rotation symmetric Boolean functions (RSBFs) with optimum algebraic immunity. The nonlinearity of the constructed functions is determined.
Algebraic immunity has been considered as one of cryptographically significant properties for Boolean functions. In this paper, we study ∑d-1 i=0 (ni)-weight Boolean functions with algebraic immunity achiev-ing the m...Algebraic immunity has been considered as one of cryptographically significant properties for Boolean functions. In this paper, we study ∑d-1 i=0 (ni)-weight Boolean functions with algebraic immunity achiev-ing the minimum of d and n - d + 1, which is highest for the functions. We present a simpler sufficient and necessary condition for these functions to achieve highest algebraic immunity. In addition, we prove that their algebraic degrees are not less than the maximum of d and n - d + 1, and for d = n1 +2 their nonlinearities equalthe minimum of ∑d-1 i=0 (ni) and ∑ d-1 i=0 (ni). Lastly, we identify two classes of such functions, one having algebraic degree of n or n-1.展开更多
Algebraic immunity is a new cryptographic criterion proposed against algebraic attacks. In order to resist algebraic attacks, Boolean functions used in many stream ciphers should possess high algebraic immunity. This ...Algebraic immunity is a new cryptographic criterion proposed against algebraic attacks. In order to resist algebraic attacks, Boolean functions used in many stream ciphers should possess high algebraic immunity. This paper presents one main result to find balanced rotation symmetric Boolean functions with maximum algebraic immunity. Through swapping the values of two orbits of rotation class of the majority function, a class of 4k+l variable Boolean functions with maximum algebraic immu- nity is constructed. The function f(x) we construct always has terms of degree n-2 independence of what ever n is. And the nonlinearity off(x) is relatively good for large n.展开更多
This paper first proposes an infinite class of 2k-variable Boolean functions with high nonlinearity and high algebraic degree. Then an infinite class of balanced Boolean functions are proposed by modifying the above B...This paper first proposes an infinite class of 2k-variable Boolean functions with high nonlinearity and high algebraic degree. Then an infinite class of balanced Boolean functions are proposed by modifying the above Boolean functions. This class of balanced Boolean functions have optimal algebraic degree and high nonlinearity. Both classes have optimal algebraic immunity based on a general combinatorial conjecture.展开更多
基金supported by the National Natural Science Foundations of China under Grant Nos. 60903200,61003299
文摘This paper presents a construction for a class of 1-resilient functions with optimal algebraic immunity on an even number of variables. The construction is based on the concatenation of two balanced functions in associative classes. For some n, a part of 1-resilient functions with maximum algebraic immunity constructed in the paper can achieve almost optimal nonlinearity. Apart from their high nonlinearity, the functions reach Siegenthaler's upper bound of algebraic degree. Also a class of l-resilient functions on any number n 〉 2 of variables with at least sub-optimal algebraic immunity is provided.
基金Supported by the National Natural Science Foundation of China ( 60603012)the Foundation of Hubei Provincial Department of Education, China (D200610004)
文摘For an odd integer n ≥ 7, this paper presented a class of n-variable rotation symmetric Boolean functions (RSBFs) with optimum algebraic immunity. The nonlinearity of the constructed functions is determined.
基金supported by National Natural Science Foundation of China (Grant Nos.10971246, 60970152)
文摘Algebraic immunity has been considered as one of cryptographically significant properties for Boolean functions. In this paper, we study ∑d-1 i=0 (ni)-weight Boolean functions with algebraic immunity achiev-ing the minimum of d and n - d + 1, which is highest for the functions. We present a simpler sufficient and necessary condition for these functions to achieve highest algebraic immunity. In addition, we prove that their algebraic degrees are not less than the maximum of d and n - d + 1, and for d = n1 +2 their nonlinearities equalthe minimum of ∑d-1 i=0 (ni) and ∑ d-1 i=0 (ni). Lastly, we identify two classes of such functions, one having algebraic degree of n or n-1.
基金Supported by the National Natural Science Foundation of China(61272434)the Natural Science Foundation of Shandong Province(ZR 2012FM004,ZR2013FQ021)the Foundation of Science and Technology on Information Assume Laboratory(KJ-13-004)
文摘Algebraic immunity is a new cryptographic criterion proposed against algebraic attacks. In order to resist algebraic attacks, Boolean functions used in many stream ciphers should possess high algebraic immunity. This paper presents one main result to find balanced rotation symmetric Boolean functions with maximum algebraic immunity. Through swapping the values of two orbits of rotation class of the majority function, a class of 4k+l variable Boolean functions with maximum algebraic immu- nity is constructed. The function f(x) we construct always has terms of degree n-2 independence of what ever n is. And the nonlinearity off(x) is relatively good for large n.
基金supported by the National Basic Research Program of China under Grant No.2011CB302400
文摘This paper first proposes an infinite class of 2k-variable Boolean functions with high nonlinearity and high algebraic degree. Then an infinite class of balanced Boolean functions are proposed by modifying the above Boolean functions. This class of balanced Boolean functions have optimal algebraic degree and high nonlinearity. Both classes have optimal algebraic immunity based on a general combinatorial conjecture.
基金supported by the National Key Basic Research Program of China under Grant No.2013CB834203the National Natural Science Foundation of China under Grant Nos.61472417 and 61472120the Research Council of Norway