PDF e-Pub

## Section: New Results

### Big Prime Field FFT on the GPU

Participant : Svyatoslav Covanov.

In colloboration with L. Chen, D. Mohajerani and M. Moreno Maza, in [11], we compare various methods for the multiplication of polynomials, using the GPU. We compare the CRT method, using $k$ machine-word primes, to the generalized Fermat prime method, for a prime of $k$ machine-words, inspired by the work in  [28]. For some degrees and $k$, we prove that the arithmetic operations with the generalized Fermat primes offer attractive performance both in terms of algebraic complexity and parallelism.