Karatsuba-Ofman Multiplier with Integrated Modular Reduction for GF(2m)

Karatsuba-Ofman Multiplier with Integrated Modular Reduction for GF(2m)

In this paper a novel GF(2m) multiplier based on Karatsuba-Ofman Algorithm is presented. A binary field multiplication in polynomial basis is typically viewed as a two steps process, a polynomial multiplication followed by a modular reduction step. This research proposes a modification to the orig...

Full description

Bibliographic Details
Main Authors: CUEVAS-FARFAN, E., MORALES-SANDOVAL, M., MORALES-REYES, A., FEREGRINO-URIBE, C., ALGREDO-BADILLO, I., KITSOS, P., CUMPLIDO, R.
Format: Article
Language:English
Published: Stefan cel Mare University of Suceava 2013-05-01
Series:Advances in Electrical and Computer Engineering
Subjects:
data security
cryptography
public key
algorithm design and analysis
field programmable gate arrays
Online Access:http://dx.doi.org/10.4316/AECE.2013.02001

Internet

http://dx.doi.org/10.4316/AECE.2013.02001

Similar Items