Lines Matching +full:- +full:d
4 * \brief Context-independent RSA helper functions
6 * This module declares some RSA-related helper functions useful when
13 * End-users of Mbed TLS who are not providing their own alternative RSA
23 * (1) Parameter-generating helpers. These are:
24 * - mbedtls_rsa_deduce_primes
25 * - mbedtls_rsa_deduce_private_exponent
26 * - mbedtls_rsa_deduce_crt
30 * (2) Parameter-checking helpers. These are:
31 * - mbedtls_rsa_validate_params
32 * - mbedtls_rsa_validate_crt
39 * SPDX-License-Identifier: Apache-2.0 OR GPL-2.0-or-later
63 * \param D RSA private exponent
68 * - 0 if successful. In this case, P and Q constitute a
70 * - A non-zero error code otherwise.
73 * D, E are modular inverses wrt. P-1 and Q-1. For that,
78 mbedtls_mpi const *D,
92 * \param D Pointer to MPI holding the private exponent on success.
95 * - 0 if successful. In this case, D is set to a simultaneous
96 * modular inverse of E modulo both P-1 and Q-1.
97 * - A non-zero error code otherwise.
105 mbedtls_mpi *D);
109 * \brief Generate RSA-CRT parameters
117 * \param D RSA private exponent
118 * \param DP Output variable for D modulo P-1
119 * \param DQ Output variable for D modulo Q-1
122 * \return 0 on success, non-zero error code otherwise.
125 * prime and whether D is a valid private exponent.
129 const mbedtls_mpi *D, mbedtls_mpi *DP,
143 * \param D RSA private exponent
149 * - 0 if the following conditions are satisfied
151 * - P prime if f_rng != NULL (%)
152 * - Q prime if f_rng != NULL (%)
153 * - 1 < N = P * Q
154 * - 1 < D, E < N
155 * - D and E are modular inverses modulo P-1 and Q-1
157 * - A non-zero error code otherwise.
161 * (-,P,-,-,-) and a PRNG amounts to a primality check for P.
164 const mbedtls_mpi *Q, const mbedtls_mpi *D,
178 * \param D RSA private exponent
179 * \param DP MPI to check for D modulo P-1
180 * \param DQ MPI to check for D modulo P-1
184 * - 0 if the following conditions are satisfied:
185 * - D = DP mod P-1 if P, D, DP != NULL
186 * - Q = DQ mod P-1 if P, D, DQ != NULL
187 * - QP = Q^-1 mod P if P, Q, QP != NULL
188 * - \c MBEDTLS_ERR_RSA_KEY_CHECK_FAILED if check failed,
191 * - \c MBEDTLS_ERR_RSA_BAD_INPUT_DATA if insufficient
196 * parameters (P, -, D, DP, -, -) will check DP = D mod P-1.
199 const mbedtls_mpi *D, const mbedtls_mpi *DP,