On the multiplicative complexity of Boolean functions over the basis (,,1).

Recommendations

On the multiplicative complexity of Boolean functions
Multiplicative complexity of some Boolean functions
On the multiplicative complexity of some Boolean functions
Upper bounds on the multiplicative complexity of symmetric Boolean functions
The number of Boolean functions with multiplicative complexity 2

Cites work

scientific article; zbMATH DE number 3648119 (Why is no real title available?)
scientific article; zbMATH DE number 4012495 (Why is no real title available?)
scientific article; zbMATH DE number 42045 (Why is no real title available?)
scientific article; zbMATH DE number 3566172 (Why is no real title available?)
scientific article; zbMATH DE number 718142 (Why is no real title available?)
scientific article; zbMATH DE number 976329 (Why is no real title available?)
Bounds to Complexities of Networks for Sorting and for Switching
Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
On the combinational complexity of certain symmetric Boolean functions
Short discreet proofs
The multiplicative complexity of quadratic boolean forms

Cited in

(31)

Upper bounds on the multiplicative complexity of symmetric Boolean functions
On various nonlinearity measures for Boolean functions
Polynomial expressions of \(p\)-ary auction functions
On the combinational complexity of certain symmetric Boolean functions
The multiplicative complexity of 6-variable Boolean functions
Tight bounds for the multiplicative complexity of symmetric functions
A 4n Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean Functions
On the multiplicative complexity of quasi-quadratic Boolean functions
The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\)
Multiplicative complexity of some Boolean functions
Faster Privacy-Preserving Location Proximity Schemes
The multiplicative complexity of Boolean functions on four and five variables
Constructive relationships between algebraic thickness and normality
The number of Boolean functions with multiplicative complexity 2
Circuit complexity and multiplicative complexity of Boolean functions
Small low-depth circuits for cryptographic applications
Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables
scientific article; zbMATH DE number 3868606 (Why is no real title available?)
Logic minimization techniques with applications to cryptology
Faster homomorphic operations and beyond: expediting homomorphic computation via Boolean circuit optimization
Multiplicative complexity of vector valued Boolean functions
The Decomposition Tree for analyses of Boolean functions
Optimizing S-Box Implementations for Several Criteria Using SAT Solvers
On the multiplicative complexity of Boolean functions
On the multiplicative complexity of Boolean functions and bitsliced higher-order masking
Boolean functions with multiplicative complexity 3 and 4
Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity
The Power of Negative Thinking in Multiplying Boolean Matrices
scientific article; zbMATH DE number 176872 (Why is no real title available?)
On the multiplicative complexity of some Boolean functions
Differential uniformity and linearity of S-boxes by multiplicative complexity

This page was built for publication: On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978699)