Searched refs:modInverse (Results 1 – 9 of 9) sorted by relevance
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/signers/ |
| D | DSASigner.java | 100 k = k.modInverse(q).multiply(m.add(x.multiply(r))); in generateSignature()
132 BigInteger w = s.modInverse(q); in verifySignature()
|
| D | ECDSASigner.java | 122 s = k.modInverse(n).multiply(e.add(d.multiply(r))).mod(n); in generateSignature()
156 BigInteger c = s.modInverse(n); in verifySignature()
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/ |
| D | RSAKeyPairGenerator.java | 125 d = e.modInverse(lcm); in generateKeyPair()
143 qInv = q.modInverse(p); in generateKeyPair()
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
| D | ECFieldElement.java | 193 return new Fp(q, r, modMult(x, modInverse(b.toBigInteger()))); in divide()
225 return new Fp(q, r, modInverse(x)); in invert()
409 protected BigInteger modInverse(BigInteger x) in modInverse() method in ECFieldElement.Fp
791 return new ECFieldElement.F2m(this.m, this.ks, this.x.modInverse(m, ks)); in invert()
|
| D | Tnaf.java | 521 BigInteger u1invert = us[1].modInverse(twoToW); in getTw()
|
| D | ECCurve.java | 661 return new LongArray(x).modInverse(m, ks).toBigInteger(); in inverse()
|
| D | LongArray.java | 2017 public LongArray modInverse(int m, int[] ks) in modInverse() method in LongArray
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/ |
| D | RSABlindedEngine.java | 111 BigInteger rInv = r.modInverse(m); in processBlock()
|
| /external/v8/benchmarks/ |
| D | crypto.js | 1330 BigInteger.prototype.modInverse = bnModInverse; method in BigInteger
1618 this.d = ee.modInverse(phi);
1621 this.coeff = this.q.modInverse(this.p);
|