HomeSort by relevance Sort by last modified time
    Searched refs:algorithm (Results 226 - 250 of 4302) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/vboot_reference/host/lib/
host_keyblock.c 23 siglen_map[signing_key->algorithm] : 0));
52 siglen_map[signing_key->algorithm], signed_size);
77 uint64_t algorithm,
83 siglen_map[algorithm]);
114 siglen_map[algorithm], signed_size);
123 signing_key_pem_file, algorithm,
  /external/bouncycastle/bcpkix/src/main/java/org/bouncycastle/operator/jcajce/
JcaDigestCalculatorProviderBuilder.java 44 public DigestCalculator get(final AlgorithmIdentifier algorithm)
51 MessageDigest dig = helper.createDigest(algorithm);
64 return algorithm;
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jcajce/provider/asymmetric/ec/
KeyPairGeneratorSpi.java 52 String algorithm; field in class:KeyPairGeneratorSpi.EC
72 this.algorithm = "EC";
77 String algorithm,
80 super(algorithm);
81 this.algorithm = algorithm;
177 BCECPublicKey pubKey = new BCECPublicKey(algorithm, pub, p, configuration);
179 new BCECPrivateKey(algorithm, priv, pubKey, p, configuration));
183 return new KeyPair(new BCECPublicKey(algorithm, pub, configuration),
184 new BCECPrivateKey(algorithm, priv, configuration))
    [all...]
  /external/vboot_reference/firmware/2lib/
2sha_utility.c 49 * @param algorithm Crypto algorithm (vb2_crypto_algorithm)
51 * @return The hash algorithm for that crypto algorithm, or VB2_HASH_INVALID if
52 * the crypto algorithm or its corresponding hash algorithm is invalid or not
55 enum vb2_hash_algorithm vb2_crypto_to_hash(uint32_t algorithm)
57 if (algorithm < ARRAY_SIZE(crypto_to_hash))
58 return crypto_to_hash[algorithm];
  /external/webrtc/webrtc/base/
opensslidentity.h 74 // Compute the digest of the certificate given algorithm
75 bool ComputeDigest(const std::string& algorithm,
82 const std::string& algorithm,
87 bool GetSignatureDigestAlgorithm(std::string* algorithm) const override;
  /prebuilts/go/darwin-x86/src/hash/crc32/
crc32_generic.go 10 // The slicing-by-8 algorithm is a faster implementation that uses a bigger
16 // polynomial. The table is suitable for use with the simple algorithm
40 // simpleUpdate uses the simple algorithm to update the CRC, given a table that
53 // slicing8Table is array of 8 Tables, used by the slicing-by-8 algorithm.
57 // table is suitable for use with the slicing-by-8 algorithm (slicingUpdate).
71 // slicingUpdate uses the slicing-by-8 algorithm to update the CRC, given a
  /prebuilts/go/linux-x86/src/hash/crc32/
crc32_generic.go 10 // The slicing-by-8 algorithm is a faster implementation that uses a bigger
16 // polynomial. The table is suitable for use with the simple algorithm
40 // simpleUpdate uses the simple algorithm to update the CRC, given a table that
53 // slicing8Table is array of 8 Tables, used by the slicing-by-8 algorithm.
57 // table is suitable for use with the slicing-by-8 algorithm (slicingUpdate).
71 // slicingUpdate uses the slicing-by-8 algorithm to update the CRC, given a
  /external/ImageMagick/Magick++/demo/
flip.cpp 15 #include <algorithm>
  /external/avb/libavb/
avb_crypto.h 54 * verification. An algorithm consists of a hash type and a signature
65 * Each algorithm type is described below:
106 /* Holds algorithm-specific data. The |padding| is needed by avb_rsa_verify. */
113 /* Provides algorithm-specific data for a given |algorithm|. Returns NULL if
114 * |algorithm| is invalid.
116 const AvbAlgorithmData* avb_get_algorithm_data(AvbAlgorithmType algorithm)
  /external/boringssl/src/tool/
file.cc 17 #include <algorithm>
  /external/compiler-rt/test/asan/TestCases/Posix/
mmap_limit_mb.cc 18 #include <algorithm>
  /external/libcxx/test/libcxx/experimental/containers/sequences/dynarray/dynarray.mutate/
default.pass.cpp 22 #include <algorithm>
  /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/
partition_copy.pass.cpp 10 // <algorithm>
19 #include <algorithm>
  /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.random.shuffle/
random_shuffle.pass.cpp 10 // <algorithm>
17 #include <algorithm>
random_shuffle_urng.pass.cpp 10 // <algorithm>
16 #include <algorithm>
  /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.adjacent.find/
adjacent_find_pred.pass.cpp 10 // <algorithm>
17 #include <algorithm>
  /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.all_of/
all_of.pass.cpp 10 // <algorithm>
16 #include <algorithm>
  /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.count/
count_if.pass.cpp 10 // <algorithm>
17 #include <algorithm>
  /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/make.heap/
make_heap.pass.cpp 10 // <algorithm>
17 #include <algorithm>
  /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/pop.heap/
pop_heap.pass.cpp 10 // <algorithm>
17 #include <algorithm>
  /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/sort.heap/
sort_heap.pass.cpp 10 // <algorithm>
17 #include <algorithm>
  /external/libcxx/test/std/algorithms/alg.sorting/alg.min.max/
max_init_list.pass.cpp 12 // <algorithm>
18 #include <algorithm>
min_init_list.pass.cpp 12 // <algorithm>
18 #include <algorithm>
  /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.ops/
reverse.pass.cpp 16 #include <algorithm>
  /external/libcxx/test/std/experimental/algorithms/alg.search/
search.pass.cpp 12 // <algorithm>
21 #include <experimental/algorithm>

Completed in 2477 milliseconds

1 2 3 4 5 6 7 8 91011>>