Paper 2007/393 Original: eprint.iacr.org/2007/393 ↗
Overlap-free Karatsuba-Ofman Polynomial Multiplication Algorithms
Abstract
We describe how a simple way to split input operands allows for fast VLSI implementations of subquadratic $GF(2)[x]$ Karatsuba-Ofman multipliers. The theoretical XOR gate delay of the resulting multipliers is reduced significantly. For example, it is reduced by about 33\% and 25\% for $n=2^{t}$ and $n=3^{t}$ $(t>1)$, respectively. To the best of our knowledge, this parameter has never been improved since the original Karatsuba-Ofman algorithm was first used to design $GF(2^n)$ multipliers in 1990.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2010-06-28: last updated
- 2007-10-14: published
- Short URL
- https://ia.cr/2007/393
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2007/393,
author = {Haining Fan and Jiaguang Sun and Ming Gu and Kwok-Yan Lam},
title = {Overlap-free Karatsuba-Ofman Polynomial Multiplication Algorithms},
howpublished = {Cryptology {ePrint} Archive, Paper 2007/393},
year = {2007},
url = {https://eprint.iacr.org/2007/393}
}