The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
The fast Fourier transform in a finite field
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An algorithm for the machine calculation of complex Fourier series
Cooley, J. W., & Tukey, J. W. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0178586-1 · Cited by 13,154
An introduction to the theory of numbers
(1960) · Journal of the Franklin Institute · doi:10.1016/0016-0032(60)90676-1 · Cited by 3,574
Golomb, S. W. (2017) · WORLD SCIENTIFIC eBooks · doi:10.1142/9361 · Cited by 2,180
Gallager, R. G., & Peterson, W. W. (1962) · Mathematics of Computation · doi:10.2307/2003832 · Cited by 2,041
Cattermole, K. W. (1968) · Electronics and Power · doi:10.1049/ep.1968.0141 · Cited by 1,319
A guided tour of the fast Fourier transform
Bergland, G. D. (1969) · IEEE Spectrum · doi:10.1109/mspec.1969.5213896 · Cited by 673
Hadamard transform image coding
Pratt, W. K., Kane, J., & Andrews, H. C. (1969) · Proceedings of the IEEE · doi:10.1109/proc.1969.6869 · Cited by 657
What is the fast Fourier transform?
Cochran, W. T., Cooley, J. W., Favin, D. L., Helms, H. D., Kaenel, R. A., Lang, W. W., Maling, G. C., Nelson, D. E., Rader, C. M., & Welch, P. D. (1967) · Proceedings of the IEEE · doi:10.1109/proc.1967.5957 · Cited by 493
What is the fast Fourier transform?
Cochran, W., Cooley, J., Favin, D., Helms, H., Kaenel, R., Lang, W., Maling, G., Nelson, D., Rader, C., & Welch, P. (1967) · IEEE Transactions on Audio and Electroacoustics · doi:10.1109/tau.1967.1161899 · Cited by 490
The Higher Arithmetic : An Introduction to the Theory of Numbers
Davenport, H. (1952) · Cited by 140
Cited by
CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM
Bos, J., Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schanck, J. M., Schwabe, P., Seiler, G., & Stehle, D. (2018) · 2018 IEEE European Symposium on Security and Privacy (EuroS&P) · doi:10.1109/eurosp.2018.00032 · Cited by 1,192
Fast Convolution using fermat number transforms with applications to digital filtering
Agarwal, R., & Burrus, C. (1974) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1974.1162555 · Cited by 295
Fast Algorithms for Signal Processing
Blahut, R. E. (2010) · doi:10.1017/cbo9780511760921 · Cited by 274
Number theoretic transforms to implement fast digital convolution
Agarwal, R. C., & Burrus, C. S. (1975) · Proceedings of the IEEE · doi:10.1109/proc.1975.9791 · Cited by 269
Feedback shift registers, 2-adic span, and combiners with memory
Klapper, A., & Goresky, M. (1997) · Journal of Cryptology · doi:10.1007/s001459900024 · Cited by 264
Metadata
- Authors
- Pollard, J. M.
- Venue
- Mathematics of Computation
- Publisher
- American Mathematical Society (AMS)
- Published
- 1971
- Volume
- 25
- Issue
- 114
- Pages
- 365-374
- ISSN
- 0025-5718 (ISSN-L)
- 1088-6842
- OpenAlex
- W2069448237
- Cited by
- 467
- References
- 10
- FWCI
- 4.31
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The fast Fourier transform in a finite field. https://app.cochat.ai/papers/10.1090/s0025-5718-1971-0301966-0
- The paper
- Pollard, J. M. (1971). The fast Fourier transform in a finite field. Mathematics of Computation. https://doi.org/10.1090/s0025-5718-1971-0301966-0
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.