Oblivious bounds on the probability of boolean functions
نویسندگان
چکیده
منابع مشابه
Lower Bounds on the Algebraic Immunity of Boolean Functions
From the motivation of algebraic attacks to stream and block ciphers([1,2,7,13,14,15]), the concept of algebraic immunity (AI) of a Boolean function was introduced in [21] and studied in [3,5,10,11,17,18,19,20,21]. High algebraic immunity is a necessary condition for resisting algebraic attacks. In this paper, we give some lower bounds on the algebraic immunity of Boolean functions. The results...
متن کاملTheoretical Upper Bounds on the Covering Radii of Boolean Functions
We prove new upper bounds for the covering radii ρ(n) and ρB(n) of the first order Reed-Muller code R(1, n). Although these bounds be actually theoretical, they improve the classical Helleseth-Kløve-Mykkeltveit (H.K.M.) bound 2n−1 − 2n2−1.
متن کاملUpper Bounds on Algebraic Immunity of Boolean Power Functions
Algebraic attacks have received a lot of attention in studying security of symmetric ciphers. The function used in a symmetric cipher should have high algebraic immunity (AI) to resist algebraic attacks. In this paper we are interested in finding AI of Boolean power functions. We give an upper bound on the AI of any Boolean power function and a formula to find its corresponding low degree multi...
متن کاملLower Bounds on Algebraic Immunity of Boolean Functions
In the recently developed algebraic attacks applying to block and stream ciphers([1-5]), the concept of algebraic immunity (AI) is introduced in [6] and studied in [6-14]. High algebraic immunity is a necessary condition for resisting algebraic attacks. In this paper, we give some lower bounds on algebraic immunity of Boolean functions. The results are applied to give lower bounds on AI of symm...
متن کاملLower Bounds on Representing Boolean Functions as Polynomials in Zm
Deene the MOD m-degree of a boolean function F to be the smallest degree of any polynomial P, over the ring of integers modulo m, such that for all 0-1 assignments ~ x, F(~ x) = 0 ii P(~ x) = 0. By exploring the periodic property of the binomial coeecients modulo m, two new lower bounds on the MOD m-degree of the MOD l and :MOD m functions are proved, where m is any composite integer and l has ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Database Systems
سال: 2014
ISSN: 0362-5915,1557-4644
DOI: 10.1145/2532641