On the independence of Boolean functions
From MaRDI portal
Recommendations
- A sufficient and necessary condition of judging the independence of Boolean functions system
- Further enumerating Boolean functions of cryptographic significance
- Enumerating Boolean functions of cryptographic significance
- scientific article; zbMATH DE number 1543297
- scientific article; zbMATH DE number 5862915
Cited in
(11)- Further enumerating Boolean functions of cryptographic significance
- A generation method for a kind of linear independent Latin arrays
- A sufficient and necessary condition of judging the independence of Boolean functions system
- Independent families in Boolean algebras with some separation properties
- Möbius transforms, coincident Boolean functions and non-coincidence property of Boolean functions
- On the Boolean-like Law I(x, I(y, x)) = 1
- Derivation of Boolean functions by the blocks method
- On influences of Boolean variables and their computation
- On Deciding Whether a Boolean Function is Constant or Not
- On Boolean Functions Defined on Bracket Sequences
- I/O correlation properties of bent functions
This page was built for publication: On the independence of Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4653698)