Searched refs:modInverse (Results 1 – 9 of 9) sorted by relevance
112 d = e.modInverse(lcm); in generateKeyPair()118 if (d.bitLength() <= qbitlength || !d.equals(e.modInverse(phi))) in generateKeyPair()134 qInv = q.modInverse(p); in generateKeyPair()
100 k = k.modInverse(q).multiply(m.add(x.multiply(r))); in generateSignature()132 BigInteger w = s.modInverse(q); in verifySignature()
120 s = k.modInverse(n).multiply(e.add(d.multiply(r))).mod(n); in generateSignature()154 BigInteger c = s.modInverse(n); in verifySignature()
183 return new Fp(q, r, modMult(x, modInverse(b.toBigInteger()))); in divide()215 return new Fp(q, r, modInverse(x)); in invert()399 protected BigInteger modInverse(BigInteger x) in modInverse() method in ECFieldElement.Fp771 return new ECFieldElement.F2m(this.m, this.ks, this.x.modInverse(m, ks)); in invert()
511 BigInteger u1invert = us[1].modInverse(twoToW); in getTw()
2015 public LongArray modInverse(int m, int[] ks) in modInverse() method in LongArray
111 BigInteger rInv = r.modInverse(m); in processBlock()
1330 BigInteger.prototype.modInverse = bnModInverse; method in BigInteger1618 this.d = ee.modInverse(phi);1621 this.coeff = this.q.modInverse(this.p);
META-INF/ META-INF/MANIFEST.MF com/ com/android/ com/ ...