Searched refs:moduli (Results 1 - 7 of 7) sorted by relevance

/macosx-10.9.5/Heimdal-323.92.1/lib/krb5/
H A Dpkinit.c119 struct krb5_dh_moduli **moduli)
124 m = moduli[1]; /* XXX */
126 m = moduli[0]; /* XXX */
129 for (i = 0; moduli[i] != NULL; i++) {
130 if (bits < moduli[i]->bits)
133 if (moduli[i] == NULL) {
140 m = moduli[i];
409 "moduli",
2000 N_("moduli file %s missing %s on line %d", ""),
2007 N_("moduli fil
118 select_dh_group(krb5_context context, DH *dh, unsigned long bits, struct krb5_dh_moduli **moduli) argument
2097 _krb5_free_moduli(struct krb5_dh_moduli **moduli) argument
2165 _krb5_parse_moduli(krb5_context context, const char *file, struct krb5_dh_moduli ***moduli) argument
2259 _krb5_dh_group_ok(krb5_context context, unsigned long bits, heim_integer *p, heim_integer *g, heim_integer *q, struct krb5_dh_moduli **moduli, char **name) argument
[all...]
/macosx-10.9.5/OpenSSH-186/openssh/contrib/suse/
H A Dopenssh.spec202 %attr(0600,root,root) %config(noreplace) %{_sysconfdir}/ssh/moduli
226 %attr(0644,root,root) %doc %{_mandir}/man5/moduli.5*
/macosx-10.9.5/Heimdal-323.92.1/lib/hcrypto/libtommath/
H A Dbn.tex196 RSA cryptography you only require exponentiation with odd moduli so even moduli support can be safely removed.
205 \hline Exponentiation with odd moduli only & BN\_S\_MP\_EXPTMOD\_C \\
210 \hline Exponentiation with random odd moduli & (The above plus the following) \\
217 \hline Modular inverse odd moduli only & BN\_MP\_INVMOD\_SLOW\_C \\
271 \hline Five modular reduction algorithms & X & & Faster modular exponentiation for a variety of moduli. \\
287 exponentiations. It depends largely on the processor, compiler and the moduli being used.
1377 Montgomery is a specialized reduction algorithm for any odd moduli. Like Barrett reduction a pre--computation
1385 For the given odd moduli $a$ the precomputation value is placed in $mp$. The reduction is computed with the
1395 Montgomery reduction is faster than Barrett reduction for moduli smalle
[all...]
H A Dtommath.tex3592 & increase the throughput of mp\_exptmod() for random odd moduli in the range \\
4266 or Montgomery methods for certain forms of moduli. The technique is based on the following simple congruence.
4536 algorithm is much faster than either Montgomery or Barrett reduction when the moduli are of the appropriate form.
6209 The Jacobi symbol is a generalization of the Legendre function for any odd non prime moduli $p$ greater than 2. If $p = \prod_{i=0}^n p_i$ then
/macosx-10.9.5/OpenSSH-186/openssh/contrib/caldera/
H A Dopenssh.spec341 %config %{_sysconfdir}/moduli
346 %{_mandir}/man5/moduli.5.gz
/macosx-10.9.5/OpenSSH-186/openssh/contrib/redhat/
H A Dopenssh.spec342 %attr(0600,root,root) %config(noreplace) %{_sysconfdir}/ssh/moduli
383 %attr(0644,root,root) %{_mandir}/man5/moduli.5*
488 - replace primes with moduli
/macosx-10.9.5/Heimdal-323.92.1/kdc/
H A Dpkinit.c83 static struct krb5_dh_moduli **moduli; variable in typeref:struct:krb5_dh_moduli
369 &dhparam.p, &dhparam.g, &dhparam.q, moduli,
2073 "libdefaults", "moduli", NULL);
2075 ret = _krb5_parse_moduli(context, file, &moduli);

Completed in 242 milliseconds