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).
Type de document :
Article dans une revue
IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2012, 61 (2), pp.151-163. 〈10.1109/TC.2010.276〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00813698
Contributeur : Christophe Negre <>
Soumis le : mardi 16 avril 2013 - 10:22:30
Dernière modification le : mercredi 20 juin 2018 - 15:20:01

Lien texte intégral

Identifiants

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〉

Partager

Métriques

Consultations de la notice

236