blob: 31fde48a27f294b27e2510cadc5a607cb9a0f49b [file] [log] [blame]
Gilles Peskine80ba8502021-04-03 20:36:37 +02001/**
2 * \file ecp_invasive.h
3 *
4 * \brief ECP module: interfaces for invasive testing only.
5 *
6 * The interfaces in this file are intended for testing purposes only.
7 * They SHOULD NOT be made available in library integrations except when
8 * building the library for testing.
9 */
10/*
11 * Copyright The Mbed TLS Contributors
12 * SPDX-License-Identifier: Apache-2.0
13 *
14 * Licensed under the Apache License, Version 2.0 (the "License"); you may
15 * not use this file except in compliance with the License.
16 * You may obtain a copy of the License at
17 *
18 * http://www.apache.org/licenses/LICENSE-2.0
19 *
20 * Unless required by applicable law or agreed to in writing, software
21 * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
22 * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
23 * See the License for the specific language governing permissions and
24 * limitations under the License.
25 */
26#ifndef MBEDTLS_ECP_INVASIVE_H
27#define MBEDTLS_ECP_INVASIVE_H
28
29#include "common.h"
Gilles Peskine72fcc982021-03-23 22:31:31 +010030#include "mbedtls/bignum.h"
Minos Galanakisdd556922023-02-03 19:12:21 +000031#include "bignum_mod.h"
Gilles Peskine80ba8502021-04-03 20:36:37 +020032#include "mbedtls/ecp.h"
33
Gilles Peskine637c0492023-06-15 19:07:41 +020034/*
35 * Curve modulus types
36 */
37typedef enum {
38 MBEDTLS_ECP_MOD_NONE = 0,
39 MBEDTLS_ECP_MOD_COORDINATE,
40 MBEDTLS_ECP_MOD_SCALAR
41} mbedtls_ecp_modulus_type;
42
Gabor Mezeif4aab6f2023-06-30 14:50:03 +020043/* Requred macros for ECP split.
44 * If MBEDTLS_ECP_WITH_MPI_UINT is defined the new bignum interface is used.
45 */
Gabor Mezeia306d202023-06-06 17:15:52 +020046#ifndef MBEDTLS_ECP_WITH_MPI_UINT
47
Gabor Mezeif4aab6f2023-06-30 14:50:03 +020048/* Because of `check_names.py` a define is needed for every macro. */
49//#define MBEDTLS_ECP_WITH_MPI_UINT
Gabor Mezeia306d202023-06-06 17:15:52 +020050
Gabor Mezeif4aab6f2023-06-30 14:50:03 +020051/* Enable the old bignum interface. */
Gabor Mezeia306d202023-06-06 17:15:52 +020052#define MBEDTLS_ECP_WITH_MPI_STRUCT
53#endif
54
Gabor Mezeic8107072023-06-06 17:24:35 +020055typedef enum {
56 MBEDTLS_ECP_VARIANT_NONE = 0,
57 MBEDTLS_ECP_VARIANT_WITH_MPI_STRUCT = 1,
58 MBEDTLS_ECP_VARIANT_WITH_MPI_UINT = 2
59} mbedtls_ecp_variant;
60
Valerio Setti0c477d32023-04-07 15:54:20 +020061#if defined(MBEDTLS_TEST_HOOKS) && defined(MBEDTLS_ECP_LIGHT)
Gilles Peskine80ba8502021-04-03 20:36:37 +020062
Gabor Mezeic8107072023-06-06 17:24:35 +020063/** Queries the ecp variant.
64 *
65 * \return The id of the ecp variant.
66 */
67MBEDTLS_STATIC_TESTABLE
68mbedtls_ecp_variant mbedtls_ecp_get_variant(void);
69
Gilles Peskine72fcc982021-03-23 22:31:31 +010070#if defined(MBEDTLS_ECP_MONTGOMERY_ENABLED)
71/** Generate a private key on a Montgomery curve (Curve25519 or Curve448).
72 *
73 * This function implements key generation for the set of secret keys
74 * specified in [Curve25519] p. 5 and in [Curve448]. The resulting value
75 * has the lower bits masked but is not necessarily canonical.
76 *
77 * \note - [Curve25519] http://cr.yp.to/ecdh/curve25519-20060209.pdf
78 * - [RFC7748] https://tools.ietf.org/html/rfc7748
79 *
Gilles Peskine55c46042021-03-24 12:34:40 +010080 * \p high_bit The position of the high-order bit of the key to generate.
Gilles Peskine72fcc982021-03-23 22:31:31 +010081 * This is the bit-size of the key minus 1:
82 * 254 for Curve25519 or 447 for Curve448.
83 * \param d The randomly generated key. This is a number of size
Xiaokang Qiana0896142023-04-18 06:49:55 +000084 * exactly \p high_bit + 1 bits, with the least significant bits
Gilles Peskine72fcc982021-03-23 22:31:31 +010085 * masked as specified in [Curve25519] and in [RFC7748] ยง5.
86 * \param f_rng The RNG function.
87 * \param p_rng The RNG context to be passed to \p f_rng.
88 *
89 * \return \c 0 on success.
90 * \return \c MBEDTLS_ERR_ECP_xxx or MBEDTLS_ERR_MPI_xxx on failure.
91 */
Xiaokang Qiana0896142023-04-18 06:49:55 +000092int mbedtls_ecp_gen_privkey_mx(size_t high_bit,
Gilles Peskine449bd832023-01-11 14:50:10 +010093 mbedtls_mpi *d,
94 int (*f_rng)(void *, unsigned char *, size_t),
95 void *p_rng);
Gilles Peskine72fcc982021-03-23 22:31:31 +010096
97#endif /* MBEDTLS_ECP_MONTGOMERY_ENABLED */
98
Gabor Mezeideece2b2023-01-25 17:57:36 +010099#if defined(MBEDTLS_ECP_DP_SECP192R1_ENABLED)
100
Gabor Mezei9b290b32023-01-27 11:00:51 +0100101/** Fast quasi-reduction modulo p192 (FIPS 186-3 D.2.1)
102 *
Gabor Mezeia2648312023-02-13 16:29:05 +0100103 * This operation expects a 384 bit MPI and the result of the reduction
104 * is a 192 bit MPI.
105 *
Gabor Mezei9b290b32023-01-27 11:00:51 +0100106 * \param[in,out] Np The address of the MPI to be converted.
Gabor Mezei0b4b8e32023-02-14 16:36:38 +0100107 * Must have twice as many limbs as the modulus.
108 * Upon return this holds the reduced value. The bitlength
109 * of the reduced value is the same as that of the modulus
110 * (192 bits).
Gabor Mezei63aae682023-02-06 16:24:08 +0100111 * \param[in] Nn The length of \p Np in limbs.
Gabor Mezei9b290b32023-01-27 11:00:51 +0100112 */
Gabor Mezeideece2b2023-01-25 17:57:36 +0100113MBEDTLS_STATIC_TESTABLE
Gabor Mezei2038ce92023-01-31 14:33:12 +0100114int mbedtls_ecp_mod_p192_raw(mbedtls_mpi_uint *Np, size_t Nn);
Gabor Mezeideece2b2023-01-25 17:57:36 +0100115
116#endif /* MBEDTLS_ECP_DP_SECP192R1_ENABLED */
117
Gabor Mezeie14b5bd2023-02-08 17:23:03 +0100118#if defined(MBEDTLS_ECP_DP_SECP224R1_ENABLED)
119
Gabor Mezeia835d202023-02-23 17:38:00 +0100120/** Fast quasi-reduction modulo p224 (FIPS 186-3 D.2.2)
121 *
Gabor Mezei08a94952023-02-28 18:40:57 +0100122 * \param[in,out] X The address of the MPI to be converted.
123 * Must have exact limb size that stores a 448-bit MPI
124 * (double the bitlength of the modulus).
125 * Upon return holds the reduced value which is
126 * in range `0 <= X < 2 * N` (where N is the modulus).
127 * The bitlength of the reduced value is the same as
128 * that of the modulus (224 bits).
129 * \param[in] X_limbs The length of \p X in limbs.
Gabor Mezeia835d202023-02-23 17:38:00 +0100130 *
131 * \return \c 0 on success.
Gabor Mezei08a94952023-02-28 18:40:57 +0100132 * \return #MBEDTLS_ERR_ECP_BAD_INPUT_DATA if \p X_limbs is not the
133 * limb size that sores a 448-bit MPI.
Gabor Mezeia835d202023-02-23 17:38:00 +0100134 */
Gabor Mezeie14b5bd2023-02-08 17:23:03 +0100135MBEDTLS_STATIC_TESTABLE
Gabor Mezei08a94952023-02-28 18:40:57 +0100136int mbedtls_ecp_mod_p224_raw(mbedtls_mpi_uint *X, size_t X_limbs);
Gabor Mezeie14b5bd2023-02-08 17:23:03 +0100137
138#endif /* MBEDTLS_ECP_DP_SECP224R1_ENABLED */
139
Gabor Mezei5221c042023-03-01 16:05:21 +0100140#if defined(MBEDTLS_ECP_DP_SECP256R1_ENABLED)
141
Gabor Mezeid1f16b92023-03-08 15:26:32 +0100142/** Fast quasi-reduction modulo p256 (FIPS 186-3 D.2.3)
143 *
144 * \param[in,out] X The address of the MPI to be converted.
145 * Must have exact limb size that stores a 512-bit MPI
146 * (double the bitlength of the modulus).
147 * Upon return holds the reduced value which is
148 * in range `0 <= X < 2 * N` (where N is the modulus).
149 * The bitlength of the reduced value is the same as
150 * that of the modulus (256 bits).
151 * \param[in] X_limbs The length of \p X in limbs.
152 *
153 * \return \c 0 on success.
154 * \return #MBEDTLS_ERR_ECP_BAD_INPUT_DATA if \p X_limbs is not the
155 * limb size that sores a 512-bit MPI.
156 */
Gabor Mezei5221c042023-03-01 16:05:21 +0100157MBEDTLS_STATIC_TESTABLE
Gabor Mezeied1acf62023-03-01 16:09:13 +0100158int mbedtls_ecp_mod_p256_raw(mbedtls_mpi_uint *X, size_t X_limbs);
Gabor Mezei5221c042023-03-01 16:05:21 +0100159
160#endif
161
Gabor Mezei2cb630e2023-02-01 14:02:16 +0100162#if defined(MBEDTLS_ECP_DP_SECP521R1_ENABLED)
163
Gabor Mezeib1c62ca2023-02-06 16:02:05 +0100164/** Fast quasi-reduction modulo p521 = 2^521 - 1 (FIPS 186-3 D.2.5)
165 *
Gabor Mezei7e6fcc12023-02-15 17:51:59 +0100166 * \param[in,out] X The address of the MPI to be converted.
167 * Must have twice as many limbs as the modulus
168 * (the modulus is 521 bits long). Upon return this
169 * holds the reduced value. The reduced value is
170 * in range `0 <= X < 2 * N` (where N is the modulus).
171 * and its the bitlength is one plus the bitlength
172 * of the modulus.
173 * \param[in] X_limbs The length of \p X in limbs.
174 *
175 * \return \c 0 on success.
176 * \return #MBEDTLS_ERR_ECP_BAD_INPUT_DATA if \p X_limbs does not have
177 * twice as many limbs as the modulus.
Gabor Mezeib1c62ca2023-02-06 16:02:05 +0100178 */
Gabor Mezei2cb630e2023-02-01 14:02:16 +0100179MBEDTLS_STATIC_TESTABLE
Gabor Mezei7e6fcc12023-02-15 17:51:59 +0100180int mbedtls_ecp_mod_p521_raw(mbedtls_mpi_uint *X, size_t X_limbs);
Gabor Mezei2cb630e2023-02-01 14:02:16 +0100181
182#endif /* MBEDTLS_ECP_DP_SECP521R1_ENABLED */
183
Minos Galanakis6fb105f2023-02-22 15:28:20 +0000184#if defined(MBEDTLS_ECP_DP_SECP384R1_ENABLED)
185
186/** Fast quasi-reduction modulo p384 (FIPS 186-3 D.2.4)
187 *
188 * \param[in,out] X The address of the MPI to be converted.
Minos Galanakisf9fca532023-03-23 10:36:53 +0000189 * Must have exact limb size that stores a 768-bit MPI
190 * (double the bitlength of the modulus).
Minos Galanakis6fb105f2023-02-22 15:28:20 +0000191 * Upon return holds the reduced value which is
192 * in range `0 <= X < 2 * N` (where N is the modulus).
193 * The bitlength of the reduced value is the same as
194 * that of the modulus (384 bits).
195 * \param[in] X_limbs The length of \p N in limbs.
196 *
197 * \return \c 0 on success.
198 * \return #MBEDTLS_ERR_ECP_BAD_INPUT_DATA if \p N_n does not have
199 * twice as many limbs as the modulus.
200 */
201MBEDTLS_STATIC_TESTABLE
202int mbedtls_ecp_mod_p384_raw(mbedtls_mpi_uint *X, size_t X_limbs);
203
204#endif /* MBEDTLS_ECP_DP_SECP384R1_ENABLED */
205
Gabor Mezei1237a342023-04-11 16:22:35 +0200206#if defined(MBEDTLS_ECP_DP_SECP192K1_ENABLED)
207
Gabor Mezeifa3f7412023-05-17 17:35:47 +0200208/** Fast quasi-reduction modulo p192k1 = 2^192 - R,
209 * with R = 2^32 + 2^12 + 2^8 + 2^7 + 2^6 + 2^3 + 1 = 0x01000011C9
210 *
211 * \param[in,out] X The address of the MPI to be converted.
212 * Must have exact limb size that stores a 384-bit MPI
213 * (double the bitlength of the modulus).
214 * Upon return holds the reduced value which is
215 * in range `0 <= X < 2 * N` (where N is the modulus).
216 * The bitlength of the reduced value is the same as
217 * that of the modulus (192 bits).
218 * \param[in] X_limbs The length of \p X in limbs.
219 *
220 * \return \c 0 on success.
Gabor Mezeid56e6e02023-05-17 17:51:19 +0200221 * \return #MBEDTLS_ERR_ECP_BAD_INPUT_DATA if \p X does not have
222 * twice as many limbs as the modulus.
Gabor Mezeifa3f7412023-05-17 17:35:47 +0200223 * \return #MBEDTLS_ERR_ECP_ALLOC_FAILED if memory allocation failed.
Gabor Mezei1237a342023-04-11 16:22:35 +0200224 */
225MBEDTLS_STATIC_TESTABLE
Gabor Mezeidacfe562023-05-02 14:05:13 +0200226int mbedtls_ecp_mod_p192k1_raw(mbedtls_mpi_uint *X, size_t X_limbs);
Gabor Mezei1237a342023-04-11 16:22:35 +0200227
228#endif /* MBEDTLS_ECP_DP_SECP192K1_ENABLED */
Gabor Mezeie42bb622023-05-02 14:10:57 +0200229
Minos Galanakise5dab972023-04-11 16:42:06 +0100230#if defined(MBEDTLS_ECP_DP_SECP224K1_ENABLED)
231
Gabor Mezeifa3f7412023-05-17 17:35:47 +0200232/** Fast quasi-reduction modulo p224k1 = 2^224 - R,
233 * with R = 2^32 + 2^12 + 2^11 + 2^9 + 2^7 + 2^4 + 2 + 1 = 0x0100001A93
234 *
235 * \param[in,out] X The address of the MPI to be converted.
236 * Must have exact limb size that stores a 448-bit MPI
237 * (double the bitlength of the modulus).
238 * Upon return holds the reduced value which is
239 * in range `0 <= X < 2 * N` (where N is the modulus).
240 * The bitlength of the reduced value is the same as
241 * that of the modulus (224 bits).
242 * \param[in] X_limbs The length of \p X in limbs.
243 *
244 * \return \c 0 on success.
Gabor Mezeid56e6e02023-05-17 17:51:19 +0200245 * \return #MBEDTLS_ERR_ECP_BAD_INPUT_DATA if \p X does not have
246 * twice as many limbs as the modulus.
Gabor Mezeifa3f7412023-05-17 17:35:47 +0200247 * \return #MBEDTLS_ERR_ECP_ALLOC_FAILED if memory allocation failed.
248 */
Minos Galanakise5dab972023-04-11 16:42:06 +0100249MBEDTLS_STATIC_TESTABLE
Gabor Mezeie42bb622023-05-02 14:10:57 +0200250int mbedtls_ecp_mod_p224k1_raw(mbedtls_mpi_uint *X, size_t X_limbs);
Minos Galanakise5dab972023-04-11 16:42:06 +0100251
252#endif /* MBEDTLS_ECP_DP_SECP224K1_ENABLED */
Gabor Mezei1237a342023-04-11 16:22:35 +0200253
Minos Galanakisd6751dc2023-04-11 17:25:31 +0100254#if defined(MBEDTLS_ECP_DP_SECP256K1_ENABLED)
255
Gabor Mezeifa3f7412023-05-17 17:35:47 +0200256/** Fast quasi-reduction modulo p256k1 = 2^256 - R,
257 * with R = 2^32 + 2^9 + 2^8 + 2^7 + 2^6 + 2^4 + 1 = 0x01000003D1
258 *
259 * \param[in,out] X The address of the MPI to be converted.
260 * Must have exact limb size that stores a 512-bit MPI
261 * (double the bitlength of the modulus).
262 * Upon return holds the reduced value which is
263 * in range `0 <= X < 2 * N` (where N is the modulus).
264 * The bitlength of the reduced value is the same as
265 * that of the modulus (256 bits).
266 * \param[in] X_limbs The length of \p X in limbs.
267 *
268 * \return \c 0 on success.
Gabor Mezeid56e6e02023-05-17 17:51:19 +0200269 * \return #MBEDTLS_ERR_ECP_BAD_INPUT_DATA if \p X does not have
270 * twice as many limbs as the modulus.
Gabor Mezeifa3f7412023-05-17 17:35:47 +0200271 * \return #MBEDTLS_ERR_ECP_ALLOC_FAILED if memory allocation failed.
272 */
Minos Galanakisd6751dc2023-04-11 17:25:31 +0100273MBEDTLS_STATIC_TESTABLE
Gabor Mezei03558b82023-05-02 14:12:25 +0200274int mbedtls_ecp_mod_p256k1_raw(mbedtls_mpi_uint *X, size_t X_limbs);
Minos Galanakisd6751dc2023-04-11 17:25:31 +0100275
276#endif /* MBEDTLS_ECP_DP_SECP256K1_ENABLED */
277
Minos Galanakisd0292c22023-05-10 15:46:47 +0100278#if defined(MBEDTLS_ECP_DP_CURVE25519_ENABLED)
279
Minos Galanakis47249fd2023-05-18 16:16:17 +0100280/** Fast quasi-reduction modulo p255 = 2^255 - 19
281 *
282 * \param[in,out] X The address of the MPI to be converted.
283 * Must have exact limb size that stores a 510-bit MPI
284 * (double the bitlength of the modulus).
285 * Upon return holds the reduced value which is
286 * in range `0 <= X < 2 * N` (where N is the modulus).
Minos Galanakis47249fd2023-05-18 16:16:17 +0100287 * \param[in] X_limbs The length of \p X in limbs.
288 *
289 * \return \c 0 on success.
290 * \return #MBEDTLS_ERR_ECP_BAD_INPUT_DATA if \p X does not have
291 * twice as many limbs as the modulus.
292 * \return #MBEDTLS_ERR_ECP_ALLOC_FAILED if memory allocation failed.
293 */
Minos Galanakisd0292c22023-05-10 15:46:47 +0100294MBEDTLS_STATIC_TESTABLE
295int mbedtls_ecp_mod_p255_raw(mbedtls_mpi_uint *X, size_t X_limbs);
296
297#endif /* MBEDTLS_ECP_DP_CURVE25519_ENABLED */
298
Paul Elliott47a3c822023-04-23 23:18:50 +0100299#if defined(MBEDTLS_ECP_DP_CURVE448_ENABLED)
300
Paul Elliottee861002023-05-31 12:12:22 +0100301/** Fast quasi-reduction modulo p448 = 2^448 - 2^224 - 1
302 * Write X as A0 + 2^448 A1 and A1 as B0 + 2^224 B1, and return A0 + A1 + B1 +
303 * (B0 + B1) * 2^224.
304 *
305 * \param[in,out] X The address of the MPI to be converted.
306 * Must have exact limb size that stores a 896-bit MPI
307 * (double the bitlength of the modulus). Upon return
308 * holds the reduced value which is in range `0 <= X <
309 * N` (where N is the modulus). The bitlength of the
310 * reduced value is the same as that of the modulus
311 * (448 bits).
312 * \param[in] X_limbs The length of \p X in limbs.
313 *
314 * \return \c 0 on Success.
315 * \return #MBEDTLS_ERR_ECP_BAD_INPUT_DATA if \p X does not have
316 * twice as many limbs as the modulus.
317 * \return #MBEDTLS_ERR_ECP_ALLOC_FAILED if memory allocation
318 * failed.
319 */
Paul Elliott47a3c822023-04-23 23:18:50 +0100320MBEDTLS_STATIC_TESTABLE
Paul Elliotta2e48f72023-06-02 16:00:05 +0100321int mbedtls_ecp_mod_p448_raw(mbedtls_mpi_uint *X, size_t X_limbs);
Paul Elliott47a3c822023-04-23 23:18:50 +0100322
323#endif /* MBEDTLS_ECP_DP_CURVE448_ENABLED */
324
Minos Galanakisa30afe22023-02-15 15:36:29 +0000325/** Initialise a modulus with hard-coded const curve data.
326 *
327 * \note The caller is responsible for the \p N modulus' memory.
328 * mbedtls_mpi_mod_modulus_free(&N) should be invoked at the
329 * end of its lifecycle.
330 *
331 * \param[in,out] N The address of the modulus structure to populate.
332 * Must be initialized.
333 * \param[in] id The mbedtls_ecp_group_id for which to initialise the modulus.
Minos Galanakis1d3e3322023-06-09 14:53:30 +0100334 * \param[in] ctype The mbedtls_ecp_modulus_type identifier for a coordinate modulus (P)
Minos Galanakisa30afe22023-02-15 15:36:29 +0000335 * or a scalar modulus (N).
336 *
337 * \return \c 0 if successful.
338 * \return #MBEDTLS_ERR_ECP_BAD_INPUT_DATA if the given MPIs do not
339 * have the correct number of limbs.
340 *
341 */
Minos Galanakisdd556922023-02-03 19:12:21 +0000342MBEDTLS_STATIC_TESTABLE
343int mbedtls_ecp_modulus_setup(mbedtls_mpi_mod_modulus *N,
344 const mbedtls_ecp_group_id id,
Minos Galanakis1d3e3322023-06-09 14:53:30 +0100345 const mbedtls_ecp_modulus_type ctype);
Minos Galanakisdd556922023-02-03 19:12:21 +0000346
Gilles Peskine80ba8502021-04-03 20:36:37 +0200347#endif /* MBEDTLS_TEST_HOOKS && MBEDTLS_ECP_C */
348
349#endif /* MBEDTLS_ECP_INVASIVE_H */