| /dports/math/linbox/linbox-1.6.3/interfaces/kaapi/ |
| H A D | communicate.h | 70 const double& get_modulus() const { return this->modulus; }
72 double& get_modulus() { return this->modulus; }
81 return out << m_tmp->get_modulus() << m_tmp->get_lmodulus() ;
87 return in >> m_tmp->get_modulus() >> m_tmp->get_lmodulus() ;
|
| /dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/src/number_fields/algebraic_num/ |
| H A D | module.cc | 186 if (base.get_modulus().is_one()) in is_whole_order()
370 a.base.get_modulus() * f), in add()
372 b.base.get_modulus() * e); in add()
384 d.assign(gcd(multhelp1.get_modulus(), multhelp2.get_modulus())); in add()
438 a.base.get_modulus() * f), in intersect()
440 b.base.get_modulus() * e); in intersect()
451 d = lcm(a.base.get_modulus()*f, b.base.get_modulus()*e); in intersect()
545 multiply(d, a.base.get_modulus(), b.base.get_modulus()); in multiply()
581 d.assign(a.base.get_modulus()); in multiply()
599 d.assign(b.base.get_modulus()); in multiply()
[all …]
|
| H A D | ideal.cc | 47 bigint m(gcd(base.get_modulus(), a)); in alg_ideal()
145 multiply(d, a.base.get_modulus(), b.base.get_modulus()); in multiply()
174 if (!(a.base.get_modulus().is_zero())) { in multiply()
175 d.assign(a.base.get_modulus()); in multiply()
186 d.assign(b.base.get_modulus()); in multiply()
224 square(d, a.base.get_modulus()); in square()
227 if (!(a.base.get_modulus().is_zero())) in square()
261 d.assign(a.base.get_modulus()); in square()
297 bigint d = a.base.get_modulus(); in multiply()
349 bigint d = a.base.get_modulus(); in multiply()
[all …]
|
| /dports/security/nflib/NFLlib-1.0.0-23-g5cf40ed/include/nfl/ |
| H A D | core.hpp | 121 auto const p = get_modulus(cm); in set()
166 (1ULL << (int)(floor(log2(get_modulus(cm))) + 1)) - 1; in set()
173 if (tmp >= get_modulus(cm)) { in set()
174 tmp -= get_modulus(cm); in set()
182 assert(_data[i + degree * cm] < get_modulus(cm)); in set()
202 if (upper_bound >= get_modulus(cm)) { in set()
278 assert(_data[i + degree * cm] < get_modulus(cm)); in set()
311 _data[degree*cm+i] = get_modulus(cm) + rnd[i]; in set()
322 assert(_data[i + degree * cm] < get_modulus(cm)); in set()
566 auto const p = get_modulus(cm); in prep_wtab()
[all …]
|
| H A D | gmp.hpp | 93 auto const p = get_modulus(cm); in set_mpz()
118 mpz_mul_ui(moduli_product, moduli_product, get_modulus(cm)); in GMP()
140 mpz_set_ui(current_modulus, get_modulus(cm)); in GMP()
216 rop(cm, i) = mpz_fdiv_ui(poly_mpz[i], get_modulus(cm)); in mpz2poly()
|
| /dports/math/eclib/eclib-20210318/libsrc/eclib/ |
| H A D | curvemod.h | 74 bigint get_modulus() const { return q; } in get_modulus() function
85 friend bigint get_modulus(const curvemodq& E);
102 inline bigint get_modulus(const curvemodq& C) { return C.q; } in get_modulus() function
|
| /dports/net/astron/Astron-c8ba982/src/dclass/dc/ |
| H A D | NumericType.ipp | 18 // get_modulus returns a double representation of the modulus value.
19 inline double NumericType::get_modulus() const
|
| /dports/security/nflib/NFLlib-1.0.0-23-g5cf40ed/tests/ |
| H A D | poly_set.cpp | 46 big_array[cm * poly_t::degree + i] % poly_t::get_modulus(cm)); in run()
73 ret_value &= (p4(cm, i) == small_array[i] % poly_t::get_modulus(cm)); in run()
149 big_array[cm * poly_p::degree + i] % poly_p::get_modulus(cm)); in run_p()
174 ret_value &= (p4(cm, i) == small_array[i] % poly_p::get_modulus(cm)); in run_p()
|
| H A D | poly_mpz.cpp | 58 mpz_class modulus_mpz_class(std::to_string(poly_t::get_modulus(cm))); in run()
129 mpz_class modulus_mpz_class(std::to_string(poly_p::get_modulus(cm))); in run_p()
|
| /dports/security/botan110/Botan-1.10.17/src/pubkey/elgamal/ |
| H A D | elgamal.h | 64 size_t max_input_bits() const { return mod_p.get_modulus().bits() - 1; } in max_input_bits()
82 size_t max_input_bits() const { return mod_p.get_modulus().bits() - 1; } in max_input_bits()
|
| H A D | elgamal.cpp | 83 const BigInt& p = mod_p.get_modulus(); in encrypt()
115 const BigInt& p = mod_p.get_modulus(); in decrypt()
|
| /dports/math/R-cran-gmp/gmp/src/ |
| H A D | bigmod.cc | 156 biginteger mod = get_modulus(base, exp); in pow()
215 biginteger mod = get_modulus(x, m); in inv()
252 biginteger get_modulus(const bigmod& b1, const bigmod& b2) in get_modulus() function
282 biginteger mod = get_modulus(lhs, rhs); in create_bigmod()
|
| /dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/src/ec_order/eco_gfp/eco_gfp/ |
| H A D | trace_list.cc | 215 multiply(M, M, l[i].get_modulus()); in number_of_combinations()
250 bigint(tm.get_modulus())); in append()
251 multiply(M3, M3, tm.get_modulus()); in append()
382 M2 = l[index_baby].get_modulus(); in split_baby_giant()
394 msmall = static_cast<udigit>(l[j].get_modulus()); in split_baby_giant()
433 M1.assign(l[0].get_modulus()); in split_baby_giant()
440 msmall = static_cast<udigit>(l[j].get_modulus()); in split_baby_giant()
1178 small_moduli[i] = static_cast<sdigit>(l[i].get_modulus()); in simple_search_for_order()
1179 multiply (N, N, l[i].get_modulus()); in simple_search_for_order()
|
| /dports/math/eclib/eclib-20210318/libsrc/ |
| H A D | pointsmod.cc | 272 cout<<"Group structure of "<<(*this)<<" mod "<<::get_modulus(*this)<<": \n"; in set_basis()
282 <<" mod "<<::get_modulus(*this)<<endl; in set_basis()
305 cout<<"Error in isomorphism_type("<<(*this)<<") mod "<<::get_modulus((curvemodq)*this) in set_basis()
312 cout<<"Error in isomorphism_type("<<(*this)<<") mod "<<::get_modulus((curvemodq)*this) in set_basis()
346 cout<<p<<"-division poly mod "<<get_modulus()<<" = "<<pdivpol<<endl; in get_pbasis_via_divpol()
350 cout<<"roots of "<<p<<"-div pol mod "<<get_modulus()<<": "<<xi<<endl; in get_pbasis_via_divpol()
365 cout<<p<<"-division poly mod "<<get_modulus()<<" = "<<pdivpolmodq<<endl; in get_pbasis_via_divpol()
369 cout<<"roots of "<<p<<"-div pol mod "<<get_modulus()<<": "<<xi<<endl; in get_pbasis_via_divpol()
394 cout<<"basis for 2-division points mod "<<get_modulus()<<": "<<ans<<endl; in get_pbasis_from_roots()
432 cout<<"basis for "<<p<<"-division points mod "<<get_modulus()<<": "<<ans<<endl; in get_pbasis_from_roots()
|
| /dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/src/linear_algebra/include/LiDIA/ |
| H A D | bigmod_matrix.h | 79 const bigint & get_modulus() const in get_modulus() function
83 const bigint & get_modulus(const bigmod_matrix & A) in get_modulus() function
85 return A.get_modulus(); in get_modulus()
|
| /dports/www/firefox-esr/firefox-91.8.0/security/nss/fuzz/ |
| H A D | mpi_submod_target.cc | 19 auto modulus = get_modulus(data, size, ctx); in LLVMFuzzerTestOneInput()
|
| H A D | mpi_addmod_target.cc | 19 auto modulus = get_modulus(data, size, ctx); in LLVMFuzzerTestOneInput()
|
| H A D | mpi_mulmod_target.cc | 19 auto modulus = get_modulus(data, size, ctx); in LLVMFuzzerTestOneInput()
|
| /dports/security/ca_root_nss/nss-3.71/nss/fuzz/ |
| H A D | mpi_addmod_target.cc | 19 auto modulus = get_modulus(data, size, ctx); in LLVMFuzzerTestOneInput()
|
| /dports/www/firefox/firefox-99.0/security/nss/fuzz/ |
| H A D | mpi_mulmod_target.cc | 19 auto modulus = get_modulus(data, size, ctx); in LLVMFuzzerTestOneInput()
|
| H A D | mpi_submod_target.cc | 19 auto modulus = get_modulus(data, size, ctx); in LLVMFuzzerTestOneInput()
|
| H A D | mpi_addmod_target.cc | 19 auto modulus = get_modulus(data, size, ctx); in LLVMFuzzerTestOneInput()
|
| /dports/lang/spidermonkey60/firefox-60.9.0/security/nss/fuzz/ |
| H A D | mpi_addmod_target.cc | 19 auto modulus = get_modulus(data, size, ctx); in LLVMFuzzerTestOneInput()
|
| H A D | mpi_mulmod_target.cc | 19 auto modulus = get_modulus(data, size, ctx); in LLVMFuzzerTestOneInput()
|
| H A D | mpi_submod_target.cc | 19 auto modulus = get_modulus(data, size, ctx); in LLVMFuzzerTestOneInput()
|