mirror of
https://github.com/rn10950/RetroZilla.git
synced 2024-11-14 11:40:13 +01:00
66 lines
1.3 KiB
C
66 lines
1.3 KiB
C
/*
|
|
* Simple test driver for MPI library
|
|
*
|
|
* Test 8: Probabilistic primality tester
|
|
*
|
|
* This Source Code Form is subject to the terms of the Mozilla Public
|
|
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <ctype.h>
|
|
#include <limits.h>
|
|
#include <time.h>
|
|
|
|
#define MP_IOFUNC 1
|
|
#include "mpi.h"
|
|
|
|
#include "mpprime.h"
|
|
|
|
int main(int argc, char *argv[])
|
|
{
|
|
int ix;
|
|
mp_digit num;
|
|
mp_int a;
|
|
|
|
srand(time(NULL));
|
|
|
|
if(argc < 2) {
|
|
fprintf(stderr, "Usage: %s <a>\n", argv[0]);
|
|
return 1;
|
|
}
|
|
|
|
printf("Test 8: Probabilistic primality testing\n\n");
|
|
|
|
mp_init(&a);
|
|
|
|
mp_read_radix(&a, argv[1], 10);
|
|
|
|
printf("a = "); mp_print(&a, stdout); fputc('\n', stdout);
|
|
|
|
printf("\nChecking for divisibility by small primes ... \n");
|
|
num = 170;
|
|
if(mpp_divis_primes(&a, &num) == MP_YES) {
|
|
printf("it is not prime\n");
|
|
goto CLEANUP;
|
|
}
|
|
printf("Passed that test (not divisible by any small primes).\n");
|
|
|
|
for(ix = 0; ix < 10; ix++) {
|
|
printf("\nPerforming Rabin-Miller test, iteration %d\n", ix + 1);
|
|
|
|
if(mpp_pprime(&a, 5) == MP_NO) {
|
|
printf("it is not prime\n");
|
|
goto CLEANUP;
|
|
}
|
|
}
|
|
printf("All tests passed; a is probably prime\n");
|
|
|
|
CLEANUP:
|
|
mp_clear(&a);
|
|
|
|
return 0;
|
|
}
|