Home
last modified time | relevance | path

Searched refs:invmod (Results 1 – 25 of 274) sorted by relevance

1234567891011

/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/polly/lib/External/isl/imath/tests/
H A Dinvmod.tc3 invmod:-25,37,=1:34
4 invmod:-25,37,=2:34
5 invmod:-5,11,0:2
6 invmod:22153,514,0:383
8 invmod:83,8990271,0:2924546
9 invmod:643111,73,0:23
10 invmod:6756751,5,0:1
14 invmod:8363,2152,0:1827
15 invmod:6067,5554,0:1061
17 invmod:581,8525,0:3096
[all …]
/dports/math/eclib/eclib-20210318/libsrc/
H A Dminim.cc55 return mod(-b*invmod(4*a,p),p); in root_p()
61 return mod(c*invmod(3*b,p),p); in root_p()
63 bigint t=invmod(4*a*p_seminv,p); in root_p()
146 bigint gamma = mod(-a0*invmod(b0,p),p); in minim_p()
208 bigint gamma = mod(-a*invmod(b,p),p); in minim_p()
226 if(ndiv(3,temp)) beta = 3 * mod(temp * invmod(b,3) , 3); in minim_p()
234 if(ndiv(p,temp)) beta = p * mod(temp * invmod(3*b,p) , p); in minim_p()
256 bigint beta = 3 * mod(-b0*invmod(a,p),p); in minim_p()
H A Dcurvered.cc155 else { temp=invmod(C.a1,p); in CurveRed()
160 { if ( div(p,C.b2) ) r = root(-C.b6,3,p); else r = -invmod(C.b2,p)*C.b4; in CurveRed()
163 { if ( div(p,c4) ) r = -invmod(BIGINT(12),p)*C.b2; in CurveRed()
164 else r = -invmod(12*c4,p)*(c6+C.b2*c4); in CurveRed()
234 else if ( pdiv3 ) r = c*invmod(b,p); in CurveRed()
235 else r = (bc - 9*d)*invmod(2*x,p); in CurveRed()
260 {if ( pdiv2 ) r = mx*root( a6t*invmod(a2t,p), 2, p); in CurveRed()
261 else r = mx*mod( -a4t*invmod(2*a2t,p), p); in CurveRed()
287 else r = -b*invmod(BIGINT(3),p); in CurveRed()
H A Dlegendre.cc1040 w=(k1*invmod(c,a))%a; in lem4x_1()
1200 bigint aaa=invmod(a*gammastar,bc); in lem4x_1()
1451 bigint p1 = (p*invmod(u,b))%b; in lem2a()
1452 bigint q1 = (q*invmod(u,c))%c; in lem2a()
1538 k=(n*invmod(c,a))%a; in lem4x()
1638 aaa=invmod(a*alpha,bc); in lem4x()
1654 aaa=invmod(a*alpha,bc); in lem4x()
1660 aaa=invmod(a*alpha,bc); in lem4x()
1706 -q*aa*alpha*invmod(k2,d1), d2, d1); in lem4x()
1770 bigint p1=chrem(q*k1*invmod(aaa,m1), -p*k2*invmod(aaa,m2), m1, m2); in lem4x()
[all …]
/dports/www/firefox-esr/firefox-91.8.0/security/nss/lib/freebl/mpi/doc/
H A Dinvmod.pod7 invmod - compute modular inverse of an integer
11 invmod <a> <m>
15 The B<invmod> program computes the inverse of I<a>, modulo I<m>, if
H A DLICENSE6 invmod.pod
/dports/security/ca_root_nss/nss-3.71/nss/lib/freebl/mpi/doc/
H A Dinvmod.pod7 invmod - compute modular inverse of an integer
11 invmod <a> <m>
15 The B<invmod> program computes the inverse of I<a>, modulo I<m>, if
H A DLICENSE6 invmod.pod
/dports/www/firefox/firefox-99.0/security/nss/lib/freebl/mpi/doc/
H A Dinvmod.pod7 invmod - compute modular inverse of an integer
11 invmod <a> <m>
15 The B<invmod> program computes the inverse of I<a>, modulo I<m>, if
H A DLICENSE6 invmod.pod
/dports/lang/spidermonkey60/firefox-60.9.0/security/nss/lib/freebl/mpi/doc/
H A Dinvmod.pod7 invmod - compute modular inverse of an integer
11 invmod <a> <m>
15 The B<invmod> program computes the inverse of I<a>, modulo I<m>, if
H A DLICENSE6 invmod.pod
/dports/www/firefox-legacy/firefox-52.8.0esr/security/nss/lib/freebl/mpi/doc/
H A Dinvmod.pod7 invmod - compute modular inverse of an integer
11 invmod <a> <m>
15 The B<invmod> program computes the inverse of I<a>, modulo I<m>, if
H A DLICENSE6 invmod.pod
/dports/security/nss/nss-3.76.1/nss/lib/freebl/mpi/doc/
H A Dinvmod.pod7 invmod - compute modular inverse of an integer
11 invmod <a> <m>
15 The B<invmod> program computes the inverse of I<a>, modulo I<m>, if
/dports/mail/thunderbird/thunderbird-91.8.0/security/nss/lib/freebl/mpi/doc/
H A Dinvmod.pod7 invmod - compute modular inverse of an integer
11 invmod <a> <m>
15 The B<invmod> program computes the inverse of I<a>, modulo I<m>, if
/dports/lang/spidermonkey78/firefox-78.9.0/security/nss/lib/freebl/mpi/doc/
H A Dinvmod.pod7 invmod - compute modular inverse of an integer
11 invmod <a> <m>
15 The B<invmod> program computes the inverse of I<a>, modulo I<m>, if
/dports/math/p5-Math-Prime-Util/Math-Prime-Util-0.73/xt/
H A Dpari-compare.pl100 my $invmod = invmod($m, $n);
101 if (defined $invmod) {
102 die "invmod($m, $n)" unless Math::Pari::lift(PARI "Mod(1/$m,$n)") == $invmod;
245 my $invmod = invmod($m, $n);
246 if (defined $invmod) {
247 die "invmod($m, $n)" unless Math::Pari::lift(PARI "Mod(1/$m,$n)") == $invmod;
/dports/math/p5-Math-Prime-Util/Math-Prime-Util-0.73/t/
H A D26-mod.t57 ok(!eval { invmod(undef,11); }, "invmod(undef,11)");
58 ok(!eval { invmod(11,undef); }, "invmod(11,undef)");
59 ok(!eval { invmod('nan',11); }, "invmod('nan',11)");
63 is( invmod($a,$n), $exp, "invmod($a,$n) = ".((defined $exp)?$exp:"<undef>") );
/dports/math/libtommath/libtommath-1.2.0/logs/
H A Dgraphs.dem14 set output "invmod.png"
15 plot 'invmod.log' smooth bezier title "Modular Inverse"
/dports/math/gp2c/gp2c-0.0.12/test2/input/
H A Dapply12 for(i=0,3,print(invmod(i,4)))
/dports/math/givaro/givaro-4.1.1/tests/
H A Dtest-ratrecon.C48 PolDom.invmod(R,Q,M); in TestRR()
61 PolDom.invmod(S,B,M); in TestRR()
/dports/math/cado-nfs/cado-nfs-f4284e2391121b2bfb97bc4880b6273c7250dc2f/utils/
H A Drootfinder.cpp416 static void invmod(unsigned long& y, unsigned long const & x, unsigned long const & p) { in invmod() function
423 static void invmod(unsigned long& y, cxx_mpz const & xx, unsigned long const & p) { in invmod() function
447 static void invmod(uint64_t& y, uint64_t const & x, uint64_t const & p) { in invmod() function
454 static void invmod(uint64_t& y, cxx_mpz const & xx, uint64_t const & p) { in invmod() function
504 static void invmod(cxx_mpz& y, cxx_mpz const & x, cxx_mpz const & p) { in invmod() function
521 using super::invmod;
586 poly_roots_impl_details<F>::invmod(Ci[i], Qi[i], qfac[i]); in operator ()()
/dports/www/firefox-legacy/firefox-52.8.0esr/security/nss/lib/freebl/mpi/
H A DMakefile.os274 utils/gcd.c utils/invmod.c utils/lap.c \
92 TOOLS=gcd.exe invmod.exe isprime.exe lap.exe dec2hex.exe hex2dec.exe \
173 exptmod.obj pi.obj makeprime.obj karatsuba.obj gcd.obj invmod.obj lap.obj \
H A DMakefile55 utils/gcd.c utils/invmod.c utils/lap.c \
73 TOOLS=gcd invmod isprime lap dec2hex hex2dec primegen prng \
170 makeprime.o gcd.o invmod.o lap.o isprime.o \

1234567891011