void generateKey(RSAint p, RSAint q, RSAint* e, RSAint* d, RSAint* n) { assert(e != NULL && d != NULL && n != NULL && p > minPrimeLimit && p < maxPrimeLimit && q > minPrimeLimit && q < maxPrimeLimit && p != q); *n = p*q; RSAint eFunc = (p-1)*(q-1); seedRand(); *e = randomPrime(2,eFunc); while(gcd(*e,eFunc) != 1) { *e = randomPrime(2,eFunc); } *d = multiplicative_inverse(*e,eFunc); assert((*n == p*q) && (*e**d % ((p-1)*(q-1)) == 1) && (*e > 10000)); }
PerlinNoise::PerlinNoise(void) { this->prime1 = randomPrime(1); this->prime2 = randomPrime(2); }