Pages that link to "Item:Q3975194"
From MaRDI portal
The following pages link to Systolic architectures for multiplication over finite field \(GF(2^ m)\) (Q3975194):
Displaying 10 items.
- Partitioned systolic architecture for modular multiplication in \(\mathrm{GF}(2^{m})\) (Q294869) (← links)
- Multiplexer-based bit-parallel systolic multipliers over GF(\(2^m)\) (Q937456) (← links)
- More efficient systolic arrays for multiplication in GF\((2^m)\) using LSB first algorithm with irreducible polynomials and trinomials (Q1013353) (← links)
- Efficient systolic multiplications in composite fields for cryptographic systems (Q2321671) (← links)
- (Q4443244) (← links)
- Efficient multiplier architectures for Galois fields GF(2/sup 4n/) (Q4571442) (← links)
- Parallel Processing and Applied Mathematics (Q5307439) (← links)
- Computational Science – ICCS 2005 (Q5709619) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901247) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901302) (← links)
