Improved Three-Way Split Approach for Binary Polynomial Multiplication Based on Optimized Reconstruction - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2013

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

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).
Fichier principal
Vignette du fichier
ext-bernstein-3way-split-case-v4.pdf (411.17 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00788646 , version 1 (14-02-2013)

Identifiers

  • HAL Id : hal-00788646 , version 1

Cite

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

Share

Gmail Mastodon Facebook X LinkedIn More