The following pages link to (Q4945370):
Displaying 3 items.
- A proof of the Beierle-Kranz-Leander conjecture related to lightweight multiplication in \(\mathbb{F}_{2^n} \) (Q2285775) (← links)
- Efficient systolic multiplications in composite fields for cryptographic systems (Q2321671) (← links)
- Look-up table-based large finite field multiplication in memory constrained cryptosystems (Q4571367) (← links)