Now MAGMA uses SS/FFT down to degree 16 at least, for 1000 bit. But now they really screwed up their algorithm, because I can use MAGMA to multiply 2400 degree polynomials considerably faster than they do it themselves.
Anyhow, I found another trick for going to 2^(l+2) digit numbers for the same cost (a factor of 4 times higher degree than what you'd normally get), which is obviously what they are using. But I know quite a few additional tricks now. So they are still beatable, in some cases by quite a healthy margin I think. Bill. --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
