Low complexity word-level sequential normal basis multipliers

@article{ReyhaniMasoleh2005LowCW,
  title={Low complexity word-level sequential normal basis multipliers},
  author={Arash Reyhani-Masoleh and M. Anwar Hasan},
  journal={IEEE Transactions on Computers},
  year={2005},
  volume={54},
  pages={98-110}
}
For efficient hardware implementation of finite field arithmetic units, the use of a normal basis is advantageous. In this paper, two classes of architectures for multipliers over the finite field GF(2/sup m/) are proposed. These multipliers are of sequential type, i.e., after receiving the coordinates of the two input field elements, they go through k, 1 /spl les/ k /spl les/ m, iterations (i.e., clock cycles) to finally yield all the coordinates of the product in parallel. The value of k… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 70 citations. REVIEW CITATIONS

15 Figures & Tables

Topics

Statistics

051015'05'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

71 Citations

Semantic Scholar estimates that this publication has 71 citations based on the available data.

See our FAQ for additional information.