16 citations · 59 across the 20 of their papers we have counts for
3 papers · 1 filter
Modular SIMD arithmetic in Mathemagix
Joris van der Hoeven, Grégoire Lecerf, Guillaume Quintin
Modular integer arithmetic occurs in many algorithms for computer algebra, cryptography, and error correcting codes. Although recent microprocessors typically offer a wide range of…
Faster polynomial multiplication over finite fields
David Harvey, Joris van der Hoeven, Grégoire Lecerf
Let p be a prime, and let M_p(n) denote the bit complexity of multiplying two polynomials in F_p[X] of degree less than n. For n large compared to p, we establish the bound M_p(n)…
Even faster integer multiplication
David Harvey, Joris van der Hoeven, Grégoire Lecerf
We give a new proof of Fürer's bound for the cost of multiplying n-bit integers in the bit complexity model. Unlike Fürer, our method does not require constructing special coeffici…