 In March 2019, David Harvey and Joris van der Hoeven () released a paper describing an multiplication algorithm.Using number-theoretic transforms instead of discrete Fourier transforms avoids rounding error problems by using modular arithmetic instead of floating-point arithmetic.In order to apply the factoring which enables the FFT to work, the length of the transform must be factorable to small primes and must be a factor of , where "N" is the field size.