Rename `rsa_deduce_private` to `rsa_deduce_private_exponent`
diff --git a/library/rsa.c b/library/rsa.c
index 408ceb1..031dc2c 100644
--- a/library/rsa.c
+++ b/library/rsa.c
@@ -78,7 +78,7 @@
* There are two classes of helper functions:
* (1) Parameter-generating helpers. These are:
* - mbedtls_rsa_deduce_moduli
- * - mbedtls_rsa_deduce_private
+ * - mbedtls_rsa_deduce_private_exponent
* - mbedtls_rsa_deduce_crt
* Each of these functions takes a set of core RSA parameters
* and generates some other, or CRT related parameters.
@@ -253,10 +253,10 @@
* This is essentially a modular inversion.
*/
-int mbedtls_rsa_deduce_private( mbedtls_mpi const *P,
- mbedtls_mpi const *Q,
- mbedtls_mpi const *E,
- mbedtls_mpi *D )
+int mbedtls_rsa_deduce_private_exponent( mbedtls_mpi const *P,
+ mbedtls_mpi const *Q,
+ mbedtls_mpi const *E,
+ mbedtls_mpi *D )
{
int ret = 0;
mbedtls_mpi K, L;
@@ -681,8 +681,10 @@
/* Deduce private exponent. This includes double-checking of the result,
* so together with the primality test above all core parameters are
* guaranteed to be sane if this call succeeds. */
- if( ( ret = mbedtls_rsa_deduce_private( &ctx->P, &ctx->Q,
- &ctx->E, &ctx->D ) ) != 0 )
+ if( ( ret = mbedtls_rsa_deduce_private_exponent( &ctx->P,
+ &ctx->Q,
+ &ctx->E,
+ &ctx->D ) ) != 0 )
{
return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA + ret );
}