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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

The security of symmetric cryptosystem depends upon the cryptographic properties of Boolean function, e.g. balancedness, high…

2016

There are many heuristic search algorithms for finding optimal Boolean functions with good cryptographic characteristics. In this…

2014

Algebraic immunity is a new cryptographic criterion. In order to resist algebraic attacks, Boolean functions used in cryptosystem…

2013

The global avalanche characteristics (the sum-of-squares indicator and the absolute indicator) measure the overall avalanche…

2013

Linear complexity is an important cryptographic index of sequences. We study the linear complexity of p(q-1)\documentclass[12pt…

2012

It has been pointed out that an n-variable Boolean function f has optimal resistance against fast algebraic attacks if and only…

2010

In this paper, we present a class of 2k-variable balanced Boolean functions and a class of 2k-variable 1-resilient Boolean…

2006

In this paper we study in detail how to design an efficient algorithm for checking whether a Boolean function has an annihilator…

2003

We give the description of locally finite groups with strongly balanced subgroup lattices and we prove that the strong uniform…

2002

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…