Article thumbnail

On the complexity of multiplication in finite fields

By A. Lempel, G. Seroussi and S. Winograd


AbstractIn this paper we study the bilinear complexity of multiplying two arbitrary elements from an nth degree extension Φ of a finite field F, and the related problem of multiplying, over F, two polynomials of degree n − 1 with indeterminate coefficients. We derive a new linear lower bound, and we describe an algorithm leading to a quasi-linear upper bound

Publisher: Published by Elsevier B.V.
Year: 1983
DOI identifier: 10.1016/0304-3975(83)90108-1
OAI identifier:

Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.