HomeSort by relevance Sort by last modified time
    Searched refs:digest_size_ (Results 1 - 4 of 4) sorted by null

  /system/keymaster/
hkdf.cpp 40 UniquePtr<uint8_t[]> zeros(new uint8_t[digest_size_]);
44 memset(zeros.get(), 0, digest_size_);
45 result = prk_hmac.Init(zeros.get(), digest_size_);
50 UniquePtr<uint8_t[]> pseudo_random_key(new uint8_t[digest_size_]);
51 if (pseudo_random_key.get() == nullptr || digest_size_ != prk_hmac.DigestLength())
54 prk_hmac.Sign(secret_key_.get(), secret_key_len_, pseudo_random_key.get(), digest_size_);
62 const size_t num_blocks = (output_len + digest_size_ - 1) / digest_size_;
66 UniquePtr<uint8_t[]> buf(new uint8_t[digest_size_ + info_len + 1]);
67 UniquePtr<uint8_t[]> digest(new uint8_t[digest_size_]);
    [all...]
iso18033kdf.cpp 36 if ((0xFFFFFFFFULL + start_counter_) * digest_size_ < (uint64_t)output_len)
43 size_t num_blocks = (output_len + digest_size_ - 1) / digest_size_;
45 UniquePtr<uint8_t[]> digest_result(new uint8_t[digest_size_]);
73 uint32_t uint32_digest_size_ = digest_size_;
75 uint32_digest_size_ != digest_size_)
78 size_t block_start = digest_size_ * block;
79 size_t block_length = min(digest_size_, output_len - block_start);
kdf.cpp 29 digest_size_ = 20;
33 digest_size_ = 32;
kdf.h 48 size_t digest_size_; member in class:keymaster::Kdf

Completed in 549 milliseconds