Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
J. M. Pollard (1971) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: