| /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;
|
| /external/dropbear/libtomcrypt/src/pk/ecc/ |
| 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);
|
| /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);
|
| /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/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
|
| 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/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
|
| /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);
|
| 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/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/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...] |
| /libcore/luni/src/main/java/org/apache/harmony/xnet/provider/jsse/ |
| 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));
|
| 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...] |
| 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(),
|
| /system/core/libmincrypt/tools/ |
| DumpPublicKey.java | 44 BigInteger modulus = key.getModulus(); local
56 if (modulus.bitLength() != 2048) {
57 throw new Exception("Modulus should be 2048 bits long but is " +
58 modulus.bitLength() + " bits.");
77 int nwords = N.bitLength() / 32; // # of 32 bit integers in modulus
97 // 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/chromium/crypto/ |
| rsa_private_key.h | 52 // that will be parsed & serialized (modulus(), etc...) during Import(),
79 std::vector<uint8>* modulus() { return &modulus_; }; function in class:crypto::PrivateKeyInfoCodec
154 // The byte-significance of the stored components (modulus, etc..).
|
| /external/openssl/apps/ |
| dsa.c | 92 * -modulus - print the DSA public key
113 int modulus=0; local
186 else if (strcmp(*argv,"-modulus") == 0)
187 modulus=1;
234 BIO_printf(bio_err," -modulus print the DSA public value\n");
320 if (modulus)
|
| rsa.c | 92 * -modulus - print the RSA key modulus
116 int modulus=0; local
196 else if (strcmp(*argv,"-modulus") == 0)
197 modulus=1;
240 BIO_printf(bio_err," -modulus print the RSA key modulus\n");
333 if (modulus)
335 BIO_printf(out,"Modulus=");
|
| /external/apache-harmony/math/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/dropbear/libtomcrypt/demos/ |
| tv_gen.c | 664 void *k, *order, *modulus; local
674 mp_init(&modulus);
681 mp_read_radix(modulus, (char *)ltc_ecc_sets[x].prime, 16);
687 ltc_mp.ecc_ptmul(k, G, R, modulus, 1);
694 mp_clear_multi(k, order, modulus, NULL);
|
