Coverage Report

Created: 2026-07-12 07:21

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/openssl/crypto/slh_dsa/slh_wots.c
Line
Count
Source
1
/*
2
 * Copyright 2024-2026 The OpenSSL Project Authors. All Rights Reserved.
3
 *
4
 * Licensed under the Apache License 2.0 (the "License").  You may not use
5
 * this file except in compliance with the License.  You can obtain a copy
6
 * in the file LICENSE in the source distribution or at
7
 * https://www.openssl.org/source/license.html
8
 */
9
10
#include <string.h>
11
#include <openssl/crypto.h>
12
#include "slh_dsa_local.h"
13
#include "slh_dsa_key.h"
14
15
/* For the parameter sets defined there is only one w value */
16
#define SLH_WOTS_LOGW 4
17
#define SLH_WOTS_W 16
18
48.5k
#define SLH_WOTS_LEN1(n) (2 * (n))
19
48.5k
#define SLH_WOTS_LEN2 3
20
#define SLH_WOTS_CHECKSUM_LEN ((SLH_WOTS_LEN2 + SLH_WOTS_LOGW + 7) / 8)
21
#define SLH_WOTS_LEN_MAX SLH_WOTS_LEN(SLH_MAX_N)
22
2.89M
#define NIBBLE_MASK 15
23
1.21M
#define NIBBLE_SHIFT 4
24
25
/*
26
 * @brief Convert a byte array to a byte array of (4 bit) nibbles
27
 * This is a Variant of the FIPS 205 Algorithm 4 base_2^b function.
28
 *
29
 * @param in A byte message to convert
30
 * @param in_len The size of |in|.
31
 * @param out The returned array of nibbles, with a size of 2*|in_len|
32
 */
33
static ossl_inline void slh_bytes_to_nibbles(const uint8_t *in, size_t in_len,
34
    uint8_t *out)
35
48.5k
{
36
48.5k
    size_t consumed = 0;
37
38
1.16M
    for (consumed = 0; consumed < in_len; consumed++) {
39
1.12M
        *out++ = (*in >> NIBBLE_SHIFT);
40
1.12M
        *out++ = (*in++ & NIBBLE_MASK);
41
1.12M
    }
42
48.5k
}
43
44
/*
45
 * With w = 16 the maximum checksum is 0xF * n which fits into 12 bits
46
 * which is 3 nibbles.
47
 *
48
 * This is effectively a cutdown version of Algorithm 7: steps 3 to 6
49
 * which does a complicated base2^b(tobyte()) operation.
50
 */
51
static ossl_inline void compute_checksum_nibbles(const uint8_t *in, size_t in_len,
52
    uint8_t *out)
53
48.5k
{
54
48.5k
    size_t i;
55
48.5k
    uint16_t csum = 0;
56
57
    /* Compute checksum */
58
2.29M
    for (i = 0; i < in_len; ++i)
59
2.24M
        csum += in[i];
60
    /*
61
     * This line is effectively the same as doing csum += NIBBLE_MASK - in[i]
62
     * in the loop above.
63
     */
64
48.5k
    csum = (uint16_t)(NIBBLE_MASK * in_len) - csum;
65
66
    /* output checksum as 3 nibbles */
67
48.5k
    out[0] = (csum >> (2 * NIBBLE_SHIFT)) & NIBBLE_MASK;
68
48.5k
    out[1] = (csum >> NIBBLE_SHIFT) & NIBBLE_MASK;
69
48.5k
    out[2] = csum & NIBBLE_MASK;
70
48.5k
}
71
72
/**
73
 * @brief WOTS+ Chaining function
74
 * See FIPS 205 Section 5 Algorithm 5
75
 *
76
 * Iterates using a hash function on the input |steps| times starting at index
77
 * |start|. (Internally the |adrs| hash address is used to update the chaining
78
 * index).
79
 *
80
 * @param ctx Contains SLH_DSA algorithm functions and constants.
81
 * @param in An input string of |n| bytes
82
 * @param start_index The chaining start index
83
 * @param steps The number of iterations starting from |start_index|
84
 *              Note |start_index| + |steps| < w
85
 *              (where w = 16 indicates the length of the hash chains)
86
 * @param pk_seed A public key seed (which is added to the hash)
87
 * @param adrs An ADRS object which has a type of WOTS_HASH, and has a layer
88
 *             address, tree address, key pair address and chain address
89
 * @params wpkt A WPACKET object to write the hash chain to (n bytes are written)
90
 * @returns 1 on success, or 0 on error.
91
 */
92
static int slh_wots_chain(SLH_DSA_HASH_CTX *ctx, const uint8_t *in,
93
    uint8_t start_index, uint8_t steps,
94
    const uint8_t *pk_seed, uint8_t *adrs, WPACKET *wpkt)
95
41.5M
{
96
41.5M
    const SLH_DSA_KEY *key = ctx->key;
97
41.5M
    SLH_HASH_FUNC_DECLARE(key, hashf);
98
41.5M
    SLH_ADRS_FUNC_DECLARE(key, adrsf);
99
41.5M
    SLH_HASH_FN_DECLARE(hashf, F);
100
41.5M
    SLH_ADRS_FN_DECLARE(adrsf, set_hash_address);
101
41.5M
    size_t j = start_index, end_index;
102
41.5M
    size_t n = key->params->n;
103
41.5M
    uint8_t *tmp; /* Pointer into the |wpkt| buffer */
104
41.5M
    size_t tmp_len = n;
105
106
41.5M
    if (steps == 0)
107
152k
        return WPACKET_memcpy(wpkt, in, n);
108
109
41.4M
    if (!WPACKET_allocate_bytes(wpkt, tmp_len, &tmp))
110
0
        return 0;
111
112
41.4M
    set_hash_address(adrs, (uint32_t)(j++));
113
41.4M
    if (!F(ctx, pk_seed, adrs, in, n, tmp, tmp_len))
114
0
        return 0;
115
116
41.4M
    end_index = start_index + steps;
117
605M
    for (; j < end_index; ++j) {
118
564M
        set_hash_address(adrs, (uint32_t)j);
119
564M
        if (!F(ctx, pk_seed, adrs, tmp, n, tmp, tmp_len))
120
0
            return 0;
121
564M
    }
122
41.4M
    return 1;
123
41.4M
}
124
125
/**
126
 * @brief WOTS+ Public key generation.
127
 * See FIPS 205 Section 5.1 Algorithm 6
128
 *
129
 * @param ctx Contains SLH_DSA algorithm functions and constants.
130
 * @param sk_seed A private key seed of size |n|
131
 * @param pk_seed A public key seed of size |n|
132
 * @param adrs An ADRS object containing the layer address, tree address and
133
 *             keypair address of the WOTS+ public key to generate.
134
 * @param pk_out The generated public key of size |n|
135
 * @param pk_out_len The maximum size of |pk_out|
136
 * @returns 1 on success, or 0 on error.
137
 */
138
int ossl_slh_wots_pk_gen(SLH_DSA_HASH_CTX *ctx,
139
    const uint8_t *sk_seed, const uint8_t *pk_seed,
140
    uint8_t *adrs, uint8_t *pk_out, size_t pk_out_len)
141
488k
{
142
488k
    int ret = 0;
143
488k
    const SLH_DSA_KEY *key = ctx->key;
144
488k
    size_t n = key->params->n;
145
488k
    size_t len = SLH_WOTS_LEN(n); /* 2 * n + 3 */
146
488k
    uint8_t tmp[SLH_WOTS_LEN_MAX * SLH_MAX_N];
147
488k
    size_t tmp_len = n * len;
148
149
488k
    SLH_HASH_FUNC_DECLARE(key, hashf);
150
488k
    SLH_ADRS_FUNC_DECLARE(key, adrsf);
151
488k
    SLH_ADRS_DECLARE(wots_pk_adrs);
152
153
488k
    if (!hashf->wots_pk_gen(ctx, sk_seed, pk_seed, adrs, tmp, tmp_len))
154
0
        goto end;
155
156
488k
    adrsf->copy(wots_pk_adrs, adrs);
157
488k
    adrsf->set_type_and_clear(wots_pk_adrs, SLH_ADRS_TYPE_WOTS_PK);
158
488k
    adrsf->copy_keypair_address(wots_pk_adrs, adrs);
159
488k
    ret = hashf->T(ctx, pk_seed, wots_pk_adrs, tmp, tmp_len, pk_out, pk_out_len);
160
488k
end:
161
488k
    return ret;
162
488k
}
163
164
/**
165
 * @brief WOTS+ Signature generation
166
 * See FIPS 205 Section 5.2 Algorithm 7
167
 *
168
 * The returned signature size is len * |n| bytes (where len = 2 * |n| + 3).
169
 *
170
 * @param ctx Contains SLH_DSA algorithm functions and constants.
171
 * @param msg An input message of size |n| bytes.
172
 *            The message is either an XMSS or FORS public key
173
 * @param sk_seed The private key seed of size |n| bytes
174
 * @param pk_seed The public key seed  of size |n| bytes
175
 * @param adrs An address containing the layer address, tree address and key
176
 *             pair address. The size is either 32 or 22 bytes.
177
 * @param sig_wpkt A WPACKET object to write the signature to.
178
 * @returns 1 on success, or 0 on error.
179
 */
180
int ossl_slh_wots_sign(SLH_DSA_HASH_CTX *ctx, const uint8_t *msg,
181
    const uint8_t *sk_seed, const uint8_t *pk_seed,
182
    uint8_t *adrs, WPACKET *sig_wpkt)
183
16.5k
{
184
16.5k
    int ret = 0;
185
16.5k
    const SLH_DSA_KEY *key = ctx->key;
186
16.5k
    uint8_t msg_and_csum_nibbles[SLH_WOTS_LEN_MAX]; /* size is >= 2 * n + 3 */
187
16.5k
    uint8_t sk[SLH_MAX_N];
188
16.5k
    size_t i;
189
16.5k
    size_t n = key->params->n;
190
16.5k
    size_t len1 = SLH_WOTS_LEN1(n); /* 2 * n = the msg length in nibbles */
191
16.5k
    size_t len = len1 + SLH_WOTS_LEN2; /* 2 * n + 3 (3 checksum nibbles) */
192
193
16.5k
    SLH_ADRS_DECLARE(sk_adrs);
194
16.5k
    SLH_HASH_FUNC_DECLARE(key, hashf);
195
16.5k
    SLH_ADRS_FUNC_DECLARE(key, adrsf);
196
16.5k
    SLH_HASH_FN_DECLARE(hashf, PRF);
197
16.5k
    SLH_ADRS_FN_DECLARE(adrsf, set_chain_address);
198
199
    /*
200
     * Convert n message bytes to 2*n base w=16 integers
201
     * i.e. Convert message to an array of 2*n nibbles.
202
     */
203
16.5k
    slh_bytes_to_nibbles(msg, n, msg_and_csum_nibbles);
204
    /* Compute a 12 bit checksum and add it to the end */
205
16.5k
    compute_checksum_nibbles(msg_and_csum_nibbles, len1, msg_and_csum_nibbles + len1);
206
207
16.5k
    adrsf->copy(sk_adrs, adrs);
208
16.5k
    adrsf->set_type_and_clear(sk_adrs, SLH_ADRS_TYPE_WOTS_PRF);
209
16.5k
    adrsf->copy_keypair_address(sk_adrs, adrs);
210
211
829k
    for (i = 0; i < len; ++i) {
212
812k
        set_chain_address(sk_adrs, (uint32_t)i);
213
        /* compute chain i secret */
214
812k
        if (!PRF(ctx, pk_seed, sk_seed, sk_adrs, sk, sizeof(sk)))
215
0
            goto err;
216
812k
        set_chain_address(adrs, (uint32_t)i);
217
        /* compute chain i signature */
218
812k
        if (!slh_wots_chain(ctx, sk, 0, msg_and_csum_nibbles[i],
219
812k
                pk_seed, adrs, sig_wpkt))
220
0
            goto err;
221
812k
    }
222
16.5k
    ret = 1;
223
16.5k
err:
224
16.5k
    return ret;
225
16.5k
}
226
227
/**
228
 * @brief Compute a candidate WOTS+ public key from a message and signature
229
 * See FIPS 205 Section 5.3 Algorithm 8
230
 *
231
 * The size of the signature is len * |n| bytes (where len = 2 * |n| + 3).
232
 *
233
 * @param ctx Contains SLH_DSA algorithm functions and constants.
234
 * @param sig_rpkt A PACKET object to read a WOTS+ signature from
235
 * @param msg A message of size |n| bytes.
236
 * @param pk_seed The public key seed of size |n|.
237
 * @param adrs An ADRS object containing the layer address, tree address and
238
 *             key pair address that of the WOTS+ key used to sign the message.
239
 * @param pk_out The returned public key candidate of size |n|
240
 * @param pk_out_len The maximum size of |pk_out|
241
 * @returns 1 on success, or 0 on error.
242
 */
243
int ossl_slh_wots_pk_from_sig(SLH_DSA_HASH_CTX *ctx,
244
    PACKET *sig_rpkt, const uint8_t *msg,
245
    const uint8_t *pk_seed, uint8_t *adrs,
246
    uint8_t *pk_out, size_t pk_out_len)
247
32.0k
{
248
32.0k
    int ret = 0;
249
32.0k
    const SLH_DSA_KEY *key = ctx->key;
250
32.0k
    uint8_t msg_and_csum_nibbles[SLH_WOTS_LEN_MAX];
251
32.0k
    size_t i;
252
32.0k
    size_t n = key->params->n;
253
32.0k
    size_t len1 = SLH_WOTS_LEN1(n);
254
32.0k
    size_t len = len1 + SLH_WOTS_LEN2; /* 2n + 3 */
255
32.0k
    const uint8_t *sig_i; /* Pointer into |sig_rpkt| buffer */
256
32.0k
    uint8_t tmp[SLH_WOTS_LEN_MAX * SLH_MAX_N];
257
32.0k
    WPACKET pkt, *tmp_pkt = &pkt;
258
32.0k
    size_t tmp_len = 0;
259
260
32.0k
    SLH_HASH_FUNC_DECLARE(key, hashf);
261
32.0k
    SLH_ADRS_FUNC_DECLARE(key, adrsf);
262
32.0k
    SLH_ADRS_FN_DECLARE(adrsf, set_chain_address);
263
32.0k
    SLH_ADRS_DECLARE(wots_pk_adrs);
264
265
32.0k
    if (!WPACKET_init_static_len(tmp_pkt, tmp, sizeof(tmp), 0))
266
0
        return 0;
267
268
32.0k
    slh_bytes_to_nibbles(msg, n, msg_and_csum_nibbles);
269
32.0k
    compute_checksum_nibbles(msg_and_csum_nibbles, len1, msg_and_csum_nibbles + len1);
270
271
    /* Compute the end nodes for each of the chains */
272
1.60M
    for (i = 0; i < len; ++i) {
273
1.57M
        set_chain_address(adrs, (uint32_t)i);
274
1.57M
        if (!PACKET_get_bytes(sig_rpkt, &sig_i, n)
275
1.57M
            || !slh_wots_chain(ctx, sig_i, msg_and_csum_nibbles[i],
276
1.57M
                NIBBLE_MASK - msg_and_csum_nibbles[i],
277
1.57M
                pk_seed, adrs, tmp_pkt))
278
0
            goto err;
279
1.57M
    }
280
    /* compress the computed public key value */
281
32.0k
    adrsf->copy(wots_pk_adrs, adrs);
282
32.0k
    adrsf->set_type_and_clear(wots_pk_adrs, SLH_ADRS_TYPE_WOTS_PK);
283
32.0k
    adrsf->copy_keypair_address(wots_pk_adrs, adrs);
284
32.0k
    if (!WPACKET_get_total_written(tmp_pkt, &tmp_len))
285
0
        goto err;
286
32.0k
    ret = hashf->T(ctx, pk_seed, wots_pk_adrs, tmp, tmp_len,
287
32.0k
        pk_out, pk_out_len);
288
32.0k
err:
289
32.0k
    if (!WPACKET_finish(tmp_pkt))
290
0
        ret = 0;
291
32.0k
    return ret;
292
32.0k
}