X-Git-Url: https://www.bearssl.org/gitweb//home/git/?p=BearSSL;a=blobdiff_plain;f=src%2Fec%2Fec_prime_i15.c;h=f86dbe6ff0dbc036af470e369048c4ae02d33337;hp=85affe5a9c0b78ec59d35621330188539dfdcf1a;hb=dda1f8a0c46e15b4a235163470ff700b2f13dcc5;hpb=3655193439d4e093bb80a2f0d9e02179d424de08

diff --git a/src/ec/ec_prime_i15.c b/src/ec/ec_prime_i15.c
index 85affe5..f86dbe6 100644
--- a/src/ec/ec_prime_i15.c
+++ b/src/ec/ec_prime_i15.c
@@ -733,11 +733,12 @@ api_mul(unsigned char *G, size_t Glen,
 	jacobian P;
 
 	cc = id_to_curve(curve);
+	if (Glen != cc->point_len) {
+		return 0;
+	}
 	r = point_decode(&P, G, Glen, cc);
 	point_mul(&P, x, xlen, cc);
-	if (Glen == cc->point_len) {
-		point_encode(G, &P, cc);
-	}
+	point_encode(G, &P, cc);
 	return r;
 }
 
@@ -765,11 +766,14 @@ api_muladd(unsigned char *A, const unsigned char *B, size_t len,
 
 	/*
 	 * TODO: see about merging the two ladders. Right now, we do
-	 * two independant point multiplications, which is a bit
+	 * two independent point multiplications, which is a bit
 	 * wasteful of CPU resources (but yields short code).
 	 */
 
 	cc = id_to_curve(curve);
+	if (len != cc->point_len) {
+		return 0;
+	}
 	r = point_decode(&P, A, len, cc);
 	if (B == NULL) {
 		size_t Glen;