Pages that link to "Item:Q1978699"

The following pages link to On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\). (Q1978699):

Displaying 17 items.

• On various nonlinearity measures for Boolean functions (Q276554) (← links)
• Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity (Q510448) (← links)
• Tight bounds for the multiplicative complexity of symmetric functions (Q924152) (← links)
• Multiplicative complexity of vector valued Boolean functions (Q1704580) (← links)
• The multiplicative complexity of 6-variable Boolean functions (Q1755188) (← links)
• Small low-depth circuits for cryptographic applications (Q1755189) (← links)
• Polynomial expressions of \(p\)-ary auction functions (Q2003342) (← links)
• Boolean functions with multiplicative complexity 3 and 4 (Q2040305) (← links)
• Differential uniformity and linearity of S-boxes by multiplicative complexity (Q2154885) (← links)
• Upper bounds on the multiplicative complexity of symmetric Boolean functions (Q2179499) (← links)
• On the multiplicative complexity of some Boolean functions (Q2354498) (← links)
• On the multiplicative complexity of quasi-quadratic Boolean functions (Q2356508) (← links)
• Logic minimization techniques with applications to cryptology (Q2377070) (← links)
• The Multiplicative Complexity of Boolean Functions on Four and Five Variables (Q2946971) (← links)
• Constructive Relationships Between Algebraic Thickness and Normality (Q2947873) (← links)
• Optimizing S-Box Implementations for Several Criteria Using SAT Solvers (Q4639475) (← links)
• The Decomposition Tree for analyses of Boolean functions (Q5458074) (← links)