Efficient reconfigurable implementation of canonical and normal basis multipliers over Galois fields GF (2ᵐ) generated by AOPs
From MaRDI portal
Publication:2432149
Recommendations
- Bit-parallel arithmetic implementations over finite fields \(\text{GF}(2^m)\) with reconfigurable hardware
- Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
- Structure of parallel multipliers for a class of fields GF(2^ m)
- scientific article; zbMATH DE number 1878331
- Computational Science and Its Applications – ICCSA 2004
Cites work
- A modified Massey-Omura parallel multiplier for a class of finite fields
- An efficient optimal normal basis type II multiplier
- GF(2/sup m/) multiplication and division over the dual basis
- Hankel matrices and lattice paths
- scientific article; zbMATH DE number 424718 (Why is no real title available?)
- Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
- Structure of parallel multipliers for a class of fields GF(2^ m)
Cited in
(3)- Bit-parallel arithmetic implementations over finite fields \(\text{GF}(2^m)\) with reconfigurable hardware
- Theoretical bases, methods, and processors for transforming information in Galois field codes on the basis of the vertical information technology
- Reconfigurable design of Galois field multiplication in symmetric cryptography
This page was built for publication: Efficient reconfigurable implementation of canonical and normal basis multipliers over Galois fields GF \((2^{m})\) generated by AOPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2432149)
