## Section: New Results

### Big prime field FFT on multi-core processors

In [9], Svyatoslav Covanov, together with Davood Mohajerani, Marc Moreno Maza, and Linxiao Wang (all from ORCCA, Canada), have worked on a multi-threaded implementation of Fast Fourier Transforms over generalized Fermat prime fields. This work extends their previous study realized on graphics processing units to multi-core processors. In this new context, they overcome the less fine control of hardware resources by successively using FFT in support of the multiplication in those fields. They obtain favorable speedup factors (up to 6.9$\times $ on a 6-core, 12 threads node, and 4.3$\times $ on a 4-core, 8 threads node) of their parallel implementation compared to the serial implementation for the overall application thanks to the low memory footprint and the sharp control of arithmetic instructions of their implementation of generalized Fermat prime fields.