On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
From MaRDI portal
Publication:1978699
DOI10.1016/S0304-3975(99)00182-6zbMath1058.94027OpenAlexW2091423939WikidataQ62472235 ScholiaQ62472235MaRDI QIDQ1978699
D. Pochuev, René Peralta, Joan. Boyar
Publication date: 4 June 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00182-6
Related Items
On various nonlinearity measures for Boolean functions, Logic minimization techniques with applications to cryptology, Differential uniformity and linearity of S-boxes by multiplicative complexity, Upper bounds on the multiplicative complexity of symmetric Boolean functions, The Multiplicative Complexity of Boolean Functions on Four and Five Variables, Constructive Relationships Between Algebraic Thickness and Normality, Faster Privacy-Preserving Location Proximity Schemes, Multiplicative complexity of vector valued Boolean functions, Tight bounds for the multiplicative complexity of symmetric functions, Optimizing S-Box Implementations for Several Criteria Using SAT Solvers, Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity, The multiplicative complexity of 6-variable Boolean functions, Small low-depth circuits for cryptographic applications, Polynomial expressions of \(p\)-ary auction functions, Boolean functions with multiplicative complexity 3 and 4, The Decomposition Tree for analyses of Boolean functions, On the multiplicative complexity of some Boolean functions, On the multiplicative complexity of quasi-quadratic Boolean functions
Cites Work
- The multiplicative complexity of quadratic boolean forms
- Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
- Short Discreet Proofs
- Bounds to Complexities of Networks for Sorting and for Switching
- On the combinational complexity of certain symmetric Boolean functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item