The Community for Technology Leaders
Green Image
Issue No. 02 - February (2012 vol. 61)
ISSN: 0018-9340
pp: 151-163
Ashkan Hosseinzadeh Namin , University of Waterloo, Waterloo
M. Anwar Hasan , University of Waterloo, Waterloo
Christophe Negre , University of Waterloo, Waterloo and Université de Perpignan, Perpignan
Nicolas Méloni , Université de Toulon-Var, Toulon
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).
Binary field, subquadratic space complexity multiplier, Toeplitz matrix, block recombination.
Ashkan Hosseinzadeh Namin, M. Anwar Hasan, Christophe Negre, Nicolas Méloni, "Block Recombination Approach for Subquadratic Space Complexity Binary Field Multiplication Based on Toeplitz Matrix-Vector Product", IEEE Transactions on Computers, vol. 61, no. , pp. 151-163, February 2012, doi:10.1109/TC.2010.276
114 ms
(Ver 3.1 (10032016))