Improved Three-Way Split Formulas for Binary Polynomial Multiplication - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Improved Three-Way Split Formulas for Binary Polynomial Multiplication

Abstract

In this paper we deal with 3-way split formulas for binary field multiplication with five recursive multiplications of smaller sizes. We first recall the formula proposed by Bernstein at CRYPTO 2009 and derive the complexity of a parallel multiplier based on this formula. We then propose a new set of 3-way split formulas with five recursive multiplications based on field extension. We evaluate their complexities and provide a comparison.

Dates and versions

hal-00813666 , version 1 (16-04-2013)

Identifiers

Cite

Murat Cenk, Christophe Negre, Anwar Hasan. Improved Three-Way Split Formulas for Binary Polynomial Multiplication. SAC: Selected Areas in Cryptography, Aug 2011, Toronto, Canada. pp.384-398, ⟨10.1007/978-3-642-28496-0_23⟩. ⟨hal-00813666⟩
115 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More