blob: 2854fb0a96202796b0ff62a39b3245edaefeb6d9 [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"
Gilles Peskine80ba8502021-04-03 20:36:37 +020031#include "mbedtls/ecp.h"
32
33#if defined(MBEDTLS_TEST_HOOKS) && defined(MBEDTLS_ECP_C)
34
Gilles Peskine618be2e2021-04-03 21:47:53 +020035#if defined(MBEDTLS_ECP_DP_SECP224R1_ENABLED) || \
36 defined(MBEDTLS_ECP_DP_SECP256R1_ENABLED) || \
37 defined(MBEDTLS_ECP_DP_SECP384R1_ENABLED)
38/* Preconditions:
39 * - bits is a multiple of 64 or is 224
40 * - c is -1 or -2
41 * - 0 <= N < 2^bits
Gilles Peskine392d1012021-04-09 15:46:51 +020042 * - N has room for bits plus one limb
Gilles Peskine618be2e2021-04-03 21:47:53 +020043 *
Gilles Peskine392d1012021-04-09 15:46:51 +020044 * Behavior:
45 * Set N to c * 2^bits + old_value_of_N.
Gilles Peskine618be2e2021-04-03 21:47:53 +020046 */
Gilles Peskine449bd832023-01-11 14:50:10 +010047void mbedtls_ecp_fix_negative(mbedtls_mpi *N, signed char c, size_t bits);
Gilles Peskine618be2e2021-04-03 21:47:53 +020048#endif
49
Gilles Peskine72fcc982021-03-23 22:31:31 +010050#if defined(MBEDTLS_ECP_MONTGOMERY_ENABLED)
51/** Generate a private key on a Montgomery curve (Curve25519 or Curve448).
52 *
53 * This function implements key generation for the set of secret keys
54 * specified in [Curve25519] p. 5 and in [Curve448]. The resulting value
55 * has the lower bits masked but is not necessarily canonical.
56 *
57 * \note - [Curve25519] http://cr.yp.to/ecdh/curve25519-20060209.pdf
58 * - [RFC7748] https://tools.ietf.org/html/rfc7748
59 *
Gilles Peskine55c46042021-03-24 12:34:40 +010060 * \p high_bit The position of the high-order bit of the key to generate.
Gilles Peskine72fcc982021-03-23 22:31:31 +010061 * This is the bit-size of the key minus 1:
62 * 254 for Curve25519 or 447 for Curve448.
63 * \param d The randomly generated key. This is a number of size
64 * exactly \p n_bits + 1 bits, with the least significant bits
65 * masked as specified in [Curve25519] and in [RFC7748] ยง5.
66 * \param f_rng The RNG function.
67 * \param p_rng The RNG context to be passed to \p f_rng.
68 *
69 * \return \c 0 on success.
70 * \return \c MBEDTLS_ERR_ECP_xxx or MBEDTLS_ERR_MPI_xxx on failure.
71 */
Gilles Peskine449bd832023-01-11 14:50:10 +010072int mbedtls_ecp_gen_privkey_mx(size_t n_bits,
73 mbedtls_mpi *d,
74 int (*f_rng)(void *, unsigned char *, size_t),
75 void *p_rng);
Gilles Peskine72fcc982021-03-23 22:31:31 +010076
77#endif /* MBEDTLS_ECP_MONTGOMERY_ENABLED */
78
Gabor Mezeideece2b2023-01-25 17:57:36 +010079#if defined(MBEDTLS_ECP_DP_SECP192R1_ENABLED)
80
Gabor Mezei9b290b32023-01-27 11:00:51 +010081/** Fast quasi-reduction modulo p192 (FIPS 186-3 D.2.1)
82 *
Gabor Mezeia2648312023-02-13 16:29:05 +010083 * This operation expects a 384 bit MPI and the result of the reduction
84 * is a 192 bit MPI.
85 *
Gabor Mezei9b290b32023-01-27 11:00:51 +010086 * \param[in,out] Np The address of the MPI to be converted.
Gabor Mezei0b4b8e32023-02-14 16:36:38 +010087 * Must have twice as many limbs as the modulus.
88 * Upon return this holds the reduced value. The bitlength
89 * of the reduced value is the same as that of the modulus
90 * (192 bits).
Gabor Mezei63aae682023-02-06 16:24:08 +010091 * \param[in] Nn The length of \p Np in limbs.
Gabor Mezei9b290b32023-01-27 11:00:51 +010092 */
Gabor Mezeideece2b2023-01-25 17:57:36 +010093MBEDTLS_STATIC_TESTABLE
Gabor Mezei2038ce92023-01-31 14:33:12 +010094int mbedtls_ecp_mod_p192_raw(mbedtls_mpi_uint *Np, size_t Nn);
Gabor Mezeideece2b2023-01-25 17:57:36 +010095
96#endif /* MBEDTLS_ECP_DP_SECP192R1_ENABLED */
97
Gabor Mezei2cb630e2023-02-01 14:02:16 +010098#if defined(MBEDTLS_ECP_DP_SECP521R1_ENABLED)
99
Gabor Mezeib1c62ca2023-02-06 16:02:05 +0100100/** Fast quasi-reduction modulo p521 = 2^521 - 1 (FIPS 186-3 D.2.5)
101 *
102 * \param[in,out] N_p The address of the MPI to be converted.
103 * Must have 2 * N - 1 limbs, where N is the modulus.
104 * \param[in] N_n The length of \p N_p in limbs.
105 */
Gabor Mezei2cb630e2023-02-01 14:02:16 +0100106MBEDTLS_STATIC_TESTABLE
107int ecp_mod_p521_raw(mbedtls_mpi_uint *N_p, size_t N_n);
108
109#endif /* MBEDTLS_ECP_DP_SECP521R1_ENABLED */
110
Gilles Peskine80ba8502021-04-03 20:36:37 +0200111#endif /* MBEDTLS_TEST_HOOKS && MBEDTLS_ECP_C */
112
113#endif /* MBEDTLS_ECP_INVASIVE_H */