| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/signers/ |
| D | DSASigner.java | 108 k = k.modInverse(q).multiply(m.add(x.multiply(r))); in generateSignature()
140 BigInteger w = s.modInverse(q); in verifySignature()
|
| D | ECDSASigner.java | 128 s = k.modInverse(n).multiply(e.add(d.multiply(r))).mod(n); in generateSignature()
162 BigInteger c = s.modInverse(n); in verifySignature()
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/ |
| D | RSAKeyPairGenerator.java | 124 d = e.modInverse(lcm); in generateKeyPair()
142 qInv = q.modInverse(p); in generateKeyPair()
|
| /external/bouncycastle/repackaged/bcprov/src/main/java/com/android/org/bouncycastle/crypto/generators/ |
| D | RSAKeyPairGenerator.java | 126 d = e.modInverse(lcm); in generateKeyPair()
144 qInv = q.modInverse(p); in generateKeyPair()
|
| /external/bouncycastle/repackaged/bcprov/src/main/java/com/android/org/bouncycastle/crypto/signers/ |
| D | DSASigner.java | 110 k = k.modInverse(q).multiply(m.add(x.multiply(r))); in generateSignature()
142 BigInteger w = s.modInverse(q); in verifySignature()
|
| D | ECDSASigner.java | 130 s = k.modInverse(n).multiply(e.add(d.multiply(r))).mod(n); in generateSignature()
164 BigInteger c = s.modInverse(n); in verifySignature()
|
| /external/ukey2/src/main/java/com/google/security/cryptauth/lib/securegcm/ |
| D | Ed25519.java | 228 return new BigInteger[] {p[X].multiply(p[Z].modInverse(Ed25519_P)).mod(Ed25519_P), // x = X / Z in toAffine()
229 p[Y].multiply(p[Z].modInverse(Ed25519_P)).mod(Ed25519_P)}; // y = Y / Z in toAffine()
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
| D | ECFieldElement.java | 202 return new Fp(q, r, modMult(x, modInverse(b.toBigInteger()))); in divide()
234 return new Fp(q, r, modInverse(x)); in invert()
418 protected BigInteger modInverse(BigInteger x) in modInverse() method in ECFieldElement.Fp
827 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 | 748 return new LongArray(x).modInverse(m, ks).toBigInteger();
|
| D | LongArray.java | 2022 public LongArray modInverse(int m, int[] ks) in modInverse() method in LongArray
|
| /external/bouncycastle/repackaged/bcprov/src/main/java/com/android/org/bouncycastle/math/ec/ |
| D | ECFieldElement.java | 212 return new Fp(q, r, modMult(x, modInverse(b.toBigInteger()))); in divide()
244 return new Fp(q, r, modInverse(x)); in invert()
428 protected BigInteger modInverse(BigInteger x) in modInverse() method in ECFieldElement.Fp
841 return new ECFieldElement.F2m(this.m, this.ks, this.x.modInverse(m, ks)); in invert()
|
| D | Tnaf.java | 522 BigInteger u1invert = us[1].modInverse(twoToW); in getTw()
|
| D | ECCurve.java | 760 return new LongArray(x).modInverse(m, ks).toBigInteger();
|
| D | LongArray.java | 2023 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 | 112 BigInteger rInv = r.modInverse(m); in processBlock()
|
| /external/bouncycastle/repackaged/bcprov/src/main/java/com/android/org/bouncycastle/crypto/engines/ |
| D | RSABlindedEngine.java | 114 BigInteger rInv = r.modInverse(m); in processBlock()
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/params/ |
| D | ECDomainParameters.java | 86 hInv = h.modInverse(n); in getHInv()
|
| /external/bouncycastle/repackaged/bcprov/src/main/java/com/android/org/bouncycastle/crypto/params/ |
| D | ECDomainParameters.java | 90 hInv = h.modInverse(n); in getHInv()
|
| /external/wycheproof/java/com/google/security/wycheproof/testcases/ |
| D | EcdsaTest.java | 595 BigInteger k = x.multiply(r).add(h).multiply(s.modInverse(n)).mod(n); in extractK()
|
| D | DsaTest.java | 758 BigInteger k = x.multiply(r).add(h).multiply(s.modInverse(q)).mod(q); in extractK()
|
| /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);
|