Searched refs:modInverse (Results 1 – 9 of 9) sorted by relevance
42 BigInteger mi = s.modInverse(prime); in main()47 BigInteger nmi = ns.modInverse(prime); in main()
722 BigInteger inv = x.modInverse(m); in modInv()
138 aNumber.modInverse(modulus); in testmodInverseException()155 aNumber.modInverse(modulus); in testmodInverseNonInvertible()172 BigInteger result = aNumber.modInverse(modulus); in testmodInversePos1()192 BigInteger result = aNumber.modInverse(modulus); in testmodInversePos2()212 BigInteger result = aNumber.modInverse(modulus); in testmodInverseNeg1()230 BigInteger result = aNumber.modInverse(modulus); in testmodInverseNeg2()
370 inv = a.modInverse(mod); in test_modInverseLjava_math_BigInteger()391 inv = a.modInverse(mod); in test_modInverseLjava_math_BigInteger()
200 BigInteger newRes = arg.modInverse(product); in repeatModInverse()207 if (!lastRes.mod(odd1).equals(arg.modInverse(odd1))) { in repeatModInverse()210 if (!lastRes.mod(odd2).equals(arg.modInverse(odd2))) { in repeatModInverse()
93 …@libcore.util.NonNull public BigInteger modInverse(@libcore.util.NonNull BigInteger m) { throw new… in modInverse() method in BigInteger
2907 return (invertResult ? result.modInverse(m) : result); in modPow()2943 BigInteger y1 = m2.modInverse(m1); in modPow()2944 BigInteger y2 = m1.modInverse(m2); in modPow()2959 return (invertResult ? result.modInverse(m) : result); in modPow()3453 public BigInteger modInverse(BigInteger m) {
2077 return modInverse(p);2094 MutableBigInteger oddPart = modInverse(oddMod);2194 private MutableBigInteger modInverse(MutableBigInteger mod) {
5358 method @NonNull public java.math.BigInteger modInverse(@NonNull java.math.BigInteger);