/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/ |
RSACoreEngine.java | 181 mP = (input.remainder(p)).modPow(dP, p); 184 mQ = (input.remainder(q)).modPow(dQ, q); 199 return input.modPow(
|
RSABlindedEngine.java | 108 BigInteger blindedInput = r.modPow(e, m).multiply(input).mod(m);
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/signers/ |
DSASigner.java | 98 BigInteger r = params.getG().modPow(k, params.getP()).mod(q); 138 u1 = params.getG().modPow(u1, p); 139 u2 = ((DSAPublicKeyParameters)key).getY().modPow(u2, p);
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/math/ |
BigIntegerModPowTest.java | 28 * Methods: modPow, modInverse, and gcd 32 * modPow: non-positive modulus 45 aNumber.modPow(exp, modulus); 51 BigInteger.ZERO.modPow(new BigInteger("-1"), new BigInteger("10")); 59 * modPow: positive exponent 72 BigInteger result = aNumber.modPow(exp, modulus); 82 * modPow: negative exponent 95 BigInteger result = aNumber.modPow(exp, modulus); 113 base[i].modPow(exp, mod[j])); 122 base[i].modPow(exp, mod[j])) [all...] |
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/agreement/ |
DHBasicAgreement.java | 69 return pub.getY().modPow(key.getX(), dhParams.getP());
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/ |
DHKeyGeneratorHelper.java | 65 return dhParams.getG().modPow(x, dhParams.getP());
|
DHParametersHelper.java | 96 // while (g.modPow(TWO, p).equals(ONE) || g.modPow(q, p).equals(ONE)); 106 g = h.modPow(TWO, p);
|
DSAKeyPairGenerator.java | 67 return g.modPow(x, p);
|
DSAParametersGenerator.java | 207 BigInteger g = h.modPow(e, p); 359 BigInteger g = W.modPow(e, p);
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jcajce/provider/asymmetric/dh/ |
KeyAgreementSpi.java | 106 result = ((DHPublicKey)key).getY().modPow(x, p); 111 result = ((DHPublicKey)key).getY().modPow(x, p);
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
ECFieldElement.java | 241 return checkSqrt(new Fp(q, r, x.modPow(e, q))); 246 BigInteger t1 = x.modPow(q.shiftRight(3), q); 256 BigInteger t4 = ECConstants.TWO.modPow(q.shiftRight(2), q); 266 if (!(x.modPow(legendreExponent, q).equals(ECConstants.ONE))) 286 || !modReduce(P.multiply(P).subtract(fourX)).modPow(legendreExponent, q).equals(qMinusOne));
|
/cts/suite/cts/deviceTests/browserbench/assets/octane/ |
crypto.js | [all...] |
/external/v8/benchmarks/ |
crypto.js | [all...] |
/libcore/luni/src/main/java/java/math/ |
BigInteger.java | [all...] |
/prebuilts/devtools/tools/lib/ |
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 | |
/prebuilts/sdk/20/ |
android.jar | |
/prebuilts/sdk/22/ |
android.jar | |
/prebuilts/sdk/5/ |
android.jar | |
/prebuilts/sdk/7/ |
android.jar | |
/prebuilts/sdk/8/ |
android.jar | |
/prebuilts/sdk/9/ |
android.jar | |