Coverage Report

Created: 2025-08-28 07:07

/src/openssl33/crypto/ec/curve448/curve448.c
Line
Count
Source (jump to first uncovered line)
1
/*
2
 * Copyright 2017-2023 The OpenSSL Project Authors. All Rights Reserved.
3
 * Copyright 2015-2016 Cryptography Research, Inc.
4
 *
5
 * Licensed under the Apache License 2.0 (the "License").  You may not use
6
 * this file except in compliance with the License.  You can obtain a copy
7
 * in the file LICENSE in the source distribution or at
8
 * https://www.openssl.org/source/license.html
9
 *
10
 * Originally written by Mike Hamburg
11
 */
12
#include <openssl/crypto.h>
13
#include "word.h"
14
#include "field.h"
15
16
#include "point_448.h"
17
#include "ed448.h"
18
#include "crypto/ecx.h"
19
#include "curve448_local.h"
20
21
578
#define COFACTOR 4
22
23
80
#define C448_WNAF_FIXED_TABLE_BITS 5
24
80
#define C448_WNAF_VAR_TABLE_BITS 3
25
26
8.24k
#define EDWARDS_D       (-39081)
27
28
static const curve448_scalar_t precomputed_scalarmul_adjustment = {
29
    {
30
        {
31
            SC_LIMB(0xc873d6d54a7bb0cfULL), SC_LIMB(0xe933d8d723a70aadULL),
32
            SC_LIMB(0xbb124b65129c96fdULL), SC_LIMB(0x00000008335dc163ULL)
33
        }
34
    }
35
};
36
37
897
#define TWISTED_D (EDWARDS_D - 1)
38
39
438k
#define WBITS C448_WORD_BITS   /* NB this may be different from ARCH_WORD_BITS */
40
41
/* Inverse. */
42
static void gf_invert(gf y, const gf x, int assert_nonzero)
43
508
{
44
508
    mask_t ret;
45
508
    gf t1, t2;
46
47
508
    ossl_gf_sqr(t1, x);              /* o^2 */
48
508
    ret = gf_isr(t2, t1);       /* +-1/sqrt(o^2) = +-1/o */
49
508
    (void)ret;
50
508
    if (assert_nonzero)
51
42
        assert(ret);
52
508
    ossl_gf_sqr(t1, t2);
53
508
    ossl_gf_mul(t2, t1, x);          /* not direct to y in case of alias. */
54
508
    gf_copy(y, t2);
55
508
}
56
57
/** identity = (0,1) */
58
const curve448_point_t ossl_curve448_point_identity =
59
    { {{{{0}}}, {{{1}}}, {{{1}}}, {{{0}}}} };
60
61
static void point_double_internal(curve448_point_t p, const curve448_point_t q,
62
                                  int before_double)
63
43.7k
{
64
43.7k
    gf a, b, c, d;
65
66
43.7k
    ossl_gf_sqr(c, q->x);
67
43.7k
    ossl_gf_sqr(a, q->y);
68
43.7k
    gf_add_nr(d, c, a);         /* 2+e */
69
43.7k
    gf_add_nr(p->t, q->y, q->x); /* 2+e */
70
43.7k
    ossl_gf_sqr(b, p->t);
71
43.7k
    gf_subx_nr(b, b, d, 3);     /* 4+e */
72
43.7k
    gf_sub_nr(p->t, a, c);      /* 3+e */
73
43.7k
    ossl_gf_sqr(p->x, q->z);
74
43.7k
    gf_add_nr(p->z, p->x, p->x); /* 2+e */
75
43.7k
    gf_subx_nr(a, p->z, p->t, 4); /* 6+e */
76
43.7k
    if (GF_HEADROOM == 5)
77
0
        gf_weak_reduce(a);      /* or 1+e */
78
43.7k
    ossl_gf_mul(p->x, a, b);
79
43.7k
    ossl_gf_mul(p->z, p->t, a);
80
43.7k
    ossl_gf_mul(p->y, p->t, d);
81
43.7k
    if (!before_double)
82
16.3k
        ossl_gf_mul(p->t, b, d);
83
43.7k
}
84
85
void ossl_curve448_point_double(curve448_point_t p, const curve448_point_t q)
86
80
{
87
80
    point_double_internal(p, q, 0);
88
80
}
89
90
/* Operations on [p]niels */
91
static ossl_inline void cond_neg_niels(niels_t n, mask_t neg)
92
44.2k
{
93
44.2k
    gf_cond_swap(n->a, n->b, neg);
94
44.2k
    gf_cond_neg(n->c, neg);
95
44.2k
}
96
97
static void pt_to_pniels(pniels_t b, const curve448_point_t a)
98
720
{
99
720
    gf_sub(b->n->a, a->y, a->x);
100
720
    gf_add(b->n->b, a->x, a->y);
101
720
    gf_mulw(b->n->c, a->t, 2 * TWISTED_D);
102
720
    gf_add(b->z, a->z, a->z);
103
720
}
104
105
static void pniels_to_pt(curve448_point_t e, const pniels_t d)
106
62
{
107
62
    gf eu;
108
109
62
    gf_add(eu, d->n->b, d->n->a);
110
62
    gf_sub(e->y, d->n->b, d->n->a);
111
62
    ossl_gf_mul(e->t, e->y, eu);
112
62
    ossl_gf_mul(e->x, d->z, e->y);
113
62
    ossl_gf_mul(e->y, d->z, eu);
114
62
    ossl_gf_sqr(e->z, d->z);
115
62
}
116
117
static void niels_to_pt(curve448_point_t e, const niels_t n)
118
510
{
119
510
    gf_add(e->y, n->b, n->a);
120
510
    gf_sub(e->x, n->b, n->a);
121
510
    ossl_gf_mul(e->t, e->y, e->x);
122
510
    gf_copy(e->z, ONE);
123
510
}
124
125
static void add_niels_to_pt(curve448_point_t d, const niels_t e,
126
                            int before_double)
127
48.7k
{
128
48.7k
    gf a, b, c;
129
130
48.7k
    gf_sub_nr(b, d->y, d->x);   /* 3+e */
131
48.7k
    ossl_gf_mul(a, e->a, b);
132
48.7k
    gf_add_nr(b, d->x, d->y);   /* 2+e */
133
48.7k
    ossl_gf_mul(d->y, e->b, b);
134
48.7k
    ossl_gf_mul(d->x, e->c, d->t);
135
48.7k
    gf_add_nr(c, a, d->y);      /* 2+e */
136
48.7k
    gf_sub_nr(b, d->y, a);      /* 3+e */
137
48.7k
    gf_sub_nr(d->y, d->z, d->x); /* 3+e */
138
48.7k
    gf_add_nr(a, d->x, d->z);   /* 2+e */
139
48.7k
    ossl_gf_mul(d->z, a, d->y);
140
48.7k
    ossl_gf_mul(d->x, d->y, b);
141
48.7k
    ossl_gf_mul(d->y, a, c);
142
48.7k
    if (!before_double)
143
36.2k
        ossl_gf_mul(d->t, b, c);
144
48.7k
}
145
146
static void sub_niels_from_pt(curve448_point_t d, const niels_t e,
147
                              int before_double)
148
3.95k
{
149
3.95k
    gf a, b, c;
150
151
3.95k
    gf_sub_nr(b, d->y, d->x);   /* 3+e */
152
3.95k
    ossl_gf_mul(a, e->b, b);
153
3.95k
    gf_add_nr(b, d->x, d->y);   /* 2+e */
154
3.95k
    ossl_gf_mul(d->y, e->a, b);
155
3.95k
    ossl_gf_mul(d->x, e->c, d->t);
156
3.95k
    gf_add_nr(c, a, d->y);      /* 2+e */
157
3.95k
    gf_sub_nr(b, d->y, a);      /* 3+e */
158
3.95k
    gf_add_nr(d->y, d->z, d->x); /* 2+e */
159
3.95k
    gf_sub_nr(a, d->z, d->x);   /* 3+e */
160
3.95k
    ossl_gf_mul(d->z, a, d->y);
161
3.95k
    ossl_gf_mul(d->x, d->y, b);
162
3.95k
    ossl_gf_mul(d->y, a, c);
163
3.95k
    if (!before_double)
164
256
        ossl_gf_mul(d->t, b, c);
165
3.95k
}
166
167
static void add_pniels_to_pt(curve448_point_t p, const pniels_t pn,
168
                             int before_double)
169
3.48k
{
170
3.48k
    gf L0;
171
172
3.48k
    ossl_gf_mul(L0, p->z, pn->z);
173
3.48k
    gf_copy(p->z, L0);
174
3.48k
    add_niels_to_pt(p, pn->n, before_double);
175
3.48k
}
176
177
static void sub_pniels_from_pt(curve448_point_t p, const pniels_t pn,
178
                               int before_double)
179
2.95k
{
180
2.95k
    gf L0;
181
182
2.95k
    ossl_gf_mul(L0, p->z, pn->z);
183
2.95k
    gf_copy(p->z, L0);
184
2.95k
    sub_niels_from_pt(p, pn->n, before_double);
185
2.95k
}
186
187
c448_bool_t
188
ossl_curve448_point_eq(const curve448_point_t p,
189
                       const curve448_point_t q)
190
80
{
191
80
    mask_t succ;
192
80
    gf a, b;
193
194
    /* equality mod 2-torsion compares x/y */
195
80
    ossl_gf_mul(a, p->y, q->x);
196
80
    ossl_gf_mul(b, q->y, p->x);
197
80
    succ = gf_eq(a, b);
198
199
80
    return mask_to_bool(succ);
200
80
}
201
202
c448_bool_t
203
ossl_curve448_point_valid(const curve448_point_t p)
204
177
{
205
177
    mask_t out;
206
177
    gf a, b, c;
207
208
177
    ossl_gf_mul(a, p->x, p->y);
209
177
    ossl_gf_mul(b, p->z, p->t);
210
177
    out = gf_eq(a, b);
211
177
    ossl_gf_sqr(a, p->x);
212
177
    ossl_gf_sqr(b, p->y);
213
177
    gf_sub(a, b, a);
214
177
    ossl_gf_sqr(b, p->t);
215
177
    gf_mulw(c, b, TWISTED_D);
216
177
    ossl_gf_sqr(b, p->z);
217
177
    gf_add(b, b, c);
218
177
    out &= gf_eq(a, b);
219
177
    out &= ~gf_eq(p->z, ZERO);
220
177
    return mask_to_bool(out);
221
177
}
222
223
static ossl_inline void constant_time_lookup_niels(niels_s * RESTRICT ni,
224
                                                   const niels_t *table,
225
                                                   int nelts, int idx)
226
44.2k
{
227
44.2k
    constant_time_lookup(ni, table, sizeof(niels_s), nelts, idx);
228
44.2k
}
229
230
void
231
ossl_curve448_precomputed_scalarmul(curve448_point_t out,
232
                                    const curve448_precomputed_s *table,
233
                                    const curve448_scalar_t scalar)
234
492
{
235
492
    unsigned int i, j, k;
236
492
    const unsigned int n = COMBS_N, t = COMBS_T, s = COMBS_S;
237
492
    niels_t ni;
238
492
    curve448_scalar_t scalar1x;
239
240
492
    ossl_curve448_scalar_add(scalar1x, scalar, precomputed_scalarmul_adjustment);
241
492
    ossl_curve448_scalar_halve(scalar1x, scalar1x);
242
243
9.34k
    for (i = s; i > 0; i--) {
244
8.85k
        if (i != s)
245
8.36k
            point_double_internal(out, out, 0);
246
247
53.1k
        for (j = 0; j < n; j++) {
248
44.2k
            int tab = 0;
249
44.2k
            mask_t invert;
250
251
265k
            for (k = 0; k < t; k++) {
252
221k
                unsigned int bit = (i - 1) + s * (k + j * t);
253
254
221k
                if (bit < C448_SCALAR_BITS)
255
219k
                    tab |=
256
219k
                        (scalar1x->limb[bit / WBITS] >> (bit % WBITS) & 1) << k;
257
221k
            }
258
259
44.2k
            invert = (tab >> (t - 1)) - 1;
260
44.2k
            tab ^= invert;
261
44.2k
            tab &= (1 << (t - 1)) - 1;
262
263
44.2k
            constant_time_lookup_niels(ni, &table->table[j << (t - 1)],
264
44.2k
                                       1 << (t - 1), tab);
265
266
44.2k
            cond_neg_niels(ni, invert);
267
44.2k
            if ((i != s) || j != 0)
268
43.7k
                add_niels_to_pt(out, ni, j == n - 1 && i != 1);
269
492
            else
270
492
                niels_to_pt(out, ni);
271
44.2k
        }
272
8.85k
    }
273
274
492
    OPENSSL_cleanse(ni, sizeof(ni));
275
492
    OPENSSL_cleanse(scalar1x, sizeof(scalar1x));
276
492
}
277
278
void
279
ossl_curve448_point_mul_by_ratio_and_encode_like_eddsa(
280
                                    uint8_t enc[EDDSA_448_PUBLIC_BYTES],
281
                                    const curve448_point_t p)
282
42
{
283
42
    gf x, y, z, t;
284
42
    curve448_point_t q;
285
286
    /* The point is now on the twisted curve.  Move it to untwisted. */
287
42
    curve448_point_copy(q, p);
288
289
42
    {
290
        /* 4-isogeny: 2xy/(y^+x^2), (y^2-x^2)/(2z^2-y^2+x^2) */
291
42
        gf u;
292
293
42
        ossl_gf_sqr(x, q->x);
294
42
        ossl_gf_sqr(t, q->y);
295
42
        gf_add(u, x, t);
296
42
        gf_add(z, q->y, q->x);
297
42
        ossl_gf_sqr(y, z);
298
42
        gf_sub(y, y, u);
299
42
        gf_sub(z, t, x);
300
42
        ossl_gf_sqr(x, q->z);
301
42
        gf_add(t, x, x);
302
42
        gf_sub(t, t, z);
303
42
        ossl_gf_mul(x, t, y);
304
42
        ossl_gf_mul(y, z, u);
305
42
        ossl_gf_mul(z, u, t);
306
42
        OPENSSL_cleanse(u, sizeof(u));
307
42
    }
308
309
    /* Affinize */
310
42
    gf_invert(z, z, 1);
311
42
    ossl_gf_mul(t, x, z);
312
42
    ossl_gf_mul(x, y, z);
313
314
    /* Encode */
315
42
    enc[EDDSA_448_PRIVATE_BYTES - 1] = 0;
316
42
    gf_serialize(enc, x, 1);
317
42
    enc[EDDSA_448_PRIVATE_BYTES - 1] |= 0x80 & gf_lobit(t);
318
319
42
    OPENSSL_cleanse(x, sizeof(x));
320
42
    OPENSSL_cleanse(y, sizeof(y));
321
42
    OPENSSL_cleanse(z, sizeof(z));
322
42
    OPENSSL_cleanse(t, sizeof(t));
323
42
    ossl_curve448_point_destroy(q);
324
42
}
325
326
c448_error_t
327
ossl_curve448_point_decode_like_eddsa_and_mul_by_ratio(
328
                                curve448_point_t p,
329
                                const uint8_t enc[EDDSA_448_PUBLIC_BYTES])
330
177
{
331
177
    uint8_t enc2[EDDSA_448_PUBLIC_BYTES];
332
177
    mask_t low;
333
177
    mask_t succ;
334
335
177
    memcpy(enc2, enc, sizeof(enc2));
336
337
177
    low = ~word_is_zero(enc2[EDDSA_448_PRIVATE_BYTES - 1] & 0x80);
338
177
    enc2[EDDSA_448_PRIVATE_BYTES - 1] &= ~0x80;
339
340
177
    succ = gf_deserialize(p->y, enc2, 1, 0);
341
177
    succ &= word_is_zero(enc2[EDDSA_448_PRIVATE_BYTES - 1]);
342
343
177
    ossl_gf_sqr(p->x, p->y);
344
177
    gf_sub(p->z, ONE, p->x);    /* num = 1-y^2 */
345
177
    gf_mulw(p->t, p->x, EDWARDS_D); /* dy^2 */
346
177
    gf_sub(p->t, ONE, p->t);    /* denom = 1-dy^2 or 1-d + dy^2 */
347
348
177
    ossl_gf_mul(p->x, p->z, p->t);
349
177
    succ &= gf_isr(p->t, p->x); /* 1/sqrt(num * denom) */
350
351
177
    ossl_gf_mul(p->x, p->t, p->z);   /* sqrt(num / denom) */
352
177
    gf_cond_neg(p->x, gf_lobit(p->x) ^ low);
353
177
    gf_copy(p->z, ONE);
354
355
177
    {
356
177
        gf a, b, c, d;
357
358
        /* 4-isogeny 2xy/(y^2-ax^2), (y^2+ax^2)/(2-y^2-ax^2) */
359
177
        ossl_gf_sqr(c, p->x);
360
177
        ossl_gf_sqr(a, p->y);
361
177
        gf_add(d, c, a);
362
177
        gf_add(p->t, p->y, p->x);
363
177
        ossl_gf_sqr(b, p->t);
364
177
        gf_sub(b, b, d);
365
177
        gf_sub(p->t, a, c);
366
177
        ossl_gf_sqr(p->x, p->z);
367
177
        gf_add(p->z, p->x, p->x);
368
177
        gf_sub(a, p->z, d);
369
177
        ossl_gf_mul(p->x, a, b);
370
177
        ossl_gf_mul(p->z, p->t, a);
371
177
        ossl_gf_mul(p->y, p->t, d);
372
177
        ossl_gf_mul(p->t, b, d);
373
177
        OPENSSL_cleanse(a, sizeof(a));
374
177
        OPENSSL_cleanse(b, sizeof(b));
375
177
        OPENSSL_cleanse(c, sizeof(c));
376
177
        OPENSSL_cleanse(d, sizeof(d));
377
177
    }
378
379
177
    OPENSSL_cleanse(enc2, sizeof(enc2));
380
177
    assert(ossl_curve448_point_valid(p) || ~succ);
381
382
177
    return c448_succeed_if(mask_to_bool(succ));
383
177
}
384
385
c448_error_t
386
ossl_x448_int(uint8_t out[X_PUBLIC_BYTES],
387
              const uint8_t base[X_PUBLIC_BYTES],
388
              const uint8_t scalar[X_PRIVATE_BYTES])
389
16
{
390
16
    gf x1, x2, z2, x3, z3, t1, t2;
391
16
    int t;
392
16
    mask_t swap = 0;
393
16
    mask_t nz;
394
395
16
    (void)gf_deserialize(x1, base, 1, 0);
396
16
    gf_copy(x2, ONE);
397
16
    gf_copy(z2, ZERO);
398
16
    gf_copy(x3, x1);
399
16
    gf_copy(z3, ONE);
400
401
7.18k
    for (t = X_PRIVATE_BITS - 1; t >= 0; t--) {
402
7.16k
        uint8_t sb = scalar[t / 8];
403
7.16k
        mask_t k_t;
404
405
        /* Scalar conditioning */
406
7.16k
        if (t / 8 == 0)
407
128
            sb &= -(uint8_t)COFACTOR;
408
7.04k
        else if (t == X_PRIVATE_BITS - 1)
409
16
            sb = -1;
410
411
7.16k
        k_t = (sb >> (t % 8)) & 1;
412
7.16k
        k_t = 0 - k_t;             /* set to all 0s or all 1s */
413
414
7.16k
        swap ^= k_t;
415
7.16k
        gf_cond_swap(x2, x3, swap);
416
7.16k
        gf_cond_swap(z2, z3, swap);
417
7.16k
        swap = k_t;
418
419
        /*
420
         * The "_nr" below skips coefficient reduction. In the following
421
         * comments, "2+e" is saying that the coefficients are at most 2+epsilon
422
         * times the reduction limit.
423
         */
424
7.16k
        gf_add_nr(t1, x2, z2);  /* A = x2 + z2 */ /* 2+e */
425
7.16k
        gf_sub_nr(t2, x2, z2);  /* B = x2 - z2 */ /* 3+e */
426
7.16k
        gf_sub_nr(z2, x3, z3);  /* D = x3 - z3 */ /* 3+e */
427
7.16k
        ossl_gf_mul(x2, t1, z2);     /* DA */
428
7.16k
        gf_add_nr(z2, z3, x3);  /* C = x3 + z3 */ /* 2+e */
429
7.16k
        ossl_gf_mul(x3, t2, z2);     /* CB */
430
7.16k
        gf_sub_nr(z3, x2, x3);  /* DA-CB */ /* 3+e */
431
7.16k
        ossl_gf_sqr(z2, z3);         /* (DA-CB)^2 */
432
7.16k
        ossl_gf_mul(z3, x1, z2);     /* z3 = x1(DA-CB)^2 */
433
7.16k
        gf_add_nr(z2, x2, x3);  /* (DA+CB) */ /* 2+e */
434
7.16k
        ossl_gf_sqr(x3, z2);         /* x3 = (DA+CB)^2 */
435
436
7.16k
        ossl_gf_sqr(z2, t1);         /* AA = A^2 */
437
7.16k
        ossl_gf_sqr(t1, t2);         /* BB = B^2 */
438
7.16k
        ossl_gf_mul(x2, z2, t1);     /* x2 = AA*BB */
439
7.16k
        gf_sub_nr(t2, z2, t1);  /* E = AA-BB */ /* 3+e */
440
441
7.16k
        gf_mulw(t1, t2, -EDWARDS_D); /* E*-d = a24*E */
442
7.16k
        gf_add_nr(t1, t1, z2);  /* AA + a24*E */ /* 2+e */
443
7.16k
        ossl_gf_mul(z2, t2, t1);     /* z2 = E(AA+a24*E) */
444
7.16k
    }
445
446
    /* Finish */
447
16
    gf_cond_swap(x2, x3, swap);
448
16
    gf_cond_swap(z2, z3, swap);
449
16
    gf_invert(z2, z2, 0);
450
16
    ossl_gf_mul(x1, x2, z2);
451
16
    gf_serialize(out, x1, 1);
452
16
    nz = ~gf_eq(x1, ZERO);
453
454
16
    OPENSSL_cleanse(x1, sizeof(x1));
455
16
    OPENSSL_cleanse(x2, sizeof(x2));
456
16
    OPENSSL_cleanse(z2, sizeof(z2));
457
16
    OPENSSL_cleanse(x3, sizeof(x3));
458
16
    OPENSSL_cleanse(z3, sizeof(z3));
459
16
    OPENSSL_cleanse(t1, sizeof(t1));
460
16
    OPENSSL_cleanse(t2, sizeof(t2));
461
462
16
    return c448_succeed_if(mask_to_bool(nz));
463
16
}
464
465
void
466
ossl_curve448_point_mul_by_ratio_and_encode_like_x448(uint8_t
467
                                                      out[X_PUBLIC_BYTES],
468
                                                      const curve448_point_t p)
469
450
{
470
450
    curve448_point_t q;
471
472
450
    curve448_point_copy(q, p);
473
450
    gf_invert(q->t, q->x, 0);   /* 1/x */
474
450
    ossl_gf_mul(q->z, q->t, q->y);   /* y/x */
475
450
    ossl_gf_sqr(q->y, q->z);         /* (y/x)^2 */
476
450
    gf_serialize(out, q->y, 1);
477
450
    ossl_curve448_point_destroy(q);
478
450
}
479
480
void ossl_x448_derive_public_key(uint8_t out[X_PUBLIC_BYTES],
481
                                 const uint8_t scalar[X_PRIVATE_BYTES])
482
450
{
483
    /* Scalar conditioning */
484
450
    uint8_t scalar2[X_PRIVATE_BYTES];
485
450
    curve448_scalar_t the_scalar;
486
450
    curve448_point_t p;
487
450
    unsigned int i;
488
489
450
    memcpy(scalar2, scalar, sizeof(scalar2));
490
450
    scalar2[0] &= -(uint8_t)COFACTOR;
491
492
450
    scalar2[X_PRIVATE_BYTES - 1] &= ~((0u - 1u) << ((X_PRIVATE_BITS + 7) % 8));
493
450
    scalar2[X_PRIVATE_BYTES - 1] |= 1 << ((X_PRIVATE_BITS + 7) % 8);
494
495
450
    ossl_curve448_scalar_decode_long(the_scalar, scalar2, sizeof(scalar2));
496
497
    /* Compensate for the encoding ratio */
498
900
    for (i = 1; i < X448_ENCODE_RATIO; i <<= 1)
499
450
        ossl_curve448_scalar_halve(the_scalar, the_scalar);
500
501
450
    ossl_curve448_precomputed_scalarmul(p, ossl_curve448_precomputed_base,
502
450
                                        the_scalar);
503
450
    ossl_curve448_point_mul_by_ratio_and_encode_like_x448(out, p);
504
450
    ossl_curve448_point_destroy(p);
505
450
}
506
507
/* Control for variable-time scalar multiply algorithms. */
508
struct smvt_control {
509
    int power, addend;
510
};
511
512
#if defined(__GNUC__) && (__GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ > 3))
513
4.17k
# define NUMTRAILINGZEROS       __builtin_ctz
514
#else
515
# define NUMTRAILINGZEROS       numtrailingzeros
516
static uint32_t numtrailingzeros(uint32_t i)
517
{
518
    uint32_t tmp;
519
    uint32_t num = 31;
520
521
    if (i == 0)
522
        return 32;
523
524
    tmp = i << 16;
525
    if (tmp != 0) {
526
        i = tmp;
527
        num -= 16;
528
    }
529
    tmp = i << 8;
530
    if (tmp != 0) {
531
        i = tmp;
532
        num -= 8;
533
    }
534
    tmp = i << 4;
535
    if (tmp != 0) {
536
        i = tmp;
537
        num -= 4;
538
    }
539
    tmp = i << 2;
540
    if (tmp != 0) {
541
        i = tmp;
542
        num -= 2;
543
    }
544
    tmp = i << 1;
545
    if (tmp != 0)
546
        num--;
547
548
    return num;
549
}
550
#endif
551
552
static int recode_wnaf(struct smvt_control *control,
553
                       /* [nbits/(table_bits + 1) + 3] */
554
                       const curve448_scalar_t scalar,
555
                       unsigned int table_bits)
556
80
{
557
80
    unsigned int table_size = C448_SCALAR_BITS / (table_bits + 1) + 3;
558
80
    int position = table_size - 1; /* at the end */
559
80
    uint64_t current = scalar->limb[0] & 0xFFFF;
560
80
    uint32_t mask = (1 << (table_bits + 1)) - 1;
561
80
    unsigned int w;
562
80
    const unsigned int B_OVER_16 = sizeof(scalar->limb[0]) / 2;
563
80
    unsigned int n, i;
564
565
    /* place the end marker */
566
80
    control[position].power = -1;
567
80
    control[position].addend = 0;
568
80
    position--;
569
570
    /*
571
     * PERF: Could negate scalar if it's large.  But then would need more cases
572
     * in the actual code that uses it, all for an expected reduction of like
573
     * 1/5 op. Probably not worth it.
574
     */
575
576
2.40k
    for (w = 1; w < (C448_SCALAR_BITS - 1) / 16 + 3; w++) {
577
2.32k
        if (w < (C448_SCALAR_BITS - 1) / 16 + 1) {
578
            /* Refill the 16 high bits of current */
579
2.16k
            current += (uint32_t)((scalar->limb[w / B_OVER_16]
580
2.16k
                       >> (16 * (w % B_OVER_16))) << 16);
581
2.16k
        }
582
583
6.49k
        while (current & 0xFFFF) {
584
4.17k
            uint32_t pos = NUMTRAILINGZEROS((uint32_t)current);
585
4.17k
            uint32_t odd = (uint32_t)current >> pos;
586
4.17k
            int32_t delta = odd & mask;
587
588
4.17k
            assert(position >= 0);
589
4.17k
            if (odd & (1 << (table_bits + 1)))
590
1.97k
                delta -= (1 << (table_bits + 1));
591
            /*
592
             * Coverity gets confused by the value of pos, thinking it might be
593
             * 32.  This would require current & 0xFFFF to be zero which isn't
594
             * possible.  Suppress this false positive, since adding a check
595
             * isn't desirable.
596
             */
597
            /* coverity[overflow_before_widen] */
598
4.17k
            current -= delta * (1 << pos);
599
4.17k
            control[position].power = pos + 16 * (w - 1);
600
4.17k
            control[position].addend = delta;
601
4.17k
            position--;
602
4.17k
        }
603
2.32k
        current >>= 16;
604
2.32k
    }
605
80
    assert(current == 0);
606
607
80
    position++;
608
80
    n = table_size - position;
609
4.33k
    for (i = 0; i < n; i++)
610
4.25k
        control[i] = control[i + position];
611
612
80
    return n - 1;
613
80
}
614
615
static void prepare_wnaf_table(pniels_t *output,
616
                               const curve448_point_t working,
617
                               unsigned int tbits)
618
80
{
619
80
    curve448_point_t tmp;
620
80
    int i;
621
80
    pniels_t twop;
622
623
80
    pt_to_pniels(output[0], working);
624
625
80
    if (tbits == 0)
626
0
        return;
627
628
80
    ossl_curve448_point_double(tmp, working);
629
80
    pt_to_pniels(twop, tmp);
630
631
80
    add_pniels_to_pt(tmp, output[0], 0);
632
80
    pt_to_pniels(output[1], tmp);
633
634
560
    for (i = 2; i < 1 << tbits; i++) {
635
480
        add_pniels_to_pt(tmp, twop, 0);
636
480
        pt_to_pniels(output[i], tmp);
637
480
    }
638
639
80
    ossl_curve448_point_destroy(tmp);
640
80
    OPENSSL_cleanse(twop, sizeof(twop));
641
80
}
642
643
void
644
ossl_curve448_base_double_scalarmul_non_secret(curve448_point_t combo,
645
                                               const curve448_scalar_t scalar1,
646
                                               const curve448_point_t base2,
647
                                               const curve448_scalar_t scalar2)
648
80
{
649
80
    const int table_bits_var = C448_WNAF_VAR_TABLE_BITS;
650
80
    const int table_bits_pre = C448_WNAF_FIXED_TABLE_BITS;
651
80
    struct smvt_control control_var[C448_SCALAR_BITS /
652
80
                                    (C448_WNAF_VAR_TABLE_BITS + 1) + 3];
653
80
    struct smvt_control control_pre[C448_SCALAR_BITS /
654
80
                                    (C448_WNAF_FIXED_TABLE_BITS + 1) + 3];
655
80
    int ncb_pre = recode_wnaf(control_pre, scalar1, table_bits_pre);
656
80
    int ncb_var = recode_wnaf(control_var, scalar2, table_bits_var);
657
80
    pniels_t precmp_var[1 << C448_WNAF_VAR_TABLE_BITS];
658
80
    int contp = 0, contv = 0, i;
659
660
80
    prepare_wnaf_table(precmp_var, base2, table_bits_var);
661
80
    i = control_var[0].power;
662
663
80
    if (i < 0) {
664
0
        curve448_point_copy(combo, ossl_curve448_point_identity);
665
0
        return;
666
0
    }
667
80
    if (i > control_pre[0].power) {
668
54
        pniels_to_pt(combo, precmp_var[control_var[0].addend >> 1]);
669
54
        contv++;
670
54
    } else if (i == control_pre[0].power && i >= 0) {
671
8
        pniels_to_pt(combo, precmp_var[control_var[0].addend >> 1]);
672
8
        add_niels_to_pt(combo,
673
8
                        ossl_curve448_wnaf_base[control_pre[0].addend >> 1],
674
8
                        i);
675
8
        contv++;
676
8
        contp++;
677
18
    } else {
678
18
        i = control_pre[0].power;
679
18
        niels_to_pt(combo, ossl_curve448_wnaf_base[control_pre[0].addend >> 1]);
680
18
        contp++;
681
18
    }
682
683
35.3k
    for (i--; i >= 0; i--) {
684
35.2k
        int cv = (i == control_var[contv].power);
685
35.2k
        int cp = (i == control_pre[contp].power);
686
687
35.2k
        point_double_internal(combo, combo, i && !(cv || cp));
688
689
35.2k
        if (cv) {
690
5.88k
            assert(control_var[contv].addend);
691
692
5.88k
            if (control_var[contv].addend > 0)
693
2.92k
                add_pniels_to_pt(combo,
694
2.92k
                                 precmp_var[control_var[contv].addend >> 1],
695
2.92k
                                 i && !cp);
696
2.95k
            else
697
2.95k
                sub_pniels_from_pt(combo,
698
2.95k
                                   precmp_var[(-control_var[contv].addend)
699
2.95k
                                              >> 1], i && !cp);
700
5.88k
            contv++;
701
5.88k
        }
702
703
35.2k
        if (cp) {
704
2.45k
            assert(control_pre[contp].addend);
705
706
2.45k
            if (control_pre[contp].addend > 0)
707
1.46k
                add_niels_to_pt(combo,
708
1.46k
                                ossl_curve448_wnaf_base[control_pre[contp].addend
709
1.46k
                                                   >> 1], i);
710
993
            else
711
993
                sub_niels_from_pt(combo,
712
993
                                  ossl_curve448_wnaf_base[(-control_pre
713
993
                                                      [contp].addend) >> 1], i);
714
2.45k
            contp++;
715
2.45k
        }
716
35.2k
    }
717
718
    /* This function is non-secret, but whatever this is cheap. */
719
80
    OPENSSL_cleanse(control_var, sizeof(control_var));
720
80
    OPENSSL_cleanse(control_pre, sizeof(control_pre));
721
80
    OPENSSL_cleanse(precmp_var, sizeof(precmp_var));
722
723
80
    assert(contv == ncb_var);
724
80
    (void)ncb_var;
725
80
    assert(contp == ncb_pre);
726
80
    (void)ncb_pre;
727
80
}
728
729
void ossl_curve448_point_destroy(curve448_point_t point)
730
1.06k
{
731
1.06k
    OPENSSL_cleanse(point, sizeof(curve448_point_t));
732
1.06k
}
733
734
int ossl_x448(uint8_t out_shared_key[56], const uint8_t private_key[56],
735
              const uint8_t peer_public_value[56])
736
16
{
737
16
    return ossl_x448_int(out_shared_key, peer_public_value, private_key)
738
16
           == C448_SUCCESS;
739
16
}
740
741
void ossl_x448_public_from_private(uint8_t out_public_value[56],
742
                                   const uint8_t private_key[56])
743
450
{
744
450
    ossl_x448_derive_public_key(out_public_value, private_key);
745
450
}