Live briefing
Everything about 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 means that for a uniformly random input string of bits, the probability of getting a 1 is 1/2. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Balanced Boolean functionA 5-minute orientation
- Skim a recent paper: Construction of weightwise almost perfectly balanced Boolean functions on an arbitrary number of variablesInfluential work since 2022
- Pick up a classic book: Intelligent Information and Database SystemsThe most-reprinted book on the subject
- Read the landmark paper: Nonlinearity and Propagation Characteristics of Balanced Boolean FunctionsCited 53 times
- Go sideways: Higher-order differential cryptanalysisA closely related topic
- Go sideways: Boolean functionA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Nonlinearity and Propagation Characteristics of Balanced Boolean Functions
Balanced rotation symmetric boolean functions with maximum algebraic immunity
Global avalanche characteristics and nonlinearity of balanced Boolean functions
On constructions of weightwise perfectly balanced Boolean functions
Global avalanche characteristics and propagation criterion of balanced Boolean functions
An improved hybrid genetic algorithm to construct balanced Boolean function with optimal cryptographic properties
A new construction of weightwise perfectly balanced Boolean functions
On a conjecture for balanced symmetric Boolean functions
🆕 Influential since 2022
Construction of weightwise almost perfectly balanced Boolean functions on an arbitrary number of variables
A systematic method of constructing weightwise almost perfectly balanced Boolean functions on an arbitrary number of variables
A unified construction of weightwise perfectly balanced Boolean functions
A class of weightwise almost perfectly balanced Boolean functions
Parametric Construction Approach of Balanced Boolean Functions from Two-to-one Mappings
📚 Books worth reading
Intelligent Information and Database SystemsAli Selamat · 2013
Foundations of computer scienceAlfred V. Aho · 1992
Combinatorial theoryAnne Penfold Street, W. D. Wallis · 1977
Information Security ApplicationsDong Hoon Lee · 2012
Apache Solr 3 Enterprise Search ServerDavid Smiley · 2011
Combinatorial theoryAnne Penfold Street, W. D. Wallis · 1977
Introduction to game design, prototyping, and developmentJeremy Gibson · 2015
Data structures & other objects using C++M. Main · 2001
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Higher-order differential cryptanalysis In cryptography, higher-order differential cryptanalysis is a generalization of differential cryptanalysis, an attack used against block ciphers. While…
- Boolean function In mathematics, a Boolean function is a function whose arguments and result assume values from a two-element set (usually {true, false}, {0,1} or {−1,1})…
- Avalanche effect In cryptography, the avalanche effect is the desirable property of cryptographic algorithms, typically block ciphers and cryptographic hash functions,…
- Deutsch–Jozsa algorithm The Deutsch–Jozsa algorithm is a deterministic quantum algorithm proposed by David Deutsch and Richard Jozsa in 1992 with improvements by Richard Cleve…
- Black-box obfuscation In cryptography, black-box obfuscation was a proposed cryptographic primitive which would allow a computer program to be obfuscated in a way such that…
- SMASH (hash) SMASH is a cryptographic hash function which was created by Lars R. Knudsen. SMASH comes in two versions: 256-bit and 512-bit. Each version was supposed…
- Verifiable random function In cryptography, a verifiable random function (VRF) is a public-key pseudorandom function that provides proofs that its outputs were calculated correctly…
- Circuit complexity In theoretical computer science, circuit complexity is a branch of computational complexity theory in which Boolean functions are classified according…