More efficient systolic arrays for multiplication in GF(2ᵐ) using LSB first algorithm with irreducible polynomials and trinomials
From MaRDI portal
(Redirected from Publication:1013353)
More efficient systolic arrays for multiplication in GF\((2^m)\) using LSB first algorithm with irreducible polynomials and trinomials
More efficient systolic arrays for multiplication in GF\((2^m)\) using LSB first algorithm with irreducible polynomials and trinomials
Recommendations
- Computational Science and Its Applications – ICCSA 2004
- Unidirectional Two Dimensional Systolic Array for Multiplication in GF(2 m ) Using LSB First Algorithm
- Computational Science and Its Applications – ICCSA 2004
- Design of a linear systolic array for computing modular multiplication and squaring in \(\text{GF}(2^m)\)
- scientific article; zbMATH DE number 17850
- Low Complexity Systolic Architecture for Modular Multiplication over GF(2 m )
- Low complexity bit parallel multiplier for GF(2ᵐ) generated by equally-spaced trinomials
- Combining multiplication methods with optimized processing sequence for polynomial multiplier in \(\mathrm{GF}(2^k)\)
- Bit-level systolic array for fast exponentiation in GF(2/sup m/)
Cited in
(3)
This page was built for publication: More efficient systolic arrays for multiplication in GF\((2^m)\) using LSB first algorithm with irreducible polynomials and trinomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1013353)
