NTT multiplication.

David Harvey dmharvey at
Wed May 13 17:15:32 CEST 2009

On May 12, 2009, at 4:04 PM, Aleksey Bader wrote:

> P.S. Reletevly recent, Martin Furer published new multiplication  
> algorithm with very low asymptotic complexity.
> Q3. Any known (tries of) implementions (in GMP O:)? Maybe someone  
> think about it (disregard to author's claim that his method  
> outperforms  Schönhage-Strassen on "astonomically large  
> numbers" :-) )?

Dan Bernstein has some notes on this, he seems to think it could be  


-------------- next part --------------
An HTML attachment was scrubbed...
URL: <>

More information about the gmp-devel mailing list