rsa_internal.h File Reference

Generate RSA-CRT parameters.

Note:

This is a 'static' helper function not operating on an RSA context. Alternative implementations need not overwrite it.

Parameters:

P	First prime factor of N
Q	Second prime factor of N
D	RSA private exponent
DP	Output variable for D modulo P-1
DQ	Output variable for D modulo Q-1
QP	Output variable for the modular inverse of Q modulo P.

Returns:

0 on success, non-zero error code otherwise.

Note:

This function does not check whether P, Q are prime and whether D is a valid private exponent.

Definition at line 453 of file rsa_internal.c.

Compute RSA prime moduli P, Q from public modulus N=PQ and a pair of private and public key.

Note:

This is a 'static' helper function not operating on an RSA context. Alternative implementations need not overwrite it.

Parameters:

N	RSA modulus N = PQ, with P, Q to be found
E	RSA public exponent
D	RSA private exponent
P	Pointer to MPI holding first prime factor of N on success
Q	Pointer to MPI holding second prime factor of N on success

Returns:

• 0 if successful. In this case, P and Q constitute a factorization of N.
• A non-zero error code otherwise.

Note:

It is neither checked that P, Q are prime nor that D, E are modular inverses wrt. P-1 and Q-1. For that, use the helper function mbedtls_rsa_validate_params.

Definition at line 68 of file rsa_internal.c.

Compute RSA private exponent from prime moduli and public key.

Note:

This is a 'static' helper function not operating on an RSA context. Alternative implementations need not overwrite it.

Parameters:

P	First prime factor of RSA modulus
Q	Second prime factor of RSA modulus
E	RSA public exponent
D	Pointer to MPI holding the private exponent on success.

Returns:

• 0 if successful. In this case, D is set to a simultaneous modular inverse of E modulo both P-1 and Q-1.
• A non-zero error code otherwise.

Note:

This function does not check whether P and Q are primes.

Definition at line 203 of file rsa_internal.c.

Check validity of RSA CRT parameters.

Note:

This is a 'static' helper function not operating on an RSA context. Alternative implementations need not overwrite it.

Parameters:

P	First prime factor of RSA modulus
Q	Second prime factor of RSA modulus
D	RSA private exponent
DP	MPI to check for D modulo P-1
DQ	MPI to check for D modulo P-1
QP	MPI to check for the modular inverse of Q modulo P.

Returns:

• 0 if the following conditions are satisfied:
  • D = DP mod P-1 if P, D, DP != NULL
  • Q = DQ mod P-1 if P, D, DQ != NULL
  • QP = Q^-1 mod P if P, Q, QP != NULL
• MBEDTLS_ERR_RSA_KEY_CHECK_FAILED if check failed, potentially including MBEDTLS_ERR_MPI_XXX if some MPI calculations failed.
• MBEDTLS_ERR_RSA_BAD_INPUT_DATA if insufficient data was provided to check DP, DQ or QP.

Note:

The function can be used with a restricted set of arguments to perform specific checks only. E.g., calling it with the parameters (P, -, D, DP, -, -) will check DP = D mod P-1.

Definition at line 249 of file rsa_internal.c.

Check validity of core RSA parameters.

Note:

This is a 'static' helper function not operating on an RSA context. Alternative implementations need not overwrite it.

Parameters:

N	RSA modulus N = PQ
P	First prime factor of N
Q	Second prime factor of N
D	RSA private exponent
E	RSA public exponent
f_rng	PRNG to be used for primality check, or NULL
p_rng	PRNG context for f_rng, or NULL

Returns:

• 0 if the following conditions are satisfied if all relevant parameters are provided:
  • P prime if f_rng != NULL (%)
  • Q prime if f_rng != NULL (%)
  • 1 < N = P * Q
  • 1 < D, E < N
  • D and E are modular inverses modulo P-1 and Q-1 (%) This is only done if MBEDTLS_GENPRIME is defined.
• A non-zero error code otherwise.

Note:

The function can be used with a restricted set of arguments to perform specific checks only. E.g., calling it with (-,P,-,-,-) and a PRNG amounts to a primality check for P.

Definition at line 337 of file rsa_internal.c.