/dports/security/hexl/hexl-1.2.3/test/ |
H A D | test-number-theory.cpp | 190 TEST(NumberTheory, InverseMod) { in TEST() argument 195 ASSERT_EQ(1ULL, InverseMod(input, modulus)); in TEST() 199 EXPECT_ANY_THROW(InverseMod(input, modulus)); in TEST() 202 EXPECT_ANY_THROW(InverseMod(input, modulus)); in TEST() 205 EXPECT_ANY_THROW(InverseMod(input, modulus)); in TEST() 209 ASSERT_EQ(1ULL, InverseMod(input, modulus)); in TEST() 212 ASSERT_EQ(1ULL, InverseMod(input, modulus)); in TEST() 215 ASSERT_EQ(4ULL, InverseMod(input, modulus)); in TEST() 218 ASSERT_EQ(5ULL, InverseMod(input, modulus)); in TEST()
|
/dports/security/cryptopp/cryptopp-8.6.0/ |
H A D | validat2.cpp | 938 result = (Integer("0x3529E4FEBC") == a.InverseMod(b)); in TestIntegerOps() 951 Integer x = a.InverseMod(m); in TestIntegerOps() 952 Integer y = (a % m).InverseMod(m); in TestIntegerOps() 1004 Integer x = a.InverseMod(m); in TestIntegerOps() 1005 Integer y = (a % m).InverseMod(m); in TestIntegerOps() 1025 Integer x = a.InverseMod(m); in TestIntegerOps() 1026 Integer y = (a % m).InverseMod(m); in TestIntegerOps() 1053 Integer x = Integer(Integer::POSITIVE, 0, a.InverseMod(m)); in TestIntegerOps() 1054 Integer y = Integer(Integer::POSITIVE, 0, ri.InverseMod(m)); in TestIntegerOps()
|
H A D | rsa.cpp | 135 m_d = m_e.InverseMod(LCM(m_p-1, m_q-1)); in GenerateRandom() 141 m_u = m_q.InverseMod(m_p); in GenerateRandom() 194 m_u = m_q.InverseMod(m_p); in Initialize()
|
H A D | nbtheory.cpp | 360 SieveSingle(m_sieve, primeTable[i], m_first, m_step, (word16)m_step.InverseMod(primeTable[i])); in DoSieve() 370 word16 stepInv = (word16)m_step.InverseMod(p); in DoSieve() 632 r1 = r2 = (-b*(a+a).InverseMod(p)) % p; in SolveModularQuadraticEquation() 637 Integer t = (a+a).InverseMod(p); in SolveModularQuadraticEquation()
|
/dports/emulators/citra-qt5/citra-ac98458e0/externals/cryptopp/cryptopp/ |
H A D | validat2.cpp | 938 result = (Integer("0x3529E4FEBC") == a.InverseMod(b)); in TestIntegerOps() 951 Integer x = a.InverseMod(m); in TestIntegerOps() 952 Integer y = (a % m).InverseMod(m); in TestIntegerOps() 1004 Integer x = a.InverseMod(m); in TestIntegerOps() 1005 Integer y = (a % m).InverseMod(m); in TestIntegerOps() 1025 Integer x = a.InverseMod(m); in TestIntegerOps() 1026 Integer y = (a % m).InverseMod(m); in TestIntegerOps() 1053 Integer x = Integer(Integer::POSITIVE, 0, a.InverseMod(m)); in TestIntegerOps() 1054 Integer y = Integer(Integer::POSITIVE, 0, ri.InverseMod(m)); in TestIntegerOps()
|
H A D | rsa.cpp | 135 m_d = m_e.InverseMod(LCM(m_p-1, m_q-1)); in GenerateRandom() 141 m_u = m_q.InverseMod(m_p); in GenerateRandom() 194 m_u = m_q.InverseMod(m_p); in Initialize()
|
H A D | nbtheory.cpp | 360 SieveSingle(m_sieve, primeTable[i], m_first, m_step, (word16)m_step.InverseMod(primeTable[i])); in DoSieve() 370 word16 stepInv = (word16)m_step.InverseMod(p); in DoSieve() 632 r1 = r2 = (-b*(a+a).InverseMod(p)) % p; in SolveModularQuadraticEquation() 637 Integer t = (a+a).InverseMod(p); in SolveModularQuadraticEquation()
|
/dports/emulators/citra/citra-ac98458e0/externals/cryptopp/cryptopp/ |
H A D | validat2.cpp | 938 result = (Integer("0x3529E4FEBC") == a.InverseMod(b)); in TestIntegerOps() 951 Integer x = a.InverseMod(m); in TestIntegerOps() 952 Integer y = (a % m).InverseMod(m); in TestIntegerOps() 1004 Integer x = a.InverseMod(m); in TestIntegerOps() 1005 Integer y = (a % m).InverseMod(m); in TestIntegerOps() 1025 Integer x = a.InverseMod(m); in TestIntegerOps() 1026 Integer y = (a % m).InverseMod(m); in TestIntegerOps() 1053 Integer x = Integer(Integer::POSITIVE, 0, a.InverseMod(m)); in TestIntegerOps() 1054 Integer y = Integer(Integer::POSITIVE, 0, ri.InverseMod(m)); in TestIntegerOps()
|
H A D | rsa.cpp | 135 m_d = m_e.InverseMod(LCM(m_p-1, m_q-1)); in GenerateRandom() 141 m_u = m_q.InverseMod(m_p); in GenerateRandom() 194 m_u = m_q.InverseMod(m_p); in Initialize()
|
H A D | nbtheory.cpp | 360 SieveSingle(m_sieve, primeTable[i], m_first, m_step, (word16)m_step.InverseMod(primeTable[i])); in DoSieve() 370 word16 stepInv = (word16)m_step.InverseMod(p); in DoSieve() 632 r1 = r2 = (-b*(a+a).InverseMod(p)) % p; in SolveModularQuadraticEquation() 637 Integer t = (a+a).InverseMod(p); in SolveModularQuadraticEquation()
|
/dports/sysutils/fusefs-securefs/securefs-0.12.0/external/cryptopp/ |
H A D | validat2.cpp | 938 result = (Integer("0x3529E4FEBC") == a.InverseMod(b)); in TestIntegerOps() 951 Integer x = a.InverseMod(m); in TestIntegerOps() 952 Integer y = (a % m).InverseMod(m); in TestIntegerOps() 1004 Integer x = a.InverseMod(m); in TestIntegerOps() 1005 Integer y = (a % m).InverseMod(m); in TestIntegerOps() 1025 Integer x = a.InverseMod(m); in TestIntegerOps() 1026 Integer y = (a % m).InverseMod(m); in TestIntegerOps() 1053 Integer x = Integer(Integer::POSITIVE, 0, a.InverseMod(m)); in TestIntegerOps() 1054 Integer y = Integer(Integer::POSITIVE, 0, ri.InverseMod(m)); in TestIntegerOps()
|
H A D | rsa.cpp | 135 m_d = m_e.InverseMod(LCM(m_p-1, m_q-1)); 141 m_u = m_q.InverseMod(m_p); 194 m_u = m_q.InverseMod(m_p);
|
H A D | nbtheory.cpp | 360 SieveSingle(m_sieve, primeTable[i], m_first, m_step, (word16)m_step.InverseMod(primeTable[i])); in DoSieve() 370 word16 stepInv = (word16)m_step.InverseMod(p); in DoSieve() 632 r1 = r2 = (-b*(a+a).InverseMod(p)) % p; in SolveModularQuadraticEquation() 637 Integer t = (a+a).InverseMod(p); in SolveModularQuadraticEquation()
|
/dports/security/hexl/hexl-1.2.3/hexl/ntt/ |
H A D | ntt-internal.cpp | 47 m_w_inv = InverseMod(m_w, m_q); in NTT() 61 inv_root_of_unity_powers[0] = InverseMod(1, m_q); in ComputeRootOfUnityPowers() 69 inv_root_of_unity_powers[idx] = InverseMod(root_of_unity_powers[idx], m_q); in ComputeRootOfUnityPowers()
|
/dports/databases/mariadb103-server/mariadb-10.3.34/extra/yassl/taocrypt/src/ |
H A D | dsa.cpp | 184 Integer kInv = k.InverseMod(q); in Sign() 235 Integer w = s_.InverseMod(q); in Verify()
|
/dports/databases/mariadb103-client/mariadb-10.3.34/extra/yassl/taocrypt/src/ |
H A D | dsa.cpp | 184 Integer kInv = k.InverseMod(q); in Sign() 235 Integer w = s_.InverseMod(q); in Verify()
|
/dports/databases/mysql55-client/mysql-5.5.62/extra/yassl/taocrypt/src/ |
H A D | dsa.cpp | 184 Integer kInv = k.InverseMod(q); in Sign() 235 Integer w = s_.InverseMod(q); in Verify()
|
/dports/net-p2p/qtum/qtum-mainnet-fastlane-v0.20.3/src/cryptopp/ |
H A D | rsa.cpp | 127 m_d = m_e.InverseMod(LCM(m_p-1, m_q-1)); in GenerateRandom() 133 m_u = m_q.InverseMod(m_p); in GenerateRandom() 186 m_u = m_q.InverseMod(m_p); in Initialize()
|
H A D | nbtheory.cpp | 362 SieveSingle(m_sieve, primeTable[i], m_first, m_step, (word16)m_step.InverseMod(primeTable[i])); in DoSieve() 372 word16 stepInv = (word16)m_step.InverseMod(p); in DoSieve() 634 r1 = r2 = (-b*(a+a).InverseMod(p)) % p; in SolveModularQuadraticEquation() 639 Integer t = (a+a).InverseMod(p); in SolveModularQuadraticEquation()
|
/dports/databases/mariadb103-client/mariadb-10.3.34/extra/yassl/taocrypt/include/ |
H A D | integer.hpp | 263 Integer InverseMod(const Integer& n) const; in usage() 264 word InverseMod(word n) const; in usage()
|
H A D | modarith.hpp | 97 {return result1 = a.InverseMod(modulus);}
|
/dports/databases/mariadb103-server/mariadb-10.3.34/extra/yassl/taocrypt/include/ |
H A D | integer.hpp | 263 Integer InverseMod(const Integer& n) const; 264 word InverseMod(word n) const;
|
H A D | modarith.hpp | 97 {return result1 = a.InverseMod(modulus);} in MultiplicativeInverse()
|
/dports/databases/mysql55-client/mysql-5.5.62/extra/yassl/taocrypt/include/ |
H A D | integer.hpp | 263 Integer InverseMod(const Integer& n) const; 264 word InverseMod(word n) const;
|
H A D | modarith.hpp | 97 {return result1 = a.InverseMod(modulus);} in MultiplicativeInverse()
|