OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:modInverse
(Results
1 - 25
of
33
) 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
...]
BigIntegerTest.java
365
* @tests java.math.BigInteger#
modInverse
(java.math.BigInteger)
374
inv = a.
modInverse
(mod);
395
inv = a.
modInverse
(mod);
/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
95
k = k.
modInverse
(params.getQ()).multiply(
132
BigInteger w = s.
modInverse
(params.getQ());
ECDSASigner.java
115
s = k.
modInverse
(n).multiply(e.add(d.multiply(r))).mod(n);
153
BigInteger c = s.
modInverse
(n);
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/
RSABlindedEngine.java
111
BigInteger rInv = r.
modInverse
(m);
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/
ECFieldElement.java
178
return new Fp(q, modMult(x, b.toBigInteger().
modInverse
(q)));
207
return new Fp(q, r, x.
modInverse
(q));
[
all
...]
IntArray.java
726
public IntArray
modInverse
(int m, int[] ks)
Tnaf.java
511
BigInteger u1invert = us[1].
modInverse
(twoToW);
LongArray.java
[
all
...]
/libcore/luni/src/main/java/java/math/
BigInteger.java
[
all
...]
BigInt.java
332
static BigInt
modInverse
(BigInt a, BigInt m) {
/system/core/libmincrypt/tools/
DumpPublicKey.java
125
BigInteger N0inv = B.subtract(N.
modInverse
(B)); // -1 / N[0] mod 2^32
/cts/suite/cts/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
...]
/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
/external/chromium_org/third_party/libaddressinput/src/java/
android.jar
/prebuilts/sdk/10/
android.jar
/prebuilts/sdk/11/
android.jar
/prebuilts/sdk/13/
android.jar
/prebuilts/sdk/16/
android.jar
Completed in 3463 milliseconds
1
2