| /libcore/ojluni/src/main/java/java/security/spec/ |
| RSAKeyGenParameterSpec.java | 61 * @param keysize the modulus size (specified in number of bits)
|
| /libcore/ojluni/src/main/java/sun/security/ssl/ |
| JsseJce.java | 355 BigInteger modulus; local
357 modulus = ((RSAPublicKey)key).getModulus();
360 modulus = spec.getModulus();
362 return modulus.bitLength();
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/ |
| RSAKeyPairGenerator.java | 67 // generate a modulus of the required length
81 // calculate the modulus
|
| /external/compiler-rt/lib/builtins/arm/ |
| udivmodsi4.S | 1 /*===-- udivmodsi4.S - 32-bit unsigned integer divide and modulus ---------===//
11 * modulus) function for the ARM 32-bit architecture.
|
| umodsi3.S | 1 /*===-- umodsi3.S - 32-bit unsigned integer modulus -----------------------===//
10 * This file implements the __umodsi3 (32-bit unsigned integer modulus)
|
| /external/v8/src/runtime/ |
| runtime-operators.cc | 67 Object::Modulus(isolate, lhs, rhs));
79 isolate, result, Object::Modulus(isolate, lhs, rhs, Strength::STRONG));
|
| /external/webrtc/webrtc/modules/rtp_rtcp/test/testAPI/ |
| test_api_video.cc | 100 // Max in the RFC 3550 is 255 bytes, we limit it to be modulus 32 for SRTP.
105 padding_bytes_in_packet = (bytes + 16) & 0xffe0; // Keep our modulus 32.
|
| /external/wpa_supplicant_8/src/crypto/ |
| crypto_gnutls.c | 156 const u8 *modulus, size_t modulus_len,
167 gcry_mpi_scan(&bn_modulus, GCRYMPI_FMT_USG, modulus, modulus_len,
|
| /external/wpa_supplicant_8/src/tls/ |
| bignum.c | 191 * @c: Bignum from bignum_init(); modulus
211 * @c: Bignum from bignum_init(); modulus
|
| /prebuilts/go/darwin-x86/src/crypto/rsa/ |
| rsa.go | 23 N *big.Int // modulus
38 errPublicModulus = errors.New("crypto/rsa: missing public modulus")
147 modulus := new(big.Int).Set(bigOne)
153 modulus.Mul(modulus, prime)
155 if modulus.Cmp(priv.N) != 0 {
156 return errors.New("crypto/rsa: invalid modulus")
320 // The message must be no longer than the length of the public modulus less
|
| /prebuilts/go/linux-x86/src/crypto/rsa/ |
| rsa.go | 23 N *big.Int // modulus
38 errPublicModulus = errors.New("crypto/rsa: missing public modulus")
147 modulus := new(big.Int).Set(bigOne)
153 modulus.Mul(modulus, prime)
155 if modulus.Cmp(priv.N) != 0 {
156 return errors.New("crypto/rsa: invalid modulus")
320 // The message must be no longer than the length of the public modulus less
|
| /system/tpm/trunks/ |
| trunks_client_test.h | 114 // Generates an RSA key pair in software. The |modulus| and |prime_factor|
118 void GenerateRSAKeyPair(std::string* modulus,
|
| trunks_client_test.cc | 175 std::string modulus; local
177 GenerateRSAKeyPair(&modulus, &prime_factor, nullptr);
181 TpmUtility::AsymmetricKeyUsage::kDecryptAndSignKey, modulus, 0x10001,
1034 std::string modulus; local
[all...] |
| /external/boringssl/linux-aarch64/crypto/bn/ |
| armv8-mont.S | 160 // Final step. We see if result is larger than modulus, and
161 // if it is, subtract the modulus. But comparison implies
162 // subtraction. So we subtract modulus, see if it borrowed,
826 // Final step. We see if result is larger than modulus, and
827 // if it is, subtract the modulus. But comparison implies
828 // subtraction. So we subtract modulus, see if it borrowed,
920 // x19-7,x28 hold result, x6-7 hold modulus
940 // x6-7 hold result-modulus
1294 // Final step. We see if result is larger than modulus, and
1295 // if it is, subtract the modulus. But comparison implie
[all...] |
| /libcore/ojluni/src/main/java/java/security/ |
| KeyPairGenerator.java | 56 * corresponds to the length of the modulus).
72 * <p>If the algorithm is the <i>DSA</i> algorithm, and the keysize (modulus
75 * <code>g</code> parameters. If the modulus size is not one of the above
78 * three modulus sizes mentioned above. Still others might not have a list of
98 * For example, the <i>Sun</i> provider uses a default modulus size (keysize)
351 * algorithm-specific metric, such as modulus length, specified in
366 * algorithm-specific metric, such as modulus length, specified in
|
| AlgorithmParameterGenerator.java | 48 * of the prime modulus (in bits).
58 * consist of the size of the prime modulus and the size of the
66 * default modulus prime size of 1024 bits for the generation of DSA
|
| /external/ipsec-tools/src/racoon/ |
| prsa_par.y | 141 %token MODULUS PUBLIC_EXPONENT PRIVATE_EXPONENT
290 MODULUS COLON HEX
291 { if (!rsa_cur->n) rsa_cur->n = $3; else { prsaerror ("Modulus already defined\n"); YYABORT; } }
|
| /external/libchrome/crypto/ |
| rsa_private_key.cc | 28 // modulus INTEGER,
91 // Create a sequence with the modulus (n) and public exponent (e).
116 // Create a sequence with the modulus (n) and public exponent (e).
|
| /external/skia/src/codec/ |
| SkBmpStandardCodec.cpp | 312 int modulus; local
313 SkTDivMod(srcX, 8, "ient, &modulus);
314 uint32_t shift = 7 - modulus;
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/ |
| numbers.py | 310 def __pow__(self, exponent, modulus=None):
311 """self ** exponent % modulus, but maybe faster.
313 Accept the modulus argument if you want to support the
|
| /prebuilts/gdb/linux-x86/lib/python2.7/ |
| numbers.py | 310 def __pow__(self, exponent, modulus=None):
311 """self ** exponent % modulus, but maybe faster.
313 Accept the modulus argument if you want to support the
|
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/big/ |
| int_test.go | 1221 modulus string
1228 var element, modulus, gcd, inverse Int
[all...] |
| /prebuilts/go/linux-x86/src/cmd/compile/internal/big/ |
| int_test.go | 1221 modulus string
1228 var element, modulus, gcd, inverse Int
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| numbers.py | 310 def __pow__(self, exponent, modulus=None):
311 """self ** exponent % modulus, but maybe faster.
313 Accept the modulus argument if you want to support the
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| numbers.py | 310 def __pow__(self, exponent, modulus=None):
311 """self ** exponent % modulus, but maybe faster.
313 Accept the modulus argument if you want to support the
|
