71 	const unsigned char *b;  in check_equals()  local
78 	for (u = 0, b = v1; u < len; u ++) {  in check_equals()
79 		fprintf(stderr, "%02X", b[u]);  in check_equals()
82 	for (u = 0, b = v2; u < len; u ++) {  in check_equals()
83 		fprintf(stderr, "%02X", b[u]);  in check_equals()
6580 …"0159DBDE04A33EF06FB608B80B190F4D3E22BCC13AC8E4A081033ABFA416EDB0B338AA08B57309EA5A5240E7DC6E54378…
7918 	"7162015b",
8180 		uint32_t a[22], b[22], x[22], y[22], z[22], t1[22], t2[22];  in test_EC_inner()  local
8185 		 * Generate random a and b, and compute A = a*G and B = b*G.  in test_EC_inner()
8191 		br_i31_decode_reduce(b, bb, sizeof bb, n);  in test_EC_inner()
8192 		br_i31_encode(bb, nlen, b);  in test_EC_inner()
8209 		 * Compute z = a*x + b*y (mod n).  in test_EC_inner()
8216 		br_i31_montymul(t2, b, t1, n, n0i);  in test_EC_inner()
8223 		 * Compute C = x*A + y*B with muladd(), and also  in test_EC_inner()
8258 		 * Check with x*A = y*B. We do so by setting b = x and y = a.  in test_EC_inner()
8260 		memcpy(b, x, sizeof x);  in test_EC_inner()
8261 		br_i31_encode(bb, nlen, b);  in test_EC_inner()
8272 		br_i31_montymul(t2, b, t1, n, n0i);  in test_EC_inner()
8292 				"mul() / muladd() mismatch (x*A=y*B)\n");  in test_EC_inner()
8297 		 * Check with x*A + y*B = 0. At that point, b = x, so we  in test_EC_inner()