Fix number of loop iterations in `mbedtls_deduce_primes`
The number of loop iterations per candidate in `mbedtls_deduce_primes` was off
by one. This commit corrects this and removes a toy non-example from the RSA
test suite, as it seems difficult to have the function fail on small values of N
even if D,E are corrupted.
diff --git a/library/rsa_internal.c b/library/rsa_internal.c
index 4d688e0..292fc13 100644
--- a/library/rsa_internal.c
+++ b/library/rsa_internal.c
@@ -148,7 +148,7 @@
Q /* temporarily use Q for storing Montgomery
* multiplication helper values */ ) );
- for( iter = 1; iter < order; ++iter )
+ for( iter = 1; iter <= order; ++iter )
{
MBEDTLS_MPI_CHK( mbedtls_mpi_add_int( &K, &K, 1 ) );
MBEDTLS_MPI_CHK( mbedtls_mpi_gcd( P, &K, N ) );