Improved three-way split formulas for binary polynomial multiplication

Authors:
Murat Cenk;Christophe Negre;M. Anwar Hasan
Affiliations:
Department of Electrical and Computer Engineering, University of Waterloo, Canada;Department of Electrical and Computer Engineering, University of Waterloo, Canada;Department of Electrical and Computer Engineering, University of Waterloo, Canada
Venue:
SAC'11 Proceedings of the 18th international conference on Selected Areas in Cryptography
Year:
2011

Citing 6
Cited 0

Use of elliptic curves in cryptography

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
A Generalized Method for Constructing Subquadratic Complexity GF(2^k) Multipliers

IEEE Transactions on Computers
A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields

IEEE Transactions on Computers
Polynomial Multiplication over Finite Fields Using Field Extensions and Interpolation

ARITH '09 Proceedings of the 2009 19th IEEE Symposium on Computer Arithmetic
Batch Binary Edwards

CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
The security and performance of the galois/counter mode (GCM) of operation

INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India

Quantified Score

Hi-index	0.00

Visualization

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.