New Bit Parallel Multiplier With Low Space Complexity for All Irreducible Trinomials Over $GF(2^{n})$

@article{Cho2012NewBP,
  title={New Bit Parallel Multiplier With Low Space Complexity for All Irreducible Trinomials Over \$GF(2^\{n\})\$},
  author={Young In Cho and Nam Su Chang and Chang Han Kim and Young-Ho Park and Seokhie Hong},
  journal={IEEE Transactions on Very Large Scale Integration (VLSI) Systems},
  year={2012},
  volume={20},
  pages={1903-1908}
}
Koç and Sunar proposed an architecture of the Mastrovito multiplier for the irreducible trinomial f(x)=xn+xk+1, where k ≠ n/2 to reduce the time complexity. Also, many multipliers based on the Karatsuba-Ofman algorithm (KOA) was proposed that sacrificed time efficiency for low space complexity. In this paper, a new multiplication formula which is a variant of KOA presented. We also provide a straightforward architecture of a non-pipelined bit-parallel multiplier using the new formula. The… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.
10 Citations
24 References
Similar Papers

Citations

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

References

Publications referenced by this paper.
Showing 1-10 of 24 references

A review of modular multiplication methods and respective hardware implementations

  • L. de Macedo Mourelle
  • IEEE Trans . Comput .
  • 2006

Similar Papers

Loading similar papers…