Pages that link to "Item:Q5714120"
From MaRDI portal
The following pages link to Information Security and Cryptology - ICISC 2003 (Q5714120):
Displaying 9 items.
- Efficient bit-parallel multipliers over finite fields GF\((2^m)\) (Q605724) (← links)
- Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials (Q963444) (← links)
- Efficient multiplier based on hybrid approach for Toeplitz matrix-vector product (Q1685022) (← links)
- Parallel \(\mathrm{GF}(3^m)\) multiplier for trinomials (Q1943625) (← links)
- Speedup of bit-parallel Karatsuba multiplier in \(\mathrm{GF}(m^2)\) generated by trinomials (Q1944906) (← links)
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers (Q2512883) (← links)
- Circuit level realization of low latency radix-4 Booth scheme for parallel multipliers (Q2676842) (← links)
- Reducing the Computation Time in (Short Bit-Width) Two's Complement Multipliers (Q5280620) (← links)
- Improved Design of High-Performance Parallel Decimal Multipliers (Q5280770) (← links)
