HomeSort by relevance Sort by last modified time
    Searched full:modulus (Results 101 - 125 of 737) sorted by null

1 2 3 45 6 7 8 91011>>

  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/util/encoders/
Base64Encoder.java 65 int modulus = length % 3; local
66 int dataLength = (length - modulus);
87 switch (modulus)
116 return (dataLength / 3) * 4 + ((modulus == 0) ? 0 : 4);
  /external/conscrypt/src/main/java/org/conscrypt/
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));
OpenSSLRSAKeyPairGenerator.java 31 * Default modulus size is 0x10001 (65537)
OpenSSLSignatureRawRSA.java 99 // Allocate buffer according to RSA modulus size.
117 // Allocate buffer according to RSA modulus size.
136 + inputBuffer.length + " (modulus size)");
  /external/google-tv-pairing-protocol/java/src/com/google/polo/pairing/
PoloChallengeResponse.java 73 * <li>the client key's modulus,</li>
75 * <li>the server key's modulus,</li>
120 logVerbose(" client modulus: " + PoloUtil.bytesToHexString(clientModulus));
122 logVerbose(" server modulus: " + PoloUtil.bytesToHexString(serverModulus));
  /external/tpm2/
Certify.c 18 // modulus of signHandle, or the buffer for the result in signature is too
CpriRSA.c 18 // This function computes the private exponent de = 1 mod (p-1)*(q-1) The inputs are the public modulus
21 // private exponent. If the computed value is smaller than the public modulus, the private exponent is de-
27 // CRYPT_PARAMETER prime is not half the size of the modulus, or the modulus is not evenly
119 // This function computes the private exponent de = 1 mod (p-1)*(q-1) The inputs are the public modulus
121 // If both primes are provided, the public modulus is computed. If only one prime is provided, the second
165 bnN = BN_CTX_get(context); // public modulus (n)
186 // Multiply the primes to get the public modulus
189 // if the space provided for the public modulus is large enough,
251 // CRYPT_PARAMETER number to exponentiate is larger than the modulus
    [all...]
CertifyCreation.c 19 // modulus of signHandle, or the buffer for the result in signature is too
GetCommandAuditDigest.c 20 // TPM_RC_VALUE digest generated for the given scheme is greater than the modulus of
GetSessionAuditDigest.c 21 // TPM_RC_VALUE digest generated for the given scheme is greater than the modulus of
GetTime.c 20 // TPM_RC_VALUE digest generated for the given scheme is greater than the modulus of
RSA_Encrypt.c 19 // TPM_RC_VALUE the numeric value of message is greater than the public modulus of
  /external/wpa_supplicant_8/src/tls/
tlsv1_client_i.h 54 /* The prime modulus used for Diffie-Hellman */
  /frameworks/base/tests/MusicServiceDemo/src/com/example/android/musicservicedemo/
Utils.java 72 if (m < 0) { // java modulus can be negative
  /libcore/luni/src/test/java/tests/security/spec/
RSAPrivateKeySpecTest.java 50 * Assertion: returns modulus
RSAPublicKeySpecTest.java 64 * Assertion: returns modulus
  /system/core/include/mincrypt/
rsa.h 43 uint32_t n[RSANUMWORDS]; /* modulus as little endian array */
  /libcore/luni/src/main/java/java/math/
BigInteger.java     [all...]
  /system/tpm/attestation/server/
pkcs11_key_store.cc 262 // Extract the modulus from the public key.
272 std::string modulus(BN_num_bytes(public_key.get()->n), 0);
274 string_as_array(&modulus)));
276 LOG(ERROR) << "Pkcs11KeyStore: Failed to extract public key modulus.";
279 modulus.resize(length);
286 std::string id = Sha1(modulus);
288 CK_ULONG modulus_bits = modulus.size() * 8;
305 {CKA_MODULUS, string_as_array(&modulus), modulus.size()}
335 {CKA_MODULUS, string_as_array(&modulus), modulus.size()}
    [all...]
  /external/libchrome/crypto/
rsa_private_key.h 46 // that will be parsed & serialized (modulus(), etc...) during Import(),
73 std::vector<uint8_t>* modulus() { return &modulus_; } function in class:crypto::PrivateKeyInfoCodec
150 // The byte-significance of the stored components (modulus, etc..).
  /external/apache-harmony/security/src/test/api/java/org/apache/harmony/security/tests/java/security/spec/
RSAPublicKeySpecTest.java 72 * Assertion: returns modulus
  /external/iptables/extensions/
libxt_HMARK.man 24 Modulus for hash calculation (to limit the range of possible marks)
  /external/v8/test/webkit/
mod-crash.js 48 // Test that reusing a floating point value after use in a modulus works correctly.
  /external/vboot_reference/firmware/2lib/include/
2rsa.h 18 const uint32_t *n; /* Modulus as little endian array */
  /external/vboot_reference/tests/
rsa_padding_test.h 17 /* The modulus of the public key (RSA-1024). */

Completed in 977 milliseconds

1 2 3 45 6 7 8 91011>>