1 /* Makes safe primes of a 2k nature */
5 int sizes[] = {256, 512, 768, 1024, 1536, 2048, 3072, 4096};
16 mp_init_multi(&q, &p, NULL);
18 out = fopen("2kprime.1", "w");
19 for (x = 0; x < (int)(sizeof(sizes) / sizeof(sizes[0])); x++) {
21 mp_2expt(&q, sizes[x]);
31 printf("No primes of size %d found\n", sizes[x]);
35 if (clock() - t1 > CLOCKS_PER_SEC) {
36 printf("."); fflush(stdout);
37 // sleep((clock() - t1 + CLOCKS_PER_SEC/2)/CLOCKS_PER_SEC);
42 mp_prime_is_prime(&q, 1, &y);
50 mp_prime_is_prime(&p, 3, &y);
56 mp_prime_is_prime(&q, 3, &y);
69 mp_toradix(&q, buf, 10);
70 printf("\n\n%d-bits (k = %lu) = %s\n", sizes[x], z, buf);
71 fprintf(out, "%d-bits (k = %lu) = %s\n", sizes[x], z, buf); fflush(out);