| /dports/java/bouncycastle15/crypto-169/core/src/main/java/org/bouncycastle/asn1/cryptopro/ |
| H A D | ECGOST3410NamedCurves.java | 50 mod_p,
64 mod_p = fromHex("FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFD97");
68 mod_p,
82 mod_p = fromHex("8000000000000000000000000000000000000000000000000000000000000C99");
86 mod_p,
104 mod_p,
122 mod_p,
141 mod_p, // p
159 mod_p,
177 mod_p,
[all …]
|
| /dports/www/geneweb/geneweb-13c850a0cc3973daf7ae3e0772a1621f84052041/src/ |
| H A D | mergeIndOk.ml | 126 let (p_related, mod_p) =
128 (fun ipc (p_related, mod_p) -> do {
165 let (p_related, mod_p) =
166 loop (p_related, mod_p) 0
169 (p_related, mod_p)
173 let (p_related, mod_p) =
176 let (p_related, mod_p) =
180 (p_related, mod_p)
194 (p_related, mod_p)
196 else (p_related, mod_p)
[all …]
|
| /dports/security/botan110/Botan-1.10.17/src/math/numbertheory/ |
| H A D | ressol.cpp | 41 Modular_Reducer mod_p(p); in ressol() local
44 BigInt n = mod_p.multiply(a, mod_p.square(r)); in ressol()
45 r = mod_p.multiply(r, a); in ressol()
64 q = mod_p.square(q); in ressol()
72 r = mod_p.multiply(r, c); in ressol()
73 c = mod_p.square(c); in ressol()
74 n = mod_p.multiply(n, c); in ressol()
|
| /dports/editors/encryptpad/EncryptPad-0.5.0.1/deps/botan/src/lib/math/numbertheory/ |
| H A D | ressol.cpp | 45 Modular_Reducer mod_p(p); in ressol() local
48 BigInt n = mod_p.multiply(a, mod_p.square(r)); in ressol()
49 r = mod_p.multiply(r, a); in ressol()
81 q = mod_p.square(q); in ressol()
91 r = mod_p.multiply(r, c); in ressol()
92 c = mod_p.square(c); in ressol()
93 n = mod_p.multiply(n, c); in ressol()
|
| H A D | make_prm.cpp | 164 Modular_Reducer mod_p(p); in random_prime() local
172 if(is_miller_rabin_probable_prime(p, mod_p, rng, 1) == false) in random_prime()
186 if(is_miller_rabin_probable_prime(p, mod_p, rng, mr_trials) == false) in random_prime()
189 if(prob > 32 && !is_lucas_probable_prime(p, mod_p)) in random_prime()
240 Modular_Reducer mod_p(p); in generate_rsa_prime() local
247 if(is_miller_rabin_probable_prime(p, mod_p, prime_test_rng, 1) == false) in generate_rsa_prime()
259 if(is_miller_rabin_probable_prime(p, mod_p, prime_test_rng, mr_trials) == true) in generate_rsa_prime()
|
| H A D | monty.cpp | 14 const Modular_Reducer& mod_p) in Montgomery_Params() argument
25 m_r1 = mod_p.reduce(r); in Montgomery_Params()
26 m_r2 = mod_p.square(m_r1); in Montgomery_Params()
27 m_r3 = mod_p.multiply(m_r1, m_r2); in Montgomery_Params()
43 Modular_Reducer mod_p(p); in Montgomery_Params() local
45 m_r1 = mod_p.reduce(r); in Montgomery_Params()
46 m_r2 = mod_p.square(m_r1); in Montgomery_Params()
47 m_r3 = mod_p.multiply(m_r1, m_r2); in Montgomery_Params()
|
| /dports/mail/thunderbird/thunderbird-91.8.0/comm/third_party/botan/src/lib/math/numbertheory/ |
| H A D | ressol.cpp | 45 Modular_Reducer mod_p(p); in ressol() local
48 BigInt n = mod_p.multiply(a, mod_p.square(r)); in ressol()
49 r = mod_p.multiply(r, a); in ressol()
81 q = mod_p.square(q); in ressol()
91 r = mod_p.multiply(r, c); in ressol()
92 c = mod_p.square(c); in ressol()
93 n = mod_p.multiply(n, c); in ressol()
|
| H A D | make_prm.cpp | 164 Modular_Reducer mod_p(p); in random_prime() local
172 if(is_miller_rabin_probable_prime(p, mod_p, rng, 1) == false) in random_prime()
186 if(is_miller_rabin_probable_prime(p, mod_p, rng, mr_trials) == false) in random_prime()
189 if(prob > 32 && !is_lucas_probable_prime(p, mod_p)) in random_prime()
240 Modular_Reducer mod_p(p); in generate_rsa_prime() local
247 if(is_miller_rabin_probable_prime(p, mod_p, prime_test_rng, 1) == false) in generate_rsa_prime()
259 if(is_miller_rabin_probable_prime(p, mod_p, prime_test_rng, mr_trials) == true) in generate_rsa_prime()
|
| H A D | monty.cpp | 14 const Modular_Reducer& mod_p) in Montgomery_Params() argument
25 m_r1 = mod_p.reduce(r); in Montgomery_Params()
26 m_r2 = mod_p.square(m_r1); in Montgomery_Params()
27 m_r3 = mod_p.multiply(m_r1, m_r2); in Montgomery_Params()
43 Modular_Reducer mod_p(p); in Montgomery_Params() local
45 m_r1 = mod_p.reduce(r); in Montgomery_Params()
46 m_r2 = mod_p.square(m_r1); in Montgomery_Params()
47 m_r3 = mod_p.multiply(m_r1, m_r2); in Montgomery_Params()
|
| /dports/security/botan2/Botan-2.18.2/src/lib/math/numbertheory/ |
| H A D | ressol.cpp | 45 Modular_Reducer mod_p(p); in ressol() local
48 BigInt n = mod_p.multiply(a, mod_p.square(r)); in ressol()
49 r = mod_p.multiply(r, a); in ressol()
81 q = mod_p.square(q); in ressol()
91 r = mod_p.multiply(r, c); in ressol()
92 c = mod_p.square(c); in ressol()
93 n = mod_p.multiply(n, c); in ressol()
|
| H A D | make_prm.cpp | 164 Modular_Reducer mod_p(p); in random_prime() local
172 if(is_miller_rabin_probable_prime(p, mod_p, rng, 1) == false) in random_prime()
186 if(is_miller_rabin_probable_prime(p, mod_p, rng, mr_trials) == false) in random_prime()
189 if(prob > 32 && !is_lucas_probable_prime(p, mod_p)) in random_prime()
240 Modular_Reducer mod_p(p); in generate_rsa_prime() local
247 if(is_miller_rabin_probable_prime(p, mod_p, prime_test_rng, 1) == false) in generate_rsa_prime()
259 if(is_miller_rabin_probable_prime(p, mod_p, prime_test_rng, mr_trials) == true) in generate_rsa_prime()
|
| H A D | monty.cpp | 14 const Modular_Reducer& mod_p) in Montgomery_Params() argument
25 m_r1 = mod_p.reduce(r); in Montgomery_Params()
26 m_r2 = mod_p.square(m_r1); in Montgomery_Params()
27 m_r3 = mod_p.multiply(m_r1, m_r2); in Montgomery_Params()
43 Modular_Reducer mod_p(p); in Montgomery_Params() local
45 m_r1 = mod_p.reduce(r); in Montgomery_Params()
46 m_r2 = mod_p.square(m_r1); in Montgomery_Params()
47 m_r3 = mod_p.multiply(m_r1, m_r2); in Montgomery_Params()
|
| /dports/java/bouncycastle15/crypto-169/core/src/test/java/org/bouncycastle/crypto/test/ |
| H A D | ECGOST3410Test.java | 41 …BigInteger mod_p = new BigInteger("578960446186580977117854925043439539266349923328202820197287920… in ecGOST3410_TEST() local
45 mod_p, // p in ecGOST3410_TEST()
110 …BigInteger mod_p = new BigInteger("578960446186580977117854925043439539266349923328202820197287920… in ecGOST3410_TestParam() local
114 mod_p, // p in ecGOST3410_TestParam()
167 …BigInteger mod_p = new BigInteger("115792089237316195423570985008687907853269984665640564039457584… in ecGOST3410_AParam() local
171 mod_p, // p in ecGOST3410_AParam()
217 …BigInteger mod_p = new BigInteger("578960446186580977117854925043439539266349923328202820197287920… in ecGOST3410_BParam() local
221 mod_p, // p in ecGOST3410_BParam()
267 …BigInteger mod_p = new BigInteger("703900853520833051995477180190184378410795166300451804712843468… in ecGOST3410_CParam() local
271 mod_p, // p in ecGOST3410_CParam()
|
| /dports/security/botan110/Botan-1.10.17/src/pubkey/elgamal/ |
| H A D | elgamal.cpp | 76 mod_p = Modular_Reducer(p); in ElGamal_Encryption_Operation()
83 const BigInt& p = mod_p.get_modulus(); in encrypt()
93 BigInt b = mod_p.multiply(m, powermod_y_p(k)); in encrypt()
106 mod_p = Modular_Reducer(p); in ElGamal_Decryption_Operation()
115 const BigInt& p = mod_p.get_modulus(); in decrypt()
130 BigInt r = mod_p.multiply(b, inverse_mod(powermod_x_p(a), p)); in decrypt()
|
| H A D | elgamal.h | 64 size_t max_input_bits() const { return mod_p.get_modulus().bits() - 1; } in max_input_bits()
73 Modular_Reducer mod_p; variable
82 size_t max_input_bits() const { return mod_p.get_modulus().bits() - 1; } in max_input_bits()
89 Modular_Reducer mod_p; variable
|
| /dports/editors/encryptpad/EncryptPad-0.5.0.1/deps/botan/src/fuzzer/ |
| H A D | pow_mod.cpp | 24 Botan::Modular_Reducer mod_p(p); in simple_power_mod() local
31 y = mod_p.multiply(x, y); in simple_power_mod()
33 x = mod_p.square(x); in simple_power_mod()
36 return mod_p.multiply(x, y); in simple_power_mod()
|
| H A D | ressol.cpp | 16 static const Botan::Modular_Reducer mod_p(p); in fuzz() local
28 const Botan::BigInt a_redc = mod_p.reduce(a); in fuzz()
29 const Botan::BigInt z = mod_p.square(a_sqrt); in fuzz()
|
| H A D | barrett.cpp | 36 const Botan::Modular_Reducer mod_p(p); in fuzz() local
37 const Botan::BigInt z = mod_p.reduce(x); in fuzz()
|
| /dports/security/botan2/Botan-2.18.2/src/fuzzer/ |
| H A D | pow_mod.cpp | 24 Botan::Modular_Reducer mod_p(p); in simple_power_mod() local
31 y = mod_p.multiply(x, y); in simple_power_mod()
33 x = mod_p.square(x); in simple_power_mod()
36 return mod_p.multiply(x, y); in simple_power_mod()
|
| H A D | ressol.cpp | 16 static const Botan::Modular_Reducer mod_p(p); in fuzz() local
28 const Botan::BigInt a_redc = mod_p.reduce(a); in fuzz()
29 const Botan::BigInt z = mod_p.square(a_sqrt); in fuzz()
|
| /dports/mail/thunderbird/thunderbird-91.8.0/comm/third_party/botan/src/fuzzer/ |
| H A D | pow_mod.cpp | 24 Botan::Modular_Reducer mod_p(p); in simple_power_mod() local
31 y = mod_p.multiply(x, y); in simple_power_mod()
33 x = mod_p.square(x); in simple_power_mod()
36 return mod_p.multiply(x, y); in simple_power_mod()
|
| H A D | ressol.cpp | 16 static const Botan::Modular_Reducer mod_p(p); in fuzz() local
28 const Botan::BigInt a_redc = mod_p.reduce(a); in fuzz()
29 const Botan::BigInt z = mod_p.square(a_sqrt); in fuzz()
|
| H A D | barrett.cpp | 36 const Botan::Modular_Reducer mod_p(p); in fuzz() local
37 const Botan::BigInt z = mod_p.reduce(x); in fuzz()
|
| /dports/net/zebra-server/idzebra-2.0.55/index/ |
| H A D | recctrl.c | 145 void *mod_p, *fl; in load_from_dir() local
150 mod_p = dlopen(fname, RTLD_NOW|RTLD_GLOBAL); in load_from_dir()
151 if (mod_p && (fl = dlsym(mod_p, "idzebra_filter"))) in load_from_dir()
154 recTypeClass_add(rts, fl, nmem, mod_p); in load_from_dir()
156 else if (mod_p) in load_from_dir()
161 dlclose(mod_p); in load_from_dir()
|
| /dports/security/helib/HElib-1.3.1/misc/psi/tests/ |
| H A D | gen-expected-mask.py | 126 args.mod_p = 0 if args.mod_p is None else args.mod_p
129 querydata = next(readRecord(f, args.mod_p))
132 records = tuple(readRecord(db, args.mod_p))
|