-#include <cl_number.h>
-#include <cl_io.h>
-#include <cl_integer.h>
-#include <cl_integer_io.h>
-#include <cl_modinteger.h>
-#include <cl_numtheory.h>
+#include <cln/number.h>
+#include <cln/io.h>
+#include <cln/integer.h>
+#include <cln/integer_io.h>
+#include <cln/modinteger.h>
+#include <cln/numtheory.h>
#include <stdlib.h>
#include <string.h>
-#include <cl_timing.h>
+#include <cln/timing.h>
+using namespace cln;
int main (int argc, char * argv[])
{
p = ((random_I((cl_I)1 << (len-1-e))*2+1) << e) + 1;
} while (!isprobprime(p));
cout << "p = " << p << endl;
- cl_modint_ring R = cl_find_modint_ring(p);
+ cl_modint_ring R = find_modint_ring(p);
cl_MI x = R->random();
cl_MI a = square(x);
sqrt_mod_p_t sol;