Home
last modified time | relevance | path

Searched refs:lcm (Results 1 – 10 of 10) sorted by relevance

/external/dropbear/
Dgenrsa.c45 DEF_MP_INT(lcm); in gen_rsa_priv_key()
56 &pminus, &lcm, &qminus, NULL); in gen_rsa_priv_key()
78 if (mp_lcm(&pminus, &qminus, &lcm) != MP_OKAY) { in gen_rsa_priv_key()
85 if (mp_invmod(key->e, &lcm, key->d) != MP_OKAY) { in gen_rsa_priv_key()
90 mp_clear_multi(&pminus, &qminus, &lcm, NULL); in gen_rsa_priv_key()
/external/dropbear/libtomcrypt/src/headers/
Dtomcrypt_math.h262 int (*lcm)(void *a, void *b, void *c); member
482 #define mp_lcm(a, b, c) ltc_mp.lcm(a, b, c)
/external/dropbear/libtomcrypt/src/math/
Dgmp_desc.c299 static int lcm(void *a, void *b, void *c) in lcm() function
428 &lcm,
Dltm_desc.c303 static int lcm(void *a, void *b, void *c) in lcm() function
434 &lcm,
Dtfm_desc.c313 static int lcm(void *a, void *b, void *c) in lcm() function
722 &lcm,
/external/dropbear/libtommath/
Dposter.tex30 $c = a^{1/b}$ & {\tt mp\_n\_root(\&a, b, \&c)} & $c = \mbox{lcm}(a, b)$ & {\tt mp\_lcm(\&a, \&b, \&…
Dbn.tex18 \def\lcm{{\rm lcm}}
/external/webkit/SunSpider/tests/
Dv8-earley-boyer.js412 var lcm = 1;
414 var f = Math.round(arguments[i] / sc_euclid_gcd(arguments[i], lcm));
415 lcm *= Math.abs(f);
417 return lcm;
/external/webkit/V8Binding/v8/benchmarks/
Dearley-boyer.js418 var lcm = 1;
420 var f = Math.round(arguments[i] / sc_euclid_gcd(arguments[i], lcm));
421 lcm *= Math.abs(f);
423 return lcm;
/external/dropbear/libtomcrypt/
Dcrypt.tex20 \def\lcm{{\rm lcm}}
3231 $\mbox{lcm}(p - 1, q - 1)$. The public key consists of the composite $N$ and some integer $e$ such…
6207 /** lcm
6213 int (*lcm)(void *a, void *b, void *c);