Initial revision

[cln.git] / tests / timeMImisc5.cc

diff --git a/tests/timeMImisc5.cc b/tests/timeMImisc5.cc
new file mode 100644 (file)
index 0000000..36e8134
--- /dev/null
+++ b/tests/timeMImisc5.cc
@@ -0,0 +1,58 @@
+#include <cl_number.h>
+#include <cl_io.h>
+#include <cl_integer.h>
+#include <cl_modinteger.h>
+#include <stdlib.h>
+#include <string.h>
+#include <cl_timing.h>
+
+int main (int argc, char * argv[])
+{
+       int repetitions = 1;
+       if ((argc >= 3) && !strcmp(argv[1],"-r")) {
+               repetitions = atoi(argv[2]);
+               argc -= 2; argv += 2;
+       }
+       if (argc < 1)
+               exit(1);
+       cl_I p = "1269281897404513557783934075031171555202695168107";
+       cl_modint_ring R = cl_find_modint_ring(p);
+       {
+               cl_MI a = R->canonhom("1111111111111111111111111111111111111111111111111");
+               cl_MI b = R->canonhom("777777777777777777777777777777777777777777777777");
+               cl_stdout << "product modulo p" << endl;
+               { CL_TIMING;
+                 for (int rep = repetitions; rep > 0; rep--)
+                   { cl_MI c = R->mul(a,b); }
+               }
+               cl_stdout << "square modulo p" << endl;
+               { CL_TIMING;
+                 for (int rep = repetitions; rep > 0; rep--)
+                   { cl_MI c = R->square(a); }
+               }
+               cl_stdout << "quotient modulo p" << endl;
+               { CL_TIMING;
+                 for (int rep = repetitions; rep > 0; rep--)
+                   { cl_MI c = R->div(a,b); }
+               }
+       }
+       {
+               cl_MI a = R->canonhom("1234567890123456789012345678901234567890123456789");
+               cl_MI b = R->canonhom("909090909090909090909090909090909090909090909090");
+               cl_stdout << "product modulo p" << endl;
+               { CL_TIMING;
+                 for (int rep = repetitions; rep > 0; rep--)
+                   { cl_MI c = R->mul(a,b); }
+               }
+               cl_stdout << "square modulo p" << endl;
+               { CL_TIMING;
+                 for (int rep = repetitions; rep > 0; rep--)
+                   { cl_MI c = R->square(a); }
+               }
+               cl_stdout << "quotient modulo p" << endl;
+               { CL_TIMING;
+                 for (int rep = repetitions; rep > 0; rep--)
+                   { cl_MI c = R->div(a,b); }
+               }
+       }
+}