I can't get MAGMA to go that fast. I timed it doing 1000 multiplies of degree 255 polynomials with coefficients of 1000 bits. It took 15 seconds or thereabouts.
I timed a similar thing with NTL and it took 17 seconds. They seem comparable to me. The only thing I didn't do is amortize the cost of finding the 1000 bit random numbers in MAGMA, whereas I did in NTL (it's harder to do in MAGMA). But I timed this separately in MAGMA and it was only about 10% of the total time. At any rate, I don't see anything like the factor of five that was spoken of. Magma may be quite a bit faster than NTL for sparse polynomials. Were the polynomials that you tested sparse, David Harvey? 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/ -~----------~----~----~----~------~----~------~--~---
