HomeSort by relevance Sort by last modified time
    Searched refs:modulus (Results 26 - 50 of 169) sorted by null

12 3 4 5 6 7

  /libcore/luni/src/main/java/java/security/spec/
RSAPrivateCrtKeySpec.java 46 * modulus, public exponent, private exponent, prime factors, prime
49 * @param modulus
50 * the modulus {@code n}.
66 public RSAPrivateCrtKeySpec(BigInteger modulus,
75 super(modulus, privateExponent);
RSAMultiPrimePrivateCrtKeySpec.java 48 * modulus, public exponent, private exponent, prime factors, prime
51 * @param modulus
52 * the modulus {@code n}.
74 BigInteger modulus,
84 super(modulus, privateExponent);
87 if (modulus == null) {
88 throw new NullPointerException("modulus == null");
  /external/stlport/test/unit/
modulus_test.cpp 35 transform((int*)input1, (int*)input1 + 4, (int*)input2, (int*)output, modulus<int>());
  /ndk/tests/device/test-gnustl-full/unit/
modulus_test.cpp 35 transform((int*)input1, (int*)input1 + 4, (int*)input2, (int*)output, modulus<int>());
  /ndk/tests/device/test-stlport/unit/
modulus_test.cpp 35 transform((int*)input1, (int*)input1 + 4, (int*)input2, (int*)output, modulus<int>());
  /external/dropbear/libtomcrypt/src/math/fp/
ltc_ecc_fp_mulmod.c     [all...]
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jcajce/provider/asymmetric/rsa/
BCRSAPrivateKey.java 28 protected BigInteger modulus; field in class:BCRSAPrivateKey
40 this.modulus = key.getModulus();
47 this.modulus = spec.getModulus();
54 this.modulus = key.getModulus();
60 return modulus;
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/pkcs/
RSAPrivateKey.java 18 private BigInteger modulus; field in class:RSAPrivateKey
52 BigInteger modulus,
62 this.modulus = modulus;
84 modulus = ((ASN1Integer)e.nextElement()).getValue();
106 return modulus;
149 * modulus INTEGER, -- n
RSAPrivateKeyStructure.java 21 private BigInteger modulus; field in class:RSAPrivateKeyStructure
54 BigInteger modulus,
64 this.modulus = modulus;
86 modulus = ((ASN1Integer)e.nextElement()).getValue();
108 return modulus;
151 * modulus INTEGER, -- n
  /external/dropbear/libtomcrypt/testprof/
ecc_test.c 35 void *modulus, *mp, *kA, *kB, *rA, *rB; local
40 DO(mp_init_multi(&kA, &kB, &rA, &rB, &modulus, NULL));
58 DO(mp_read_radix(modulus, ltc_ecc_sets[z].prime, 16));
59 DO(mp_montgomery_setup(modulus, &mp));
70 DO(ltc_mp.ecc_ptmul(rA, G, A, modulus, 1));
73 DO(ltc_mp.ecc_ptmul(rB, G, B, modulus, 1));
82 DO(ltc_mp.ecc_ptmul(kA, A, C1, modulus, 0));
83 DO(ltc_mp.ecc_ptmul(kB, B, C2, modulus, 0));
84 DO(ltc_mp.ecc_ptadd(C1, C2, C1, modulus, mp));
85 DO(ltc_mp.ecc_map(C1, modulus, mp))
    [all...]
  /external/libvpx/libvpx/vp9/encoder/
vp9_subexp.c 33 static int split_index(int i, int n, int modulus) {
34 int max1 = (n - 1 - modulus / 2) / modulus + 1;
35 if (i % modulus == modulus / 2)
36 i = i / modulus;
38 i = max1 + i - (i + modulus - modulus / 2) / 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/chromium_org/net/android/
keystore.h 35 // Returns the modulus of a given RSAPrivateKey platform object,
40 // |modulus| will receive the modulus bytes on success.
44 std::vector<uint8>* modulus);
  /external/chromium/crypto/
rsa_private_key_win.cc 59 pki.modulus()->size() +
78 rsa_pub_key->bitlen = pki.modulus()->size() * 8;
87 memcpy(dest, &pki.modulus()->front(), pki.modulus()->size());
88 dest += pki.modulus()->size();
161 pki.modulus()->assign(pos, pos + mod_size);
  /external/chromium_org/third_party/tlslite/tlslite/utils/
cryptomath.py 263 def powMod(base, power, modulus):
266 modulus = gmpy.mpz(modulus)
267 result = pow(base, power, modulus)
274 def powMod(base, power, modulus):
277 """ Return base**power mod modulus, using multi bit scanning
299 lowPowers.append((lowPowers[i-1] * base) % modulus)
310 prod = (prod * prod) % modulus
311 if nib: prod = (prod * lowPowers[nib]) % modulus
315 prodInv = invMod(prod, modulus)
    [all...]
  /libcore/crypto/src/main/java/org/conscrypt/
OpenSSLRSAPrivateCrtKey.java 58 BigInteger modulus = rsaKeySpec.getModulus(); local
61 if (modulus == null) {
62 throw new InvalidKeySpecException("modulus == null");
69 * OpenSSL uses the public modulus to do RSA blinding. If
70 * the public modulus is not available, the call to
82 modulus.toByteArray(),
96 BigInteger modulus = rsaPrivateKey.getModulus(); local
99 if (modulus == null) {
100 throw new InvalidKeyException("modulus == null");
107 * OpenSSL uses the public modulus to do RSA blinding. I
    [all...]
OpenSSLRSAKeyFactory.java 181 BigInteger modulus = rsaKey.getModulus(); local
191 return engineGeneratePrivate(new RSAPrivateCrtKeySpec(modulus, publicExponent,
199 BigInteger modulus = rsaKey.getModulus(); local
203 return engineGeneratePrivate(new RSAPrivateKeySpec(modulus, privateExponent));
  /system/core/libmincrypt/tools/
DumpPublicKey.java 46 BigInteger modulus = key.getModulus(); local
58 if (modulus.bitLength() != 2048) {
59 throw new Exception("Modulus should be 2048 bits long but is " +
60 modulus.bitLength() + " bits.");
79 int nwords = N.bitLength() / 32; // # of 32 bit integers in modulus
99 // Write out modulus as little endian array of integers.
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/util/encoders/
Base64Encoder.java 62 int modulus = length % 3; local
63 int dataLength = (length - modulus);
84 switch (modulus)
113 return (dataLength / 3) * 4 + ((modulus == 0) ? 0 : 4);
  /external/openssh/
dh.c 135 logit("WARNING: %s does not exist, using fixed modulus",
265 dh_new_group_asc(const char *gen, const char *modulus)
272 if (BN_hex2bn(&dh->p, modulus) == 0)
286 dh_new_group(BIGNUM *gen, BIGNUM *modulus)
292 dh->p = modulus;
  /external/chromium_org/chrome/browser/chromeos/policy/
auto_enrollment_client_unittest.cc 85 void ServerWillReply(int64 modulus, bool with_hashes, bool with_serial_hash) {
89 if (modulus >= 0)
90 enrollment_response->set_expected_modulus(modulus);
169 EXPECT_EQ(16, auto_enrollment_request().modulus());
241 EXPECT_EQ(128, auto_enrollment_request().modulus());
288 EXPECT_EQ(1, auto_enrollment_request().modulus());
304 EXPECT_EQ(GG_INT64_C(1) << i, auto_enrollment_request().modulus());
auto_enrollment_client.cc 44 // The modulus value is sent in an int64 field in the protobuf, whose maximum
155 LOG(ERROR) << "Initial auto-enrollment modulus is larger than the limit, "
304 // Server is asking us to retry with a different modulus.
305 int64 modulus = enrollment_response.expected_modulus(); local
306 int power = NextPowerOf2(modulus);
307 if ((GG_INT64_C(1) << power) != modulus) {
309 << "modulus. Using the closest power-of-2 instead "
310 << "(" << modulus << " vs 2^" << power << ")";
314 << "modulus but the server asked for a new one again: "
318 << "modulus than the client accepts (" << power << " vs
    [all...]
  /external/dropbear/libtomcrypt/src/headers/
tomcrypt_pk.h 25 /** The modulus */
104 /** The modulus */
256 int ltc_ecc_projective_dbl_point(ecc_point *P, ecc_point *R, void *modulus, void *mp);
259 int ltc_ecc_projective_add_point(ecc_point *P, ecc_point *Q, ecc_point *R, void *modulus, void *mp);
263 int ltc_ecc_fp_mulmod(void *k, ecc_point *G, ecc_point *R, void *modulus, int map);
270 int ltc_ecc_mulmod(void *k, ecc_point *G, ecc_point *R, void *modulus, int map);
277 void *modulus);
282 ecc_point *C, void *modulus);
289 int ltc_ecc_map(ecc_point *P, void *modulus, void *mp);
295 /* Max diff between group and modulus size in bytes *
    [all...]
tomcrypt_math.h 242 @param b The modulus (upto bits_per_digit in length)
267 @param c The modulus
275 @param b The modulus
283 @param b The modulus
292 @param a The modulus
300 @param b The modulus
307 @param b The modulus
324 @param c The modulus integer
343 @param modulus The modulus for the fiel
    [all...]
  /hardware/qcom/keymaster/
keymaster_qcom.h 51 uint8_t modulus[KM_KEY_SIZE_MAX]; member in struct:qcom_km_key_blob

Completed in 1081 milliseconds

12 3 4 5 6 7