genprime.h

RSA算法的VC源码

/*	genprime.h - C include file for generation of large primes
		used by public-key key generation routines.


	These functions are for the generation of large prime integers and
	for other functions related to factoring and key generation for
	many number-theoretic cryptographic algorithms, such as the NIST
	Digital Signature Standard.

	NOTE:  This assumes previous inclusion of "mpilib.h"
*/

int randomprime(unsigned short* p,short nbits);
/* Makes a "random" prime p with nbits significant bits of precision. */

void mp_gcd(unsigned short* result,unsigned short* a,unsigned short* n);
	/* Computes greatest common divisor via Euclid's algorithm. */

void mp_inv(unsigned short* x,unsigned short* a,unsigned short* n);
	/* Euclid's algorithm extended to compute multiplicative inverse.
	   Computes x such that a*x mod n = 1, where 0<a<n */