Pages that link to "Item:Q1704580"
From MaRDI portal
The following pages link to Multiplicative complexity of vector valued Boolean functions (Q1704580):
Displaying 5 items.
- Multiplicative complexity of some Boolean functions (Q314127) (← links)
- Complexity of fixed-size bit-vector logics (Q504997) (← links)
- Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\) (Q1641147) (← links)
- Differential uniformity and linearity of S-boxes by multiplicative complexity (Q2154885) (← links)
- A lower bound for differential uniformity by multiplicative complexity \& bijective functions of multiplicative complexity 1 over finite fields (Q6542664) (← links)