Error detection in polynomial basis multipliers over binary extension fields
From MaRDI portal
Recommendations
- Concurrent all-cell error detection in semi-systolic multiplier using linear codes
- Bit Serial Multiplication in Finite Fields
- On low complexity bit parallel polynomial basis multipliers.
- Multiplexer-based bit-parallel systolic multipliers over GF(\(2^m)\)
- GF(2/sup m/) multiplication and division over the dual basis
Cited in
(4)
This page was built for publication: Error detection in polynomial basis multipliers over binary extension fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4425739)