Low-complexity bit-parallel systolic multipliers over GF(2m)

@article{Lee2008LowcomplexityBS,
  title={Low-complexity bit-parallel systolic multipliers over GF(2m)},
  author={Chiou-Yng Lee},
  journal={Integration},
  year={2008},
  volume={41},
  pages={106-112}
}
Highly Cited
This paper has 43 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 26 extracted citations

Systolic and Super-Systolic Multipliers for Finite Field $GF(2^{m})$ Based on Irreducible Trinomials

IEEE Transactions on Circuits and Systems I: Regular Papers • 2008
View 4 Excerpts
Highly Influenced

New digit-serial three-operand multiplier over binary extension fields for high-performance applications

2017 2nd IEEE International Conference on Computational Intelligence and Applications (ICCIA) • 2017
View 1 Excerpt

A novel polynomial basis multiplier for arbitrary elliptic curves over GF (2m)

International Conference for Convergence for Technology-2014 • 2014
View 2 Excerpts

Similar Papers

Loading similar papers…