#

A Tour of NTL: Some Performance Data

Here are some timing figures from using NTL. They were obtained using NTL 8.1 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.47705e-07
    remainder 2000/1000-bit ints: 8.39264e-07
    gcd 1000-bit ints: 1.00414e-05
    multiply degree-1000 poly mod 1000-bit prime: 0.0153934
    remainder degree-2000/1000 poly mod 1000-bit prime: 0.0433238
    preconditioned remainder degree-2000/1000 poly mod 1000-bit prime: 0.0157501
    gcd degree-1000 poly mod 1000-bit prime: 0.368628
    multiply degree-1000 int poly with 1000-bit coeffs: 0.0159159

    factoring degree-1000 poly mod 1000-bit prime...
    square-free decomposition...0.370933
    factoring multiplicity 1, deg = 1000
    computing X^p...24.9979
    computing DDF...generating baby steps...+++++++++++++++++++++17.5707
    generating giant steps...++++++++++++++++++++++18.3577
    giant refine...++++split 1 43
    split 2 38
    split 3 64
    *++++split 5 108
    *++++split 11 237
    split 12 510
    *giant refine time: 9.15376
    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.670223
    DDF time: 45.7607
    computing EDF(3,2)...+0.077173
    ...total time = 71.2393

    multiply 500-bit GF2Xs: 1.02584e-06
    remainder 1000/500-bit GF2Xs: 6.37183e-06
    gcd 500-bit GF2Xs: 1.19604e-05

    factoring degree-500 GF2X: 0.00109244
    gcd 500-bit GF2X: 1.19249e-05
    multiply degree-500 poly mod 500-bit GF2X: 0.0246363
    remainder degree-1000/500 poly mod 500-bit GF2X: 0.088353
    preconditioned remainder degree-1000/500 poly mod 500-bit GF2X: 0.0492548
    gcd degree-500 poly mod 500-bit GF2X: 0.554616

    factoring degree-500 poly mod 500-bit GF2X...
    square-free decomposition...0.038065
    factoring multiplicity 1, deg = 250
    computing X^p...4.93778
    computing DDF...generating baby steps...++++++++++3.50973
    generating giant steps...+++++++++++3.78204
    giant refine...++++*++++split 6 59
    split 7 68
    *split 0 123
    giant refine time: 2.58842
    baby refine...split 59 59
    split 68 68
    split 123 123
    baby refine time: 3.3e-05
    DDF time: 9.88039

    ...total time = 14.8705