| /external/apache-harmony/security/src/test/api/java/org/apache/harmony/security/tests/java/security/spec/ |
| RSAMultiPrimePrivateCrtKeySpecTest.java | 58 * <code>RSAMultiPrimePrivateCrtKeySpec(BigInteger modulus,
87 * <code>RSAMultiPrimePrivateCrtKeySpec(BigInteger modulus,
97 * Assertion: NullPointerException if modulus is null
118 * <code>RSAMultiPrimePrivateCrtKeySpec(BigInteger modulus,
149 * <code>RSAMultiPrimePrivateCrtKeySpec(BigInteger modulus,
180 * <code>RSAMultiPrimePrivateCrtKeySpec(BigInteger modulus,
211 * <code>RSAMultiPrimePrivateCrtKeySpec(BigInteger modulus,
242 * <code>RSAMultiPrimePrivateCrtKeySpec(BigInteger modulus,
273 * <code>RSAMultiPrimePrivateCrtKeySpec(BigInteger modulus,
304 * <code>RSAMultiPrimePrivateCrtKeySpec(BigInteger modulus,
[all...] |
| /libcore/luni/src/test/java/tests/security/spec/ |
| RSAMultiPrimePrivateCrtKeySpecTest.java | 51 * <code>RSAMultiPrimePrivateCrtKeySpec(BigInteger modulus,
80 * <code>RSAMultiPrimePrivateCrtKeySpec(BigInteger modulus,
90 * Assertion: NullPointerException if modulus is null
111 * <code>RSAMultiPrimePrivateCrtKeySpec(BigInteger modulus,
142 * <code>RSAMultiPrimePrivateCrtKeySpec(BigInteger modulus,
173 * <code>RSAMultiPrimePrivateCrtKeySpec(BigInteger modulus,
204 * <code>RSAMultiPrimePrivateCrtKeySpec(BigInteger modulus,
235 * <code>RSAMultiPrimePrivateCrtKeySpec(BigInteger modulus,
266 * <code>RSAMultiPrimePrivateCrtKeySpec(BigInteger modulus,
297 * <code>RSAMultiPrimePrivateCrtKeySpec(BigInteger modulus,
[all...] |
| /external/gemmlowp/internal/ |
| common.h | 197 // the fixed Modulus.
198 template <unsigned Modulus, typename Integer>
200 return i - (i % Modulus);
204 // the fixed Modulus.
205 template <unsigned Modulus, typename Integer>
207 return RoundDown<Modulus>(i + Modulus - 1);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/rpcsvc/ |
| key_prot.x | 58 * PROOT and MODULUS define the way the Diffie-Hellman key is generated.
60 * MODULUS should be chosen as a prime of the form: MODULUS == 2*p + 1,
64 * (1) (PROOT ** 2) % MODULUS != 1
65 * (2) (PROOT ** p) % MODULUS != 1
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/rpcsvc/ |
| key_prot.x | 58 * PROOT and MODULUS define the way the Diffie-Hellman key is generated.
60 * MODULUS should be chosen as a prime of the form: MODULUS == 2*p + 1,
64 * (1) (PROOT ** 2) % MODULUS != 1
65 * (2) (PROOT ** p) % MODULUS != 1
|
| /external/libcxx/test/std/numerics/rand/rand.eng/rand.eng.lcong/ |
| values.pass.cpp | 19 // static constexpr result_type modulus = m;
39 static_assert((LCE::modulus == m), "");
45 where(LCE::modulus);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/rand/rand.eng/rand.eng.lcong/ |
| values.pass.cpp | 19 // static constexpr result_type modulus = m;
39 static_assert((LCE::modulus == m), "");
45 where(LCE::modulus);
|
| /external/ppp/pppd/ |
| srp-entry.c | 23 * Index, if supplied, is the modulus/generator index from
26 * then the default "well known" EAP SRP-SHA1 modulus/generator is
29 * The default modulus/generator can be requested as index 0.
129 mytce.modulus.data = (u_char *)wkmodulus;
130 mytce.modulus.len = sizeof (wkmodulus);
136 (void) fprintf(stderr, "SRP modulus/generator %d not found\n",
|
| /system/core/libmincrypt/tools/ |
| DumpPublicKey.java | 50 BigInteger modulus = key.getModulus(); local
62 if (modulus.bitLength() != 2048) {
63 throw new Exception("Modulus should be 2048 bits long but is " +
64 modulus.bitLength() + " bits.");
113 int nwords = N.bitLength() / 32; // # of 32 bit integers in modulus
133 // Write out modulus as little endian array of integers.
|
| /external/chromium-trace/catapult/third_party/gsutil/third_party/pyasn1-modules/pyasn1_modules/ |
| rfc2437.py | 31 namedtype.NamedType('modulus', univ.Integer()),
43 namedtype.NamedType('modulus', univ.Integer()),
|
| /external/compiler-rt/lib/builtins/arm/ |
| modsi3.S | 1 /*===-- modsi3.S - 32-bit signed integer modulus --------------------------===//
10 * This file implements the __modsi3 (32-bit signed integer modulus) function
|
| /external/tpm2/ |
| RSA_Decrypt.c | 19 // TPM_RC_SIZE cipherText is not the size of the modulus of key referenced by
22 // greater that the modulus of keyHandle
|
| /device/google/contexthub/util/nanoapp_sign/ |
| nanoapp_sign.c | 120 uint32_t modulus[RSA_LIMBS]; member in struct:RsaData
136 memcpy(rsa->modulus, sigPack + RSA_BYTES, RSA_BYTES);
139 rsaResult = rsaPubOp(&rsa->state, rsa->num, rsa->modulus);
232 memcpy(masterPubKey, rsa->modulus, RSA_BYTES);
270 if (memcmp(masterPubKey, rsa->modulus, RSA_BYTES) == 0) {
384 rsaResult = rsaPrivOp(&rsa->state, rsa->num, rsa->exponent, rsa->modulus);
395 ret = (fwrite(rsa->modulus, 1, RSA_BYTES, out) == RSA_BYTES) ? 0 : 2;
512 if (!readFile(rsa.modulus, sizeof(rsa.modulus), keyPubFile))
515 printHashRev(stderr, "RSA modulus", rsa.modulus, RSA_LIMBS)
[all...] |
| /art/runtime/interpreter/mterp/arm/ |
| binopLit16.S | 9 * vCC (r1). Useful for integer division and modulus.
|
| /art/runtime/interpreter/mterp/arm64/ |
| binopLit16.S | 9 * vCC (w1). Useful for integer division and modulus.
|
| binopLit8.S | 9 * vCC (w1). Useful for integer division and modulus.
|
| binopWide.S | 9 * vCC (w1). Useful for integer division and modulus.
|
| binopWide2addr.S | 8 * vCC (w1). Useful for integer division and modulus.
|
| /art/runtime/interpreter/mterp/mips/ |
| binop.S | 9 * vCC (a1). Useful for integer division and modulus. Note that we
|
| binop2addr.S | 8 * vCC (a1). Useful for integer division and modulus.
|
| binopLit16.S | 9 * vCC (a1). Useful for integer division and modulus.
|
| binopLit8.S | 9 * vCC (a1). Useful for integer division and modulus.
|
| /art/runtime/interpreter/mterp/mips64/ |
| binop.S | 9 * vCC (a1). Useful for integer division and modulus. Note that we
|
| binop2addr.S | 9 * vB (a1). Useful for integer division and modulus. Note that we
|
| binopLit16.S | 9 * CCCC (a1). Useful for integer division and modulus.
|
