1 /* Copyright (c) 2023, Google LLC
2 *
3 * Permission to use, copy, modify, and/or distribute this software for any
4 * purpose with or without fee is hereby granted, provided that the above
5 * copyright notice and this permission notice appear in all copies.
6 *
7 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
8 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
9 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
10 * SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
11 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION
12 * OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
13 * CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. */
14
15 #include <openssl/base.h>
16
17 #include <string.h>
18
19 #include "./address.h"
20 #include "./merkle.h"
21 #include "./params.h"
22 #include "./thash.h"
23 #include "./wots.h"
24
spx_treehash(uint8_t out_pk[SPX_N],const uint8_t sk_seed[SPX_N],uint32_t i,uint32_t z,const uint8_t pk_seed[SPX_N],uint8_t addr[32])25 void spx_treehash(uint8_t out_pk[SPX_N], const uint8_t sk_seed[SPX_N],
26 uint32_t i /*target node index*/,
27 uint32_t z /*target node height*/,
28 const uint8_t pk_seed[SPX_N], uint8_t addr[32]) {
29 BSSL_CHECK(z <= SPX_TREE_HEIGHT);
30 BSSL_CHECK(i < (uint32_t)(1 << (SPX_TREE_HEIGHT - z)));
31
32 if (z == 0) {
33 spx_set_type(addr, SPX_ADDR_TYPE_WOTS);
34 spx_set_keypair_addr(addr, i);
35 spx_wots_pk_gen(out_pk, sk_seed, pk_seed, addr);
36 } else {
37 // Stores left node and right node.
38 uint8_t nodes[2 * SPX_N];
39 spx_treehash(nodes, sk_seed, 2 * i, z - 1, pk_seed, addr);
40 spx_treehash(nodes + SPX_N, sk_seed, 2 * i + 1, z - 1, pk_seed, addr);
41 spx_set_type(addr, SPX_ADDR_TYPE_HASHTREE);
42 spx_set_tree_height(addr, z);
43 spx_set_tree_index(addr, i);
44 spx_thash_h(out_pk, nodes, pk_seed, addr);
45 }
46 }
47
spx_xmss_sign(uint8_t * sig,const uint8_t msg[SPX_N],unsigned int idx,const uint8_t sk_seed[SPX_N],const uint8_t pk_seed[SPX_N],uint8_t addr[32])48 void spx_xmss_sign(uint8_t *sig, const uint8_t msg[SPX_N], unsigned int idx,
49 const uint8_t sk_seed[SPX_N], const uint8_t pk_seed[SPX_N],
50 uint8_t addr[32]) {
51 // Build authentication path
52 for (size_t j = 0; j < SPX_TREE_HEIGHT; ++j) {
53 unsigned int k = (idx >> j) ^ 1;
54 spx_treehash(sig + SPX_WOTS_BYTES + j * SPX_N, sk_seed, k, j, pk_seed,
55 addr);
56 }
57
58 // Compute WOTS+ signature
59 spx_set_type(addr, SPX_ADDR_TYPE_WOTS);
60 spx_set_keypair_addr(addr, idx);
61 spx_wots_sign(sig, msg, sk_seed, pk_seed, addr);
62 }
63
spx_xmss_pk_from_sig(uint8_t * root,const uint8_t * xmss_sig,unsigned int idx,const uint8_t msg[SPX_N],const uint8_t pk_seed[SPX_N],uint8_t addr[32])64 void spx_xmss_pk_from_sig(uint8_t *root, const uint8_t *xmss_sig,
65 unsigned int idx, const uint8_t msg[SPX_N],
66 const uint8_t pk_seed[SPX_N], uint8_t addr[32]) {
67 // Stores node[0] and node[1] from Algorithm 10
68 uint8_t node[2 * SPX_N];
69 uint8_t tmp[2 * SPX_N];
70 spx_set_type(addr, SPX_ADDR_TYPE_WOTS);
71 spx_set_keypair_addr(addr, idx);
72 spx_wots_pk_from_sig(node, xmss_sig, msg, pk_seed, addr);
73
74 const uint8_t *auth = xmss_sig + SPX_WOTS_BYTES;
75
76 spx_set_type(addr, SPX_ADDR_TYPE_HASHTREE);
77 spx_set_tree_index(addr, idx);
78 for (size_t k = 0; k < SPX_TREE_HEIGHT; ++k) {
79 spx_set_tree_height(addr, k + 1);
80 // Is even
81 if (((idx >> k) & 1) == 0) {
82 spx_set_tree_index(addr, spx_get_tree_index(addr) >> 1);
83 memcpy(tmp, node, SPX_N);
84 memcpy(tmp + SPX_N, auth + k * SPX_N, SPX_N);
85 spx_thash_h(node + SPX_N, tmp, pk_seed, addr);
86 } else {
87 spx_set_tree_index(addr, (spx_get_tree_index(addr) - 1) >> 1);
88 memcpy(tmp, auth + k * SPX_N, SPX_N);
89 memcpy(tmp + SPX_N, node, SPX_N);
90 spx_thash_h(node + SPX_N, tmp, pk_seed, addr);
91 }
92 memcpy(node, node + SPX_N, SPX_N);
93 }
94 memcpy(root, node, SPX_N);
95 }
96
spx_ht_sign(uint8_t * sig,const uint8_t message[SPX_N],uint64_t idx_tree,uint32_t idx_leaf,const uint8_t sk_seed[SPX_N],const uint8_t pk_seed[SPX_N])97 void spx_ht_sign(uint8_t *sig, const uint8_t message[SPX_N], uint64_t idx_tree,
98 uint32_t idx_leaf, const uint8_t sk_seed[SPX_N],
99 const uint8_t pk_seed[SPX_N]) {
100 uint8_t addr[32] = {0};
101 spx_set_tree_addr(addr, idx_tree);
102
103 // Layer 0
104 uint8_t sig_tmp[SPX_XMSS_BYTES];
105 spx_xmss_sign(sig_tmp, message, idx_leaf, sk_seed, pk_seed, addr);
106 memcpy(sig, sig_tmp, sizeof(sig_tmp));
107
108 uint8_t root[SPX_N];
109 spx_xmss_pk_from_sig(root, sig_tmp, idx_leaf, message, pk_seed, addr);
110
111 // All other layers
112 for (size_t j = 1; j < SPX_D; ++j) {
113 idx_leaf = idx_tree % (1 << SPX_TREE_HEIGHT);
114 idx_tree = idx_tree >> SPX_TREE_HEIGHT;
115 spx_set_layer_addr(addr, j);
116 spx_set_tree_addr(addr, idx_tree);
117 spx_xmss_sign(sig_tmp, root, idx_leaf, sk_seed, pk_seed, addr);
118 memcpy(sig + j * SPX_XMSS_BYTES, sig_tmp, sizeof(sig_tmp));
119
120 if (j < (SPX_D - 1)) {
121 spx_xmss_pk_from_sig(root, sig_tmp, idx_leaf, root, pk_seed, addr);
122 }
123 }
124 }
125
spx_ht_verify(const uint8_t sig[SPX_D * SPX_XMSS_BYTES],const uint8_t message[SPX_N],uint64_t idx_tree,uint32_t idx_leaf,const uint8_t pk_root[SPX_N],const uint8_t pk_seed[SPX_N])126 int spx_ht_verify(const uint8_t sig[SPX_D * SPX_XMSS_BYTES],
127 const uint8_t message[SPX_N], uint64_t idx_tree,
128 uint32_t idx_leaf, const uint8_t pk_root[SPX_N],
129 const uint8_t pk_seed[SPX_N]) {
130 uint8_t addr[32] = {0};
131 spx_set_tree_addr(addr, idx_tree);
132
133 uint8_t sig_tmp[SPX_XMSS_BYTES];
134 memcpy(sig_tmp, sig, sizeof(sig_tmp));
135
136 uint8_t node[SPX_N];
137 spx_xmss_pk_from_sig(node, sig_tmp, idx_leaf, message, pk_seed, addr);
138
139 for (size_t j = 1; j < SPX_D; ++j) {
140 idx_leaf = idx_tree % (1 << SPX_TREE_HEIGHT);
141 idx_tree = idx_tree >> SPX_TREE_HEIGHT;
142 spx_set_layer_addr(addr, j);
143 spx_set_tree_addr(addr, idx_tree);
144 // Get jth XMSS signature
145 memcpy(sig_tmp, sig + j * SPX_XMSS_BYTES, sizeof(sig_tmp));
146
147 spx_xmss_pk_from_sig(node, sig_tmp, idx_leaf, node, pk_seed, addr);
148 }
149 return memcmp(node, pk_root, SPX_N) == 0;
150 }
151