Skip to Main content Skip to Navigation
Conference papers

Improved Three-Way Split Formulas for Binary Polynomial Multiplication

Murat Cenk 1 Christophe Negre 2, 3 Anwar Hasan 1
3 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 : 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.
Document type :
Conference papers
Complete list of metadata
Contributor : Christophe Negre Connect in order to contact the contributor
Submitted on : Tuesday, April 16, 2013 - 9:51:20 AM
Last modification on : Tuesday, March 15, 2022 - 12:55:40 PM

Links full text



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⟩



Record views