Pages that link to "Item:Q2946971"
From MaRDI portal
The following pages link to The Multiplicative Complexity of Boolean Functions on Four and Five Variables (Q2946971):
Displaying 6 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)
- On compiling Boolean circuits optimized for secure multi-party computation (Q1696583) (← links)
- The multiplicative complexity of 6-variable Boolean functions (Q1755188) (← links)
- Boolean functions with multiplicative complexity 3 and 4 (Q2040305) (← links)
- Upper bounds on the multiplicative complexity of symmetric Boolean functions (Q2179499) (← links)
