Wraparound multiplicaton vs mullo
dmharvey at cims.nyu.edu
Thu Oct 22 16:03:17 CEST 2009
On Oct 22, 2009, at 6:25 AM, Niels Möller wrote:
> bodrato at mail.dm.unipi.it writes:
>> I think it would be better to implement a recursive function:
>> compute the product Mod x^4-1 by computing it Mod x^2-1 and Mod
>> x^2+1, then using CRT.
> I've implemented a divide-and-conquer algorithm like that now, and it
> looks good.
Cool, these numbers look very promising!
More information about the gmp-devel