Logo image
Se connecter
Retour
Improved Three-Way Split Formulas for Binary Polynomial Multiplication
Acte de colloque   Open Access

Improved Three-Way Split Formulas for Binary Polynomial Multiplication

Murat Cenk, Christophe Negre et Anwar Hasan
18th International Workshop on Selected Areas in Cryptography, Vol.LNCS(7118), pp.384-398
Selected Areas in Cryptography
SAC: Selected Areas in Cryptography (Toronto, Canada, 11/08/2011–12/08/2011)
2012
DOI: https://doi.org/10.1007/978-3-642-28496-0_23

Résumé

Computer arithmetic Cost/performance High-Speed Arithmetic Algorithms Arithmetic and Logic Structures
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.

Fichiers et liens (2)

url
Find in HALAfficher
url
https://doi.org/10.1007/978-3-642-28496-0_23Afficher
Published (Version of record) Ouvrir

Indicateurs

1 Consultations de la notice

Détails

Logo image