1 /* Makes safe primes of a 2k nature */
5 static int sizes[] = {256, 512, 768, 1024, 1536, 2048, 3072, 4096};
17 mp_init_multi(&q, &p, NULL);
19 out = fopen("2kprime.1", "w");
21 for (x = 0; x < (sizeof(sizes) / sizeof(sizes[0])); x++) {
23 mp_2expt(&q, sizes[x]);
24 mp_add_d(&q, 3uL, &q);
29 mp_sub_d(&q, 4uL, &q);
33 printf("No primes of size %d found\n", sizes[x]);
37 if ((clock() - t1) > CLOCKS_PER_SEC) {
40 /* sleep((clock() - t1 + CLOCKS_PER_SEC/2)/CLOCKS_PER_SEC); */
45 mp_prime_is_prime(&q, 1, &y);
51 mp_sub_d(&q, 1uL, &p);
53 mp_prime_is_prime(&p, 3, &y);
59 mp_prime_is_prime(&q, 3, &y);
72 mp_to_decimal(&q, buf, sizeof(buf));
73 printf("\n\n%d-bits (k = %lu) = %s\n", sizes[x], z, buf);
74 fprintf(out, "%d-bits (k = %lu) = %s\n", sizes[x], z, buf);