Searched refs:rho (Results 1 - 25 of 42) sorted by relevance

12

/macosx-10.10/Heimdal-398.1.2/lib/hcrypto/libtommath/
H A Dbn_mp_montgomery_setup.c20 mp_montgomery_setup (mp_int * n, mp_digit * rho) argument
50 /* rho = -1/m mod b */
51 *rho = (unsigned long)(((mp_word)1 << ((mp_word) DIGIT_BIT)) - x) & MP_MASK;
H A Dbn_mp_montgomery_reduce.c20 mp_montgomery_reduce (mp_int * x, mp_int * n, mp_digit rho) argument
35 return fast_mp_montgomery_reduce (x, n, rho);
47 /* mu = ai * rho mod b
49 * The value of rho must be precalculated via
55 mu = (mp_digit) (((mp_word)x->dp[ix]) * ((mp_word)rho) & MP_MASK);
H A Dbn_fast_mp_montgomery_reduce.c26 int fast_mp_montgomery_reduce (mp_int * x, mp_int * n, mp_digit rho) argument
76 mu = (mp_digit) (((W[ix] & MP_MASK) * rho) & MP_MASK);
H A Dtommath.tex2723 Let $\rho = lg(\beta)$ represent the number of bits in a single precision digit. By further re-arrangement of the equation the final solution is
2727 k < {{2^{\alpha}} \over {\left (2^{2\rho} - 2^{\rho + 1} + 1 \right )}}
4027 extensively in this algorithm and should be precomputed. Let $\rho$ represent the negative of the modular inverse of $n_0$ modulo $\beta$.
4029 For example, let $\beta = 10$ represent the radix. Let $n = 17$ represent the modulus which implies $k = 2$ and $\rho \equiv 7$. Let $x = 33$
4059 \textbf{Input}. mp\_int $x$, mp\_int $n$ and a digit $\rho \equiv -1/n_0 \mbox{ (mod }n\mbox{)}$. \\
4073 \hspace{3mm}5.1 $\mu \leftarrow x_{ix} \cdot \rho \mbox{ (mod }\beta\mbox{)}$ \\
4101 for the Barrett algorithm. Additionally if $n > 1$ and $n$ is odd there will exist a modular inverse $\rho$. $\rho$ must be calculated in
4147 \textbf{Input}. mp\_int $x$, mp\_int $n$ and a digit $\rho \equi
[all...]
/macosx-10.10/groff-38/groff/font/devps/generate/
H A Dlgreekmap23 rho *r
H A Dsymbolchars57 rho *r
/macosx-10.10/tcl-105/tcl_ext/snack/snack/generic/
H A DjkGetF0.h89 float rho[BIGSORD+1]; member in struct:windstat_rec
H A Dsigproc.c381 float rho[BIGSORD+1], k[BIGSORD], a[BIGSORD+1],*r,*kp,*ap,en,er,wfact=1.0; local
396 if(!(r = ar)) r = rho; /* Permit optional return of the various */
404 for(i=1; i <= lpc_ord; i++) rho[i] = ffact * r[i];
405 *rho = *r;
406 r = rho;
H A DjkGetF0.c1307 save_windstat(rho, order, err, rms)
1308 float *rho;
1317 for(i=0;i<=order; i++) windstat[j-1].rho[i] = windstat[j].rho[i];
1321 for(i=0;i<=order; i++) windstat[wReuse-1].rho[i] = rho[i]; /*save*/
1326 for(i=0;i<=order; i++) windstat[0].rho[i] = rho[i]; /* save */
1337 retrieve_windstat(rho, order, err, rms)
1338 float *rho;
[all...]
H A Dsigproc2.c822 double rho[MAXORDER+1], k[MAXORDER], a[MAXORDER+1],*r,*kp,*ap,en,er; local
838 if(!(r = ar)) r = rho;
846 for(i=1; i <= lpc_ord; i++) rho[i] = ffact * r[i];
847 *rho = *r;
848 r = rho;
H A DjkFormant.c569 int lpcbsa(np, lpc_stabl, wind, data, lpc, rho, nul1, nul2, energy, preemp)
572 double *lpc, *rho, *nul1, *nul2, *energy, lpc_stabl, preemp;
/macosx-10.10/tcl-105/tcl_ext/tcllib/tcllib/modules/mapproj/
H A Dmapproj.tcl1583 set rho [expr {$G - $phi}]
1584 set x [expr {$rho * sin($theta)}]
1585 set y [expr {$rho_0 - $rho * cos($theta)}]
1615 set rho [expr {sqrt($x*$x + $rho_0my * $rho_0my)}]
1616 if {$n < 0.0} {set rho [expr {-$rho}]}
1617 set phi [expr {($G - $rho) * $radian}]
1656 set rho [expr {sqrt($C - 2.0 * $n * sin($phi)) / $n}]
1658 set x [expr {$rho * sin($theta)}]
1659 set y [expr {$rho_0 - $rho * co
[all...]
/macosx-10.10/CommonCrypto-60061/include/
H A DCommonBigNum.h687 @param rho The destination for the reduction digit.
693 CCBigNumMontgomerySetup(CCBigNumRef num, uint32_t *rho)
721 @param rho The reduction digit.
727 CCBigNumMontgomeryReduce(CCBigNumRef x, CCBigNumRef modulus, uint32_t rho)
/macosx-10.10/groff-38/groff/src/preproc/pic/
H A Dcommon.cpp103 double rho = sqrt(temp / a_4 / b_4 * temp / a_4 / b_4 * temp); local
110 position M0 = position(rho * cos(phi0), rho * sin(phi0)) + M;
111 position M1 = position(rho * cos(phi1), rho * sin(phi1)) + M;
115 solid_arc(M + cent, rho, phi0, phi1, lt);
/macosx-10.10/OpenSSL098-52/src/crypto/bn/
H A Dbn_gf2m.c928 BIGNUM *a, *z, *rho, *w, *w2, *tmp; local
968 rho = BN_CTX_get(ctx);
974 if (!BN_rand(rho, p[0], 0, 0)) goto err;
975 if (!BN_GF2m_mod_arr(rho, rho, p)) goto err;
977 if (!BN_copy(w, rho)) goto err;
984 if (!BN_GF2m_add(w, w2, rho)) goto err;
/macosx-10.10/vim-55/runtime/syntax/
H A Dplaintex.vim92 \ '\\\%(aleph\|alpha\|beta\|chi\|[dD]elta\|ell\|epsilon\|eta\|[gG]amma\|[ij]math\|iota\|kappa\|[lL]ambda\|[mn]u\|[oO]mega\|[pP][hs]\=i\|rho\|[sS]igma\|tau\|[tT]heta\|[uU]psilon\|var\%(epsilon\|ph\=i\|rho\|sigma\|theta\)\|[xX]i\|zeta\)\>'
H A Dgretl.vim40 syn keyword gGenrFunc log exp sin cos tan atan diff ldiff sdiff mean sd min max sort int ln coeff abs rho sqrt sum nobs firstobs lastobs normal uniform stderr cum missing ok misszero corr vcv var sst cov median zeromiss pvalue critical obsnum mpow dnorm cnorm gamma lngamma resample hpfilt bkfilt fracdiff varnum isvector islist nelem
H A Drhelp.vim80 syn match rhelpKeyword "\\rho"
/macosx-10.10/CommonCrypto-60061/lib/
H A DCommonBigNum.c476 CCBigNumMontgomerySetup(CCBigNumRef num, uint32_t *rho) argument
479 return kCCUnimplemented; // ccLTCErr(mp_montgomery_setup(num, rho));
490 CCBigNumMontgomeryReduce(CCBigNumRef x, CCBigNumRef n, uint32_t rho) argument
493 return kCCUnimplemented; // ccLTCErr(mp_montgomery_reduce(x, n, rho));
/macosx-10.10/emacs-93/emacs/leim/quail/
H A Dhanja-jis.el74 ("rho" "掛卦罫咼戈挂枴褂")
/macosx-10.10/tcl-105/tcl_ext/tcllib/tcllib/modules/htmlparse/
H A Dhtmlparse.tcl71 pi \u3C0 rho \u3C1 sigmaf \u3C2 sigma \u3C3 tau \u3C4
/macosx-10.10/vim-55/runtime/keymap/
H A Dgreek_utf-8.vim70 " All accents are supported. Even rho with < and > and Rho with <
610 >r <char-0x1FE4> "rho psili
611 <r <char-0x1FE5> "rho dasia
/macosx-10.10/tcl-105/tcl_ext/tcllib/tcllib/modules/html/
H A Dhtml.tcl85 \u3BF &omicron; \u3C0 &pi; \u3C1 &rho; \u3C2 &sigmaf; \u3C3 &sigma;
/macosx-10.10/tcl-105/tk/tk/library/
H A Dmkpsenc.tcl441 03C1 rho
/macosx-10.10/tcl-105/tk84/tk/library/
H A Dmkpsenc.tcl441 03C1 rho

Completed in 160 milliseconds

12