Home
last modified time | relevance | path

Searched refs:mul_mod (Results 1 – 25 of 66) sorted by relevance

123

/dports/math/fxt/fxt/src/mod/
H A Dsqrtmod.cc57 x = mul_mod(x, a, p); in sqrt_modp()
58 b = mul_mod(b, x, p); in sqrt_modp()
83 x = mul_mod(x, v, p); in sqrt_modp()
84 b = mul_mod(b, y, p); in sqrt_modp()
120 z = mul_mod(z, r, m); // a*r in sqrt_modpp()
121 z = mul_mod(z, r, m); // a*r*r in sqrt_modpp()
123 r = mul_mod(r, z/2, m); // r*(3 - a*r*r)/2 = r*(1 + (1-a*r*r)/2) in sqrt_modpp()
126 r = mul_mod(r, a, m); in sqrt_modpp()
135 umod_t ar = mul_mod(a, ri, m); // a/r in sqrt_modpp()
137 r = mul_mod(r, h, m); // (r+a/r)/2 in sqrt_modpp()
H A Dchebyshev2.cc26 umod_t ue = mul_mod(add_mod(r0, r1, m), sub_mod(r0, r1, m), m); in chebyU()
32 umod_t t = mul_mod(r1, x, m); in chebyU()
34 t = mul_mod(r1, t, m); in chebyU()
40 umod_t t = mul_mod(r0, x, m); in chebyU()
42 t = mul_mod(t, r0, m); in chebyU()
78 umod_t ue = mul_mod(add_mod(r0, r1, m), sub_mod(r0, r1, m), m); in chebyU2()
86 t = mul_mod(r1, t, m); in chebyU2()
94 t = mul_mod(t, r0, m); in chebyU2()
105 umod_t s1 = mul_mod(ru1, ru1, m); // s1=ru1^2 in chebyU2()
106 umod_t s2 = mul_mod(ru0, ru0, m); // s2=ru0^2 in chebyU2()
[all …]
H A Dmodarith.h52 inline umod_t mul_mod(umod_t a, umod_t b, umod_t m) in mul_mod() function
64 return mul_mod(a, a, m); in sqr_mod()
95 if ( e & b ) s = mul_mod(s, a, m); // s *= a; in pow_mod()
113 if ( e & 1 ) y = mul_mod(y, z, m); // y *= z; in pow_mod()
H A Dchebyshev1.cc29 T1 = mul_mod(r0, r1, m); // multiplication in chebyT()
43 T0 = mul_mod(r0, r1, m); // multiplication in chebyT()
108 T1 = mul_mod(r0, r1, m); // multiplication in chebyT2()
122 T0 = mul_mod(r0, r1, m); // multiplication in chebyT2()
H A Dchinese.cc33 Xi = mul_mod(Xi, x[i], M); in chinese()
H A Drabinmiller.cc37 b = mul_mod(b, b, n); in is_strong_pseudo_prime()
H A Dmod.h96 s.x_ = mul_mod(x_, x_, mod::modulus); in sqr()
118 { z.x_ = mul_mod(z.x_, h.x_, mod::modulus); return z; }
/dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/src/base/simple_classes/single_precision/
H A Dsingle_precision.cc369 int mul_mod(int a, int b, int m) in mul_mod() function
392 int mul_mod(int a, int b, int m) in mul_mod() function
625 n = mul_mod(r, r, p); in ressol()
626 n = mul_mod(n, a, p); in ressol()
627 r = mul_mod(r, a, p); in ressol()
646 k = mul_mod(k, k, p); in ressol()
657 r = mul_mod(r, c, p); in ressol()
658 c = mul_mod(c, c, p); in ressol()
659 n = mul_mod(n, c, p); in ressol()
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/
H A Dhash-table.c148 mul_mod (hashval_t x, hashval_t y, hashval_t inv, int shift) in mul_mod() function
172 return mul_mod (hash, p->prime, p->inv, p->shift); in hash_table_mod1()
186 return 1 + mul_mod (hash, p->prime - 2, p->inv_m2, p->shift); in hash_table_mod2()
/dports/lang/gcc48/gcc-4.8.5/gcc/
H A Dhash-table.c148 mul_mod (hashval_t x, hashval_t y, hashval_t inv, int shift) in mul_mod() function
172 return mul_mod (hash, p->prime, p->inv, p->shift); in hash_table_mod1()
186 return 1 + mul_mod (hash, p->prime - 2, p->inv_m2, p->shift); in hash_table_mod2()
/dports/devel/mingw32-gcc/gcc-4.8.1/gcc/
H A Dhash-table.c148 mul_mod (hashval_t x, hashval_t y, hashval_t inv, int shift) in mul_mod() function
172 return mul_mod (hash, p->prime, p->inv, p->shift); in hash_table_mod1()
186 return 1 + mul_mod (hash, p->prime - 2, p->inv_m2, p->shift); in hash_table_mod2()
/dports/security/hashcat/hashcat-6.2.5/OpenCL/
H A Dinc_ecc_secp256k1.cl1561 mul_mod (rx, rx, neg);
1563 mul_mod (rz, neg, rz);
1564 mul_mod (ry, ry, rz);
1625 mul_mod (neg, rz, rz);
1628 mul_mod (rz, neg, rz);
1629 mul_mod (ry, ry, rz);
1690 mul_mod (neg, rz, rz);
1693 mul_mod (rz, neg, rz);
1694 mul_mod (ry, ry, rz);
2054 mul_mod (y, x, x);
[all …]
/dports/www/aria2/aria2-1.36.0/src/
H A DInternalDHKeyExchange.cc80 publicKey_ = generator_.mul_mod(privateKey_, prime_); in generatePublicKey()
119 n secret = peerKey.mul_mod(privateKey_, prime_); in computeSecret()
/dports/security/gnupg1/gnupg-1.4.23/mpi/
H A Dmpi-pow.c327 mul_mod (mpi_ptr_t xp, mpi_size_t *xsize_p, in mul_mod() function
509 mul_mod (xp, &xsize, bp, bsize, bp, bsize, mp, msize, &karactx); in mpi_powm()
516 mul_mod (rp, &rsize, xp, xsize, base_u, base_u_size, in mpi_powm()
519 mul_mod (rp, &rsize, base_u, base_u_size, xp, xsize, in mpi_powm()
637 mul_mod (xp, &xsize, rp, rsize, base_u, base_u_size, in mpi_powm()
650 mul_mod (xp, &xsize, rp, rsize, rp, rsize, mp, msize, &karactx); in mpi_powm()
/dports/security/libgcrypt/libgcrypt-1.9.4/mpi/
H A Dmpi-pow.c371 mul_mod (mpi_ptr_t xp, mpi_size_t *xsize_p, in mul_mod() function
563 mul_mod (xp, &xsize, bp, bsize, bp, bsize, mp, msize, &karactx); in _gcry_mpi_powm()
570 mul_mod (rp, &rsize, xp, xsize, base_u, base_u_size, in _gcry_mpi_powm()
573 mul_mod (rp, &rsize, base_u, base_u_size, xp, xsize, in _gcry_mpi_powm()
691 mul_mod (xp, &xsize, rp, rsize, base_u, base_u_size, in _gcry_mpi_powm()
704 mul_mod (xp, &xsize, rp, rsize, rp, rsize, mp, msize, &karactx); in _gcry_mpi_powm()
/dports/mail/thunderbird/thunderbird-91.8.0/comm/third_party/libgcrypt/mpi/
H A Dmpi-pow.c371 mul_mod (mpi_ptr_t xp, mpi_size_t *xsize_p, in mul_mod() function
563 mul_mod (xp, &xsize, bp, bsize, bp, bsize, mp, msize, &karactx); in _gcry_mpi_powm()
570 mul_mod (rp, &rsize, xp, xsize, base_u, base_u_size, in _gcry_mpi_powm()
573 mul_mod (rp, &rsize, base_u, base_u_size, xp, xsize, in _gcry_mpi_powm()
691 mul_mod (xp, &xsize, rp, rsize, base_u, base_u_size, in _gcry_mpi_powm()
704 mul_mod (xp, &xsize, rp, rsize, rp, rsize, mp, msize, &karactx); in _gcry_mpi_powm()
/dports/math/linbox/linbox-1.6.3/linbox/algorithms/polynomial-matrix/
H A Dpolynomial-fft-butterflies.h127 V4 = mul_mod<simd>(V2,W,P,Wp); in Butterfly_DIT_mod4p()
209 T = mul_mod<simd >(V4,W,P,Wp);// T is the result in Butterfly_DIF_mod2p()
294 V4 = mul_mod<simd>(V2,W,P,Wp); in Butterfly_DIT_mod4p()
366 V7 = mul_mod<simd >(V4,beta,P,betap); in Butterfly_DIT_mod4p_firststeps()
403 T = mul_mod<simd >(V4,W,P,Wp);// T is the result in Butterfly_DIF_mod2p()
430 V2 = mul_mod<simd >(V7,alpha,P,alphap); in Butterfly_DIF_mod2p_laststeps()
H A Dpolynomial-fft-transform-simd.inl52 inline Simd_vect mul_mod (const Simd_vect a, const Simd_vect b, const Simd_vect p, const Simd_vect … function
102 T = mul_mod<Simd128<uint32_t> >(V4,W,P,Wp);// T is the result
155 T2 = mul_mod<Simd128<uint32_t> >(T6,W,P,Wp);
167 T4 = mul_mod<Simd128<uint32_t> >(T6,W,P,Wp);// T1 is the result
177 V3 = mul_mod<Simd128<uint32_t> >(T6,W,P,Wp);// T1 is the result
184 V4 = mul_mod<Simd128<uint32_t> >(T6,W,P,Wp);// T1 is the result
264 V4 = mul_mod<Simd128<uint32_t> >(V2,W,P,Wp);
520 T = mul_mod<Simd256<uint32_t> >(V4,W,P,Wp);// T is the result
549 V2 = mul_mod<Simd256<uint32_t> >(V7,alpha,P,alphap);
688 V4 = mul_mod<Simd256<uint32_t> >(V2,W,P,Wp);
[all …]
/dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/src/base/include/LiDIA/base/
H A Dinterface_lib.h39 int mul_mod(int, int, int);
/dports/devel/dtool/dtool-0.11.0/cargo-crates/crypto-bigint-0.2.6/src/
H A Dtraits.rs122 fn mul_mod(&self, rhs: &Rhs, p: &Self, p_inv: Limb) -> Self::Output; in mul_mod() method
/dports/security/arti/arti-9d0ede26801cdb182daa85c3eb5f0058dc178eb6/cargo-crates/crypto-bigint-0.2.11/src/
H A Dtraits.rs125 fn mul_mod(&self, rhs: &Rhs, p: &Self, p_inv: Limb) -> Self::Output; in mul_mod() method
/dports/lang/gnat_util/gcc-6-20180516/gcc/
H A Dhash-table.h307 mul_mod (hashval_t x, hashval_t y, hashval_t inv, int shift) in mul_mod() function
328 return mul_mod (hash, p->prime, p->inv, p->shift); in hash_table_mod1()
338 return 1 + mul_mod (hash, p->prime - 2, p->inv_m2, p->shift); in hash_table_mod2()
/dports/lang/gcc6-aux/gcc-6-20180516/gcc/
H A Dhash-table.h307 mul_mod (hashval_t x, hashval_t y, hashval_t inv, int shift) in mul_mod() function
328 return mul_mod (hash, p->prime, p->inv, p->shift); in hash_table_mod1()
338 return 1 + mul_mod (hash, p->prime - 2, p->inv_m2, p->shift); in hash_table_mod2()
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/
H A Dhash-table.h307 mul_mod (hashval_t x, hashval_t y, hashval_t inv, int shift) in mul_mod() function
328 return mul_mod (hash, p->prime, p->inv, p->shift); in hash_table_mod1()
338 return 1 + mul_mod (hash, p->prime - 2, p->inv_m2, p->shift); in hash_table_mod2()
/dports/lang/gcc9/gcc-9.4.0/gcc/
H A Dhash-table.h316 mul_mod (hashval_t x, hashval_t y, hashval_t inv, int shift) in mul_mod() function
337 return mul_mod (hash, p->prime, p->inv, p->shift); in hash_table_mod1()
347 return 1 + mul_mod (hash, p->prime - 2, p->inv_m2, p->shift); in hash_table_mod2()

123