2 * Copyright (C) 2018 vt@altlinux.org. All Rights Reserved.
4 * Contents licensed under the terms of the OpenSSL license
5 * See https://www.openssl.org/source/license.html for details
9 #include <openssl/evp.h>
10 #include <openssl/rand.h>
11 #include <openssl/err.h>
12 #include <openssl/asn1.h>
13 #include <openssl/obj_mac.h>
14 #include <openssl/ec.h>
15 #include <openssl/bn.h>
18 #define T(e) ({ if (!(e)) { \
19 ERR_print_errors_fp(stderr); \
20 OpenSSLDie(__FILE__, __LINE__, #e); \
24 #define cRED "\033[1;31m"
25 #define cDRED "\033[0;31m"
26 #define cGREEN "\033[1;32m"
27 #define cDGREEN "\033[0;32m"
28 #define cBLUE "\033[1;34m"
29 #define cDBLUE "\033[0;34m"
30 #define cNORM "\033[m"
31 #define TEST_ASSERT(e) { \
34 printf(cRED " Test FAILED" cNORM "\n"); \
36 printf(cGREEN " Test passed" cNORM "\n"); \
45 static struct test_curve test_curves[] = {
47 { NID_id_GostR3410_2001_TestParamSet, },
49 { NID_id_GostR3410_2001_CryptoPro_A_ParamSet },
50 { NID_id_GostR3410_2001_CryptoPro_B_ParamSet },
51 { NID_id_GostR3410_2001_CryptoPro_C_ParamSet },
52 { NID_id_GostR3410_2001_CryptoPro_XchA_ParamSet },
53 { NID_id_GostR3410_2001_CryptoPro_XchB_ParamSet },
54 { NID_id_tc26_gost_3410_2012_512_paramSetA, "id-tc26-gost-3410-2012-512-paramSetA", },
55 { NID_id_tc26_gost_3410_2012_512_paramSetB, "id-tc26-gost-3410-2012-512-paramSetB", },
56 { NID_id_tc26_gost_3410_2012_512_paramSetC, "id-tc26-gost-3410-2012-512-paramSetC", },
57 { NID_id_tc26_gost_3410_2012_256_paramSetA, "id-tc26-gost-3410-2012-256-paramSetA", },
58 { NID_id_tc26_gost_3410_2012_256_paramSetB, "id-tc26-gost-3410-2012-256-paramSetB", },
59 { NID_id_tc26_gost_3410_2012_256_paramSetC, "id-tc26-gost-3410-2012-256-paramSetC", },
60 { NID_id_tc26_gost_3410_2012_256_paramSetD, "id-tc26-gost-3410-2012-256-paramSetD", },
64 static struct test_curve *get_test_curve(int nid)
68 for (i = 0; test_curves[i].nid; i++)
69 if (test_curves[i].nid == nid)
70 return &test_curves[i];
74 static void print_bn(const char *name, const BIGNUM *n)
76 printf("%3s = ", name);
77 BN_print_fp(stdout, n);
81 // https://wiki.openssl.org/index.php/Elliptic_Curve_Cryptography
82 static int parameter_test(struct test_curve *tc)
84 const int nid = tc->nid;
87 printf(cBLUE "Test curve NID %d" cNORM, nid);
89 printf(cBLUE ": %s" cNORM, tc->name);
90 else if (OBJ_nid2sn(nid))
91 printf(cBLUE ": %s" cNORM, OBJ_nid2sn(nid));
94 if (!OBJ_nid2obj(nid)) {
95 printf(cRED "NID %d not found" cNORM "\n", nid);
99 /* nid resolves in both directions */
101 T(sn = OBJ_nid2sn(nid));
102 T(ln = OBJ_nid2ln(nid));
104 T(!strcmp(tc->name, OBJ_nid2sn(nid)));
105 T(nid == OBJ_sn2nid(sn));
106 T(nid == OBJ_ln2nid(ln));
109 T(ec = EC_KEY_new());
110 if (!fill_GOST_EC_params(ec, nid)) {
111 printf(cRED "fill_GOST_EC_params FAIL" cNORM "\n");
112 ERR_print_errors_fp(stderr);
116 const EC_GROUP *group;
117 T(group = EC_KEY_get0_group(ec));
120 T(ctx = BN_CTX_new());
125 EC_GROUP_get_curve(group, p, a, b, ctx);
130 T(BN_is_odd(p)); /* Should be odd for F_p */
134 /* Check generator */
135 const EC_POINT *generator;
136 T(generator = EC_GROUP_get0_generator(group));
140 T(EC_POINT_get_affine_coordinates(group, generator, x, y, ctx));
145 /* Generator is not identity element 0 */
146 T(EC_POINT_is_at_infinity(group, generator) == 0);
148 /* x and y is in range [1 .. p-1] */
149 T(!BN_is_negative(x));
150 T(!BN_is_negative(y));
154 /* Generator should be on curve */
155 T(EC_POINT_is_on_curve(group, generator, ctx) == 1);
157 /* y^2 == (x^3 + ax + b) mod p
158 * Should be same as EC_POINT_is_on_curve(generator),
159 * but, let's calculate it manually. */
160 BIGNUM *yy = BN_new();
161 BIGNUM *r = BN_new();
162 BIGNUM *xxx = BN_new();
163 BIGNUM *ax = BN_new();
164 T(yy && r && xxx && ax);
166 BN_mod_exp(yy, y, r, p, ctx);
168 BN_mod_exp(xxx, x, r, p, ctx);
169 BN_mod_mul(ax, a, x, p, ctx);
170 BN_mod_add(xxx, xxx, ax, p, ctx);
171 BN_mod_add(xxx, xxx, b, p, ctx);
172 T(BN_cmp(yy, xxx) == 0);
185 T(order = EC_GROUP_get0_order(group));
186 T(!BN_is_zero(order));
187 print_bn("q", order);
190 T((point = EC_POINT_new(group)));
191 T(EC_POINT_mul(group, point, NULL, generator, order, ctx));
192 /* generator * order is the point at infinity? */
193 T(EC_POINT_is_at_infinity(group, point) == 1);
194 EC_POINT_free(point);
196 /* Check if order is cyclic */
197 BIGNUM *k1 = BN_new();
198 BIGNUM *k2 = BN_new();
199 EC_POINT *p1 = EC_POINT_new(group);
200 EC_POINT *p2 = EC_POINT_new(group);
203 BN_add(k2, k2, order);
204 T(EC_POINT_mul(group, p1, NULL, generator, k1, ctx));
205 T(EC_POINT_mul(group, p2, NULL, generator, k2, ctx));
206 T(EC_POINT_cmp(group, p1, p2, ctx) == 0);
212 /* Cofactor is 1 or 4 */
214 T(c = EC_GROUP_get0_cofactor(group));
215 T(BN_is_word(c, 1) || BN_is_word(c, 4));
223 int main(int argc, char **argv)
227 struct test_curve *tc;
228 for (tc = test_curves; tc->nid; tc++) {
229 ret |= parameter_test(tc);
233 printf(cDRED "= Some tests FAILED!" cNORM "\n");
235 printf(cDGREEN "= All tests passed!" cNORM "\n");