Skip to main content
SpringerLink
Log in

Polynomial multiplication over finite fields: from quadratic to straight-line complexity

  • Published:
computational complexity Aims and scope Submit manuscript

Abstract.

It is shown that computing the coefficients of the product of two degree-n polynomials over a finite field by a straight-line algorithm requires at least 3n − o(n) multiplications/divisions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Computer Science, Technion – Israel Institute of Technology, Haifa, 32000, Israel

    Nader H. Bshouty & Michael Kaminski

Authors
  1. Nader H. Bshouty
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Kaminski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nader H. Bshouty.

Additional information

Manuscript received 6 June 2005

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bshouty, N.H., Kaminski, M. Polynomial multiplication over finite fields: from quadratic to straight-line complexity. comput. complex. 15, 252–262 (2006). https://doi.org/10.1007/s00037-006-0215-4

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00037-006-0215-4

Keywords.

Subject classification.

Search

Navigation