/dports/security/cryptopp/cryptopp-8.6.0/ |
H A D | rw.cpp | 134 m_pre_2_9p = modp.Exponentiate(2, (9 * m_p - 11)/8); in PrecomputeTweakedRoots() 136 m_pre_2_3q = modq.Exponentiate(2, (3 * m_q - 5)/8); in PrecomputeTweakedRoots() 138 m_pre_q_p = modp.Exponentiate(m_q, m_p - 2); in PrecomputeTweakedRoots() 141 m_pre_2_9p = modp.Exponentiate(2, (9 * m_p - 11)/8); in PrecomputeTweakedRoots() 142 m_pre_2_3q = modq.Exponentiate(2, (3 * m_q - 5)/8); in PrecomputeTweakedRoots() 143 m_pre_q_p = modp.Exponentiate(m_q, m_p - 2); in PrecomputeTweakedRoots() 221 const Integer U = modq.Exponentiate(h, (q+1)/8); in CalculateInverse() 222 if(((modq.Exponentiate(U, 4) - h) % q).IsZero()) in CalculateInverse() 227 const Integer eh = e*h, V = modp.Exponentiate(eh, (p-3)/8); in CalculateInverse() 228 if(((modp.Multiply(modp.Exponentiate(V, 4), modp.Exponentiate(eh, 2)) - eh) % p).IsZero()) in CalculateInverse() [all …]
|
H A D | validat2.cpp | 757 Integer z = EuclideanDomainOf<Integer>().Exponentiate(y, y) % x; in TestIntegerOps() 1136 Integer x = EuclideanDomainOf<Integer>().Exponentiate(b, i) % m; in TestIntegerOps() 1159 Integer y = EuclideanDomainOf<Integer>().Exponentiate(z, z) % m; in TestIntegerOps() 1190 Integer z = EuclideanDomainOf<Integer>().Exponentiate(0, 0) % x; in TestIntegerOps() 1209 Integer y = EuclideanDomainOf<Integer>().Exponentiate(b, i) % m; in TestIntegerOps() 1223 Integer y = EuclideanDomainOf<Integer>().Exponentiate(b, i) % m; in TestIntegerOps() 1237 Integer y = EuclideanDomainOf<Integer>().Exponentiate(b, i) % m; in TestIntegerOps() 1251 Integer y = EuclideanDomainOf<Integer>().Exponentiate(b, i) % m; in TestIntegerOps()
|
H A D | eprecomp.h | 110 …virtual Element Exponentiate(const DL_GroupPrecomputation<Element> &group, const Integer &exponent… 144 Element Exponentiate(const DL_GroupPrecomputation<Element> &group, const Integer &exponent) const;
|
H A D | gfpcrypt.cpp | 177 CRYPTOPP_ASSERT(gpc->Exponentiate(GetGroupPrecomputation(), Integer::One()) == g); in ValidateElement() 178 pass = pass && gpc->Exponentiate(GetGroupPrecomputation(), Integer::One()) == g; in ValidateElement() 195 Integer gp = gpc ? gpc->Exponentiate(GetGroupPrecomputation(), q) : ExponentiateElement(g, q); in ValidateElement()
|
H A D | rsa.cpp | 180 Integer a = modn.Exponentiate(i, r); in Initialize() 244 Integer re = modn.Exponentiate(r, m_e); in CalculateInverse() 250 if (modn.Exponentiate(y, m_e) != x) // check in CalculateInverse()
|
/dports/emulators/citra-qt5/citra-ac98458e0/externals/cryptopp/cryptopp/ |
H A D | rw.cpp | 134 m_pre_2_9p = modp.Exponentiate(2, (9 * m_p - 11)/8); in PrecomputeTweakedRoots() 136 m_pre_2_3q = modq.Exponentiate(2, (3 * m_q - 5)/8); in PrecomputeTweakedRoots() 138 m_pre_q_p = modp.Exponentiate(m_q, m_p - 2); in PrecomputeTweakedRoots() 141 m_pre_2_9p = modp.Exponentiate(2, (9 * m_p - 11)/8); in PrecomputeTweakedRoots() 142 m_pre_2_3q = modq.Exponentiate(2, (3 * m_q - 5)/8); in PrecomputeTweakedRoots() 143 m_pre_q_p = modp.Exponentiate(m_q, m_p - 2); in PrecomputeTweakedRoots() 221 const Integer U = modq.Exponentiate(h, (q+1)/8); in CalculateInverse() 222 if(((modq.Exponentiate(U, 4) - h) % q).IsZero()) in CalculateInverse() 227 const Integer eh = e*h, V = modp.Exponentiate(eh, (p-3)/8); in CalculateInverse() 228 if(((modp.Multiply(modp.Exponentiate(V, 4), modp.Exponentiate(eh, 2)) - eh) % p).IsZero()) in CalculateInverse() [all …]
|
H A D | validat2.cpp | 757 Integer z = EuclideanDomainOf<Integer>().Exponentiate(y, y) % x; in TestIntegerOps() 1136 Integer x = EuclideanDomainOf<Integer>().Exponentiate(b, i) % m; in TestIntegerOps() 1159 Integer y = EuclideanDomainOf<Integer>().Exponentiate(z, z) % m; in TestIntegerOps() 1190 Integer z = EuclideanDomainOf<Integer>().Exponentiate(0, 0) % x; in TestIntegerOps() 1209 Integer y = EuclideanDomainOf<Integer>().Exponentiate(b, i) % m; in TestIntegerOps() 1223 Integer y = EuclideanDomainOf<Integer>().Exponentiate(b, i) % m; in TestIntegerOps() 1237 Integer y = EuclideanDomainOf<Integer>().Exponentiate(b, i) % m; in TestIntegerOps() 1251 Integer y = EuclideanDomainOf<Integer>().Exponentiate(b, i) % m; in TestIntegerOps()
|
H A D | eprecomp.h | 110 …virtual Element Exponentiate(const DL_GroupPrecomputation<Element> &group, const Integer &exponent… 144 Element Exponentiate(const DL_GroupPrecomputation<Element> &group, const Integer &exponent) const;
|
H A D | gfpcrypt.cpp | 177 CRYPTOPP_ASSERT(gpc->Exponentiate(GetGroupPrecomputation(), Integer::One()) == g); in ValidateElement() 178 pass = pass && gpc->Exponentiate(GetGroupPrecomputation(), Integer::One()) == g; in ValidateElement() 195 Integer gp = gpc ? gpc->Exponentiate(GetGroupPrecomputation(), q) : ExponentiateElement(g, q); in ValidateElement()
|
H A D | rsa.cpp | 180 Integer a = modn.Exponentiate(i, r); in Initialize() 244 Integer re = modn.Exponentiate(r, m_e); in CalculateInverse() 250 if (modn.Exponentiate(y, m_e) != x) // check in CalculateInverse()
|
/dports/emulators/citra/citra-ac98458e0/externals/cryptopp/cryptopp/ |
H A D | rw.cpp | 134 m_pre_2_9p = modp.Exponentiate(2, (9 * m_p - 11)/8); in PrecomputeTweakedRoots() 136 m_pre_2_3q = modq.Exponentiate(2, (3 * m_q - 5)/8); in PrecomputeTweakedRoots() 138 m_pre_q_p = modp.Exponentiate(m_q, m_p - 2); in PrecomputeTweakedRoots() 141 m_pre_2_9p = modp.Exponentiate(2, (9 * m_p - 11)/8); in PrecomputeTweakedRoots() 142 m_pre_2_3q = modq.Exponentiate(2, (3 * m_q - 5)/8); in PrecomputeTweakedRoots() 143 m_pre_q_p = modp.Exponentiate(m_q, m_p - 2); in PrecomputeTweakedRoots() 221 const Integer U = modq.Exponentiate(h, (q+1)/8); in CalculateInverse() 222 if(((modq.Exponentiate(U, 4) - h) % q).IsZero()) in CalculateInverse() 227 const Integer eh = e*h, V = modp.Exponentiate(eh, (p-3)/8); in CalculateInverse() 228 if(((modp.Multiply(modp.Exponentiate(V, 4), modp.Exponentiate(eh, 2)) - eh) % p).IsZero()) in CalculateInverse() [all …]
|
H A D | validat2.cpp | 757 Integer z = EuclideanDomainOf<Integer>().Exponentiate(y, y) % x; in TestIntegerOps() 1136 Integer x = EuclideanDomainOf<Integer>().Exponentiate(b, i) % m; in TestIntegerOps() 1159 Integer y = EuclideanDomainOf<Integer>().Exponentiate(z, z) % m; in TestIntegerOps() 1190 Integer z = EuclideanDomainOf<Integer>().Exponentiate(0, 0) % x; in TestIntegerOps() 1209 Integer y = EuclideanDomainOf<Integer>().Exponentiate(b, i) % m; in TestIntegerOps() 1223 Integer y = EuclideanDomainOf<Integer>().Exponentiate(b, i) % m; in TestIntegerOps() 1237 Integer y = EuclideanDomainOf<Integer>().Exponentiate(b, i) % m; in TestIntegerOps() 1251 Integer y = EuclideanDomainOf<Integer>().Exponentiate(b, i) % m; in TestIntegerOps()
|
H A D | eprecomp.h | 110 …virtual Element Exponentiate(const DL_GroupPrecomputation<Element> &group, const Integer &exponent… 144 Element Exponentiate(const DL_GroupPrecomputation<Element> &group, const Integer &exponent) const;
|
H A D | gfpcrypt.cpp | 177 CRYPTOPP_ASSERT(gpc->Exponentiate(GetGroupPrecomputation(), Integer::One()) == g); in ValidateElement() 178 pass = pass && gpc->Exponentiate(GetGroupPrecomputation(), Integer::One()) == g; in ValidateElement() 195 Integer gp = gpc ? gpc->Exponentiate(GetGroupPrecomputation(), q) : ExponentiateElement(g, q); in ValidateElement()
|
H A D | rsa.cpp | 180 Integer a = modn.Exponentiate(i, r); in Initialize() 244 Integer re = modn.Exponentiate(r, m_e); in CalculateInverse() 250 if (modn.Exponentiate(y, m_e) != x) // check in CalculateInverse()
|
/dports/sysutils/fusefs-securefs/securefs-0.12.0/external/cryptopp/ |
H A D | rw.cpp | 134 m_pre_2_9p = modp.Exponentiate(2, (9 * m_p - 11)/8); in PrecomputeTweakedRoots() 136 m_pre_2_3q = modq.Exponentiate(2, (3 * m_q - 5)/8); in PrecomputeTweakedRoots() 138 m_pre_q_p = modp.Exponentiate(m_q, m_p - 2); in PrecomputeTweakedRoots() 141 m_pre_2_9p = modp.Exponentiate(2, (9 * m_p - 11)/8); in PrecomputeTweakedRoots() 142 m_pre_2_3q = modq.Exponentiate(2, (3 * m_q - 5)/8); in PrecomputeTweakedRoots() 143 m_pre_q_p = modp.Exponentiate(m_q, m_p - 2); in PrecomputeTweakedRoots() 221 const Integer U = modq.Exponentiate(h, (q+1)/8); in CalculateInverse() 222 if(((modq.Exponentiate(U, 4) - h) % q).IsZero()) in CalculateInverse() 227 const Integer eh = e*h, V = modp.Exponentiate(eh, (p-3)/8); in CalculateInverse() 228 if(((modp.Multiply(modp.Exponentiate(V, 4), modp.Exponentiate(eh, 2)) - eh) % p).IsZero()) in CalculateInverse() [all …]
|
H A D | validat2.cpp | 757 Integer z = EuclideanDomainOf<Integer>().Exponentiate(y, y) % x; in TestIntegerOps() 1136 Integer x = EuclideanDomainOf<Integer>().Exponentiate(b, i) % m; in TestIntegerOps() 1159 Integer y = EuclideanDomainOf<Integer>().Exponentiate(z, z) % m; in TestIntegerOps() 1190 Integer z = EuclideanDomainOf<Integer>().Exponentiate(0, 0) % x; in TestIntegerOps() 1209 Integer y = EuclideanDomainOf<Integer>().Exponentiate(b, i) % m; in TestIntegerOps() 1223 Integer y = EuclideanDomainOf<Integer>().Exponentiate(b, i) % m; in TestIntegerOps() 1237 Integer y = EuclideanDomainOf<Integer>().Exponentiate(b, i) % m; in TestIntegerOps() 1251 Integer y = EuclideanDomainOf<Integer>().Exponentiate(b, i) % m; in TestIntegerOps()
|
H A D | eprecomp.h | 110 …virtual Element Exponentiate(const DL_GroupPrecomputation<Element> &group, const Integer &exponent… 144 Element Exponentiate(const DL_GroupPrecomputation<Element> &group, const Integer &exponent) const;
|
H A D | gfpcrypt.cpp | 177 CRYPTOPP_ASSERT(gpc->Exponentiate(GetGroupPrecomputation(), Integer::One()) == g); in ValidateElement() 178 pass = pass && gpc->Exponentiate(GetGroupPrecomputation(), Integer::One()) == g; in ValidateElement() 195 Integer gp = gpc ? gpc->Exponentiate(GetGroupPrecomputation(), q) : ExponentiateElement(g, q); in ValidateElement()
|
H A D | rsa.cpp | 180 Integer a = modn.Exponentiate(i, r); 244 Integer re = modn.Exponentiate(r, m_e); 250 if (modn.Exponentiate(y, m_e) != x) // check
|
/dports/net-p2p/qtum/qtum-mainnet-fastlane-v0.20.3/src/cryptopp/ |
H A D | rw.cpp | 131 m_pre_2_9p = modp.Exponentiate(2, (9 * m_p - 11)/8); in PrecomputeTweakedRoots() 133 m_pre_2_3q = modq.Exponentiate(2, (3 * m_q - 5)/8); in PrecomputeTweakedRoots() 135 m_pre_q_p = modp.Exponentiate(m_q, m_p - 2); in PrecomputeTweakedRoots() 213 const Integer U = modq.Exponentiate(h, (q+1)/8); in CalculateInverse() 214 if(((modq.Exponentiate(U, 4) - h) % q).IsZero()) in CalculateInverse() 219 const Integer eh = e*h, V = modp.Exponentiate(eh, (p-3)/8); in CalculateInverse() 220 if(((modp.Multiply(modp.Exponentiate(V, 4), modp.Exponentiate(eh, 2)) - eh) % p).IsZero()) in CalculateInverse() 234 const Integer t = modp.Multiply(modp.Exponentiate(V, 3), eh); in CalculateInverse()
|
H A D | eprecomp.h | 46 …virtual Element Exponentiate(const DL_GroupPrecomputation<Element> &group, const Integer &exponent… 69 Element Exponentiate(const DL_GroupPrecomputation<Element> &group, const Integer &exponent) const;
|
H A D | rsa.cpp | 172 Integer a = modn.Exponentiate(i, r); in Initialize() 236 Integer re = modn.Exponentiate(r, m_e); in CalculateInverse() 242 if (modn.Exponentiate(y, m_e) != x) // check in CalculateInverse()
|
/dports/math/py-nevergrad/nevergrad-0.4.3.post2/nevergrad/parametrization/ |
H A D | test_transforms.py | 16 exponentiate=(transforms.Exponentiate(3, 4), "Ex(3,4)"), 36 exponentiate=(transforms.Exponentiate(10, -1.0), [0, 1, 2], [1, 0.1, 0.01]),
|
/dports/math/gap/gap-4.11.0/pkg/nq-2.5.4/src/ |
H A D | collect.h | 17 extern word Exponentiate(word u, int n);
|