Article detail · 2019
Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
- Year
- 2019
- Type
- article
Data source split
- YÖKSİS YÖKSİS article record
- YÖKSİS venue IEEE Transactions on Computers
- Catalog match (ISSN) IEEE Transactions on Computers
- OpenAlex OpenAlex enrichment (abstract, citations, topics)
Abstract
OpenAlex · English
We present a new low-complexity bit-parallel canonical basis multiplier for the field GF(2m) generated by an all-one-polynomial. The proposed canonical basis multiplier requires m/sup 2/-1 XOR gates and m/sup 2/ AND gates. We also extend this canonical basis multiplier to obtain a new bit-parallel normal basis multiplier.
Topics
Citations
OpenAlex cited_by_count. Not a WoS or Scopus citation count; those sources have no separate column here.
186 citations
OpenAlex cited_by_count (cache / database)
8 publications in the local catalog that cite this work (OpenAlex reference match; not the full global list).
- Mastrovito multiplier for all trinomials 1999
- An efficient optimal normal basis type II multiplier 2019
- Mastrovito multiplier for general irreducible polynomials 2019
- Parallel multipliers based on special irreducible pentanomials 2003
- Mastrovito Multiplier for General Irreducible Polynomials 1999
- Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields 2002
- A Matrix Decomposition Method for Optimal Normal Basis Multiplication 2016
- A Matrix Decomposition Method for Optimal Normal Basis Multiplication. 2015