1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
|
/*
* XMSS Common Ops
* Operations shared by XMSS signature generation and verification operations.
* (C) 2016,2017 Matthias Gierlings
*
* Botan is released under the Simplified BSD License (see license.txt)
**/
#include <botan/xmss_common_ops.h>
namespace Botan {
void
XMSS_Common_Ops::randomize_tree_hash(secure_vector<uint8_t>& result,
const secure_vector<uint8_t>& left,
const secure_vector<uint8_t>& right,
XMSS_Address& adrs,
const secure_vector<uint8_t>& seed,
XMSS_Hash& hash)
{
adrs.set_key_mask_mode(XMSS_Address::Key_Mask::Key_Mode);
secure_vector<uint8_t> key { hash.prf(seed, adrs.bytes()) };
adrs.set_key_mask_mode(XMSS_Address::Key_Mask::Mask_MSB_Mode);
secure_vector<uint8_t> bitmask_l { hash.prf(seed, adrs.bytes()) };
adrs.set_key_mask_mode(XMSS_Address::Key_Mask::Mask_LSB_Mode);
secure_vector<uint8_t> bitmask_r { hash.prf(seed, adrs.bytes()) };
BOTAN_ASSERT(bitmask_l.size() == left.size() &&
bitmask_r.size() == right.size(),
"Bitmask size doesn't match node size.");
secure_vector<uint8_t> concat_xor(m_xmss_params.element_size() * 2);
for(size_t i = 0; i < left.size(); i++)
{
concat_xor[i] = left[i] ^ bitmask_l[i];
concat_xor[i + left.size()] = right[i] ^ bitmask_r[i];
}
hash.h(result, key, concat_xor);
}
void
XMSS_Common_Ops::create_l_tree(secure_vector<uint8_t>& result,
wots_keysig_t pk,
XMSS_Address& adrs,
const secure_vector<uint8_t>& seed,
XMSS_Hash& hash)
{
size_t l = m_xmss_params.len();
adrs.set_tree_height(0);
while(l > 1)
{
for(size_t i = 0; i < l >> 1; i++)
{
adrs.set_tree_index(i);
randomize_tree_hash(pk[i], pk[2 * i], pk[2 * i + 1], adrs, seed, hash);
}
if(l & 0x01)
{
pk[l >> 1] = pk[l - 1];
}
l = (l >> 1) + (l & 0x01);
adrs.set_tree_height(adrs.get_tree_height() + 1);
}
result = pk[0];
}
}
|
