Portal de Periódicos da CAPES

The Fast Fourier Transform in a Finite Field

1971; American Mathematical Society; Volume: 25; Issue: 114 Linguagem: Inglês

10.2307/2004932

1088-6842

J. M. Pollard,

Blind Source Separation Techniques

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.