Skip to search formSkip to main contentSkip to account menu

Balanced boolean function

In mathematics and computer science, a balanced boolean function is a boolean function whose output yields as many 0s as 1s over its input set. This… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
Bent functionComputer scienceCorrelation attackCryptanalysis

Broader (1)

Boolean algebra

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Analysis of Cost function using Genetic algorithm to construct balanced Boolean function
The security of symmetric cryptosystem depends upon the cryptographic properties of Boolean function, e.g. balancedness, high… 
2016
2016
Enhance the nonlinearity of optimizing Boolean function via permutation
There are many heuristic search algorithms for finding optimal Boolean functions with good cryptographic characteristics. In this… 
2014
2014
One Sufficient and Necessary Condition on Balanced Boolean Functions with σf = 22n + 2n+3(n ≥ 3)
The Global Avalanche Characteristics (including the sum-of-squares indicator and the absolute indicator) measure the overall… 
2014
2014
Construction for Balanced Boolean Function with Maximum Algebraic Immunity
Algebraic immunity is a new cryptographic criterion. In order to resist algebraic attacks, Boolean functions used in cryptosystem… 
2013
2013
The autocorrelation distribution of balanced Boolean function
The global avalanche characteristics (the sum-of-squares indicator and the absolute indicator) measure the overall avalanche… 
2013
2013
On the linear complexity of Legendre–Sidelnikov sequences
Linear complexity is an important cryptographic index of sequences. We study the linear complexity of p(q-1)\documentclass[12pt… 
2012
2012
On the Existence of Boolean Functions with Optimal Resistance against Fast Algebraic Attacks
It has been pointed out that an n-variable Boolean function f has optimal resistance against fast algebraic attacks if and only… 
2006
2006
Towards an Efficient Algorithm to find Annihilators by Solving a Set of Homogeneous Linear Equations
In this paper we study in detail how to design an efficient algorithm for checking whether a Boolean function has an annihilator… 
2003
2003
On strong uniform dimension of locally finite groups
We give the description of locally finite groups with strongly balanced subgroup lattices and we prove that the strong uniform… 
2002
2002
Criteria for Balance in Abelian Gain Graphs ∗
A gain graph (Γ, g, G) is a graph Γ = (V,E) together with a group G, the gain group, and a homomorphism g, the gain function… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)