cat primesearch.c
/* primesearch.c May 3, 1987 */
/* Steps a user through generation of primes */

/*  Uses theorem 101 of Hardy as the basis for algorthm  */

char *xero = "0000000000000" ;
char *one =  "0000000000001" ;
char *max =  "9999999999999" ;
char q[400] ;
main() /* Interacts with user to generate a masterkey
 and a series of encryption/decryption pairs     */
{       char *x, *malloc() ;
        x = malloc(15) ;
        copy(xero,x) ;
        prime(x) ;
}
/* requires prime.f, search.f, rsa.f, and mathset.f to run */

$