• Publication
  • 2010
  • Issue No. 7 - July
  • Abstract - Comments on "A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Field"
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Comments on "A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Field"
July 2010 (vol. 59 no. 7)
pp. 1007-1008
ASCII Text
x 
 
Gang Zhou, Harald Michalik, "Comments on "A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Field"," IEEE Transactions on Computers, vol. 59, no. 7, pp. 1007-1008, July, 2010.
 
 
BibTex
x
 
@article{ 10.1109/TC.2010.46,
author = {Gang Zhou and Harald Michalik},
title = {Comments on "A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Field"},
journal ={IEEE Transactions on Computers},
volume = {59},
number = {7},
issn = {0018-9340},
year = {2010},
pages = {1007-1008},
doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2010.46},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Comments on "A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Field"
IS - 7
SN - 0018-9340
SP1007
EP1008
EPD - 1007-1008
A1 - Gang Zhou,
A1 - Harald Michalik,
PY - 2010
KW - Karatsuba algorithm
KW - polynomial multiplication
KW - finite field.
VL - 59
JA - IEEE Transactions on Computers
ER -
 
Gang Zhou, Technical University of Braunschweig, Braunschweig
Harald Michalik, Technical University of Braunschweig, Braunschweig
In this comment, we show that the gate complexity of Karatsuba polynomial multipliers presented in the above paper can be reduced by exploring the common subexpressions.

[1] C. Paar, "A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Fields," IEEE Trans. Computers, vol. 45, no. 7, pp. 856-861, July 1996.
[2] B. Sunar, "A Generalized Method for Constructing Subquadratic Complexity $GF(2^k)$ Multipliers," IEEE Trans. Computers, vol. 53, no. 9, pp. 1097-1105, Sept. 2004.
[3] P.L. Montgomery, "Five, Six, and Seven-Term Karatsuba-Like Formulae," IEEE Trans. Computers, vol. 54, no. 3, pp. 362-369, Mar. 2005.
[4] A. Weimerskirch and C. Paar, "Generalizations of the Karatsuba Algorithm for Efficient Implementations," eprint Archive, http://eprint.iacr.org/2006224.pdf, 2006.
[5] H. Fan and M.A. Hasan, "A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields," IEEE Trans. Computers, vol. 56, no. 2, pp. 224-233, Feb. 2007.
[6] H. Fan, J. Sun, M. Gu, and K.-Y. Lam, "Overlap-Free Karatsuba-Ofman Polynomial Multiplication Algorithm," Cryptology ePrint Archive, http://eprint.iacr.org/2007393.pdf, 2007.

Index Terms:
Karatsuba algorithm, polynomial multiplication, finite field.
Citation:
Gang Zhou, Harald Michalik, "Comments on "A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Field"," IEEE Transactions on Computers, vol. 59, no. 7, pp. 1007-1008, July 2010, doi:10.1109/TC.2010.46
Usage of this product signifies your acceptance of the Terms of Use.