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
8 #include "e_gost_err.h"
10 #include <openssl/evp.h>
11 #include <openssl/rand.h>
12 #include <openssl/err.h>
13 #include <openssl/asn1.h>
14 #include <openssl/obj_mac.h>
15 #include <openssl/ec.h>
16 #include <openssl/bn.h>
19 #define T(e) ({ if (!(e)) { \
20 ERR_print_errors_fp(stderr); \
21 OpenSSLDie(__FILE__, __LINE__, #e); \
25 #define cRED "\033[1;31m"
26 #define cDRED "\033[0;31m"
27 #define cGREEN "\033[1;32m"
28 #define cDGREEN "\033[0;32m"
29 #define cBLUE "\033[1;34m"
30 #define cDBLUE "\033[0;34m"
31 #define cNORM "\033[m"
32 #define TEST_ASSERT(e) {if ((test = (e))) \
33 printf(cRED " Test FAILED\n" cNORM); \
35 printf(cGREEN " Test passed\n" cNORM);}
43 static struct test_curve test_curves[] = {
45 { NID_id_GostR3410_2001_TestParamSet, },
47 { NID_id_GostR3410_2001_CryptoPro_A_ParamSet },
48 { NID_id_GostR3410_2001_CryptoPro_B_ParamSet },
49 { NID_id_GostR3410_2001_CryptoPro_C_ParamSet },
50 { NID_id_GostR3410_2001_CryptoPro_XchA_ParamSet },
51 { NID_id_GostR3410_2001_CryptoPro_XchB_ParamSet },
52 { NID_id_tc26_gost_3410_2012_512_paramSetA, "id-tc26-gost-3410-2012-512-paramSetA", },
53 { NID_id_tc26_gost_3410_2012_512_paramSetB, "id-tc26-gost-3410-2012-512-paramSetB", },
54 { NID_id_tc26_gost_3410_2012_512_paramSetC, "id-tc26-gost-3410-2012-512-paramSetC", },
55 { NID_id_tc26_gost_3410_2012_256_paramSetA, "id-tc26-gost-3410-2012-256-paramSetA", },
56 { NID_id_tc26_gost_3410_2012_256_paramSetB, "id-tc26-gost-3410-2012-256-paramSetB", },
57 { NID_id_tc26_gost_3410_2012_256_paramSetC, "id-tc26-gost-3410-2012-256-paramSetC", },
58 { NID_id_tc26_gost_3410_2012_256_paramSetD, "id-tc26-gost-3410-2012-256-paramSetD", },
62 static struct test_curve *get_test_curve(int nid)
66 for (i = 0; test_curves[i].nid; i++)
67 if (test_curves[i].nid == nid)
68 return &test_curves[i];
72 static void print_bn(const char *name, const BIGNUM *n)
74 printf("%3s = ", name);
75 BN_print_fp(stdout, n);
79 // https://wiki.openssl.org/index.php/Elliptic_Curve_Cryptography
80 static int parameter_test(struct test_curve *tc)
82 const int nid = tc->nid;
85 printf(cBLUE "Test curve NID %d" cNORM, nid);
87 printf(cBLUE ": %s" cNORM, tc->name);
88 else if (OBJ_nid2sn(nid))
89 printf(cBLUE ": %s" cNORM, OBJ_nid2sn(nid));
92 if (!OBJ_nid2obj(nid)) {
93 printf(cRED "NID %d not found\n" cNORM, nid);
97 /* nid resolves in both directions */
99 T(sn = OBJ_nid2sn(nid));
100 T(ln = OBJ_nid2ln(nid));
102 T(!strcmp(tc->name, OBJ_nid2sn(nid)));
103 T(nid == OBJ_sn2nid(sn));
104 T(nid == OBJ_ln2nid(ln));
107 T(ec = EC_KEY_new());
108 if (!fill_GOST_EC_params(ec, nid)) {
109 printf(cRED "fill_GOST_EC_params FAIL\n" cNORM);
110 ERR_print_errors_fp(stderr);
114 const EC_GROUP *group;
115 T(group = EC_KEY_get0_group(ec));
118 T(ctx = BN_CTX_new());
123 EC_GROUP_get_curve(group, p, a, b, ctx);
128 T(BN_is_odd(p)); /* Should be odd for F_p */
132 /* Check generator */
133 const EC_POINT *generator;
134 T(generator = EC_GROUP_get0_generator(group));
138 T(EC_POINT_get_affine_coordinates(group, generator, x, y, ctx));
143 /* Generator is not identity element 0 */
144 T(EC_POINT_is_at_infinity(group, generator) == 0);
146 /* x and y is in range [1 .. p-1] */
147 T(!BN_is_negative(x));
148 T(!BN_is_negative(y));
152 /* Generator should be on curve */
153 T(EC_POINT_is_on_curve(group, generator, ctx) == 1);
155 /* y^2 == (x^3 + ax + b) mod p
156 * Should be same as EC_POINT_is_on_curve(generator),
157 * but, let's calculate it manually. */
158 BIGNUM *yy = BN_new();
159 BIGNUM *r = BN_new();
160 BIGNUM *xxx = BN_new();
161 BIGNUM *ax = BN_new();
162 T(yy && r && xxx && ax);
164 BN_mod_exp(yy, y, r, p, ctx);
166 BN_mod_exp(xxx, x, r, p, ctx);
167 BN_mod_mul(ax, a, x, p, ctx);
168 BN_mod_add(xxx, xxx, ax, p, ctx);
169 BN_mod_add(xxx, xxx, b, p, ctx);
170 T(BN_cmp(yy, xxx) == 0);
174 T(order = EC_GROUP_get0_order(group));
175 T(!BN_is_zero(order));
176 print_bn("q", order);
179 T((point = EC_POINT_new(group)));
180 T(EC_POINT_mul(group, point, NULL, generator, order, ctx));
181 /* generator * order is the point at infinity? */
182 T(EC_POINT_is_at_infinity(group, point) == 1);
184 /* Check if order is cyclic */
185 BIGNUM *k1 = BN_new();
186 BIGNUM *k2 = BN_new();
187 EC_POINT *p1 = EC_POINT_new(group);
188 EC_POINT *p2 = EC_POINT_new(group);
191 BN_add(k2, k2, order);
192 T(EC_POINT_mul(group, p1, NULL, generator, k1, ctx));
193 T(EC_POINT_mul(group, p2, NULL, generator, k2, ctx));
195 /* Cofactor is 1 or 4 */
197 T(c = EC_GROUP_get0_cofactor(group));
198 T(BN_is_word(c, 1) || BN_is_word(c, 4));
204 int main(int argc, char **argv)
208 struct test_curve *tc;
209 for (tc = test_curves; tc->nid; tc++) {
210 ret |= parameter_test(tc);
214 printf(cDRED "= Some tests FAILED!\n" cNORM);
216 printf(cDGREEN "= All tests passed!\n" cNORM);