Home
last modified time | relevance | path

Searched refs:modInverse (Results 1 – 11 of 11) sorted by relevance

/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/signers/
DDSASigner.java101 k = k.modInverse(q).multiply(m.add(x.multiply(r))); in generateSignature()
133 BigInteger w = s.modInverse(q); in verifySignature()
DECDSASigner.java122 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/
DRSAKeyPairGenerator.java123 d = e.modInverse(lcm); in generateKeyPair()
141 qInv = q.modInverse(p); in generateKeyPair()
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/
DECFieldElement.java193 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()
DTnaf.java521 BigInteger u1invert = us[1].modInverse(twoToW); in getTw()
DECCurve.java661 return new LongArray(x).modInverse(m, ks).toBigInteger(); in inverse()
DLongArray.java2017 public LongArray modInverse(int m, int[] ks) in modInverse() method in LongArray
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/
DRSABlindedEngine.java111 BigInteger rInv = r.modInverse(m); in processBlock()
/external/wycheproof/java/com/google/security/wycheproof/testcases/
DEcdsaTest.java595 BigInteger k = x.multiply(r).add(h).multiply(s.modInverse(n)).mod(n); in extractK()
DDsaTest.java758 BigInteger k = x.multiply(r).add(h).multiply(s.modInverse(q)).mod(q); in extractK()
/external/v8/benchmarks/
Dcrypto.js1330 BigInteger.prototype.modInverse = bnModInverse; method in BigInteger
1618 this.d = ee.modInverse(phi);
1621 this.coeff = this.q.modInverse(this.p);