On comparison and analysis of algorithms for multiplication in GF(2ᵐ)
From MaRDI portal
Publication:960503
Recommendations
Cited in
(11)- Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$
- Faster Multiplication in GF(2)[x]
- On computing multiplicative inverses in GF(2/sup m/)
- Efficient circuits for multiplying in GF(\(2^ m\)) for certain values of \(m\)
- scientific article; zbMATH DE number 1583946 (Why is no real title available?)
- A new algorithm for multiplication in finite fields
- scientific article; zbMATH DE number 1504805 (Why is no real title available?)
- scientific article; zbMATH DE number 545390 (Why is no real title available?)
- The VLSI Implementation of a Reed—Solomon Encoder Using Berlekamp's Bit-Serial Multiplier Algorithm
- scientific article; zbMATH DE number 4102996 (Why is no real title available?)
- An optimal algorithm for multiplication in \(\mathbb{F}_{256}/\mathbb{F}_ 4\)
This page was built for publication: On comparison and analysis of algorithms for multiplication in \(\mathrm{GF}(2^m)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960503)