Paper
12 September 2007 On matrix-vector product based sub-quadratic arithmetic complexity schemes for field multiplication
Author Affiliations +
Abstract
Using an efficient way to compute the product of a Toeplitz matrix and a vector, a sub-quadratic arithmetic complexity scheme for field multiplication over binary extension fields has recently been proposed by Fan and Hasan. The scheme has been developed using a shifted polynomial basis for the representation of the field elements and has been stated to be applicable to the conventional polynomial basis, although with an increased gate delay for some field defining polynomials. The conventional polynomial basis is widely used in practice and is part of different recommendations and standards for cryptographic applications. In this article, we give additional details of the sub-quadratic complexity algorithm for the case of the polynomial basis by presenting efficient transformation matrices for a class of low weight field defining polynomials, namely trinomials.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
M. A. Hasan "On matrix-vector product based sub-quadratic arithmetic complexity schemes for field multiplication", Proc. SPIE 6697, Advanced Signal Processing Algorithms, Architectures, and Implementations XVII, 669702 (12 September 2007); https://doi.org/10.1117/12.734195
Lens.org Logo
CITATIONS
Cited by 5 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Matrices

Logic devices

Computing systems

Binary data

Cryptography

Fluctuations and noise

Space operations

RELATED CONTENT

Digital Optical Iterative Pattern Recognizer
Proceedings of SPIE (May 03 1988)
The seven wonders of computer arithmetic
Proceedings of SPIE (October 26 2004)
Polychromatism In Optical Digital Processors
Proceedings of SPIE (February 08 1988)
On-Line Arithmetic: An Overview
Proceedings of SPIE (November 28 1984)
Parity-preserving transformations in computer arithmetic
Proceedings of SPIE (December 06 2002)

Back to Top