Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.


The fast Fourier transform in a finite field
HTML articles powered by AMS MathViewer

by J. M. Pollard PDF
Math. Comp. 25 (1971), 365-374 Request permission


A transform analogous to the discrete Fourier transform may be defined in a finite field, and may be calculated efficiently by the ’fast Fourier transform’ algorithm. The transform may be applied to the problem of calculating convolutions of long integer sequences by means of integer arithmetic.
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 65T05
  • Retrieve articles in all journals with MSC: 65T05
Additional Information
  • © Copyright 1971 American Mathematical Society
  • Journal: Math. Comp. 25 (1971), 365-374
  • MSC: Primary 65T05
  • DOI:
  • MathSciNet review: 0301966