|
|
@@ -58,6 +58,8 @@
|
|
|
#define mbedtls_free free
|
|
|
#endif
|
|
|
|
|
|
+#if !defined(MBEDTLS_BIGNUM_ALT)
|
|
|
+
|
|
|
/* Implementation that should never be optimized out by the compiler */
|
|
|
static void mbedtls_mpi_zeroize( mbedtls_mpi_uint *v, size_t n ) {
|
|
|
volatile mbedtls_mpi_uint *p = v; while( n-- ) *p++ = 0;
|
|
|
@@ -1095,6 +1097,8 @@ int mbedtls_mpi_sub_int( mbedtls_mpi *X, const mbedtls_mpi *A, mbedtls_mpi_sint
|
|
|
return( mbedtls_mpi_sub_mpi( X, A, &_B ) );
|
|
|
}
|
|
|
|
|
|
+#if !defined(MBEDTLS_MPI_MUL_MPI_ALT) || !defined(MBEDTLS_MPI_EXP_MOD_ALT)
|
|
|
+
|
|
|
/*
|
|
|
* Helper for mbedtls_mpi multiplication
|
|
|
*/
|
|
|
@@ -1106,6 +1110,7 @@ static
|
|
|
*/
|
|
|
__attribute__ ((noinline))
|
|
|
#endif
|
|
|
+
|
|
|
void mpi_mul_hlp( size_t i, mbedtls_mpi_uint *s, mbedtls_mpi_uint *d, mbedtls_mpi_uint b )
|
|
|
{
|
|
|
mbedtls_mpi_uint c = 0, t = 0;
|
|
|
@@ -1167,6 +1172,9 @@ void mpi_mul_hlp( size_t i, mbedtls_mpi_uint *s, mbedtls_mpi_uint *d, mbedtls_mp
|
|
|
while( c != 0 );
|
|
|
}
|
|
|
|
|
|
+#endif
|
|
|
+
|
|
|
+#if !defined(MBEDTLS_MPI_MUL_MPI_ALT)
|
|
|
/*
|
|
|
* Baseline multiplication: X = A * B (HAC 14.12)
|
|
|
*/
|
|
|
@@ -1203,6 +1211,7 @@ cleanup:
|
|
|
|
|
|
return( ret );
|
|
|
}
|
|
|
+#endif
|
|
|
|
|
|
/*
|
|
|
* Baseline multiplication: X = A * b
|
|
|
@@ -1527,6 +1536,8 @@ int mbedtls_mpi_mod_int( mbedtls_mpi_uint *r, const mbedtls_mpi *A, mbedtls_mpi_
|
|
|
return( 0 );
|
|
|
}
|
|
|
|
|
|
+#if !defined(MBEDTLS_MPI_EXP_MOD_ALT)
|
|
|
+
|
|
|
/*
|
|
|
* Fast Montgomery initialization (thanks to Tom St Denis)
|
|
|
*/
|
|
|
@@ -1808,6 +1819,7 @@ cleanup:
|
|
|
|
|
|
return( ret );
|
|
|
}
|
|
|
+#endif
|
|
|
|
|
|
/*
|
|
|
* Greatest common divisor: G = gcd(A, B) (HAC 14.54)
|
|
|
@@ -2269,6 +2281,7 @@ cleanup:
|
|
|
}
|
|
|
|
|
|
#endif /* MBEDTLS_GENPRIME */
|
|
|
+#endif /* MBEDTLS_BIGNUM_ALT */
|
|
|
|
|
|
#if defined(MBEDTLS_SELF_TEST)
|
|
|
|