| /dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/generators/ |
| DHParametersGenerator.java | 66 if (g.modPow(TWO, p).equals(ONE))
71 if (g.modPow(q, p).equals(ONE))
|
| DHKeyGeneratorHelper.java | 66 return g.modPow(x, p);
|
| DSAKeyPairGenerator.java | 52 y = g.modPow(x, p);
|
| DSAParametersGenerator.java | 167 g = h.modPow(pMinusOneOverQ, p);
|
| /dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/agreement/ |
| DHAgreement.java | 67 return dhParams.getG().modPow(privateValue, dhParams.getP());
84 return message.modPow(key.getX(), dhParams.getP()).multiply(pub.getY().modPow(privateValue, dhParams.getP())).mod(dhParams.getP());
|
| DHBasicAgreement.java | 70 return pub.getY().modPow(key.getX(), dhParams.getP());
|
| /dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/engines/ |
| RSAEngine.java | 145 mP = (input.remainder(p)).modPow(dP, p);
148 mQ = (input.remainder(q)).modPow(dQ, q);
163 output = input.modPow(
|
| /dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/signers/ |
| DSASigner.java | 71 BigInteger r = params.getG().modPow(k, params.getP()).mod(params.getQ());
115 u1 = params.getG().modPow(u1, params.getP());
116 u2 = ((DSAPublicKeyParameters)key).getY().modPow(u2, params.getP());
|
| /dalvik/libcore/security/src/main/java/org/bouncycastle/jce/provider/ |
| JCEDHKeyAgreement.java | 72 result = ((DHPublicKey)key).getY().modPow(x, p);
77 result = ((DHPublicKey)key).getY().modPow(x, p);
|
| /dalvik/libcore/security/src/main/java/org/apache/harmony/security/provider/crypto/ |
| SHA1withDSA_SignatureImpl.java | 238 r = g.modPow(k, p).mod(q);
384 v = g.modPow(u1, p).multiply(y.modPow(u2, p)).mod(p).mod(q);
|
| /dalvik/libcore/math/src/test/java/org/apache/harmony/math/tests/java/math/ |
| BigIntegerModPowTest.java | 35 * Methods: modPow, modInverse, and gcd
39 * modPow: non-positive modulus
43 notes = "This is a complete subset of tests for modPow method.",
44 method = "modPow",
58 aNumber.modPow(exp, modulus);
66 * modPow: positive exponent
70 notes = "This is a complete subset of tests for modPow method.",
71 method = "modPow",
85 BigInteger result = aNumber.modPow(exp, modulus);
95 * modPow: negative exponen
[all...] |
| /dalvik/libcore/security/src/main/java/org/bouncycastle/openssl/ |
| PEMWriter.java | 163 BigInteger y = p.getG().modPow(x, p.getP());
|
| /external/v8/benchmarks/ |
| crypto.js | [all...] |
| /external/webkit/SunSpider/tests/v8-v4/ |
| v8-crypto.js | [all...] |
| /dalvik/libcore/math/src/main/java/java/math/ |
| BigInteger.java | [all...] |
| /prebuilt/sdk/5/ |
| android.jar | |
| /prebuilt/sdk/7/ |
| android.jar | |
| /prebuilt/sdk/8/ |
| android.jar | |
