3 #include <cl_integer.h>
4 #include <cl_modinteger.h>
9 int main (int argc, char * argv[])
12 if ((argc >= 3) && !strcmp(argv[1],"-r")) {
13 repetitions = atoi(argv[2]);
18 uintL len = atoi(argv[1]);
19 cl_modint_ring R = cl_find_modint_ring((cl_I)1 << (intDsize*len));
20 cl_MI a = R->random();
22 do { b = R->random(); } while (!oddp(R->retract(b)));
24 for (int rep = repetitions; rep > 0; rep--)
25 { cl_MI c = R->div(a,b); }