20643915034

Committed 01 Jan 2026 07:04PM UTC coverage: 90.422% (+1.2%) from 89.189%

Build # 20643915034

Build Type

Pull #4783

github

Committed by

web-flow

Commit Message

Merge 1e9606ec8 into f2257be0a

Pull Request Pull Request #4783: Update deprecated mem_ops.h function calls to use std::span-based versions and resolve some TODOs

Run Details

101631 of 112396 relevant lines covered (90.42%)

12920407.49 hits per line

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

97.88

/src/lib/misc/roughtime/roughtime.cpp

/*
* Roughtime
* (C) 2019 Nuno Goncalves <nunojpg@gmail.com>
*
* Botan is released under the Simplified BSD License (see license.txt)
*/

#include <botan/roughtime.h>

#include <botan/base64.h>
#include <botan/hash.h>
#include <botan/mem_ops.h>
#include <botan/pubkey.h>
#include <botan/rng.h>
#include <botan/internal/socket_udp.h>
#include <botan/internal/stl_util.h>

#include <map>
#include <sstream>

namespace Botan {

namespace {

// This exists to work around a LGTM false positive
static_assert(Roughtime::request_min_size == 1024, "Expected minimum size");

template <class T>
struct is_array : std::false_type {};

template <class T, std::size_t N>
struct is_array<std::array<T, N>> : std::true_type {};

template <typename T>
T impl_from_little_endian(const uint8_t* t, const size_t i)
   requires(sizeof(T) <= sizeof(int64_t))
{
   return T(static_cast<int64_t>(t[i]) << i * 8) + (i == 0 ? T(0) : impl_from_little_endian<T>(t, i - 1));
}

template <typename T>
T from_little_endian(const uint8_t* t) {
   return impl_from_little_endian<T>(t, sizeof(T) - 1);
}

template <typename T>
T copy(const uint8_t* t)
   requires(is_array<T>::value)
{
   //arrays are endianness independent, so we do a memcpy
   return typecast_copy<T>(std::span<const uint8_t, sizeof(T)>(t, sizeof(T)));
}

template <typename T>
T copy(const uint8_t* t)
   requires(!is_array<T>::value)
{
   //other types are arithmetic, so we account that roughtime serializes as little endian
   return from_little_endian<T>(t);
}

template <typename T>
std::map<std::string, std::vector<uint8_t>> unpack_roughtime_packet(T bytes) {
   if(bytes.size() < 8) {
      throw Roughtime::Roughtime_Error("Map length is under minimum of 8 bytes");
   }
   const auto buf = bytes.data();
   const uint32_t num_tags = buf[0];
   const uint32_t start_content = num_tags * 8;
   if(start_content > bytes.size()) {
      throw Roughtime::Roughtime_Error("Map length too small to contain all tags");
   }
   uint32_t start = start_content;
   std::map<std::string, std::vector<uint8_t>> tags;
   for(uint32_t i = 0; i < num_tags; ++i) {
      const size_t end =
         ((i + 1) == num_tags) ? bytes.size() : start_content + from_little_endian<uint32_t>(buf + 4 + i * 4);
      if(end > bytes.size()) {
         throw Roughtime::Roughtime_Error("Tag end index out of bounds");
      }
      if(end < start) {
         throw Roughtime::Roughtime_Error("Tag offset must be more than previous tag offset");
      }
      const char* label_ptr = cast_uint8_ptr_to_char(buf) + (num_tags + i) * 4;
      const char label[] = {label_ptr[0], label_ptr[1], label_ptr[2], label_ptr[3], 0};
      auto ret = tags.emplace(label, std::vector<uint8_t>(buf + start, buf + end));
      if(!ret.second) {
         throw Roughtime::Roughtime_Error(std::string("Map has duplicated tag: ") + label);
      }
      start = static_cast<uint32_t>(end);
   }
   return tags;
}

template <typename T>
T get(const std::map<std::string, std::vector<uint8_t>>& map, const std::string& label) {
   const auto& tag = map.find(label);
   if(tag == map.end()) {
      throw Roughtime::Roughtime_Error("Tag " + label + " not found");
   }
   if(tag->second.size() != sizeof(T)) {
      throw Roughtime::Roughtime_Error("Tag " + label + " has unexpected size");
   }
   return copy<T>(tag->second.data());
}

const std::vector<uint8_t>& get_v(const std::map<std::string, std::vector<uint8_t>>& map, const std::string& label) {
   const auto& tag = map.find(label);
   if(tag == map.end()) {
      throw Roughtime::Roughtime_Error("Tag " + label + " not found");
   }
   return tag->second;
}

bool verify_signature(const std::array<uint8_t, 32>& pk,
                      const std::vector<uint8_t>& payload,
                      const std::array<uint8_t, 64>& signature) {
   constexpr std::string_view context("RoughTime v1 response signature\0", 32);
   const Ed25519_PublicKey key(std::vector<uint8_t>(pk.data(), pk.data() + pk.size()));
   PK_Verifier verifier(key, "Pure");
   verifier.update(context);
   verifier.update(payload);
   return verifier.check_signature(signature.data(), signature.size());
}

std::array<uint8_t, 64> hashLeaf(const std::array<uint8_t, 64>& leaf) {
   std::array<uint8_t, 64> ret{};
   auto hash = HashFunction::create_or_throw("SHA-512");
   hash->update(0);
   hash->update(leaf.data(), leaf.size());
   hash->final(ret.data());
   return ret;
}

void hashNode(std::span<uint8_t, 64> hash, std::span<const uint8_t, 64> node, bool reverse) {
   auto h = HashFunction::create_or_throw("SHA-512");
   h->update(1);
   if(reverse) {
      h->update(node.data(), node.size());
      h->update(hash.data(), hash.size());
   } else {
      h->update(hash.data(), hash.size());
      h->update(node.data(), node.size());
   }
   h->final(hash.data());
}

template <size_t N, typename T>
std::array<uint8_t, N> vector_to_array(std::vector<uint8_t, T> vec) {
   return typecast_copy<std::array<uint8_t, N>>(vec);
}
}  // namespace

namespace Roughtime {

Nonce::Nonce(const std::vector<uint8_t>& nonce) : m_nonce{} {
   if(nonce.size() != 64) {
      throw Invalid_Argument("Roughtime nonce must be 64 bytes long");
   }
   m_nonce = typecast_copy<std::array<uint8_t, 64>>(nonce);
}

Nonce::Nonce(RandomNumberGenerator& rng) : m_nonce(rng.random_array<64>()) {}

std::array<uint8_t, request_min_size> encode_request(const Nonce& nonce) {
   std::array<uint8_t, request_min_size> buf = {{2, 0, 0, 0, 64, 0, 0, 0, 'N', 'O', 'N', 'C', 'P', 'A', 'D', 0xff}};
   std::memcpy(buf.data() + 16, nonce.get_nonce().data(), nonce.get_nonce().size());
   std::memset(buf.data() + 16 + nonce.get_nonce().size(), 0, buf.size() - 16 - nonce.get_nonce().size());
   return buf;
}

Response Response::from_bits(const std::vector<uint8_t>& response, const Nonce& nonce) {
   const auto response_v = unpack_roughtime_packet(response);
   const auto cert = unpack_roughtime_packet(get_v(response_v, "CERT"));
   const auto cert_dele = get<std::array<uint8_t, 72>>(cert, "DELE");
   const auto cert_sig = get<std::array<uint8_t, 64>>(cert, "SIG");
   const auto cert_dele_v = unpack_roughtime_packet(cert_dele);
   const auto srep = get_v(response_v, "SREP");
   const auto srep_v = unpack_roughtime_packet(srep);

   const auto cert_dele_pubk = get<std::array<uint8_t, 32>>(cert_dele_v, "PUBK");
   const auto sig = get<std::array<uint8_t, 64>>(response_v, "SIG");
   if(!verify_signature(cert_dele_pubk, srep, sig)) {
      throw Roughtime_Error("Response signature invalid");
   }

   const auto indx = get<uint32_t>(response_v, "INDX");
   const auto path = get_v(response_v, "PATH");
   const auto srep_root = get<std::array<uint8_t, 64>>(srep_v, "ROOT");
   const size_t size = path.size();
   const size_t levels = size / 64;

   if(size % 64 != 0) {
      throw Roughtime_Error("Merkle tree path size must be multiple of 64 bytes");
   }
   if(indx >= (1U << levels)) {
      throw Roughtime_Error("Merkle tree path is too short");
   }

   BufferSlicer slicer(path);
   auto hash = hashLeaf(nonce.get_nonce());
   auto index = indx;
   for(std::size_t level = 0; level < levels; ++level) {
      hashNode(hash, slicer.take<64>(), index % 2 == 1);
      index >>= 1;
   }

   if(srep_root != hash) {
      throw Roughtime_Error("Nonce verification failed");
   }

   const auto cert_dele_maxt = sys_microseconds64(get<microseconds64>(cert_dele_v, "MAXT"));
   const auto cert_dele_mint = sys_microseconds64(get<microseconds64>(cert_dele_v, "MINT"));
   const auto srep_midp = sys_microseconds64(get<microseconds64>(srep_v, "MIDP"));
   const auto srep_radi = get<microseconds32>(srep_v, "RADI");
   if(srep_midp < cert_dele_mint) {
      throw Roughtime_Error("Midpoint earlier than delegation start");
   }
   if(srep_midp > cert_dele_maxt) {
      throw Roughtime_Error("Midpoint later than delegation end");
   }
   return {cert_dele, cert_sig, srep_midp, srep_radi};
}

bool Response::validate(const Ed25519_PublicKey& pk) const {
   constexpr std::string_view context("RoughTime v1 delegation signature--\0", 36);
   PK_Verifier verifier(pk, "Pure");
   verifier.update(context);
   verifier.update(m_cert_dele.data(), m_cert_dele.size());
   return verifier.check_signature(m_cert_sig.data(), m_cert_sig.size());
}

Nonce nonce_from_blind(const std::vector<uint8_t>& previous_response, const Nonce& blind) {
   std::array<uint8_t, 64> ret{};
   const auto blind_arr = blind.get_nonce();
   auto hash = HashFunction::create_or_throw("SHA-512");
   hash->update(previous_response);
   hash->update(hash->final());
   hash->update(blind_arr.data(), blind_arr.size());
   hash->final(ret.data());

   return Nonce(ret);
}

Chain::Chain(std::string_view str) {
   std::istringstream ss{std::string(str)};  // FIXME C++23 avoid copy
   const std::string ERROR_MESSAGE = "Line does not have 4 space separated fields";
   for(std::string s; std::getline(ss, s);) {
      size_t start = 0;
      size_t end = 0;
      end = s.find(' ', start);
      if(end == std::string::npos) {
         throw Decoding_Error(ERROR_MESSAGE);
      }
      const auto publicKeyType = s.substr(start, end - start);
      if(publicKeyType != "ed25519") {
         throw Not_Implemented("Only ed25519 publicKeyType is implemented");
      }

      start = end + 1;
      end = s.find(' ', start);
      if(end == std::string::npos) {
         throw Decoding_Error(ERROR_MESSAGE);
      }
      const auto serverPublicKey = Ed25519_PublicKey(base64_decode(s.substr(start, end - start)));

      start = end + 1;
      end = s.find(' ', start);
      if(end == std::string::npos) {
         throw Decoding_Error(ERROR_MESSAGE);
      }
      if((end - start) != 88) {
         throw Decoding_Error("Nonce has invalid length");
      }
      const auto vec = base64_decode(s.substr(start, end - start));
      const auto nonceOrBlind = Nonce(vector_to_array<64>(base64_decode(s.substr(start, end - start))));

      start = end + 1;
      end = s.find(' ', start);
      if(end != std::string::npos) {
         throw Decoding_Error(ERROR_MESSAGE);
      }
      const auto response = unlock(base64_decode(s.substr(start)));

      m_links.push_back({response, serverPublicKey, nonceOrBlind});
   }
}

std::vector<Response> Chain::responses() const {
   std::vector<Response> responses;
   for(size_t i = 0; i < m_links.size(); ++i) {
      const auto& l = m_links[i];
      const auto nonce = i > 0 ? nonce_from_blind(m_links[i - 1].response(), l.nonce_or_blind()) : l.nonce_or_blind();
      const auto response = Response::from_bits(l.response(), nonce);
      if(!response.validate(l.public_key())) {
         throw Roughtime_Error("Invalid signature or public key");
      }
      responses.push_back(response);
   }
   return responses;
}

Nonce Chain::next_nonce(const Nonce& blind) const {
   return m_links.empty() ? blind : nonce_from_blind(m_links.back().response(), blind);
}

void Chain::append(const Link& new_link, size_t max_chain_size) {
   if(max_chain_size <= 0) {
      throw Invalid_Argument("Max chain size must be positive");
   }

   while(m_links.size() >= max_chain_size) {
      if(m_links.size() == 1) {
         auto new_link_updated = new_link;
         new_link_updated.nonce_or_blind() =
            nonce_from_blind(m_links[0].response(), new_link.nonce_or_blind());  //we need to convert blind to nonce
         m_links.clear();
         m_links.push_back(new_link_updated);
         return;
      }
      if(m_links.size() >= 2) {
         m_links[1].nonce_or_blind() =
            nonce_from_blind(m_links[0].response(), m_links[1].nonce_or_blind());  //we need to convert blind to nonce
      }
      m_links.erase(m_links.begin());
   }
   m_links.push_back(new_link);
}

std::string Chain::to_string() const {
   std::string s;
   s.reserve((7 + 1 + 88 + 1 + 44 + 1 + 480) * m_links.size());
   for(const auto& link : m_links) {
      s += "ed25519";
      s += ' ';
      s += base64_encode(link.public_key().get_public_key());
      s += ' ';
      s += base64_encode(link.nonce_or_blind().get_nonce().data(), link.nonce_or_blind().get_nonce().size());
      s += ' ';
      s += base64_encode(link.response());
      s += '\n';
   }
   return s;
}

std::vector<uint8_t> online_request(std::string_view uri, const Nonce& nonce, std::chrono::milliseconds timeout) {
   const std::chrono::system_clock::time_point start_time = std::chrono::system_clock::now();
   auto socket = OS::open_socket_udp(uri, timeout);
   if(!socket) {
      throw Not_Implemented("No socket support enabled in build");
   }

   const auto encoded = encode_request(nonce);
   socket->write(encoded.data(), encoded.size());

   if(std::chrono::system_clock::now() - start_time > timeout) {
      throw System_Error("Timeout during socket write");
   }

   std::vector<uint8_t> buffer;
   buffer.resize(360 + 64 * 10 + 1);  //response basic size is 360 bytes + 64 bytes for each level of merkle tree
                                      //add one additional byte to be able to differentiate if datagram got truncated
   const auto n = socket->read(buffer.data(), buffer.size());

   if(n == 0 || std::chrono::system_clock::now() - start_time > timeout) {
      throw System_Error("Timeout waiting for response");
   }

   if(n == buffer.size()) {
      throw System_Error("Buffer too small");
   }

   buffer.resize(n);
   return buffer;
}

std::vector<Server_Information> servers_from_str(std::string_view str) {
   std::vector<Server_Information> servers;
   std::istringstream ss{std::string(str)};  // FIXME C++23 avoid copy

   const std::string ERROR_MESSAGE = "Line does not have at least 5 space separated fields";
   for(std::string s; std::getline(ss, s);) {
      size_t start = 0;
      size_t end = 0;
      end = s.find(' ', start);
      if(end == std::string::npos) {
         throw Decoding_Error(ERROR_MESSAGE);
      }
      const auto name = s.substr(start, end - start);

      start = end + 1;
      end = s.find(' ', start);
      if(end == std::string::npos) {
         throw Decoding_Error(ERROR_MESSAGE);
      }
      const auto publicKeyType = s.substr(start, end - start);
      if(publicKeyType != "ed25519") {
         throw Not_Implemented("Only ed25519 publicKeyType is implemented");
      }

      start = end + 1;
      end = s.find(' ', start);

      if(end == std::string::npos) {
         throw Decoding_Error(ERROR_MESSAGE);
      }
      const auto publicKeyBase64 = s.substr(start, end - start);
      const auto publicKey = Ed25519_PublicKey(base64_decode(publicKeyBase64));

      start = end + 1;
      end = s.find(' ', start);
      if(end == std::string::npos) {
         throw Decoding_Error(ERROR_MESSAGE);
      }
      const auto protocol = s.substr(start, end - start);
      if(protocol != "udp") {
         throw Not_Implemented("Only UDP protocol is implemented");
      }

      const auto addresses = [&]() {
         std::vector<std::string> addr;
         for(;;) {
            start = end + 1;
            end = s.find(' ', start);
            const auto address = s.substr(start, (end == std::string::npos) ? std::string::npos : end - start);
            if(address.empty()) {
               return addr;
            }
            addr.push_back(address);
            if(end == std::string::npos) {
               return addr;
            }
         }
      }();
      if(addresses.empty()) {
         throw Decoding_Error(ERROR_MESSAGE);
      }

      servers.push_back({name, publicKey, addresses});
   }
   return servers;
}

}  // namespace Roughtime

}  // namespace Botan

1	/*
2	* Roughtime
3	* (C) 2019 Nuno Goncalves <nunojpg@gmail.com>
4	*
5	* Botan is released under the Simplified BSD License (see license.txt)
6	*/
7
8	#include <botan/roughtime.h>
9
10	#include <botan/base64.h>
11	#include <botan/hash.h>
12	#include <botan/mem_ops.h>
13	#include <botan/pubkey.h>
14	#include <botan/rng.h>
15	#include <botan/internal/socket_udp.h>
16	#include <botan/internal/stl_util.h>
17
18	#include <map>
19	#include <sstream>
20
21	namespace Botan {
22
23	namespace {
24
25	// This exists to work around a LGTM false positive
26	static_assert(Roughtime::request_min_size == 1024, "Expected minimum size");
27
28	template <class T>
29	struct is_array : std::false_type {};
30
31	template <class T, std::size_t N>
32	struct is_array<std::array<T, N>> : std::true_type {};
33
34	template <typename T>
35	T impl_from_little_endian(const uint8_t* t, const size_t i)	921✔
36	requires(sizeof(T) <= sizeof(int64_t))
37	{
38	return T(static_cast<int64_t>(t[i]) << i * 8) + (i == 0 ? T(0) : impl_from_little_endian<T>(t, i - 1));	1,856✔
39	}
40
41	template <typename T>
42	T from_little_endian(const uint8_t* t) {	369✔
43	return impl_from_little_endian<T>(t, sizeof(T) - 1);	369✔
44	}
45
46	template <typename T>
47	T copy(const uint8_t* t)	142✔
48	requires(is_array<T>::value)
49	{
50	//arrays are endianness independent, so we do a memcpy
51	return typecast_copy<T>(std::span<const uint8_t, sizeof(T)>(t, sizeof(T)));	142✔
52	}
53
54	template <typename T>
55	T copy(const uint8_t* t)	92✔
56	requires(!is_array<T>::value)
57	{
58	//other types are arithmetic, so we account that roughtime serializes as little endian
59	return from_little_endian<T>(t);	92✔
60	}
61
62	template <typename T>
63	std::map<std::string, std::vector<uint8_t>> unpack_roughtime_packet(T bytes) {	124✔
64	if(bytes.size() < 8) {	94✔
65	throw Roughtime::Roughtime_Error("Map length is under minimum of 8 bytes");	1✔
66	}
67	const auto buf = bytes.data();	123✔
68	const uint32_t num_tags = buf[0];	123✔
69	const uint32_t start_content = num_tags * 8;	123✔
70	if(start_content > bytes.size()) {	123✔
71	throw Roughtime::Roughtime_Error("Map length too small to contain all tags");	1✔
72	}
73	uint32_t start = start_content;	122✔
74	std::map<std::string, std::vector<uint8_t>> tags;	122✔
75	for(uint32_t i = 0; i < num_tags; ++i) {	517✔
76	const size_t end =	457✔
77	((i + 1) == num_tags) ? bytes.size() : start_content + from_little_endian<uint32_t>(buf + 4 + i * 4);	614✔
78	if(end > bytes.size()) {	367✔
79	throw Roughtime::Roughtime_Error("Tag end index out of bounds");	1✔
80	}
81	if(end < start) {	396✔
82	throw Roughtime::Roughtime_Error("Tag offset must be more than previous tag offset");	1✔
83	}
84	const char* label_ptr = cast_uint8_ptr_to_char(buf) + (num_tags + i) * 4;	395✔
85	const char label[] = {label_ptr[0], label_ptr[1], label_ptr[2], label_ptr[3], 0};	395✔
86	auto ret = tags.emplace(label, std::vector<uint8_t>(buf + start, buf + end));	792✔
87	if(!ret.second) {	395✔
88	throw Roughtime::Roughtime_Error(std::string("Map has duplicated tag: ") + label);	×
89	}
90	start = static_cast<uint32_t>(end);	395✔
91	}
92	return tags;	120✔
93	}	2✔
94
95	template <typename T>
96	T get(const std::map<std::string, std::vector<uint8_t>>& map, const std::string& label) {	262✔
97	const auto& tag = map.find(label);	262✔
98	if(tag == map.end()) {	262✔
99	throw Roughtime::Roughtime_Error("Tag " + label + " not found");	2✔
100	}
101	if(tag->second.size() != sizeof(T)) {	261✔
102	throw Roughtime::Roughtime_Error("Tag " + label + " has unexpected size");	2✔
103	}
104	return copy<T>(tag->second.data());	260✔
105	}
106
107	const std::vector<uint8_t>& get_v(const std::map<std::string, std::vector<uint8_t>>& map, const std::string& label) {	87✔
108	const auto& tag = map.find(label);	87✔
109	if(tag == map.end()) {	87✔
110	throw Roughtime::Roughtime_Error("Tag " + label + " not found");	2✔
111	}
112	return tag->second;	86✔
113	}
114
115	bool verify_signature(const std::array<uint8_t, 32>& pk,	27✔
116	const std::vector<uint8_t>& payload,
117	const std::array<uint8_t, 64>& signature) {
118	constexpr std::string_view context("RoughTime v1 response signature\0", 32);	27✔
119	const Ed25519_PublicKey key(std::vector<uint8_t>(pk.data(), pk.data() + pk.size()));	27✔
120	PK_Verifier verifier(key, "Pure");	27✔
121	verifier.update(context);	27✔
122	verifier.update(payload);	27✔
123	return verifier.check_signature(signature.data(), signature.size());	54✔
124	}	27✔
125
126	std::array<uint8_t, 64> hashLeaf(const std::array<uint8_t, 64>& leaf) {	24✔
127	std::array<uint8_t, 64> ret{};	24✔
128	auto hash = HashFunction::create_or_throw("SHA-512");	24✔
129	hash->update(0);	24✔
130	hash->update(leaf.data(), leaf.size());	24✔
131	hash->final(ret.data());	24✔
132	return ret;	24✔
133	}	24✔
134
135	void hashNode(std::span<uint8_t, 64> hash, std::span<const uint8_t, 64> node, bool reverse) {	3✔
136	auto h = HashFunction::create_or_throw("SHA-512");	3✔
137	h->update(1);	3✔
138	if(reverse) {	3✔
139	h->update(node.data(), node.size());	2✔
140	h->update(hash.data(), hash.size());	2✔
141	} else {
142	h->update(hash.data(), hash.size());	1✔
143	h->update(node.data(), node.size());	1✔
144	}
145	h->final(hash.data());	6✔
146	}	3✔
147
148	template <size_t N, typename T>
149	std::array<uint8_t, N> vector_to_array(std::vector<uint8_t, T> vec) {	13✔
150	return typecast_copy<std::array<uint8_t, N>>(vec);	13✔
151	}
152	} // namespace
153
154	namespace Roughtime {
155
156	Nonce::Nonce(const std::vector<uint8_t>& nonce) : m_nonce{} {	27✔
157	if(nonce.size() != 64) {	27✔
158	throw Invalid_Argument("Roughtime nonce must be 64 bytes long");	2✔
159	}
160	m_nonce = typecast_copy<std::array<uint8_t, 64>>(nonce);	25✔
161	}	25✔
162
163	Nonce::Nonce(RandomNumberGenerator& rng) : m_nonce(rng.random_array<64>()) {}	6✔
164
165	std::array<uint8_t, request_min_size> encode_request(const Nonce& nonce) {	8✔
166	std::array<uint8_t, request_min_size> buf = {{2, 0, 0, 0, 64, 0, 0, 0, 'N', 'O', 'N', 'C', 'P', 'A', 'D', 0xff}};	8✔
167	std::memcpy(buf.data() + 16, nonce.get_nonce().data(), nonce.get_nonce().size());	8✔
168	std::memset(buf.data() + 16 + nonce.get_nonce().size(), 0, buf.size() - 16 - nonce.get_nonce().size());	8✔
169	return buf;	8✔
170	}
171
172	Response Response::from_bits(const std::vector<uint8_t>& response, const Nonce& nonce) {	34✔
173	const auto response_v = unpack_roughtime_packet(response);	37✔
174	const auto cert = unpack_roughtime_packet(get_v(response_v, "CERT"));	71✔
175	const auto cert_dele = get<std::array<uint8_t, 72>>(cert, "DELE");	30✔
176	const auto cert_sig = get<std::array<uint8_t, 64>>(cert, "SIG");	39✔
177	const auto cert_dele_v = unpack_roughtime_packet(cert_dele);	30✔
178	const auto srep = get_v(response_v, "SREP");	39✔
179	const auto srep_v = unpack_roughtime_packet(srep);	39✔
180
181	const auto cert_dele_pubk = get<std::array<uint8_t, 32>>(cert_dele_v, "PUBK");	29✔
182	const auto sig = get<std::array<uint8_t, 64>>(response_v, "SIG");	31✔
183	if(!verify_signature(cert_dele_pubk, srep, sig)) {	27✔
184	throw Roughtime_Error("Response signature invalid");	1✔
185	}
186
187	const auto indx = get<uint32_t>(response_v, "INDX");	26✔
188	const auto path = get_v(response_v, "PATH");	34✔
189	const auto srep_root = get<std::array<uint8_t, 64>>(srep_v, "ROOT");	26✔
190	const size_t size = path.size();	26✔
191	const size_t levels = size / 64;	26✔
192
193	if(size % 64 != 0) {	26✔
194	throw Roughtime_Error("Merkle tree path size must be multiple of 64 bytes");	1✔
195	}
196	if(indx >= (1U << levels)) {	25✔
197	throw Roughtime_Error("Merkle tree path is too short");	1✔
198	}
199
200	BufferSlicer slicer(path);	24✔
201	auto hash = hashLeaf(nonce.get_nonce());	24✔
202	auto index = indx;
203	for(std::size_t level = 0; level < levels; ++level) {	27✔
204	hashNode(hash, slicer.take<64>(), index % 2 == 1);	3✔
205	index >>= 1;	3✔
206	}
207
208	if(srep_root != hash) {	24✔
209	throw Roughtime_Error("Nonce verification failed");	1✔
210	}
211
212	const auto cert_dele_maxt = sys_microseconds64(get<microseconds64>(cert_dele_v, "MAXT"));	23✔
213	const auto cert_dele_mint = sys_microseconds64(get<microseconds64>(cert_dele_v, "MINT"));	23✔
214	const auto srep_midp = sys_microseconds64(get<microseconds64>(srep_v, "MIDP"));	23✔
215	const auto srep_radi = get<microseconds32>(srep_v, "RADI");	28✔
216	if(srep_midp < cert_dele_mint) {	23✔
217	throw Roughtime_Error("Midpoint earlier than delegation start");	1✔
218	}
219	if(srep_midp > cert_dele_maxt) {	22✔
220	throw Roughtime_Error("Midpoint later than delegation end");	1✔
221	}
222	return {cert_dele, cert_sig, srep_midp, srep_radi};	21✔
223	}	82✔
224
225	bool Response::validate(const Ed25519_PublicKey& pk) const {	20✔
226	constexpr std::string_view context("RoughTime v1 delegation signature--\0", 36);	20✔
227	PK_Verifier verifier(pk, "Pure");	20✔
228	verifier.update(context);	20✔
229	verifier.update(m_cert_dele.data(), m_cert_dele.size());	20✔
230	return verifier.check_signature(m_cert_sig.data(), m_cert_sig.size());	40✔
231	}	20✔
232
233	Nonce nonce_from_blind(const std::vector<uint8_t>& previous_response, const Nonce& blind) {	11✔
234	std::array<uint8_t, 64> ret{};	11✔
235	const auto blind_arr = blind.get_nonce();	11✔
236	auto hash = HashFunction::create_or_throw("SHA-512");	11✔
237	hash->update(previous_response);	11✔
238	hash->update(hash->final());	11✔
239	hash->update(blind_arr.data(), blind_arr.size());	11✔
240	hash->final(ret.data());	11✔
241
242	return Nonce(ret);	11✔
243	}	11✔
244
245	Chain::Chain(std::string_view str) {	13✔
246	std::istringstream ss{std::string(str)}; // FIXME C++23 avoid copy	26✔
247	const std::string ERROR_MESSAGE = "Line does not have 4 space separated fields";	13✔
248	for(std::string s; std::getline(ss, s);) {	25✔
249	size_t start = 0;	19✔
250	size_t end = 0;	19✔
251	end = s.find(' ', start);	19✔
252	if(end == std::string::npos) {	19✔
253	throw Decoding_Error(ERROR_MESSAGE);	1✔
254	}
255	const auto publicKeyType = s.substr(start, end - start);	18✔
256	if(publicKeyType != "ed25519") {	18✔
257	throw Not_Implemented("Only ed25519 publicKeyType is implemented");	1✔
258	}
259
260	start = end + 1;	17✔
261	end = s.find(' ', start);	17✔
262	if(end == std::string::npos) {	17✔
263	throw Decoding_Error(ERROR_MESSAGE);	1✔
264	}
265	const auto serverPublicKey = Ed25519_PublicKey(base64_decode(s.substr(start, end - start)));	38✔
266
267	start = end + 1;	15✔
268	end = s.find(' ', start);	15✔
269	if(end == std::string::npos) {	15✔
270	throw Decoding_Error(ERROR_MESSAGE);	1✔
271	}
272	if((end - start) != 88) {	14✔
273	throw Decoding_Error("Nonce has invalid length");	1✔
274	}
275	const auto vec = base64_decode(s.substr(start, end - start));	13✔
276	const auto nonceOrBlind = Nonce(vector_to_array<64>(base64_decode(s.substr(start, end - start))));	39✔
277
278	start = end + 1;	13✔
279	end = s.find(' ', start);	13✔
280	if(end != std::string::npos) {	13✔
281	throw Decoding_Error(ERROR_MESSAGE);	1✔
282	}
283	const auto response = unlock(base64_decode(s.substr(start)));	37✔
284
285	m_links.push_back({response, serverPublicKey, nonceOrBlind});	24✔
286	}	46✔
287	}	20✔
288
289	std::vector<Response> Chain::responses() const {	7✔
290	std::vector<Response> responses;	7✔
291	for(size_t i = 0; i < m_links.size(); ++i) {	17✔
292	const auto& l = m_links[i];	11✔
293	const auto nonce = i > 0 ? nonce_from_blind(m_links[i - 1].response(), l.nonce_or_blind()) : l.nonce_or_blind();	11✔
294	const auto response = Response::from_bits(l.response(), nonce);	11✔
295	if(!response.validate(l.public_key())) {	11✔
296	throw Roughtime_Error("Invalid signature or public key");	1✔
297	}
298	responses.push_back(response);	10✔
299	}
300	return responses;	6✔
301	}	1✔
302
303	Nonce Chain::next_nonce(const Nonce& blind) const {	4✔
304	return m_links.empty() ? blind : nonce_from_blind(m_links.back().response(), blind);	4✔
305	}
306
307	void Chain::append(const Link& new_link, size_t max_chain_size) {	6✔
308	if(max_chain_size <= 0) {	6✔
309	throw Invalid_Argument("Max chain size must be positive");	1✔
310	}
311
312	while(m_links.size() >= max_chain_size) {	6✔
313	if(m_links.size() == 1) {	2✔
314	auto new_link_updated = new_link;	1✔
315	new_link_updated.nonce_or_blind() =	1✔
316	nonce_from_blind(m_links[0].response(), new_link.nonce_or_blind()); //we need to convert blind to nonce	1✔
317	m_links.clear();	1✔
318	m_links.push_back(new_link_updated);	1✔
319	return;	1✔
320	}	1✔
321	if(m_links.size() >= 2) {	1✔
322	m_links[1].nonce_or_blind() =	1✔
323	nonce_from_blind(m_links[0].response(), m_links[1].nonce_or_blind()); //we need to convert blind to nonce	1✔
324	}
325	m_links.erase(m_links.begin());	1✔
326	}
327	m_links.push_back(new_link);	4✔
328	}
329
330	std::string Chain::to_string() const {	4✔
331	std::string s;	4✔
332	s.reserve((7 + 1 + 88 + 1 + 44 + 1 + 480) * m_links.size());	4✔
333	for(const auto& link : m_links) {	11✔
334	s += "ed25519";	7✔
335	s += ' ';	7✔
336	s += base64_encode(link.public_key().get_public_key());	14✔
337	s += ' ';	7✔
338	s += base64_encode(link.nonce_or_blind().get_nonce().data(), link.nonce_or_blind().get_nonce().size());	14✔
339	s += ' ';	7✔
340	s += base64_encode(link.response());	14✔
341	s += '\n';	14✔
342	}
343	return s;	4✔
344	}	×
345
346	std::vector<uint8_t> online_request(std::string_view uri, const Nonce& nonce, std::chrono::milliseconds timeout) {	6✔
347	const std::chrono::system_clock::time_point start_time = std::chrono::system_clock::now();	6✔
348	auto socket = OS::open_socket_udp(uri, timeout);	6✔
349	if(!socket) {	6✔
350	throw Not_Implemented("No socket support enabled in build");	×
351	}
352
353	const auto encoded = encode_request(nonce);	6✔
354	socket->write(encoded.data(), encoded.size());	6✔
355
356	if(std::chrono::system_clock::now() - start_time > timeout) {	6✔
357	throw System_Error("Timeout during socket write");	×
358	}
359
360	std::vector<uint8_t> buffer;	6✔
361	buffer.resize(360 + 64 * 10 + 1); //response basic size is 360 bytes + 64 bytes for each level of merkle tree	6✔
362	//add one additional byte to be able to differentiate if datagram got truncated
363	const auto n = socket->read(buffer.data(), buffer.size());	6✔
364
365	if(n == 0 \|\| std::chrono::system_clock::now() - start_time > timeout) {	6✔
366	throw System_Error("Timeout waiting for response");	×
367	}
368
369	if(n == buffer.size()) {	6✔
370	throw System_Error("Buffer too small");	×
371	}
372
373	buffer.resize(n);	6✔
374	return buffer;	6✔
375	}	6✔
376
377	std::vector<Server_Information> servers_from_str(std::string_view str) {	12✔
378	std::vector<Server_Information> servers;	12✔
379	std::istringstream ss{std::string(str)}; // FIXME C++23 avoid copy	24✔
380
381	const std::string ERROR_MESSAGE = "Line does not have at least 5 space separated fields";	12✔
382	for(std::string s; std::getline(ss, s);) {	20✔
383	size_t start = 0;	16✔
384	size_t end = 0;	16✔
385	end = s.find(' ', start);	16✔
386	if(end == std::string::npos) {	16✔
387	throw Decoding_Error(ERROR_MESSAGE);	1✔
388	}
389	const auto name = s.substr(start, end - start);	15✔
390
391	start = end + 1;	15✔
392	end = s.find(' ', start);	15✔
393	if(end == std::string::npos) {	15✔
394	throw Decoding_Error(ERROR_MESSAGE);	1✔
395	}
396	const auto publicKeyType = s.substr(start, end - start);	14✔
397	if(publicKeyType != "ed25519") {	14✔
398	throw Not_Implemented("Only ed25519 publicKeyType is implemented");	1✔
399	}
400
401	start = end + 1;	13✔
402	end = s.find(' ', start);	13✔
403
404	if(end == std::string::npos) {	13✔
405	throw Decoding_Error(ERROR_MESSAGE);	1✔
406	}
407	const auto publicKeyBase64 = s.substr(start, end - start);	12✔
408	const auto publicKey = Ed25519_PublicKey(base64_decode(publicKeyBase64));	16✔
409
410	start = end + 1;	11✔
411	end = s.find(' ', start);	11✔
412	if(end == std::string::npos) {	11✔
413	throw Decoding_Error(ERROR_MESSAGE);	1✔
414	}
415	const auto protocol = s.substr(start, end - start);	10✔
416	if(protocol != "udp") {	10✔
417	throw Not_Implemented("Only UDP protocol is implemented");	1✔
418	}
419
420	const auto addresses = [&]() {	2✔
421	std::vector<std::string> addr;	9✔
422	for(;;) {	9✔
423	start = end + 1;	9✔
424	end = s.find(' ', start);	9✔
425	const auto address = s.substr(start, (end == std::string::npos) ? std::string::npos : end - start);	9✔
426	if(address.empty()) {	9✔
427	return addr;
428	}
429	addr.push_back(address);	8✔
430	if(end == std::string::npos) {	8✔
431	return addr;
432	}
433	}	9✔
434	}();	9✔
435	if(addresses.empty()) {	9✔
436	throw Decoding_Error(ERROR_MESSAGE);	1✔
437	}
438
439	servers.push_back({name, publicKey, addresses});	16✔
440	}	37✔
441	return servers;	8✔
442	}	20✔
443
444	} // namespace Roughtime
445
446	} // namespace Botan

randombit / botan / 20643915034

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