Pages that link to "Item:Q1641147"
From MaRDI portal
The following pages link to Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\) (Q1641147):
Displaying 10 items.
- A framework to optimize implementations of matrices (Q826298) (← links)
- A multi-start heuristic for multiplicative depth minimization of Boolean circuits (Q1642709) (← links)
- Small low-depth circuits for cryptographic applications (Q1755189) (← links)
- Construction of lightweight involutory MDS matrices (Q2035451) (← links)
- New records of pre-image search of reduced SHA-1 using SAT solvers (Q2079908) (← links)
- Logic minimization techniques with applications to cryptology (Q2377070) (← links)
- A new matrix form to generate all \(3\times 3\) involutory MDS matrices over \(\mathbb{F}_{2^m}\) (Q2414052) (← links)
- On the Shortest Linear Straight-Line Program for Computing Linear Forms (Q3599124) (← links)
- Three input exclusive-or gate support for Boyar-Peralta's algorithm (Q6157579) (← links)
- Four by four MDS matrices with the fewest XOR gates based on words (Q6167301) (← links)
