Block Recombination Approach for Subquadratic Space Complexity Binary Field Multiplication based on Toeplitz Matrix-Vector Product - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Computers Year : 2012

Block Recombination Approach for Subquadratic Space Complexity Binary Field Multiplication based on Toeplitz Matrix-Vector Product

Abstract

In this paper, we present a new method for parallel binary finite field multiplication which results in subquadratic space complexity. The method is based on decomposing the building blocks of the Fan-Hasan subquadratic Toeplitz matrix-vector multiplier. We reduce the space complexity of their architecture by recombining the building blocks. In comparison to other similar schemes available in the literature, our proposal presents a better space complexity while having the same time complexity. We also show that block recombination can be used for efficient implementation of the GHASH function of Galois Counter Mode (GCM).

Dates and versions

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

Identifiers

Cite

Anwar Hasan, Nicolas Méloni, Ashkan Hosseinzadeh Namin, Christophe Negre. Block Recombination Approach for Subquadratic Space Complexity Binary Field Multiplication based on Toeplitz Matrix-Vector Product. IEEE Transactions on Computers, 2012, 61 (2), pp.151-163. ⟨10.1109/TC.2010.276⟩. ⟨hal-00813698⟩
203 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More