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

1 2 3 4 5 6 7

  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/params/
RSAKeyParameters.java 8 private BigInteger modulus; field in class:RSAKeyParameters
13 BigInteger modulus,
18 this.modulus = modulus;
24 return modulus;
RSAPrivateCrtKeyParameters.java 19 BigInteger modulus,
28 super(true, modulus, privateExponent);
  /libcore/luni/src/main/java/java/security/spec/
RSAPrivateKeySpec.java 30 // Modulus
31 private final BigInteger modulus; field in class:RSAPrivateKeySpec
36 * Creates a new {@code RSAPrivateKeySpec} with the specified modulus and
39 * @param modulus
40 * the modulus {@code n}.
44 public RSAPrivateKeySpec(BigInteger modulus, BigInteger privateExponent) {
45 this.modulus = modulus;
50 * Returns the modulus {@code n}.
52 * @return the modulus {@code n}
    [all...]
RSAPublicKeySpec.java 30 // Modulus
31 private final BigInteger modulus; field in class:RSAPublicKeySpec
36 * Creates a new {@code RSAPublicKeySpec} with the specified modulus and
39 * @param modulus
40 * the modulus {@code n}.
44 public RSAPublicKeySpec(BigInteger modulus, BigInteger publicExponent) {
45 this.modulus = modulus;
50 * Returns the modulus {@code n}.
52 * @return the modulus {@code n}
    [all...]
  /external/dropbear/libtommath/etc/
mont.c 6 mp_int modulus, R, p, pp; local
11 mp_init_multi(&modulus, &R, &p, &pp, NULL);
17 /* make up the odd modulus */
18 mp_rand(&modulus, x);
19 modulus.dp[0] |= 1;
22 mp_montgomery_calc_normalization(&R, &modulus);
23 mp_montgomery_setup(&modulus, &mp);
29 mp_montgomery_reduce(&pp, &modulus, mp);
  /external/libvpx/libvpx/vp9/decoder/
vp9_dsubexp.c 34 static int merge_index(int v, int n, int modulus) {
35 int max1 = (n - 1 - modulus / 2) / modulus + 1;
37 v = v * modulus + modulus / 2;
42 v += (v + modulus - modulus / 2) / modulus;
43 while (v % modulus == modulus / 2 |
    [all...]
  /external/openssh/regress/
ssh2putty.sh 27 modulus=`
28 openssl rsa -noout -modulus -in $KEYFILE | grep ^Modulus= |
29 sed 's/^Modulus=/0x/' | tr A-Z a-z
33 echo "rsa2@$PORT:$HOST $public_exponent,$modulus"
  /external/dropbear/libtomcrypt/src/pk/ecc/
ltc_ecc_map.c 29 @param modulus The modulus of the field the ECC curve is in
33 int ltc_ecc_map(ecc_point *P, void *modulus, void *mp)
39 LTC_ARGCHK(modulus != NULL);
47 if ((err = mp_montgomery_reduce(P->z, modulus, mp)) != CRYPT_OK) { goto done; }
50 if ((err = mp_invmod(P->z, modulus, t1)) != CRYPT_OK) { goto done; }
54 if ((err = mp_mod(t2, modulus, t2)) != CRYPT_OK) { goto done; }
56 if ((err = mp_mod(t1, modulus, t1)) != CRYPT_OK) { goto done; }
60 if ((err = mp_montgomery_reduce(P->x, modulus, mp)) != CRYPT_OK) { goto done; }
62 if ((err = mp_montgomery_reduce(P->y, modulus, mp)) != CRYPT_OK) { goto done;
    [all...]
ltc_ecc_projective_add_point.c 31 @param modulus The modulus of the field the ECC curve is in
35 int ltc_ecc_projective_add_point(ecc_point *P, ecc_point *Q, ecc_point *R, void *modulus, void *mp)
43 LTC_ARGCHK(modulus != NULL);
51 if ((err = mp_sub(modulus, Q->y, t1)) != CRYPT_OK) { goto done; }
57 return ltc_ecc_projective_dbl_point(P, R, modulus, mp);
68 if ((err = mp_montgomery_reduce(t1, modulus, mp)) != CRYPT_OK) { goto done; }
71 if ((err = mp_montgomery_reduce(x, modulus, mp)) != CRYPT_OK) { goto done; }
74 if ((err = mp_montgomery_reduce(t1, modulus, mp)) != CRYPT_OK) { goto done; }
77 if ((err = mp_montgomery_reduce(y, modulus, mp)) != CRYPT_OK) { goto done;
    [all...]
ltc_ecc_projective_dbl_point.c 30 @param modulus The modulus of the field the ECC curve is in
34 int ltc_ecc_projective_dbl_point(ecc_point *P, ecc_point *R, void *modulus, void *mp)
41 LTC_ARGCHK(modulus != NULL);
56 if ((err = mp_montgomery_reduce(t1, modulus, mp)) != CRYPT_OK) { goto done; }
59 if ((err = mp_montgomery_reduce(R->z, modulus, mp)) != CRYPT_OK) { goto done; }
62 if (mp_cmp(R->z, modulus) != LTC_MP_LT) {
63 if ((err = mp_sub(R->z, modulus, R->z)) != CRYPT_OK) { goto done; }
69 if ((err = mp_add(t2, modulus, t2)) != CRYPT_OK) { goto done; }
73 if (mp_cmp(t1, modulus) != LTC_MP_LT)
    [all...]
ltc_ecc_mulmod_timing.c 33 @param modulus The modulus of the field the ECC curve is in
37 int ltc_ecc_mulmod(void *k, ecc_point *G, ecc_point *R, void *modulus, int map)
48 LTC_ARGCHK(modulus != NULL);
51 if ((err = mp_montgomery_setup(modulus, &mp)) != CRYPT_OK) {
58 if ((err = mp_montgomery_normalization(mu, modulus)) != CRYPT_OK) {
82 if ((err = mp_mulmod(G->x, mu, modulus, tG->x)) != CRYPT_OK) { goto done; }
83 if ((err = mp_mulmod(G->y, mu, modulus, tG->y)) != CRYPT_OK) { goto done; }
84 if ((err = mp_mulmod(G->z, mu, modulus, tG->z)) != CRYPT_OK) { goto done; }
94 if ((err = ltc_mp.ecc_ptdbl(tG, M[1], modulus, mp)) != CRYPT_OK) { goto done;
    [all...]
ecc_test.c 32 void *modulus, *order; local
36 if ((err = mp_init_multi(&modulus, &order, NULL)) != CRYPT_OK) {
43 mp_clear_multi(modulus, order, NULL);
53 if ((err = mp_read_radix(modulus, (char *)ltc_ecc_sets[i].prime, 16)) != CRYPT_OK) { goto done; }
57 if ((err = mp_prime_is_prime(modulus, 8, &primality)) != CRYPT_OK) { goto done; }
76 if ((err = ltc_mp.ecc_ptmul(order, G, GG, modulus, 1)) != CRYPT_OK) { goto done; }
86 mp_clear_multi(order, modulus, NULL);
ltc_ecc_mul2add.c 34 @param modulus Modulus for curve
40 void *modulus)
54 LTC_ARGCHK(modulus != NULL);
97 if ((err = mp_montgomery_setup(modulus, &mp)) != CRYPT_OK) {
103 if ((err = mp_montgomery_normalization(mu, modulus)) != CRYPT_OK) {
108 if ((err = mp_mulmod(A->x, mu, modulus, precomp[1]->x)) != CRYPT_OK) { goto ERR_MU; }
109 if ((err = mp_mulmod(A->y, mu, modulus, precomp[1]->y)) != CRYPT_OK) { goto ERR_MU; }
110 if ((err = mp_mulmod(A->z, mu, modulus, precomp[1]->z)) != CRYPT_OK) { goto ERR_MU; }
112 if ((err = mp_mulmod(B->x, mu, modulus, precomp[1<<2]->x)) != CRYPT_OK) { goto ERR_MU;
    [all...]
ltc_ecc_mulmod.c 35 @param modulus The modulus of the field the ECC curve is in
39 int ltc_ecc_mulmod(void *k, ecc_point *G, ecc_point *R, void *modulus, int map)
50 LTC_ARGCHK(modulus != NULL);
53 if ((err = mp_montgomery_setup(modulus, &mp)) != CRYPT_OK) {
60 if ((err = mp_montgomery_normalization(mu, modulus)) != CRYPT_OK) {
89 if ((err = mp_mulmod(G->x, mu, modulus, tG->x)) != CRYPT_OK) { goto done; }
90 if ((err = mp_mulmod(G->y, mu, modulus, tG->y)) != CRYPT_OK) { goto done; }
91 if ((err = mp_mulmod(G->z, mu, modulus, tG->z)) != CRYPT_OK) { goto done; }
98 if ((err = ltc_mp.ecc_ptdbl(tG, M[0], modulus, mp)) != CRYPT_OK) { goto done;
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/function.objects/arithmetic.operations/
modulus.pass.cpp 12 // modulus
20 typedef std::modulus<int> F;
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/pkcs/
RSAPublicKey.java 17 private BigInteger modulus; field in class:RSAPublicKey
44 BigInteger modulus,
47 this.modulus = modulus;
62 modulus = ASN1Integer.getInstance(e.nextElement()).getPositiveValue();
68 return modulus;
80 * modulus INTEGER, -- n
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x509/
RSAPublicKeyStructure.java 20 private BigInteger modulus; field in class:RSAPublicKeyStructure
47 BigInteger modulus,
50 this.modulus = modulus;
65 modulus = ASN1Integer.getInstance(e.nextElement()).getPositiveValue();
71 return modulus;
83 * modulus INTEGER, -- n
  /libcore/crypto/src/main/java/org/conscrypt/
OpenSSLRSAPrivateKey.java 36 protected BigInteger modulus; field in class:OpenSSLRSAPrivateKey
60 final BigInteger modulus = rsaKeySpec.getModulus(); local
63 if (modulus == null) {
64 throw new InvalidKeySpecException("modulus == null");
71 modulus.toByteArray(),
93 final BigInteger modulus = rsaPrivateKey.getModulus(); local
96 if (modulus == null) {
97 throw new InvalidKeyException("modulus == null");
104 modulus.toByteArray(),
127 throw new NullPointerException("modulus == null")
    [all...]
OpenSSLRSAPublicKey.java 35 private BigInteger modulus; field in class:OpenSSLRSAPublicKey
101 modulus = new BigInteger(params[0]);
110 return modulus;
144 return modulus.equals(other.getModulus())
152 return modulus.hashCode() ^ publicExponent.hashCode();
160 sb.append("modulus=");
161 sb.append(modulus.toString(16));
174 modulus.toByteArray(),
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/
JCERSAPrivateKey.java 28 protected BigInteger modulus; field in class:JCERSAPrivateKey
40 this.modulus = key.getModulus();
47 this.modulus = spec.getModulus();
54 this.modulus = key.getModulus();
60 return modulus;
128 this.modulus = (BigInteger)in.readObject();
140 out.writeObject(modulus);
JCERSAPublicKey.java 22 private BigInteger modulus; field in class:JCERSAPublicKey
28 this.modulus = key.getModulus();
35 this.modulus = spec.getModulus();
42 this.modulus = key.getModulus();
53 this.modulus = pubKey.getModulus();
63 * return the modulus.
65 * @return the modulus.
69 return modulus;
126 buf.append(" modulus: ").append(this.getModulus().toString(16)).append(nl);
  /external/dropbear/libtomcrypt/src/math/
tfm_desc.c 408 static int tfm_ecc_projective_dbl_point(ecc_point *P, ecc_point *R, void *modulus, void *Mp)
415 LTC_ARGCHK(modulus != NULL);
431 fp_montgomery_reduce(&t1, modulus, mp);
434 fp_montgomery_reduce(R->z, modulus, mp);
437 if (fp_cmp(R->z, modulus) != FP_LT) {
438 fp_sub(R->z, modulus, R->z);
444 fp_add(&t2, modulus, &t2);
448 if (fp_cmp(&t1, modulus) != FP_LT) {
449 fp_sub(&t1, modulus, &t1);
453 fp_montgomery_reduce(&t2, modulus, mp)
    [all...]
  /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/math/
BigIntegerModPowTest.java 32 * modPow: non-positive modulus
43 BigInteger modulus = new BigInteger(mSign, mBytes); local
45 aNumber.modPow(exp, modulus);
71 BigInteger modulus = new BigInteger(mSign, mBytes); local
72 BigInteger result = aNumber.modPow(exp, modulus);
94 BigInteger modulus = new BigInteger(mSign, mBytes); local
95 BigInteger result = aNumber.modPow(exp, modulus);
128 * modInverse: non-positive modulus
136 BigInteger modulus = new BigInteger(mSign, mBytes); local
138 aNumber.modInverse(modulus);
153 BigInteger modulus = new BigInteger(mSign, mBytes); local
171 BigInteger modulus = new BigInteger(mSign, mBytes); local
191 BigInteger modulus = new BigInteger(mSign, mBytes); local
211 BigInteger modulus = new BigInteger(mSign, mBytes); local
229 BigInteger modulus = new BigInteger(mBytes); local
    [all...]
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jcajce/provider/asymmetric/rsa/
BCRSAPublicKey.java 20 private BigInteger modulus; field in class:BCRSAPublicKey
26 this.modulus = key.getModulus();
33 this.modulus = spec.getModulus();
40 this.modulus = key.getModulus();
51 this.modulus = pubKey.getModulus();
61 * return the modulus.
63 * @return the modulus.
67 return modulus;
124 buf.append(" modulus: ").append(this.getModulus().toString(16)).append(nl);
  /external/wpa_supplicant_8/src/crypto/
crypto_internal-modexp.c 18 const u8 *modulus, size_t modulus_len,
35 bignum_set_unsigned_bin(bn_modulus, modulus, modulus_len) < 0)

Completed in 682 milliseconds

1 2 3 4 5 6 7