21753596263

Committed 06 Feb 2026 02:13PM UTC coverage: 90.063% (-0.01%) from 90.073%

Build # 21753596263

Build Type

Pull #5289

github

Committed by

web-flow

Commit Message

Merge 587099284 into 8ea0ca252

Pull Request Pull Request #5289: Further misc header reductions, forward declarations, etc

Run Details

102237 of 113517 relevant lines covered (90.06%)

11402137.11 hits per line

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

99.28

/src/lib/modes/aead/ocb/ocb.cpp

/*
* OCB Mode
* (C) 2013,2017 Jack Lloyd
* (C) 2016 Daniel Neus, Rohde & Schwarz Cybersecurity
*
* Botan is released under the Simplified BSD License (see license.txt)
*/

#include <botan/internal/ocb.h>

#include <botan/block_cipher.h>
#include <botan/exceptn.h>
#include <botan/mem_ops.h>
#include <botan/internal/bit_ops.h>
#include <botan/internal/ct_utils.h>
#include <botan/internal/poly_dbl.h>

namespace Botan {

// Has to be in Botan namespace so unique_ptr can reference it
class L_computer final {
   public:
      explicit L_computer(const BlockCipher& cipher) :
            m_BS(cipher.block_size()), m_max_blocks(cipher.parallel_bytes() / m_BS) {
         m_L_star.resize(m_BS);
         cipher.encrypt(m_L_star);
         m_L_dollar = poly_double(star());

         // Preallocate the m_L vector to the maximum expected size to avoid
         // re-allocations during runtime. This had caused a use-after-free in
         // earlier versions, due to references into this buffer becoming stale
         // in `compute_offset()`, after calling `get()` in the hot path.
         //
         // Note, that the list member won't be pre-allocated, so the expected
         // memory overhead is negligible.
         //
         // See also https://github.com/randombit/botan/issues/3812
         m_L.reserve(31);
         m_L.push_back(poly_double(dollar()));

         while(m_L.size() < 8) {
            m_L.push_back(poly_double(m_L.back()));
         }

         m_offset_buf.resize(m_BS * m_max_blocks);
      }

      void init(const secure_vector<uint8_t>& offset) { m_offset = offset; }

      bool initialized() const { return !m_offset.empty(); }

      const secure_vector<uint8_t>& star() const { return m_L_star; }

      const secure_vector<uint8_t>& dollar() const { return m_L_dollar; }

      const secure_vector<uint8_t>& offset() const { return m_offset; }

      const secure_vector<uint8_t>& get(size_t i) const {
         while(m_L.size() <= i) {
            m_L.push_back(poly_double(m_L.back()));
         }

         return m_L[i];
      }

      const uint8_t* compute_offsets(size_t block_index, size_t blocks) {
         BOTAN_ASSERT(blocks <= m_max_blocks, "OCB offsets");

         uint8_t* offsets = m_offset_buf.data();

         if(block_index % 4 == 0) {
            const secure_vector<uint8_t>& L0 = get(0);
            const secure_vector<uint8_t>& L1 = get(1);

            while(blocks >= 4) {
               // ntz(4*i+1) == 0
               // ntz(4*i+2) == 1
               // ntz(4*i+3) == 0
               block_index += 4;
               const size_t ntz4 = var_ctz32(static_cast<uint32_t>(block_index));

               xor_buf(offsets, m_offset.data(), L0.data(), m_BS);
               offsets += m_BS;

               xor_buf(offsets, offsets - m_BS, L1.data(), m_BS);
               offsets += m_BS;

               xor_buf(m_offset.data(), L1.data(), m_BS);
               copy_mem(offsets, m_offset.data(), m_BS);
               offsets += m_BS;

               xor_buf(m_offset.data(), get(ntz4).data(), m_BS);
               copy_mem(offsets, m_offset.data(), m_BS);
               offsets += m_BS;

               blocks -= 4;
            }
         }

         for(size_t i = 0; i != blocks; ++i) {  // could be done in parallel
            const size_t ntz = var_ctz32(static_cast<uint32_t>(block_index + i + 1));
            xor_buf(m_offset.data(), get(ntz).data(), m_BS);
            copy_mem(offsets, m_offset.data(), m_BS);
            offsets += m_BS;
         }

         return m_offset_buf.data();
      }

   private:
      static secure_vector<uint8_t> poly_double(const secure_vector<uint8_t>& in) {
         secure_vector<uint8_t> out(in.size());
         poly_double_n(out.data(), in.data(), out.size());
         return out;
      }

      const size_t m_BS, m_max_blocks;
      secure_vector<uint8_t> m_L_dollar, m_L_star;
      secure_vector<uint8_t> m_offset;
      mutable std::vector<secure_vector<uint8_t>> m_L;
      secure_vector<uint8_t> m_offset_buf;
};

namespace {

/*
* OCB's HASH
*/
secure_vector<uint8_t> ocb_hash(const L_computer& L, const BlockCipher& cipher, const uint8_t ad[], size_t ad_len) {
   const size_t BS = cipher.block_size();
   secure_vector<uint8_t> sum(BS);
   secure_vector<uint8_t> offset(BS);

   secure_vector<uint8_t> buf(BS);

   const size_t ad_blocks = (ad_len / BS);
   const size_t ad_remainder = (ad_len % BS);

   for(size_t i = 0; i != ad_blocks; ++i) {
      // this loop could run in parallel
      offset ^= L.get(var_ctz32(static_cast<uint32_t>(i + 1)));
      buf = offset;
      xor_buf(buf.data(), &ad[BS * i], BS);
      cipher.encrypt(buf);
      sum ^= buf;
   }

   if(ad_remainder > 0) {
      offset ^= L.star();
      buf = offset;
      xor_buf(buf.data(), &ad[BS * ad_blocks], ad_remainder);
      buf[ad_remainder] ^= 0x80;
      cipher.encrypt(buf);
      sum ^= buf;
   }

   return sum;
}

}  // namespace

OCB_Mode::OCB_Mode(std::unique_ptr<BlockCipher> cipher, size_t tag_size) :
      m_cipher(std::move(cipher)),
      m_checksum(m_cipher->parallel_bytes()),
      m_ad_hash(m_cipher->block_size()),
      m_tag_size(tag_size),
      m_block_size(m_cipher->block_size()),
      m_par_blocks(m_cipher->parallel_bytes() / m_block_size) {
   const size_t BS = block_size();

   /*
   * draft-krovetz-ocb-wide-d1 specifies OCB for several other block
   * sizes but only 128, 192, 256 and 512 bit are currently supported
   * by this implementation.
   */
   BOTAN_ARG_CHECK(BS == 16 || BS == 24 || BS == 32 || BS == 64, "Invalid block size for OCB");

   BOTAN_ARG_CHECK(m_tag_size % 4 == 0 && m_tag_size >= 8 && m_tag_size <= BS && m_tag_size <= 32,
                   "Invalid OCB tag length");
}

OCB_Mode::~OCB_Mode() = default;

void OCB_Mode::clear() {
   m_cipher->clear();
   m_L.reset();  // add clear here?
   reset();
}

void OCB_Mode::reset() {
   m_block_index = 0;
   zeroise(m_ad_hash);
   zeroise(m_checksum);
   m_last_nonce.clear();
   m_stretch.clear();
}

bool OCB_Mode::valid_nonce_length(size_t length) const {
   if(length == 0) {
      return false;
   }
   if(block_size() == 16) {
      return length < 16;
   } else {
      return length < (block_size() - 1);
   }
}

std::string OCB_Mode::name() const {
   return m_cipher->name() + "/OCB";  // include tag size?
}

size_t OCB_Mode::update_granularity() const {
   return block_size();
}

size_t OCB_Mode::ideal_granularity() const {
   return (m_par_blocks * block_size());
}

Key_Length_Specification OCB_Mode::key_spec() const {
   return m_cipher->key_spec();
}

bool OCB_Mode::has_keying_material() const {
   return m_cipher->has_keying_material();
}

void OCB_Mode::key_schedule(std::span<const uint8_t> key) {
   m_cipher->set_key(key);
   m_L = std::make_unique<L_computer>(*m_cipher);
}

void OCB_Mode::set_associated_data_n(size_t idx, std::span<const uint8_t> ad) {
   BOTAN_ARG_CHECK(idx == 0, "OCB: cannot handle non-zero index in set_associated_data_n");
   assert_key_material_set();
   m_ad_hash = ocb_hash(*m_L, *m_cipher, ad.data(), ad.size());
}

const secure_vector<uint8_t>& OCB_Mode::update_nonce(const uint8_t nonce[], size_t nonce_len) {
   const size_t BS = block_size();

   BOTAN_ASSERT(BS == 16 || BS == 24 || BS == 32 || BS == 64, "OCB block size is supported");

   // NOLINTNEXTLINE(readability-avoid-nested-conditional-operator)
   const size_t MASKLEN = (BS == 16 ? 6 : ((BS == 24) ? 7 : 8));

   const uint8_t BOTTOM_MASK = static_cast<uint8_t>((static_cast<uint16_t>(1) << MASKLEN) - 1);

   m_nonce_buf.resize(BS);
   clear_mem(m_nonce_buf.data(), m_nonce_buf.size());

   copy_mem(&m_nonce_buf[BS - nonce_len], nonce, nonce_len);
   m_nonce_buf[0] = static_cast<uint8_t>(((tag_size() * 8) % (BS * 8)) << (BS <= 16 ? 1 : 0));

   m_nonce_buf[BS - nonce_len - 1] ^= 1;

   const uint8_t bottom = m_nonce_buf[BS - 1] & BOTTOM_MASK;
   m_nonce_buf[BS - 1] &= ~BOTTOM_MASK;

   const bool need_new_stretch = (m_last_nonce != m_nonce_buf);

   if(need_new_stretch) {
      m_last_nonce = m_nonce_buf;

      m_cipher->encrypt(m_nonce_buf);

      /*
      The loop bounds (BS vs BS/2) are derived from the relation
      between the block size and the MASKLEN. Using the terminology
      of draft-krovetz-ocb-wide, we have to derive enough bits in
      ShiftedKtop to read up to BLOCKLEN+bottom bits from Stretch.

                 +----------+---------+-------+---------+
                 | BLOCKLEN | RESIDUE | SHIFT | MASKLEN |
                 +----------+---------+-------+---------+
                 |       32 |     141 |    17 |    4    |
                 |       64 |      27 |    25 |    5    |
                 |       96 |    1601 |    33 |    6    |
                 |      128 |     135 |     8 |    6    |
                 |      192 |     135 |    40 |    7    |
                 |      256 |    1061 |     1 |    8    |
                 |      384 |    4109 |    80 |    8    |
                 |      512 |     293 |   176 |    8    |
                 |     1024 |  524355 |   352 |    9    |
                 +----------+---------+-------+---------+
      */
      if(BS == 16) {
         for(size_t i = 0; i != BS / 2; ++i) {
            m_nonce_buf.push_back(m_nonce_buf[i] ^ m_nonce_buf[i + 1]);
         }
      } else if(BS == 24) {
         for(size_t i = 0; i != 16; ++i) {
            m_nonce_buf.push_back(m_nonce_buf[i] ^ m_nonce_buf[i + 5]);
         }
      } else if(BS == 32) {
         for(size_t i = 0; i != BS; ++i) {
            m_nonce_buf.push_back(m_nonce_buf[i] ^ (m_nonce_buf[i] << 1) ^ (m_nonce_buf[i + 1] >> 7));
         }
      } else if(BS == 64) {
         for(size_t i = 0; i != BS / 2; ++i) {
            m_nonce_buf.push_back(m_nonce_buf[i] ^ m_nonce_buf[i + 22]);
         }
      }

      m_stretch = m_nonce_buf;
   }

   // now set the offset from stretch and bottom
   const size_t shift_bytes = bottom / 8;
   const size_t shift_bits = bottom % 8;

   BOTAN_ASSERT(m_stretch.size() >= BS + shift_bytes + 1, "Size ok");

   m_offset.resize(BS);
   for(size_t i = 0; i != BS; ++i) {
      m_offset[i] = (m_stretch[i + shift_bytes] << shift_bits);
      m_offset[i] |= (m_stretch[i + shift_bytes + 1] >> (8 - shift_bits));
   }

   return m_offset;
}

void OCB_Mode::start_msg(const uint8_t nonce[], size_t nonce_len) {
   if(!valid_nonce_length(nonce_len)) {
      throw Invalid_IV_Length(name(), nonce_len);
   }

   assert_key_material_set();

   m_L->init(update_nonce(nonce, nonce_len));
   zeroise(m_checksum);
   m_block_index = 0;
}

void OCB_Encryption::encrypt(uint8_t buffer[], size_t blocks) {
   assert_key_material_set();
   BOTAN_STATE_CHECK(m_L->initialized());

   const size_t BS = block_size();

   while(blocks > 0) {
      const size_t proc_blocks = std::min(blocks, par_blocks());
      const size_t proc_bytes = proc_blocks * BS;

      const uint8_t* offsets = m_L->compute_offsets(m_block_index, proc_blocks);

      xor_buf(m_checksum.data(), buffer, proc_bytes);

      xor_buf(buffer, offsets, proc_bytes);
      m_cipher->encrypt_n(buffer, buffer, proc_blocks);
      xor_buf(buffer, offsets, proc_bytes);

      buffer += proc_bytes;
      blocks -= proc_blocks;
      m_block_index += proc_blocks;
   }
}

size_t OCB_Encryption::process_msg(uint8_t buf[], size_t sz) {
   BOTAN_ARG_CHECK(sz % update_granularity() == 0, "Invalid OCB input size");
   encrypt(buf, sz / block_size());
   return sz;
}

void OCB_Encryption::finish_msg(secure_vector<uint8_t>& buffer, size_t offset) {
   assert_key_material_set();
   BOTAN_STATE_CHECK(m_L->initialized());

   const size_t BS = block_size();

   BOTAN_ARG_CHECK(buffer.size() >= offset, "Offset is out of range");
   const size_t sz = buffer.size() - offset;
   uint8_t* buf = buffer.data() + offset;

   secure_vector<uint8_t> mac(BS);

   if(sz > 0) {
      const size_t final_full_blocks = sz / BS;
      const size_t remainder_bytes = sz - (final_full_blocks * BS);

      encrypt(buf, final_full_blocks);
      mac = m_L->offset();

      if(remainder_bytes > 0) {
         BOTAN_ASSERT(remainder_bytes < BS, "Only a partial block left");
         uint8_t* remainder = &buf[sz - remainder_bytes];

         xor_buf(m_checksum.data(), remainder, remainder_bytes);
         m_checksum[remainder_bytes] ^= 0x80;

         // Offset_*
         mac ^= m_L->star();

         secure_vector<uint8_t> pad(BS);
         m_cipher->encrypt(mac, pad);
         xor_buf(remainder, pad.data(), remainder_bytes);
      }
   } else {
      mac = m_L->offset();
   }

   // now compute the tag

   // fold checksum
   for(size_t i = 0; i != m_checksum.size(); i += BS) {
      xor_buf(mac.data(), m_checksum.data() + i, BS);
   }

   xor_buf(mac.data(), m_L->dollar().data(), BS);
   m_cipher->encrypt(mac);
   xor_buf(mac.data(), m_ad_hash.data(), BS);

   buffer += std::make_pair(mac.data(), tag_size());

   zeroise(m_checksum);
   m_block_index = 0;
}

void OCB_Decryption::decrypt(uint8_t buffer[], size_t blocks) {
   assert_key_material_set();
   BOTAN_STATE_CHECK(m_L->initialized());

   const size_t BS = block_size();

   while(blocks > 0) {
      const size_t proc_blocks = std::min(blocks, par_blocks());
      const size_t proc_bytes = proc_blocks * BS;

      const uint8_t* offsets = m_L->compute_offsets(m_block_index, proc_blocks);

      xor_buf(buffer, offsets, proc_bytes);
      m_cipher->decrypt_n(buffer, buffer, proc_blocks);
      xor_buf(buffer, offsets, proc_bytes);

      xor_buf(m_checksum.data(), buffer, proc_bytes);

      buffer += proc_bytes;
      blocks -= proc_blocks;
      m_block_index += proc_blocks;
   }
}

size_t OCB_Decryption::process_msg(uint8_t buf[], size_t sz) {
   BOTAN_ARG_CHECK(sz % update_granularity() == 0, "Invalid OCB input size");
   decrypt(buf, sz / block_size());
   return sz;
}

void OCB_Decryption::finish_msg(secure_vector<uint8_t>& buffer, size_t offset) {
   assert_key_material_set();
   BOTAN_STATE_CHECK(m_L->initialized());

   const size_t BS = block_size();

   BOTAN_ARG_CHECK(buffer.size() >= offset, "Offset is out of range");
   const size_t sz = buffer.size() - offset;
   uint8_t* buf = buffer.data() + offset;

   BOTAN_ARG_CHECK(sz >= tag_size(), "input did not include the tag");

   const size_t remaining = sz - tag_size();

   secure_vector<uint8_t> mac(BS);

   if(remaining > 0) {
      const size_t final_full_blocks = remaining / BS;
      const size_t final_bytes = remaining - (final_full_blocks * BS);

      decrypt(buf, final_full_blocks);
      mac ^= m_L->offset();

      if(final_bytes > 0) {
         BOTAN_ASSERT(final_bytes < BS, "Only a partial block left");

         uint8_t* remainder = &buf[remaining - final_bytes];

         mac ^= m_L->star();
         secure_vector<uint8_t> pad(BS);
         m_cipher->encrypt(mac, pad);  // P_*
         xor_buf(remainder, pad.data(), final_bytes);

         xor_buf(m_checksum.data(), remainder, final_bytes);
         m_checksum[final_bytes] ^= 0x80;
      }
   } else {
      mac = m_L->offset();
   }

   // compute the mac

   // fold checksum
   for(size_t i = 0; i != m_checksum.size(); i += BS) {
      xor_buf(mac.data(), m_checksum.data() + i, BS);
   }

   mac ^= m_L->dollar();
   m_cipher->encrypt(mac);
   mac ^= m_ad_hash;

   // reset state
   zeroise(m_checksum);
   m_block_index = 0;

   // compare mac
   const uint8_t* included_tag = &buf[remaining];

   if(!CT::is_equal(mac.data(), included_tag, tag_size()).as_bool()) {
      throw Invalid_Authentication_Tag("OCB tag check failed");
   }

   // remove tag from end of message
   buffer.resize(remaining + offset);
}

}  // namespace Botan

1	/*
2	* OCB Mode
3	* (C) 2013,2017 Jack Lloyd
4	* (C) 2016 Daniel Neus, Rohde & Schwarz Cybersecurity
5	*
6	* Botan is released under the Simplified BSD License (see license.txt)
7	*/
8
9	#include <botan/internal/ocb.h>
10
11	#include <botan/block_cipher.h>
12	#include <botan/exceptn.h>
13	#include <botan/mem_ops.h>
14	#include <botan/internal/bit_ops.h>
15	#include <botan/internal/ct_utils.h>
16	#include <botan/internal/poly_dbl.h>
17
18	namespace Botan {
19
20	// Has to be in Botan namespace so unique_ptr can reference it
21	class L_computer final {
22	public:
23	explicit L_computer(const BlockCipher& cipher) :	225✔
24	m_BS(cipher.block_size()), m_max_blocks(cipher.parallel_bytes() / m_BS) {	450✔
25	m_L_star.resize(m_BS);	225✔
26	cipher.encrypt(m_L_star);	225✔
27	m_L_dollar = poly_double(star());	225✔
28
29	// Preallocate the m_L vector to the maximum expected size to avoid
30	// re-allocations during runtime. This had caused a use-after-free in
31	// earlier versions, due to references into this buffer becoming stale
32	// in `compute_offset()`, after calling `get()` in the hot path.
33	//
34	// Note, that the list member won't be pre-allocated, so the expected
35	// memory overhead is negligible.
36	//
37	// See also https://github.com/randombit/botan/issues/3812
38	m_L.reserve(31);	225✔
39	m_L.push_back(poly_double(dollar()));	225✔
40
41	while(m_L.size() < 8) {	1,800✔
42	m_L.push_back(poly_double(m_L.back()));	3,150✔
43	}
44
45	m_offset_buf.resize(m_BS * m_max_blocks);	225✔
46	}	225✔
47
48	void init(const secure_vector<uint8_t>& offset) { m_offset = offset; }	9,439✔
49
50	bool initialized() const { return !m_offset.empty(); }	16,577✔
51
52	const secure_vector<uint8_t>& star() const { return m_L_star; }	6,051✔
53
54	const secure_vector<uint8_t>& dollar() const { return m_L_dollar; }	9,572✔
55
56	const secure_vector<uint8_t>& offset() const { return m_offset; }	9,347✔
57
58	const secure_vector<uint8_t>& get(size_t i) const {	121,908✔
59	while(m_L.size() <= i) {	121,995✔
60	m_L.push_back(poly_double(m_L.back()));	174✔
61	}
62
63	return m_L[i];	121,908✔
64	}
65
66	const uint8_t* compute_offsets(size_t block_index, size_t blocks) {	14,536✔
67	BOTAN_ASSERT(blocks <= m_max_blocks, "OCB offsets");	14,536✔
68
69	uint8_t* offsets = m_offset_buf.data();	14,536✔
70
71	if(block_index % 4 == 0) {	14,536✔
72	const secure_vector<uint8_t>& L0 = get(0);	14,082✔
73	const secure_vector<uint8_t>& L1 = get(1);	14,082✔
74
75	while(blocks >= 4) {	65,295✔
76	// ntz(4*i+1) == 0
77	// ntz(4*i+2) == 1
78	// ntz(4*i+3) == 0
79	block_index += 4;	37,131✔
80	const size_t ntz4 = var_ctz32(static_cast<uint32_t>(block_index));	37,131✔
81
82	xor_buf(offsets, m_offset.data(), L0.data(), m_BS);	37,131✔
83	offsets += m_BS;	37,131✔
84
85	xor_buf(offsets, offsets - m_BS, L1.data(), m_BS);	37,131✔
86	offsets += m_BS;	37,131✔
87
88	xor_buf(m_offset.data(), L1.data(), m_BS);	37,131✔
89	copy_mem(offsets, m_offset.data(), m_BS);	37,131✔
90	offsets += m_BS;	37,131✔
91
92	xor_buf(m_offset.data(), get(ntz4).data(), m_BS);	37,131✔
93	copy_mem(offsets, m_offset.data(), m_BS);	37,131✔
94	offsets += m_BS;	37,131✔
95
96	blocks -= 4;	37,131✔
97	}
98	}
99
100	for(size_t i = 0; i != blocks; ++i) { // could be done in parallel	24,144✔
101	const size_t ntz = var_ctz32(static_cast<uint32_t>(block_index + i + 1));	9,608✔
102	xor_buf(m_offset.data(), get(ntz).data(), m_BS);	9,608✔
103	copy_mem(offsets, m_offset.data(), m_BS);	9,608✔
104	offsets += m_BS;	9,608✔
105	}
106
107	return m_offset_buf.data();	14,536✔
108	}
109
110	private:
111	static secure_vector<uint8_t> poly_double(const secure_vector<uint8_t>& in) {	2,112✔
112	secure_vector<uint8_t> out(in.size());	2,112✔
113	poly_double_n(out.data(), in.data(), out.size());	2,112✔
114	return out;	2,112✔
115	}	×
116
117	const size_t m_BS, m_max_blocks;
118	secure_vector<uint8_t> m_L_dollar, m_L_star;
119	secure_vector<uint8_t> m_offset;
120	mutable std::vector<secure_vector<uint8_t>> m_L;
121	secure_vector<uint8_t> m_offset_buf;
122	};
123
124	namespace {
125
126	/*
127	* OCB's HASH
128	*/
129	secure_vector<uint8_t> ocb_hash(const L_computer& L, const BlockCipher& cipher, const uint8_t ad[], size_t ad_len) {	9,495✔
130	const size_t BS = cipher.block_size();	9,495✔
131	secure_vector<uint8_t> sum(BS);	9,495✔
132	secure_vector<uint8_t> offset(BS);	9,495✔
133
134	secure_vector<uint8_t> buf(BS);	9,495✔
135
136	const size_t ad_blocks = (ad_len / BS);	9,495✔
137	const size_t ad_remainder = (ad_len % BS);	9,495✔
138
139	for(size_t i = 0; i != ad_blocks; ++i) {	56,500✔
140	// this loop could run in parallel
141	offset ^= L.get(var_ctz32(static_cast<uint32_t>(i + 1)));	94,010✔
142	buf = offset;	47,005✔
143	xor_buf(buf.data(), &ad[BS * i], BS);	47,005✔
144	cipher.encrypt(buf);	47,005✔
145	sum ^= buf;	47,005✔
146	}
147
148	if(ad_remainder > 0) {	9,495✔
149	offset ^= L.star();	5,870✔
150	buf = offset;	5,870✔
151	xor_buf(buf.data(), &ad[BS * ad_blocks], ad_remainder);	5,870✔
152	buf[ad_remainder] ^= 0x80;	5,870✔
153	cipher.encrypt(buf);	5,870✔
154	sum ^= buf;	5,870✔
155	}
156
157	return sum;	9,495✔
158	}	18,990✔
159
160	} // namespace
161
162	OCB_Mode::OCB_Mode(std::unique_ptr<BlockCipher> cipher, size_t tag_size) :	317✔
163	m_cipher(std::move(cipher)),	317✔
164	m_checksum(m_cipher->parallel_bytes()),	634✔
165	m_ad_hash(m_cipher->block_size()),	317✔
166	m_tag_size(tag_size),	317✔
167	m_block_size(m_cipher->block_size()),	317✔
168	m_par_blocks(m_cipher->parallel_bytes() / m_block_size) {	951✔
169	const size_t BS = block_size();	317✔
170
171	/*
172	* draft-krovetz-ocb-wide-d1 specifies OCB for several other block
173	* sizes but only 128, 192, 256 and 512 bit are currently supported
174	* by this implementation.
175	*/
176	BOTAN_ARG_CHECK(BS == 16 \|\| BS == 24 \|\| BS == 32 \|\| BS == 64, "Invalid block size for OCB");	317✔
177
178	BOTAN_ARG_CHECK(m_tag_size % 4 == 0 && m_tag_size >= 8 && m_tag_size <= BS && m_tag_size <= 32,	317✔
179	"Invalid OCB tag length");
180	}	317✔
181
182	OCB_Mode::~OCB_Mode() = default;	1,851✔
183
184	void OCB_Mode::clear() {	92✔
185	m_cipher->clear();	92✔
186	m_L.reset(); // add clear here?	92✔
187	reset();	92✔
188	}	92✔
189
190	void OCB_Mode::reset() {	410✔
191	m_block_index = 0;	410✔
192	zeroise(m_ad_hash);	410✔
193	zeroise(m_checksum);	410✔
194	m_last_nonce.clear();	410✔
195	m_stretch.clear();	410✔
196	}	410✔
197
198	bool OCB_Mode::valid_nonce_length(size_t length) const {	9,485✔
199	if(length == 0) {	9,485✔
200	return false;
201	}
202	if(block_size() == 16) {	9,485✔
203	return length < 16;	7,883✔
204	} else {
205	return length < (block_size() - 1);	1,602✔
206	}
207	}
208
209	std::string OCB_Mode::name() const {	506✔
210	return m_cipher->name() + "/OCB"; // include tag size?	1,012✔
211	}
212
213	size_t OCB_Mode::update_granularity() const {	1,597✔
214	return block_size();	1,597✔
215	}
216
217	size_t OCB_Mode::ideal_granularity() const {	276✔
218	return (m_par_blocks * block_size());	276✔
219	}
220
221	Key_Length_Specification OCB_Mode::key_spec() const {	225✔
222	return m_cipher->key_spec();	225✔
223	}
224
225	bool OCB_Mode::has_keying_material() const {	36,293✔
226	return m_cipher->has_keying_material();	36,293✔
227	}
228
229	void OCB_Mode::key_schedule(std::span<const uint8_t> key) {	225✔
230	m_cipher->set_key(key);	225✔
231	m_L = std::make_unique<L_computer>(*m_cipher);	225✔
232	}	225✔
233
234	void OCB_Mode::set_associated_data_n(size_t idx, std::span<const uint8_t> ad) {	9,679✔
235	BOTAN_ARG_CHECK(idx == 0, "OCB: cannot handle non-zero index in set_associated_data_n");	9,679✔
236	assert_key_material_set();	9,679✔
237	m_ad_hash = ocb_hash(m_L, m_cipher, ad.data(), ad.size());	9,495✔
238	}	9,495✔
239
240	const secure_vector<uint8_t>& OCB_Mode::update_nonce(const uint8_t nonce[], size_t nonce_len) {	9,439✔
241	const size_t BS = block_size();	9,439✔
242
243	BOTAN_ASSERT(BS == 16 \|\| BS == 24 \|\| BS == 32 \|\| BS == 64, "OCB block size is supported");	9,439✔
244
245	// NOLINTNEXTLINE(readability-avoid-nested-conditional-operator)
246	const size_t MASKLEN = (BS == 16 ? 6 : ((BS == 24) ? 7 : 8));	9,439✔
247
248	const uint8_t BOTTOM_MASK = static_cast<uint8_t>((static_cast<uint16_t>(1) << MASKLEN) - 1);	9,439✔
249
250	m_nonce_buf.resize(BS);	9,439✔
251	clear_mem(m_nonce_buf.data(), m_nonce_buf.size());	9,439✔
252
253	copy_mem(&m_nonce_buf[BS - nonce_len], nonce, nonce_len);	9,439✔
254	m_nonce_buf[0] = static_cast<uint8_t>(((tag_size() * 8) % (BS * 8)) << (BS <= 16 ? 1 : 0));	11,037✔
255
256	m_nonce_buf[BS - nonce_len - 1] ^= 1;	9,439✔
257
258	const uint8_t bottom = m_nonce_buf[BS - 1] & BOTTOM_MASK;	9,439✔
259	m_nonce_buf[BS - 1] &= ~BOTTOM_MASK;	9,439✔
260
261	const bool need_new_stretch = (m_last_nonce != m_nonce_buf);	9,439✔
262
263	if(need_new_stretch) {	9,439✔
264	m_last_nonce = m_nonce_buf;	663✔
265
266	m_cipher->encrypt(m_nonce_buf);	663✔
267
268	/*
269	The loop bounds (BS vs BS/2) are derived from the relation
270	between the block size and the MASKLEN. Using the terminology
271	of draft-krovetz-ocb-wide, we have to derive enough bits in
272	ShiftedKtop to read up to BLOCKLEN+bottom bits from Stretch.
273
274	+----------+---------+-------+---------+
275	\| BLOCKLEN \| RESIDUE \| SHIFT \| MASKLEN \|
276	+----------+---------+-------+---------+
277	\| 32 \| 141 \| 17 \| 4 \|
278	\| 64 \| 27 \| 25 \| 5 \|
279	\| 96 \| 1601 \| 33 \| 6 \|
280	\| 128 \| 135 \| 8 \| 6 \|
281	\| 192 \| 135 \| 40 \| 7 \|
282	\| 256 \| 1061 \| 1 \| 8 \|
283	\| 384 \| 4109 \| 80 \| 8 \|
284	\| 512 \| 293 \| 176 \| 8 \|
285	\| 1024 \| 524355 \| 352 \| 9 \|
286	+----------+---------+-------+---------+
287	*/
288	if(BS == 16) {	663✔
289	for(size_t i = 0; i != BS / 2; ++i) {	5,355✔
290	m_nonce_buf.push_back(m_nonce_buf[i] ^ m_nonce_buf[i + 1]);	4,760✔
291	}
292	} else if(BS == 24) {	68✔
293	for(size_t i = 0; i != 16; ++i) {	408✔
294	m_nonce_buf.push_back(m_nonce_buf[i] ^ m_nonce_buf[i + 5]);	384✔
295	}
296	} else if(BS == 32) {	44✔
297	for(size_t i = 0; i != BS; ++i) {	1,089✔
298	m_nonce_buf.push_back(m_nonce_buf[i] ^ (m_nonce_buf[i] << 1) ^ (m_nonce_buf[i + 1] >> 7));	1,056✔
299	}
300	} else if(BS == 64) {
301	for(size_t i = 0; i != BS / 2; ++i) {	363✔
302	m_nonce_buf.push_back(m_nonce_buf[i] ^ m_nonce_buf[i + 22]);	352✔
303	}
304	}
305
306	m_stretch = m_nonce_buf;	663✔
307	}
308
309	// now set the offset from stretch and bottom
310	const size_t shift_bytes = bottom / 8;	9,439✔
311	const size_t shift_bits = bottom % 8;	9,439✔
312
313	BOTAN_ASSERT(m_stretch.size() >= BS + shift_bytes + 1, "Size ok");	9,439✔
314
315	m_offset.resize(BS);	9,439✔
316	for(size_t i = 0; i != BS; ++i) {	195,399✔
317	m_offset[i] = (m_stretch[i + shift_bytes] << shift_bits);	185,960✔
318	m_offset[i] \|= (m_stretch[i + shift_bytes + 1] >> (8 - shift_bits));	185,960✔
319	}
320
321	return m_offset;	9,439✔
322	}
323
324	void OCB_Mode::start_msg(const uint8_t nonce[], size_t nonce_len) {	9,439✔
325	if(!valid_nonce_length(nonce_len)) {	9,439✔
326	throw Invalid_IV_Length(name(), nonce_len);	×
327	}
328
329	assert_key_material_set();	9,439✔
330
331	m_L->init(update_nonce(nonce, nonce_len));	9,439✔
332	zeroise(m_checksum);	9,439✔
333	m_block_index = 0;	9,439✔
334	}	9,439✔
335
336	void OCB_Encryption::encrypt(uint8_t buffer[], size_t blocks) {	4,193✔
337	assert_key_material_set();	4,193✔
338	BOTAN_STATE_CHECK(m_L->initialized());	4,147✔
339
340	const size_t BS = block_size();	4,101✔
341
342	while(blocks > 0) {	11,782✔
343	const size_t proc_blocks = std::min(blocks, par_blocks());	7,681✔
344	const size_t proc_bytes = proc_blocks * BS;	7,681✔
345
346	const uint8_t* offsets = m_L->compute_offsets(m_block_index, proc_blocks);	7,681✔
347
348	xor_buf(m_checksum.data(), buffer, proc_bytes);	7,681✔
349
350	xor_buf(buffer, offsets, proc_bytes);	7,681✔
351	m_cipher->encrypt_n(buffer, buffer, proc_blocks);	7,681✔
352	xor_buf(buffer, offsets, proc_bytes);	7,681✔
353
354	buffer += proc_bytes;	7,681✔
355	blocks -= proc_blocks;	7,681✔
356	m_block_index += proc_blocks;	7,681✔
357	}
358	}	4,101✔
359
360	size_t OCB_Encryption::process_msg(uint8_t buf[], size_t sz) {	500✔
361	BOTAN_ARG_CHECK(sz % update_granularity() == 0, "Invalid OCB input size");	500✔
362	encrypt(buf, sz / block_size());	500✔
363	return sz;	408✔
364	}
365
366	void OCB_Encryption::finish_msg(secure_vector<uint8_t>& buffer, size_t offset) {	5,699✔
367	assert_key_material_set();	5,699✔
368	BOTAN_STATE_CHECK(m_L->initialized());	5,607✔
369
370	const size_t BS = block_size();	5,561✔
371
372	BOTAN_ARG_CHECK(buffer.size() >= offset, "Offset is out of range");	5,561✔
373	const size_t sz = buffer.size() - offset;	5,561✔
374	uint8_t* buf = buffer.data() + offset;	5,561✔
375
376	secure_vector<uint8_t> mac(BS);	5,561✔
377
378	if(sz > 0) {	5,561✔
379	const size_t final_full_blocks = sz / BS;	3,693✔
380	const size_t remainder_bytes = sz - (final_full_blocks * BS);	3,693✔
381
382	encrypt(buf, final_full_blocks);	3,693✔
383	mac = m_L->offset();	3,693✔
384
385	if(remainder_bytes > 0) {	3,693✔
386	BOTAN_ASSERT(remainder_bytes < BS, "Only a partial block left");	3,492✔
387	uint8_t* remainder = &buf[sz - remainder_bytes];	3,492✔
388
389	xor_buf(m_checksum.data(), remainder, remainder_bytes);	3,492✔
390	m_checksum[remainder_bytes] ^= 0x80;	3,492✔
391
392	// Offset_*
393	mac ^= m_L->star();	3,492✔
394
395	secure_vector<uint8_t> pad(BS);	3,492✔
396	m_cipher->encrypt(mac, pad);	3,492✔
397	xor_buf(remainder, pad.data(), remainder_bytes);	3,492✔
398	}	3,492✔
399	} else {
400	mac = m_L->offset();	1,868✔
401	}
402
403	// now compute the tag
404
405	// fold checksum
406	for(size_t i = 0; i != m_checksum.size(); i += BS) {	130,657✔
407	xor_buf(mac.data(), m_checksum.data() + i, BS);	125,096✔
408	}
409
410	xor_buf(mac.data(), m_L->dollar().data(), BS);	5,561✔
411	m_cipher->encrypt(mac);	5,561✔
412	xor_buf(mac.data(), m_ad_hash.data(), BS);	5,561✔
413
414	buffer += std::make_pair(mac.data(), tag_size());	5,561✔
415
416	zeroise(m_checksum);	5,561✔
417	m_block_index = 0;	5,561✔
418	}	5,561✔
419
420	void OCB_Decryption::decrypt(uint8_t buffer[], size_t blocks) {	3,037✔
421	assert_key_material_set();	3,037✔
422	BOTAN_STATE_CHECK(m_L->initialized());	2,991✔
423
424	const size_t BS = block_size();	2,945✔
425
426	while(blocks > 0) {	9,800✔
427	const size_t proc_blocks = std::min(blocks, par_blocks());	6,855✔
428	const size_t proc_bytes = proc_blocks * BS;	6,855✔
429
430	const uint8_t* offsets = m_L->compute_offsets(m_block_index, proc_blocks);	6,855✔
431
432	xor_buf(buffer, offsets, proc_bytes);	6,855✔
433	m_cipher->decrypt_n(buffer, buffer, proc_blocks);	6,855✔
434	xor_buf(buffer, offsets, proc_bytes);	6,855✔
435
436	xor_buf(m_checksum.data(), buffer, proc_bytes);	6,855✔
437
438	buffer += proc_bytes;	6,855✔
439	blocks -= proc_blocks;	6,855✔
440	m_block_index += proc_blocks;	6,855✔
441	}
442	}	2,945✔
443
444	size_t OCB_Decryption::process_msg(uint8_t buf[], size_t sz) {	513✔
445	BOTAN_ARG_CHECK(sz % update_granularity() == 0, "Invalid OCB input size");	513✔
446	decrypt(buf, sz / block_size());	513✔
447	return sz;	421✔
448	}
449
450	void OCB_Decryption::finish_msg(secure_vector<uint8_t>& buffer, size_t offset) {	3,924✔
451	assert_key_material_set();	3,924✔
452	BOTAN_STATE_CHECK(m_L->initialized());	3,832✔
453
454	const size_t BS = block_size();	3,786✔
455
456	BOTAN_ARG_CHECK(buffer.size() >= offset, "Offset is out of range");	3,786✔
457	const size_t sz = buffer.size() - offset;	3,786✔
458	uint8_t* buf = buffer.data() + offset;	3,786✔
459
460	BOTAN_ARG_CHECK(sz >= tag_size(), "input did not include the tag");	3,786✔
461
462	const size_t remaining = sz - tag_size();	3,786✔
463
464	secure_vector<uint8_t> mac(BS);	3,786✔
465
466	if(remaining > 0) {	3,786✔
467	const size_t final_full_blocks = remaining / BS;	2,524✔
468	const size_t final_bytes = remaining - (final_full_blocks * BS);	2,524✔
469
470	decrypt(buf, final_full_blocks);	2,524✔
471	mac ^= m_L->offset();	2,524✔
472
473	if(final_bytes > 0) {	2,524✔
474	BOTAN_ASSERT(final_bytes < BS, "Only a partial block left");	2,334✔
475
476	uint8_t* remainder = &buf[remaining - final_bytes];	2,334✔
477
478	mac ^= m_L->star();	2,334✔
479	secure_vector<uint8_t> pad(BS);	2,472✔
480	m_cipher->encrypt(mac, pad); // P_*	2,334✔
481	xor_buf(remainder, pad.data(), final_bytes);	2,334✔
482
483	xor_buf(m_checksum.data(), remainder, final_bytes);	2,334✔
484	m_checksum[final_bytes] ^= 0x80;	2,334✔
485	}	2,334✔
486	} else {
487	mac = m_L->offset();	1,262✔
488	}
489
490	// compute the mac
491
492	// fold checksum
493	for(size_t i = 0; i != m_checksum.size(); i += BS) {	124,094✔
494	xor_buf(mac.data(), m_checksum.data() + i, BS);	120,308✔
495	}
496
497	mac ^= m_L->dollar();	3,786✔
498	m_cipher->encrypt(mac);	3,786✔
499	mac ^= m_ad_hash;	3,786✔
500
501	// reset state
502	zeroise(m_checksum);	3,786✔
503	m_block_index = 0;	3,786✔
504
505	// compare mac
506	const uint8_t* included_tag = &buf[remaining];	3,786✔
507
508	if(!CT::is_equal(mac.data(), included_tag, tag_size()).as_bool()) {	3,786✔
509	throw Invalid_Authentication_Tag("OCB tag check failed");	138✔
510	}
511
512	// remove tag from end of message
513	buffer.resize(remaining + offset);	3,648✔
514	}	3,648✔
515
516	} // namespace Botan

randombit / botan / 21753596263

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