Lines Matching defs:modulus
67 * These cryptographic routines are characterized by the prime modulus
125 #define PLEN 512 /* default prime modulus size (bits) */
126 #define ILEN 512 /* default identity modulus size (bits) */
182 u_int modulus = PLEN; /* prime modulus size (bits) */
183 u_int modulus2 = ILEN; /* identity modulus size (bits) */
425 if (HAVE_OPT( MODULUS ))
426 modulus = OPT_VALUE_MODULUS;
1019 fprintf(stderr, "Generating RSA keys (%d bits)...\n", modulus);
1020 rsa = genRsaKeyPair(modulus, _UC("RSA"));
1031 * modulus turns out to be non-prime. Just for grins, we check
1076 "Generating DSA parameters (%d bits)...\n", modulus);
1077 dsa = genDsaParams(modulus, _UC("DSA"));
1088 fprintf(stderr, "Generating DSA keys (%d bits)...\n", modulus);
1260 * p modulus p
1261 * q modulus q
1303 * bit public modulus is n = p q, where p and q are secret large primes.
1316 * The scheme goes like this. Both Alice and Bob have the same modulus n
1459 * n modulus n
1622 * Compute the modulus q as the product of the primes. Compute
1623 * the modulus p as 2 * q + 1 and test p for primality. If p
1864 * p modulus p
1865 * q modulus q
1889 * p modulus p
1890 * q modulus q (used only when generating k)
1912 * p modulus p
Indexes created Thu Aug 20 00:25:57 UTC 2026