HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

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).
Document type :
Journal articles
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-00813698
Contributor : Christophe Negre Connect in order to contact the contributor
Submitted on : Tuesday, April 16, 2013 - 10:22:30 AM
Last modification on : Tuesday, March 15, 2022 - 12:55:38 PM

Links full text

Identifiers

Citation

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

Share

Metrics

Record views

184