Skip to Main content Skip to Navigation

Improved Three-Way Split Approach for Binary Polynomial Multiplication Based on Optimized Reconstruction

Christophe Negre 1, 2
2 DALI - Digits, Architectures et Logiciels Informatiques
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, UPVD - Université de Perpignan Via Domitia
Abstract : At Crypto 2009, Bernstein initiated an optimization of Karatsuba formula for binary polynomial multiplication by reorganizing the computations in the reconstruction part of two recursions of the formula. This approach was generalized in (HAL00724778) to an arbitrary number of recursions resulting in the best known bit parallel multiplier based on Karatsuba formula. In this paper we extend this approach to three-way split formula: we first reorganize two recursions and then extend this re-organization to an arbitrary number s of recursions. We obtain a parallel multiplier with a space complexity of 4.68 n^(\log_3(6))+O(n) XOR gates and n(\log_3(6)) AND gates and a delay of 3log_3(n)D_X+D_A. This improves the previous best known results regarding space complexity of~\cite{murat-3way} and reaches the same time complexity as the the best known approach (Fan-et al. 2010).
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Christophe Negre Connect in order to contact the contributor
Submitted on : Thursday, February 14, 2013 - 6:45:52 PM
Last modification on : Tuesday, March 15, 2022 - 12:55:39 PM
Long-term archiving on: : Sunday, April 2, 2017 - 12:04:41 AM


Files produced by the author(s)


  • HAL Id : hal-00788646, version 1


Christophe Negre. Improved Three-Way Split Approach for Binary Polynomial Multiplication Based on Optimized Reconstruction. [Research Report] RR-1300x, Lirmm. 2013. ⟨hal-00788646⟩



Record views


Files downloads