X-Git-Url: https://www.bearssl.org/gitweb//home/git/?p=BearSSL;a=blobdiff_plain;f=src%2Fec%2Fec_prime_i31.c;h=b205f367aebaec00048bec5a68fdc09999a58914;hp=ce4d4abdb88dcdfd9d0bb36fceaa0ff304bcacb8;hb=b2ec2030e40acf5e9e4cd0f2669aacb27eadb540;hpb=3655193439d4e093bb80a2f0d9e02179d424de08;ds=sidebyside

diff --git a/src/ec/ec_prime_i31.c b/src/ec/ec_prime_i31.c
index ce4d4ab..b205f36 100644
--- a/src/ec/ec_prime_i31.c
+++ b/src/ec/ec_prime_i31.c
@@ -107,15 +107,16 @@ typedef struct {
 	const uint32_t *b;
 	const uint32_t *R2;
 	uint32_t p0i;
+	size_t point_len;
 } curve_params;
 
 static inline const curve_params *
 id_to_curve(int curve)
 {
 	static const curve_params pp[] = {
-		{ P256_P, P256_B, P256_R2, 0x00000001 },
-		{ P384_P, P384_B, P384_R2, 0x00000001 },
-		{ P521_P, P521_B, P521_R2, 0x00000001 }
+		{ P256_P, P256_B, P256_R2, 0x00000001,  65 },
+		{ P384_P, P384_B, P384_R2, 0x00000001,  97 },
+		{ P521_P, P521_B, P521_R2, 0x00000001, 133 }
 	};
 
 	return &pp[curve - BR_EC_secp256r1];
@@ -734,6 +735,9 @@ 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);
 	point_encode(G, &P, cc);
@@ -764,11 +768,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;