12805544433

Committed 16 Jan 2025 09:08AM UTC coverage: 90.876% (-0.4%) from 91.245%

Build # 12805544433

Build Type

Pull #4540

github

Committed by

web-flow

Commit Message

Merge cc1ceff51 into 9b798efbb

Pull Request Pull Request #4540: PKCS #11 Version 3.2 Support

Run Details

93425 of 102805 relevant lines covered (90.88%)

11409241.89 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

95.65

/src/lib/kdf/kdf2/kdf2.cpp

/*
* KDF2
* (C) 1999-2007 Jack Lloyd
* (C) 2024      René Meusel, Rohde & Schwarz Cybersecurity
*
* Botan is released under the Simplified BSD License (see license.txt)
*/

#include <botan/internal/kdf2.h>

#include <botan/exceptn.h>
#include <botan/internal/bit_ops.h>
#include <botan/internal/fmt.h>
#include <botan/internal/stl_util.h>

namespace Botan {

std::string KDF2::name() const {
   return fmt("KDF2({})", m_hash->name());
}

std::unique_ptr<KDF> KDF2::new_object() const {
   return std::make_unique<KDF2>(m_hash->new_object());
}

void KDF2::perform_kdf(std::span<uint8_t> key,
                       std::span<const uint8_t> secret,
                       std::span<const uint8_t> salt,
                       std::span<const uint8_t> label) const {
   if(key.empty()) {
      return;
   }

   const size_t hash_output_length = m_hash->output_length();
   const auto blocks_required = ceil_division<uint64_t /* for 32bit systems */>(key.size(), hash_output_length);

   // This KDF uses a 32-bit counter for the hash blocks, initialized at 1.
   // It will wrap around after 2^32 - 1 iterations limiting the theoretically
   // possible output to 2^32 - 1 blocks.
   BOTAN_ARG_CHECK(blocks_required <= 0xFFFFFFFE, "KDF2 maximum output length exceeeded");

   BufferStuffer k(key);
   for(uint32_t counter = 1; !k.full(); ++counter) {
      BOTAN_ASSERT_NOMSG(counter != 0);  // no overflow

      m_hash->update(secret);
      m_hash->update_be(counter);
      m_hash->update(label);
      m_hash->update(salt);

      // Write straight into the output buffer, except if the hash output needs
      // a truncation in the final iteration.
      if(k.remaining_capacity() >= hash_output_length) {
         m_hash->final(k.next(hash_output_length));
      } else {
         const auto h = m_hash->final();
         k.append(std::span{h}.first(k.remaining_capacity()));
      }
   }
}

}  // namespace Botan

1	/*
2	* KDF2
3	* (C) 1999-2007 Jack Lloyd
4	* (C) 2024 René Meusel, Rohde & Schwarz Cybersecurity
5	*
6	* Botan is released under the Simplified BSD License (see license.txt)
7	*/
8
9	#include <botan/internal/kdf2.h>
10
11	#include <botan/exceptn.h>
12	#include <botan/internal/bit_ops.h>
13	#include <botan/internal/fmt.h>
14	#include <botan/internal/stl_util.h>
15
16	namespace Botan {
17
18	std::string KDF2::name() const {	240✔
19	return fmt("KDF2({})", m_hash->name());	240✔
20	}
21
22	std::unique_ptr<KDF> KDF2::new_object() const {	119✔
23	return std::make_unique<KDF2>(m_hash->new_object());	238✔
24	}
25
26	void KDF2::perform_kdf(std::span<uint8_t> key,	6,354✔
27	std::span<const uint8_t> secret,
28	std::span<const uint8_t> salt,
29	std::span<const uint8_t> label) const {
30	if(key.empty()) {	6,354✔
31	return;	×
32	}
33
34	const size_t hash_output_length = m_hash->output_length();	6,354✔
35	const auto blocks_required = ceil_division<uint64_t /* for 32bit systems */>(key.size(), hash_output_length);	6,354✔
36
37	// This KDF uses a 32-bit counter for the hash blocks, initialized at 1.
38	// It will wrap around after 2^32 - 1 iterations limiting the theoretically
39	// possible output to 2^32 - 1 blocks.
40	BOTAN_ARG_CHECK(blocks_required <= 0xFFFFFFFE, "KDF2 maximum output length exceeeded");	6,354✔
41
42	BufferStuffer k(key);	6,354✔
43	for(uint32_t counter = 1; !k.full(); ++counter) {	19,111✔
44	BOTAN_ASSERT_NOMSG(counter != 0); // no overflow	12,757✔
45
46	m_hash->update(secret);	12,757✔
47	m_hash->update_be(counter);	12,757✔
48	m_hash->update(label);	12,757✔
49	m_hash->update(salt);	12,757✔
50
51	// Write straight into the output buffer, except if the hash output needs
52	// a truncation in the final iteration.
53	if(k.remaining_capacity() >= hash_output_length) {	12,757✔
54	m_hash->final(k.next(hash_output_length));	11,952✔
55	} else {
56	const auto h = m_hash->final();	805✔
57	k.append(std::span{h}.first(k.remaining_capacity()));	805✔
58	}	805✔
59	}
60	}	805✔
61
62	} // namespace Botan

randombit / botan / 12805544433

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous