#include <time.h>
#include "tommath.h"
+int n_prime;
+FILE *primes;
+
/* fast square root */
static mp_digit
i_sqrt (mp_word x)
/* generates a prime digit */
-static mp_digit
-prime_digit ()
+static void gen_prime (void)
{
mp_digit r, x, y, next;
-
- /* make a DIGIT_BIT-bit random number */
- for (r = x = 0; x < DIGIT_BIT; x++) {
- r = (r << 1) | (rand () & 1);
- }
-
- /* now force it odd */
- r |= 1;
-
- /* force it to be >30 */
- if (r < 30) {
- r += 30;
- }
+ FILE *out;
+
+ out = fopen("pprime.dat", "wb");
+
+ /* write first set of primes */
+ r = 3; fwrite(&r, 1, sizeof(mp_digit), out);
+ r = 5; fwrite(&r, 1, sizeof(mp_digit), out);
+ r = 7; fwrite(&r, 1, sizeof(mp_digit), out);
+ r = 11; fwrite(&r, 1, sizeof(mp_digit), out);
+ r = 13; fwrite(&r, 1, sizeof(mp_digit), out);
+ r = 17; fwrite(&r, 1, sizeof(mp_digit), out);
+ r = 19; fwrite(&r, 1, sizeof(mp_digit), out);
+ r = 23; fwrite(&r, 1, sizeof(mp_digit), out);
+ r = 29; fwrite(&r, 1, sizeof(mp_digit), out);
+ r = 31; fwrite(&r, 1, sizeof(mp_digit), out);
/* get square root, since if 'r' is composite its factors must be < than this */
y = i_sqrt (r);
next = (y + 1) * (y + 1);
+ for (;;) {
do {
r += 2; /* next candidate */
+ r &= MP_MASK;
+ if (r < 31) break;
/* update sqrt ? */
if (next <= r) {
}
}
} while (x == 0);
+ if (r > 31) { fwrite(&r, 1, sizeof(mp_digit), out); printf("%9d\r", r); fflush(stdout); }
+ if (r < 31) break;
+ }
- return r;
+ fclose(out);
}
+void load_tab(void)
+{
+ primes = fopen("pprime.dat", "rb");
+ if (primes == NULL) {
+ gen_prime();
+ primes = fopen("pprime.dat", "rb");
+ }
+ fseek(primes, 0, SEEK_END);
+ n_prime = ftell(primes) / sizeof(mp_digit);
+}
+
+mp_digit prime_digit(void)
+{
+ int n;
+ mp_digit d;
+
+ n = abs(rand()) % n_prime;
+ fseek(primes, n * sizeof(mp_digit), SEEK_SET);
+ fread(&d, 1, sizeof(mp_digit), primes);
+ return d;
+}
+
+
/* makes a prime of at least k bits */
int
pprime (int k, int li, mp_int * p, mp_int * q)
}
if ((res = mp_init (&v)) != MP_OKAY) {
- goto __C;
+ goto LBL_C;
}
/* product of first 50 primes */
mp_read_radix (&v,
"19078266889580195013601891820992757757219839668357012055907516904309700014933909014729740190",
10)) != MP_OKAY) {
- goto __V;
+ goto LBL_V;
}
if ((res = mp_init (&a)) != MP_OKAY) {
- goto __V;
+ goto LBL_V;
}
/* set the prime */
mp_set (&a, prime_digit ());
if ((res = mp_init (&b)) != MP_OKAY) {
- goto __A;
+ goto LBL_A;
}
if ((res = mp_init (&n)) != MP_OKAY) {
- goto __B;
+ goto LBL_B;
}
if ((res = mp_init (&x)) != MP_OKAY) {
- goto __N;
+ goto LBL_N;
}
if ((res = mp_init (&y)) != MP_OKAY) {
- goto __X;
+ goto LBL_X;
}
if ((res = mp_init (&z)) != MP_OKAY) {
- goto __Y;
+ goto LBL_Y;
}
/* now loop making the single digit */
while (mp_count_bits (&a) < k) {
- printf ("prime has %4d bits left\r", k - mp_count_bits (&a));
- fflush (stdout);
+ fprintf (stderr, "prime has %4d bits left\r", k - mp_count_bits (&a));
+ fflush (stderr);
top:
mp_set (&b, prime_digit ());
/* now compute z = a * b * 2 */
if ((res = mp_mul (&a, &b, &z)) != MP_OKAY) { /* z = a * b */
- goto __Z;
+ goto LBL_Z;
}
if ((res = mp_copy (&z, &c)) != MP_OKAY) { /* c = a * b */
- goto __Z;
+ goto LBL_Z;
}
if ((res = mp_mul_2 (&z, &z)) != MP_OKAY) { /* z = 2 * a * b */
- goto __Z;
+ goto LBL_Z;
}
/* n = z + 1 */
if ((res = mp_add_d (&z, 1, &n)) != MP_OKAY) { /* n = z + 1 */
- goto __Z;
+ goto LBL_Z;
}
/* check (n, v) == 1 */
if ((res = mp_gcd (&n, &v, &y)) != MP_OKAY) { /* y = (n, v) */
- goto __Z;
+ goto LBL_Z;
}
if (mp_cmp_d (&y, 1) != MP_EQ)
/* compute x^a mod n */
if ((res = mp_exptmod (&x, &a, &n, &y)) != MP_OKAY) { /* y = x^a mod n */
- goto __Z;
+ goto LBL_Z;
}
/* if y == 1 loop */
/* now x^2a mod n */
if ((res = mp_sqrmod (&y, &n, &y)) != MP_OKAY) { /* y = x^2a mod n */
- goto __Z;
+ goto LBL_Z;
}
if (mp_cmp_d (&y, 1) == MP_EQ)
/* compute x^b mod n */
if ((res = mp_exptmod (&x, &b, &n, &y)) != MP_OKAY) { /* y = x^b mod n */
- goto __Z;
+ goto LBL_Z;
}
/* if y == 1 loop */
/* now x^2b mod n */
if ((res = mp_sqrmod (&y, &n, &y)) != MP_OKAY) { /* y = x^2b mod n */
- goto __Z;
+ goto LBL_Z;
}
if (mp_cmp_d (&y, 1) == MP_EQ)
/* compute x^c mod n == x^ab mod n */
if ((res = mp_exptmod (&x, &c, &n, &y)) != MP_OKAY) { /* y = x^ab mod n */
- goto __Z;
+ goto LBL_Z;
}
/* if y == 1 loop */
/* now compute (x^c mod n)^2 */
if ((res = mp_sqrmod (&y, &n, &y)) != MP_OKAY) { /* y = x^2ab mod n */
- goto __Z;
+ goto LBL_Z;
}
/* y should be 1 */
if (ii == li)
goto top;
-/*
{
char buf[4096];
-
+
mp_toradix(&n, buf, 10);
printf("Certificate of primality for:\n%s\n\n", buf);
mp_toradix(&a, buf, 10);
printf("A == \n%s\n\n", buf);
mp_toradix(&b, buf, 10);
- printf("B == \n%s\n", buf);
+ printf("B == \n%s\n\nG == %d\n", buf, bases[ii]);
printf("----------------------------------------------------------------\n");
-}
-*/
+}
+
/* a = n */
mp_copy (&n, &a);
}
mp_exch (&n, p);
res = MP_OKAY;
-__Z:mp_clear (&z);
-__Y:mp_clear (&y);
-__X:mp_clear (&x);
-__N:mp_clear (&n);
-__B:mp_clear (&b);
-__A:mp_clear (&a);
-__V:mp_clear (&v);
-__C:mp_clear (&c);
+LBL_Z:mp_clear (&z);
+LBL_Y:mp_clear (&y);
+LBL_X:mp_clear (&x);
+LBL_N:mp_clear (&n);
+LBL_B:mp_clear (&b);
+LBL_A:mp_clear (&a);
+LBL_V:mp_clear (&v);
+LBL_C:mp_clear (&c);
return res;
}
clock_t t1;
srand (time (NULL));
+ load_tab();
printf ("Enter # of bits: \n");
fgets (buf, sizeof (buf), stdin);
projects / bcm963xx.git / blobdiff