Coverage Report

Created: 2025-12-31 06:58

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/openssl30/crypto/ec/ecdh_ossl.c
Line
Count
Source
1
/*
2
 * Copyright 2002-2021 The OpenSSL Project Authors. All Rights Reserved.
3
 * Copyright (c) 2002, Oracle and/or its affiliates. All rights reserved
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
11
/*
12
 * ECDH low level APIs are deprecated for public use, but still ok for
13
 * internal use.
14
 */
15
#include "internal/deprecated.h"
16
17
#include <string.h>
18
#include <limits.h>
19
20
#include "internal/cryptlib.h"
21
22
#include <openssl/err.h>
23
#include <openssl/bn.h>
24
#include <openssl/objects.h>
25
#include <openssl/ec.h>
26
#include "ec_local.h"
27
28
int ossl_ecdh_compute_key(unsigned char **psec, size_t *pseclen,
29
    const EC_POINT *pub_key, const EC_KEY *ecdh)
30
4.28k
{
31
4.28k
    if (ecdh->group->meth->ecdh_compute_key == NULL) {
32
0
        ERR_raise(ERR_LIB_EC, EC_R_CURVE_DOES_NOT_SUPPORT_ECDH);
33
0
        return 0;
34
0
    }
35
36
4.28k
    return ecdh->group->meth->ecdh_compute_key(psec, pseclen, pub_key, ecdh);
37
4.28k
}
38
39
/*-
40
 * This implementation is based on the following primitives in the
41
 * IEEE 1363 standard:
42
 *  - ECKAS-DH1
43
 *  - ECSVDP-DH
44
 *
45
 * It also conforms to SP800-56A r3
46
 * See Section 5.7.1.2 "Elliptic Curve Cryptography Cofactor Diffie-Hellman
47
 * (ECC CDH) Primitive:". The steps listed below refer to SP800-56A.
48
 */
49
int ossl_ecdh_simple_compute_key(unsigned char **pout, size_t *poutlen,
50
    const EC_POINT *pub_key, const EC_KEY *ecdh)
51
611
{
52
611
    BN_CTX *ctx;
53
611
    EC_POINT *tmp = NULL;
54
611
    BIGNUM *x = NULL;
55
611
    const BIGNUM *priv_key;
56
611
    const EC_GROUP *group;
57
611
    int ret = 0;
58
611
    size_t buflen, len;
59
611
    unsigned char *buf = NULL;
60
61
611
    if ((ctx = BN_CTX_new_ex(ecdh->libctx)) == NULL)
62
0
        goto err;
63
611
    BN_CTX_start(ctx);
64
611
    x = BN_CTX_get(ctx);
65
611
    if (x == NULL) {
66
0
        ERR_raise(ERR_LIB_EC, ERR_R_MALLOC_FAILURE);
67
0
        goto err;
68
0
    }
69
70
611
    priv_key = EC_KEY_get0_private_key(ecdh);
71
611
    if (priv_key == NULL) {
72
0
        ERR_raise(ERR_LIB_EC, EC_R_MISSING_PRIVATE_KEY);
73
0
        goto err;
74
0
    }
75
76
611
    group = EC_KEY_get0_group(ecdh);
77
78
    /*
79
     * Step(1) - Compute the point tmp = cofactor * owners_private_key
80
     *                                   * peer_public_key.
81
     */
82
611
    if (EC_KEY_get_flags(ecdh) & EC_FLAG_COFACTOR_ECDH) {
83
0
        if (!EC_GROUP_get_cofactor(group, x, NULL) || !BN_mul(x, x, priv_key, ctx)) {
84
0
            ERR_raise(ERR_LIB_EC, ERR_R_MALLOC_FAILURE);
85
0
            goto err;
86
0
        }
87
0
        priv_key = x;
88
0
    }
89
90
611
    if ((tmp = EC_POINT_new(group)) == NULL) {
91
0
        ERR_raise(ERR_LIB_EC, ERR_R_MALLOC_FAILURE);
92
0
        goto err;
93
0
    }
94
95
611
    if (!EC_POINT_mul(group, tmp, NULL, pub_key, priv_key, ctx)) {
96
0
        ERR_raise(ERR_LIB_EC, EC_R_POINT_ARITHMETIC_FAILURE);
97
0
        goto err;
98
0
    }
99
100
    /*
101
     * Step(2) : If point tmp is at infinity then clear intermediate values and
102
     * exit. Note: getting affine coordinates returns 0 if point is at infinity.
103
     * Step(3a) : Get x-coordinate of point x = tmp.x
104
     */
105
611
    if (!EC_POINT_get_affine_coordinates(group, tmp, x, NULL, ctx)) {
106
0
        ERR_raise(ERR_LIB_EC, EC_R_POINT_ARITHMETIC_FAILURE);
107
0
        goto err;
108
0
    }
109
110
    /*
111
     * Step(3b) : convert x to a byte string, using the field-element-to-byte
112
     * string conversion routine defined in Appendix C.2
113
     */
114
611
    buflen = (EC_GROUP_get_degree(group) + 7) / 8;
115
611
    len = BN_num_bytes(x);
116
611
    if (len > buflen) {
117
0
        ERR_raise(ERR_LIB_EC, ERR_R_INTERNAL_ERROR);
118
0
        goto err;
119
0
    }
120
611
    if ((buf = OPENSSL_malloc(buflen)) == NULL) {
121
0
        ERR_raise(ERR_LIB_EC, ERR_R_MALLOC_FAILURE);
122
0
        goto err;
123
0
    }
124
125
611
    memset(buf, 0, buflen - len);
126
611
    if (len != (size_t)BN_bn2bin(x, buf + buflen - len)) {
127
0
        ERR_raise(ERR_LIB_EC, ERR_R_BN_LIB);
128
0
        goto err;
129
0
    }
130
131
611
    *pout = buf;
132
611
    *poutlen = buflen;
133
611
    buf = NULL;
134
135
611
    ret = 1;
136
137
611
err:
138
    /* Step(4) : Destroy all intermediate calculations */
139
611
    BN_clear(x);
140
611
    EC_POINT_clear_free(tmp);
141
611
    BN_CTX_end(ctx);
142
611
    BN_CTX_free(ctx);
143
611
    OPENSSL_free(buf);
144
611
    return ret;
145
611
}