Lines Matching refs:modulus
65 * These cryptographic routines are characterized by the prime modulus
123 #define PLEN 512 /* default prime modulus size (bits) */
124 #define ILEN 256 /* default identity modulus size (bits) */
180 u_int modulus = PLEN; /* prime modulus size (bits) */
181 u_int modulus2 = ILEN; /* identity modulus size (bits) */
420 modulus = OPT_VALUE_MODULUS;
998 fprintf(stderr, "Generating RSA keys (%d bits)...\n", modulus);
999 rsa = genRsaKeyPair(modulus, _UC("RSA"));
1010 * modulus turns out to be non-prime. Just for grins, we check
1055 "Generating DSA parameters (%d bits)...\n", modulus);
1056 dsa = genDsaParams(modulus, _UC("DSA"));
1067 fprintf(stderr, "Generating DSA keys (%d bits)...\n", modulus);
1239 * p modulus p
1240 * q modulus q
1282 * bit public modulus is n = p q, where p and q are secret large primes.
1295 * The scheme goes like this. Both Alice and Bob have the same modulus n
1438 * n modulus n
1601 * Compute the modulus q as the product of the primes. Compute
1602 * the modulus p as 2 * q + 1 and test p for primality. If p
1843 * p modulus p
1844 * q modulus q
1868 * p modulus p
1869 * q modulus q (used only when generating k)
1891 * p modulus p