Coverage Report

Created: 2023-06-08 06:40

/src/openssl111/crypto/ec/ecp_mont.c
Line
Count
Source (jump to first uncovered line)
1
/*
2
 * Copyright 2001-2019 The OpenSSL Project Authors. All Rights Reserved.
3
 * Copyright (c) 2002, Oracle and/or its affiliates. All rights reserved
4
 *
5
 * Licensed under the OpenSSL license (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
#include <openssl/err.h>
12
13
#include "ec_local.h"
14
15
const EC_METHOD *EC_GFp_mont_method(void)
16
489
{
17
489
    static const EC_METHOD ret = {
18
489
        EC_FLAGS_DEFAULT_OCT,
19
489
        NID_X9_62_prime_field,
20
489
        ec_GFp_mont_group_init,
21
489
        ec_GFp_mont_group_finish,
22
489
        ec_GFp_mont_group_clear_finish,
23
489
        ec_GFp_mont_group_copy,
24
489
        ec_GFp_mont_group_set_curve,
25
489
        ec_GFp_simple_group_get_curve,
26
489
        ec_GFp_simple_group_get_degree,
27
489
        ec_group_simple_order_bits,
28
489
        ec_GFp_simple_group_check_discriminant,
29
489
        ec_GFp_simple_point_init,
30
489
        ec_GFp_simple_point_finish,
31
489
        ec_GFp_simple_point_clear_finish,
32
489
        ec_GFp_simple_point_copy,
33
489
        ec_GFp_simple_point_set_to_infinity,
34
489
        ec_GFp_simple_set_Jprojective_coordinates_GFp,
35
489
        ec_GFp_simple_get_Jprojective_coordinates_GFp,
36
489
        ec_GFp_simple_point_set_affine_coordinates,
37
489
        ec_GFp_simple_point_get_affine_coordinates,
38
489
        0, 0, 0,
39
489
        ec_GFp_simple_add,
40
489
        ec_GFp_simple_dbl,
41
489
        ec_GFp_simple_invert,
42
489
        ec_GFp_simple_is_at_infinity,
43
489
        ec_GFp_simple_is_on_curve,
44
489
        ec_GFp_simple_cmp,
45
489
        ec_GFp_simple_make_affine,
46
489
        ec_GFp_simple_points_make_affine,
47
489
        0 /* mul */ ,
48
489
        0 /* precompute_mult */ ,
49
489
        0 /* have_precompute_mult */ ,
50
489
        ec_GFp_mont_field_mul,
51
489
        ec_GFp_mont_field_sqr,
52
489
        0 /* field_div */ ,
53
489
        ec_GFp_mont_field_inv,
54
489
        ec_GFp_mont_field_encode,
55
489
        ec_GFp_mont_field_decode,
56
489
        ec_GFp_mont_field_set_to_one,
57
489
        ec_key_simple_priv2oct,
58
489
        ec_key_simple_oct2priv,
59
489
        0, /* set private */
60
489
        ec_key_simple_generate_key,
61
489
        ec_key_simple_check_key,
62
489
        ec_key_simple_generate_public_key,
63
489
        0, /* keycopy */
64
489
        0, /* keyfinish */
65
489
        ecdh_simple_compute_key,
66
489
        0, /* field_inverse_mod_ord */
67
489
        ec_GFp_simple_blind_coordinates,
68
489
        ec_GFp_simple_ladder_pre,
69
489
        ec_GFp_simple_ladder_step,
70
489
        ec_GFp_simple_ladder_post
71
489
    };
72
73
489
    return &ret;
74
489
}
75
76
int ec_GFp_mont_group_init(EC_GROUP *group)
77
2.27k
{
78
2.27k
    int ok;
79
80
2.27k
    ok = ec_GFp_simple_group_init(group);
81
2.27k
    group->field_data1 = NULL;
82
2.27k
    group->field_data2 = NULL;
83
2.27k
    return ok;
84
2.27k
}
85
86
void ec_GFp_mont_group_finish(EC_GROUP *group)
87
2.27k
{
88
2.27k
    BN_MONT_CTX_free(group->field_data1);
89
2.27k
    group->field_data1 = NULL;
90
2.27k
    BN_free(group->field_data2);
91
2.27k
    group->field_data2 = NULL;
92
2.27k
    ec_GFp_simple_group_finish(group);
93
2.27k
}
94
95
void ec_GFp_mont_group_clear_finish(EC_GROUP *group)
96
0
{
97
0
    BN_MONT_CTX_free(group->field_data1);
98
0
    group->field_data1 = NULL;
99
0
    BN_clear_free(group->field_data2);
100
0
    group->field_data2 = NULL;
101
0
    ec_GFp_simple_group_clear_finish(group);
102
0
}
103
104
int ec_GFp_mont_group_copy(EC_GROUP *dest, const EC_GROUP *src)
105
1.18k
{
106
1.18k
    BN_MONT_CTX_free(dest->field_data1);
107
1.18k
    dest->field_data1 = NULL;
108
1.18k
    BN_clear_free(dest->field_data2);
109
1.18k
    dest->field_data2 = NULL;
110
111
1.18k
    if (!ec_GFp_simple_group_copy(dest, src))
112
0
        return 0;
113
114
1.18k
    if (src->field_data1 != NULL) {
115
1.18k
        dest->field_data1 = BN_MONT_CTX_new();
116
1.18k
        if (dest->field_data1 == NULL)
117
0
            return 0;
118
1.18k
        if (!BN_MONT_CTX_copy(dest->field_data1, src->field_data1))
119
0
            goto err;
120
1.18k
    }
121
1.18k
    if (src->field_data2 != NULL) {
122
1.18k
        dest->field_data2 = BN_dup(src->field_data2);
123
1.18k
        if (dest->field_data2 == NULL)
124
0
            goto err;
125
1.18k
    }
126
127
1.18k
    return 1;
128
129
0
 err:
130
0
    BN_MONT_CTX_free(dest->field_data1);
131
0
    dest->field_data1 = NULL;
132
0
    return 0;
133
1.18k
}
134
135
int ec_GFp_mont_group_set_curve(EC_GROUP *group, const BIGNUM *p,
136
                                const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
137
1.08k
{
138
1.08k
    BN_CTX *new_ctx = NULL;
139
1.08k
    BN_MONT_CTX *mont = NULL;
140
1.08k
    BIGNUM *one = NULL;
141
1.08k
    int ret = 0;
142
143
1.08k
    BN_MONT_CTX_free(group->field_data1);
144
1.08k
    group->field_data1 = NULL;
145
1.08k
    BN_free(group->field_data2);
146
1.08k
    group->field_data2 = NULL;
147
148
1.08k
    if (ctx == NULL) {
149
0
        ctx = new_ctx = BN_CTX_new();
150
0
        if (ctx == NULL)
151
0
            return 0;
152
0
    }
153
154
1.08k
    mont = BN_MONT_CTX_new();
155
1.08k
    if (mont == NULL)
156
0
        goto err;
157
1.08k
    if (!BN_MONT_CTX_set(mont, p, ctx)) {
158
0
        ECerr(EC_F_EC_GFP_MONT_GROUP_SET_CURVE, ERR_R_BN_LIB);
159
0
        goto err;
160
0
    }
161
1.08k
    one = BN_new();
162
1.08k
    if (one == NULL)
163
0
        goto err;
164
1.08k
    if (!BN_to_montgomery(one, BN_value_one(), mont, ctx))
165
0
        goto err;
166
167
1.08k
    group->field_data1 = mont;
168
1.08k
    mont = NULL;
169
1.08k
    group->field_data2 = one;
170
1.08k
    one = NULL;
171
172
1.08k
    ret = ec_GFp_simple_group_set_curve(group, p, a, b, ctx);
173
174
1.08k
    if (!ret) {
175
0
        BN_MONT_CTX_free(group->field_data1);
176
0
        group->field_data1 = NULL;
177
0
        BN_free(group->field_data2);
178
0
        group->field_data2 = NULL;
179
0
    }
180
181
1.08k
 err:
182
1.08k
    BN_free(one);
183
1.08k
    BN_CTX_free(new_ctx);
184
1.08k
    BN_MONT_CTX_free(mont);
185
1.08k
    return ret;
186
1.08k
}
187
188
int ec_GFp_mont_field_mul(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a,
189
                          const BIGNUM *b, BN_CTX *ctx)
190
281k
{
191
281k
    if (group->field_data1 == NULL) {
192
0
        ECerr(EC_F_EC_GFP_MONT_FIELD_MUL, EC_R_NOT_INITIALIZED);
193
0
        return 0;
194
0
    }
195
196
281k
    return BN_mod_mul_montgomery(r, a, b, group->field_data1, ctx);
197
281k
}
198
199
int ec_GFp_mont_field_sqr(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a,
200
                          BN_CTX *ctx)
201
201k
{
202
201k
    if (group->field_data1 == NULL) {
203
0
        ECerr(EC_F_EC_GFP_MONT_FIELD_SQR, EC_R_NOT_INITIALIZED);
204
0
        return 0;
205
0
    }
206
207
201k
    return BN_mod_mul_montgomery(r, a, a, group->field_data1, ctx);
208
201k
}
209
210
/*-
211
 * Computes the multiplicative inverse of a in GF(p), storing the result in r.
212
 * If a is zero (or equivalent), you'll get a EC_R_CANNOT_INVERT error.
213
 * We have a Mont structure, so SCA hardening is FLT inversion.
214
 */
215
int ec_GFp_mont_field_inv(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a,
216
                            BN_CTX *ctx)
217
227
{
218
227
    BIGNUM *e = NULL;
219
227
    BN_CTX *new_ctx = NULL;
220
227
    int ret = 0;
221
222
227
    if (group->field_data1 == NULL)
223
0
        return 0;
224
225
227
    if (ctx == NULL && (ctx = new_ctx = BN_CTX_secure_new()) == NULL)
226
0
        return 0;
227
228
227
    BN_CTX_start(ctx);
229
227
    if ((e = BN_CTX_get(ctx)) == NULL)
230
0
        goto err;
231
232
    /* Inverse in constant time with Fermats Little Theorem */
233
227
    if (!BN_set_word(e, 2))
234
0
        goto err;
235
227
    if (!BN_sub(e, group->field, e))
236
0
        goto err;
237
    /*-
238
     * Exponent e is public.
239
     * No need for scatter-gather or BN_FLG_CONSTTIME.
240
     */
241
227
    if (!BN_mod_exp_mont(r, a, e, group->field, ctx, group->field_data1))
242
0
        goto err;
243
244
    /* throw an error on zero */
245
227
    if (BN_is_zero(r)) {
246
0
        ECerr(EC_F_EC_GFP_MONT_FIELD_INV, EC_R_CANNOT_INVERT);
247
0
        goto err;
248
0
    }
249
250
227
    ret = 1;
251
252
227
  err:
253
227
    BN_CTX_end(ctx);
254
227
    BN_CTX_free(new_ctx);
255
227
    return ret;
256
227
}
257
258
int ec_GFp_mont_field_encode(const EC_GROUP *group, BIGNUM *r,
259
                             const BIGNUM *a, BN_CTX *ctx)
260
6.07k
{
261
6.07k
    if (group->field_data1 == NULL) {
262
0
        ECerr(EC_F_EC_GFP_MONT_FIELD_ENCODE, EC_R_NOT_INITIALIZED);
263
0
        return 0;
264
0
    }
265
266
6.07k
    return BN_to_montgomery(r, a, (BN_MONT_CTX *)group->field_data1, ctx);
267
6.07k
}
268
269
int ec_GFp_mont_field_decode(const EC_GROUP *group, BIGNUM *r,
270
                             const BIGNUM *a, BN_CTX *ctx)
271
571
{
272
571
    if (group->field_data1 == NULL) {
273
0
        ECerr(EC_F_EC_GFP_MONT_FIELD_DECODE, EC_R_NOT_INITIALIZED);
274
0
        return 0;
275
0
    }
276
277
571
    return BN_from_montgomery(r, a, group->field_data1, ctx);
278
571
}
279
280
int ec_GFp_mont_field_set_to_one(const EC_GROUP *group, BIGNUM *r,
281
                                 BN_CTX *ctx)
282
3.00k
{
283
3.00k
    if (group->field_data2 == NULL) {
284
0
        ECerr(EC_F_EC_GFP_MONT_FIELD_SET_TO_ONE, EC_R_NOT_INITIALIZED);
285
0
        return 0;
286
0
    }
287
288
3.00k
    if (!BN_copy(r, group->field_data2))
289
0
        return 0;
290
3.00k
    return 1;
291
3.00k
}