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

DOI10.1016/S0304-3975(99)00182-6zbMATH Open1058.94027OpenAlexW2091423939WikidataQ62472235 ScholiaQ62472235MaRDI QIDQ1978699FDOQ1978699

Authors: D. Pochuev, Joan Boyar, René Peralta 

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

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

Mathematics Subject Classification ID

Boolean functions (06E30)

Cites Work

• Title not available (Why is that?)
• Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the combinational complexity of certain symmetric Boolean functions
• Bounds to Complexities of Networks for Sorting and for Switching
• The multiplicative complexity of quadratic boolean forms
• Title not available (Why is that?)
• Short discreet proofs
• Title not available (Why is that?)

Cited In (29)

• 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
• 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})\)
• Faster Privacy-Preserving Location Proximity Schemes
• Multiplicative complexity of some Boolean functions
• The multiplicative complexity of Boolean functions on four and five variables
• Constructive relationships between algebraic thickness and normality
• Circuit complexity and multiplicative complexity of Boolean functions
• The number of Boolean functions with multiplicative complexity 2
• Small low-depth circuits for cryptographic applications
• Title not available (Why is that?)
• Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables
• Logic minimization techniques with applications to cryptology
• The Decomposition Tree for analyses of Boolean functions
• Multiplicative complexity of vector valued 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
• The Power of Negative Thinking in Multiplying Boolean Matrices
• Title not available (Why is that?)
• Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity
• 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)