A Tour of NTL: Some Performance Data
Here are some timing figures from using NTL. They were obtained using NTL 7.0 compiled with g++ 4.2.1 and with GMP 5.1 on a 2.8GHz Intel Core 2 Duo running on Max OSX 10.6.8.
All times are ins seconds. The times were obtained using the program Timing included in the distribution. The data was generated using NTL's random number generator, but running this on a different machine should (in theory) generate the same data.
multiply 1000-bit ints: 4.47784e-07 remainder 2000/1000-bit ints: 8.39371e-07 gcd 1000-bit ints: 1.06022e-05 multiply degree-1000 poly mod 1000-bit prime: 0.0219381 remainder degree-2000/1000 poly mod 1000-bit prime: 0.0634543 preconditioned remainder degree-2000/1000 poly mod 1000-bit prime: 0.0221471 gcd degree-1000 poly mod 1000-bit prime: 0.474409 multiply degree-1000 int poly with 1000-bit coeffs: 0.0162051 factoring degree-1000 poly mod 1000-bit prime... square-free decomposition...0.474527 factoring multiplicity 1, deg = 1000 computing X^p...35.2584 computing DDF...generating baby steps...+++++++++++++++++++++20.3491 generating giant steps...++++++++++++++++++++++21.2315 giant refine...++++split 1 43 split 2 38 split 3 64 *++++split 5 108 *++++split 11 237 split 12 510 *giant refine time: 12.4869 baby refine...split 3 6 split 6 6 split 9 9 split 22 22 split 38 38 split 64 64 split 108 108 split 237 237 split 248 248 split 262 262 baby refine time: 0.891584 DDF time: 54.9709 computing EDF(3,2)...+0.076551 ...total time = 90.8269 multiply 500-bit GF2Xs: 1.02688e-06 remainder 1000/500-bit GF2Xs: 6.41996e-06 gcd 500-bit GF2Xs: 1.19903e-05 factoring degree-500 GF2X: 0.00108857 gcd 500-bit GF2X: 1.19912e-05 multiply degree-500 poly mod 500-bit GF2X: 0.0246024 remainder degree-1000/500 poly mod 500-bit GF2X: 0.0883719 preconditioned remainder degree-1000/500 poly mod 500-bit GF2X: 0.0492817 gcd degree-500 poly mod 500-bit GF2X: 0.55643 factoring degree-500 poly mod 500-bit GF2X... square-free decomposition...0.038026 factoring multiplicity 1, deg = 250 computing X^p...4.93042 computing DDF...generating baby steps...++++++++++3.50638 generating giant steps...+++++++++++3.77895 giant refine...++++*++++split 6 59 split 7 68 *split 0 123 giant refine time: 2.59095 baby refine...split 59 59 split 68 68 split 123 123 baby refine time: 5.6e-05 DDF time: 9.87652 ...total time = 14.8591