Pages that link to "Item:Q4571282"
From MaRDI portal
The following pages link to Bit-parallel finite field multiplier and squarer using polynomial basis (Q4571282):
Displaying 11 items.
- Polynomial basis multiplication over \(\text{GF}(2^m)\) (Q850783) (← links)
- An extension of TYT inversion algorithm in polynomial basis (Q991790) (← links)
- High-performance hardware architecture of elliptic curve cryptography processor over \(\text{GF}(2^{163})\) (Q1045615) (← links)
- Fast modular reduction and squaring in \(\mathrm{GF}(2^m)\) (Q1705651) (← links)
- Speedup of bit-parallel Karatsuba multiplier in \(\mathrm{GF}(m^2)\) generated by trinomials (Q1944906) (← links)
- Efficient systolic multiplications in composite fields for cryptographic systems (Q2321671) (← links)
- On the arithmetic operations over finite fields of characteristic three with low complexity (Q2349632) (← links)
- Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials (Q2413208) (← links)
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers (Q2512883) (← links)
- A three-term Karatsuba multiplier for a special class of trinomials (Q5865701) (← links)
- Reduction-free multiplication for finite fields and polynomial rings (Q6169003) (← links)