| /dports/security/botan110/Botan-1.10.17/src/math/numbertheory/ |
| H A D | numthry.cpp | 71 s = low_zero_bits(n_minus_1); in MillerRabin_Test()
142 size_t low_zero_bits(const BigInt& n) in low_zero_bits() function
176 size_t shift = std::min(low_zero_bits(x), low_zero_bits(y)); in gcd()
183 x >>= low_zero_bits(x); in gcd()
184 y >>= low_zero_bits(y); in gcd()
332 size_t zero_bits = low_zero_bits(u); in inverse_mod()
341 zero_bits = low_zero_bits(v); in inverse_mod()
|
| H A D | jacobi.cpp | 37 size_t shifts = low_zero_bits(x); in jacobi()
|
| H A D | ressol.cpp | 35 size_t s = low_zero_bits(p - 1); in ressol()
|
| H A D | numthry.h | 115 size_t BOTAN_DLL low_zero_bits(const BigInt& x);
|
| /dports/editors/encryptpad/EncryptPad-0.5.0.1/deps/botan/src/lib/math/numbertheory/ |
| H A D | numthry.cpp | 39 size_t low_zero_bits(const BigInt& n) in low_zero_bits() function
100 const size_t common2s = std::min(low_zero_bits(f), low_zero_bits(g)); in gcd()
|
| H A D | jacobi.cpp | 36 size_t shifts = low_zero_bits(x); in jacobi()
|
| H A D | ressol.cpp | 39 size_t s = low_zero_bits(p - 1); in ressol()
|
| H A D | primality.cpp | 112 const size_t s = low_zero_bits(n_minus_1); in passes_miller_rabin_test()
|
| H A D | numthry.h | 173 size_t BOTAN_PUBLIC_API(2,0) low_zero_bits(const BigInt& x);
|
| /dports/mail/thunderbird/thunderbird-91.8.0/comm/third_party/botan/src/lib/math/numbertheory/ |
| H A D | numthry.cpp | 39 size_t low_zero_bits(const BigInt& n) in low_zero_bits() function
100 const size_t common2s = std::min(low_zero_bits(f), low_zero_bits(g)); in gcd()
|
| H A D | jacobi.cpp | 36 size_t shifts = low_zero_bits(x); in jacobi()
|
| H A D | ressol.cpp | 39 size_t s = low_zero_bits(p - 1); in ressol()
|
| H A D | numthry.h | 173 size_t BOTAN_PUBLIC_API(2,0) low_zero_bits(const BigInt& x);
|
| H A D | primality.cpp | 112 const size_t s = low_zero_bits(n_minus_1); in passes_miller_rabin_test()
|
| /dports/security/botan2/Botan-2.18.2/src/lib/math/numbertheory/ |
| H A D | numthry.cpp | 39 size_t low_zero_bits(const BigInt& n) in low_zero_bits() function
100 const size_t common2s = std::min(low_zero_bits(f), low_zero_bits(g)); in gcd()
|
| H A D | jacobi.cpp | 36 size_t shifts = low_zero_bits(x); in jacobi()
|
| H A D | ressol.cpp | 39 size_t s = low_zero_bits(p - 1); in ressol()
|
| H A D | numthry.h | 173 size_t BOTAN_PUBLIC_API(2,0) low_zero_bits(const BigInt& x);
|
| H A D | primality.cpp | 112 const size_t s = low_zero_bits(n_minus_1); in passes_miller_rabin_test()
|
| /dports/editors/encryptpad/EncryptPad-0.5.0.1/deps/botan/src/fuzzer/ |
| H A D | invert.cpp | 22 const size_t u_zero_bits = Botan::low_zero_bits(u); in ref_inverse_mod()
31 const size_t v_zero_bits = Botan::low_zero_bits(v); in ref_inverse_mod()
|
| /dports/mail/thunderbird/thunderbird-91.8.0/comm/third_party/botan/src/fuzzer/ |
| H A D | invert.cpp | 22 const size_t u_zero_bits = Botan::low_zero_bits(u); in ref_inverse_mod()
31 const size_t v_zero_bits = Botan::low_zero_bits(v); in ref_inverse_mod()
|
| /dports/security/botan2/Botan-2.18.2/src/fuzzer/ |
| H A D | invert.cpp | 22 const size_t u_zero_bits = Botan::low_zero_bits(u); in ref_inverse_mod()
31 const size_t v_zero_bits = Botan::low_zero_bits(v); in ref_inverse_mod()
|
| /dports/devel/qca/qca-2.3.4/src/botantools/botan/botan/ |
| H A D | numthry.h | 81 u32bit low_zero_bits(const BigInt &);
|
| /dports/security/botan110/Botan-1.10.17/src/constructs/fpe_fe1/ |
| H A D | fpe_fe1.cpp | 39 size_t n_low_zero = low_zero_bits(n); in factor()
|
| /dports/math/bsdnt/bsdnt-de98bde/ |
| H A D | nn_linear.c | 571 return skip + low_zero_bits(x); in nn_scan1()
576 return (bits_t)i * WORD_BITS + low_zero_bits(a[i]); in nn_scan1()
|