Complexity Analysis and Efficient Implementations of Bit Parallel Finite Field Multipliers Based on Karatsuba-Ofman Algorithm on FPGAs

Gang Zhou, Harald Michalik, László Hinsenkamp. Complexity Analysis and Efficient Implementations of Bit Parallel Finite Field Multipliers Based on Karatsuba-Ofman Algorithm on FPGAs. IEEE Trans. VLSI Syst., 18(7):1057-1066, 2010. [doi]

@article{ZhouMH10,
  title = {Complexity Analysis and Efficient Implementations of Bit Parallel Finite Field Multipliers Based on Karatsuba-Ofman Algorithm on FPGAs},
  author = {Gang Zhou and Harald Michalik and László Hinsenkamp},
  year = {2010},
  doi = {10.1109/TVLSI.2009.2020088},
  url = {http://dx.doi.org/10.1109/TVLSI.2009.2020088},
  tags = {rule-based, analysis},
  researchr = {https://researchr.org/publication/ZhouMH10},
  cites = {0},
  citedby = {0},
  journal = {IEEE Trans. VLSI Syst.},
  volume = {18},
  number = {7},
  pages = {1057-1066},
}