"Complexity Analysis and Efficient Implementations of Bit Parallel Finite ..."

Gang Zhou, Harald Michalik, László Hinsenkamp (2010)

> Home

Details and statistics

DOI: 10.1109/TVLSI.2009.2020088

access: closed

type: Journal Article

metadata version: 2020-03-11

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tvlsi/ZhouMH10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tvlsi/ZhouMH10
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. Very Large Scale Integr. Syst. 18(7): 1057-1066 (2010)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.