HomeSort by relevance Sort by last modified time
    Searched refs:modInverse (Results 1 - 25 of 29) sorted by null

1 2

  /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/math/
BigIntegerModPowTest.java 28 * Methods: modPow, modInverse, and gcd
128 * modInverse: non-positive modulus
138 aNumber.modInverse(modulus);
145 * modInverse: non-invertible number
155 aNumber.modInverse(modulus);
162 * modInverse: positive number
172 BigInteger result = aNumber.modInverse(modulus);
182 * modInverse: positive number (another case: a < 0)
192 BigInteger result = aNumber.modInverse(modulus);
202 * modInverse: negative numbe
    [all...]
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/
RSAKeyPairGenerator.java 132 d = e.modInverse(phi);
141 qInv = q.modInverse(p);
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/signers/
DSASigner.java 73 k = k.modInverse(params.getQ()).multiply(
110 BigInteger w = s.modInverse(params.getQ());
ECDSASigner.java 92 s = k.modInverse(n).multiply(e.add(d.multiply(r))).mod(n);
130 BigInteger c = s.modInverse(n);
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/
RSABlindedEngine.java 111 BigInteger rInv = r.modInverse(m);
  /external/ganymed-ssh2/src/main/java/ch/ethz/ssh2/signature/
DSASHA1Verify.java 172 BigInteger w = s.modInverse(q);
204 k = k.modInverse(pk.getQ()).multiply(m.add((pk).getX().multiply(r)));
  /system/core/libmincrypt/tools/
DumpPublicKey.java 91 BigInteger N0inv = B.subtract(N.modInverse(B)); // -1 / N[0] mod 2^32
  /libcore/luni/src/main/java/org/apache/harmony/security/provider/crypto/
SHA1withDSA_SignatureImpl.java 234 s = k.modInverse(q).multiply(digestBI.add(x.multiply(r)).mod(q))
370 w = s.modInverse(q);
  /libcore/luni/src/main/java/java/math/
BigInteger.java     [all...]
BigInt.java 332 static BigInt modInverse(BigInt a, BigInt m) {
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/
ECFieldElement.java 87 return new Fp(q, x.multiply(b.toBigInteger().modInverse(q)).mod(q));
102 return new Fp(q, x.modInverse(q));
    [all...]
Tnaf.java 525 BigInteger u1invert = us[1].modInverse(twoToW);
  /libcore/harmony-tests/src/test/java/tests/api/java/math/
BigIntegerTest.java 365 * @tests java.math.BigInteger#modInverse(java.math.BigInteger)
374 inv = a.modInverse(mod);
395 inv = a.modInverse(mod);
  /cts/suite/pts/deviceTests/browserbench/assets/octane/
crypto.js     [all...]
  /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v4/
v8-crypto.js     [all...]
  /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v5/
v8-crypto.js     [all...]
  /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v6/
v8-crypto.js     [all...]
  /external/chromium_org/v8/benchmarks/
crypto.js     [all...]
  /external/v8/benchmarks/
crypto.js     [all...]
  /prebuilts/devtools/tools/lib/
bcprov-jdk15on-1.48.jar 
  /prebuilts/tools/common/m2/repository/org/bouncycastle/bcprov-jdk15on/1.48/
bcprov-jdk15on-1.48.jar 
  /prebuilts/sdk/10/
android.jar 
  /prebuilts/sdk/11/
android.jar 
  /prebuilts/sdk/13/
android.jar 
  /prebuilts/sdk/16/
android.jar 

Completed in 694 milliseconds

1 2