]> git.ipfire.org Git - thirdparty/openssl.git/blob - crypto/ec/ectest.c
fix warnings
[thirdparty/openssl.git] / crypto / ec / ectest.c
1 /* crypto/ec/ectest.c */
2 /*
3 * Originally written by Bodo Moeller for the OpenSSL project.
4 */
5 /* ====================================================================
6 * Copyright (c) 1998-2001 The OpenSSL Project. All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 *
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 *
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in
17 * the documentation and/or other materials provided with the
18 * distribution.
19 *
20 * 3. All advertising materials mentioning features or use of this
21 * software must display the following acknowledgment:
22 * "This product includes software developed by the OpenSSL Project
23 * for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
24 *
25 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
26 * endorse or promote products derived from this software without
27 * prior written permission. For written permission, please contact
28 * openssl-core@openssl.org.
29 *
30 * 5. Products derived from this software may not be called "OpenSSL"
31 * nor may "OpenSSL" appear in their names without prior written
32 * permission of the OpenSSL Project.
33 *
34 * 6. Redistributions of any form whatsoever must retain the following
35 * acknowledgment:
36 * "This product includes software developed by the OpenSSL Project
37 * for use in the OpenSSL Toolkit (http://www.openssl.org/)"
38 *
39 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
40 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
41 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
42 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
43 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
44 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
45 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
46 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
47 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
48 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
49 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
50 * OF THE POSSIBILITY OF SUCH DAMAGE.
51 * ====================================================================
52 *
53 * This product includes cryptographic software written by Eric Young
54 * (eay@cryptsoft.com). This product includes software written by Tim
55 * Hudson (tjh@cryptsoft.com).
56 *
57 */
58 /* ====================================================================
59 * Copyright 2002 Sun Microsystems, Inc. ALL RIGHTS RESERVED.
60 *
61 * Portions of the attached software ("Contribution") are developed by
62 * SUN MICROSYSTEMS, INC., and are contributed to the OpenSSL project.
63 *
64 * The Contribution is licensed pursuant to the OpenSSL open source
65 * license provided above.
66 *
67 * In addition, Sun covenants to all licensees who provide a reciprocal
68 * covenant with respect to their own patents if any, not to sue under
69 * current and future patent claims necessarily infringed by the making,
70 * using, practicing, selling, offering for sale and/or otherwise
71 * disposing of the Contribution as delivered hereunder
72 * (or portions thereof), provided that such covenant shall not apply:
73 * 1) for code that a licensee deletes from the Contribution;
74 * 2) separates from the Contribution; or
75 * 3) for infringements caused by:
76 * i) the modification of the Contribution or
77 * ii) the combination of the Contribution with other software or
78 * devices where such combination causes the infringement.
79 *
80 * The elliptic curve binary polynomial software is originally written by
81 * Sheueling Chang Shantz and Douglas Stebila of Sun Microsystems Laboratories.
82 *
83 */
84
85 #include <stdio.h>
86 #include <stdlib.h>
87 #include <string.h>
88 #include <time.h>
89
90
91 #ifdef OPENSSL_NO_EC
92 int main(int argc, char * argv[]) { puts("Elliptic curves are disabled."); return 0; }
93 #else
94
95
96 #include <openssl/ec.h>
97 #include <openssl/engine.h>
98 #include <openssl/err.h>
99 #include <openssl/obj_mac.h>
100
101 #define ABORT do { \
102 fflush(stdout); \
103 fprintf(stderr, "%s:%d: ABORT\n", __FILE__, __LINE__); \
104 ERR_print_errors_fp(stderr); \
105 exit(1); \
106 } while (0)
107
108 void prime_field_tests(void);
109 void char2_field_tests(void);
110
111 #if 0
112 static void timings(EC_GROUP *group, int multi, BN_CTX *ctx)
113 {
114 clock_t clck;
115 int i, j;
116 BIGNUM *s;
117 BIGNUM *r[10], *r0[10];
118 EC_POINT *P;
119
120 s = BN_new();
121 if (s == NULL) ABORT;
122
123 fprintf(stdout, "Timings for %d-bit field, ", EC_GROUP_get_degree(group));
124 if (!EC_GROUP_get_order(group, s, ctx)) ABORT;
125 fprintf(stdout, "%d-bit scalars ", (int)BN_num_bits(s));
126 fflush(stdout);
127
128 P = EC_POINT_new(group);
129 if (P == NULL) ABORT;
130 EC_POINT_copy(P, EC_GROUP_get0_generator(group));
131
132 for (i = 0; i < 10; i++)
133 {
134 if ((r[i] = BN_new()) == NULL) ABORT;
135 if (!BN_pseudo_rand(r[i], BN_num_bits(s), 0, 0)) ABORT;
136 if (multi)
137 {
138 if ((r0[i] = BN_new()) == NULL) ABORT;
139 if (!BN_pseudo_rand(r0[i], BN_num_bits(s), 0, 0)) ABORT;
140 }
141 }
142
143 clck = clock();
144 for (i = 0; i < 10; i++)
145 {
146 for (j = 0; j < 10; j++)
147 {
148 if (!EC_POINT_mul(group, P, r[i], multi ? P : NULL, multi ? r0[i] : NULL, ctx)) ABORT;
149 }
150 }
151 fprintf(stdout, "\n");
152
153 clck = clock() - clck;
154
155 #ifdef CLOCKS_PER_SEC
156 /* "To determine the time in seconds, the value returned
157 * by the clock function should be divided by the value
158 * of the macro CLOCKS_PER_SEC."
159 * -- ISO/IEC 9899 */
160 # define UNIT "s"
161 #else
162 /* "`CLOCKS_PER_SEC' undeclared (first use this function)"
163 * -- cc on NeXTstep/OpenStep */
164 # define UNIT "units"
165 # define CLOCKS_PER_SEC 1
166 #endif
167
168 fprintf(stdout, "%i %s in %.2f " UNIT "\n", i*j,
169 multi ? "s*P+t*Q operations" : "point multiplications",
170 (double)clck/CLOCKS_PER_SEC);
171 fprintf(stdout, "average: %.4f " UNIT "\n", (double)clck/(CLOCKS_PER_SEC*i*j));
172
173 EC_POINT_free(P);
174 BN_free(s);
175 for (i = 0; i < 10; i++)
176 {
177 BN_free(r[i]);
178 if (multi) BN_free(r0[i]);
179 }
180 }
181 #endif
182
183 void prime_field_tests()
184 {
185 BN_CTX *ctx = NULL;
186 BIGNUM *p, *a, *b;
187 EC_GROUP *group;
188 EC_GROUP *P_192 = NULL, *P_224 = NULL, *P_256 = NULL, *P_384 = NULL, *P_521 = NULL;
189 EC_POINT *P, *Q, *R;
190 BIGNUM *x, *y, *z;
191 unsigned char buf[100];
192 size_t i, len;
193 int k;
194
195 #if 1 /* optional */
196 ctx = BN_CTX_new();
197 if (!ctx) ABORT;
198 #endif
199
200 p = BN_new();
201 a = BN_new();
202 b = BN_new();
203 if (!p || !a || !b) ABORT;
204
205 if (!BN_hex2bn(&p, "17")) ABORT;
206 if (!BN_hex2bn(&a, "1")) ABORT;
207 if (!BN_hex2bn(&b, "1")) ABORT;
208
209 group = EC_GROUP_new(EC_GFp_mont_method()); /* applications should use EC_GROUP_new_curve_GFp
210 * so that the library gets to choose the EC_METHOD */
211 if (!group) ABORT;
212
213 if (!EC_GROUP_set_curve_GFp(group, p, a, b, ctx)) ABORT;
214
215 {
216 EC_GROUP *tmp;
217 tmp = EC_GROUP_new(EC_GROUP_method_of(group));
218 if (!tmp) ABORT;
219 if (!EC_GROUP_copy(tmp, group));
220 EC_GROUP_free(group);
221 group = tmp;
222 }
223
224 if (!EC_GROUP_get_curve_GFp(group, p, a, b, ctx)) ABORT;
225
226 fprintf(stdout, "Curve defined by Weierstrass equation\n y^2 = x^3 + a*x + b (mod 0x");
227 BN_print_fp(stdout, p);
228 fprintf(stdout, ")\n a = 0x");
229 BN_print_fp(stdout, a);
230 fprintf(stdout, "\n b = 0x");
231 BN_print_fp(stdout, b);
232 fprintf(stdout, "\n");
233
234 P = EC_POINT_new(group);
235 Q = EC_POINT_new(group);
236 R = EC_POINT_new(group);
237 if (!P || !Q || !R) ABORT;
238
239 if (!EC_POINT_set_to_infinity(group, P)) ABORT;
240 if (!EC_POINT_is_at_infinity(group, P)) ABORT;
241
242 buf[0] = 0;
243 if (!EC_POINT_oct2point(group, Q, buf, 1, ctx)) ABORT;
244
245 if (!EC_POINT_add(group, P, P, Q, ctx)) ABORT;
246 if (!EC_POINT_is_at_infinity(group, P)) ABORT;
247
248 x = BN_new();
249 y = BN_new();
250 z = BN_new();
251 if (!x || !y || !z) ABORT;
252
253 if (!BN_hex2bn(&x, "D")) ABORT;
254 if (!EC_POINT_set_compressed_coordinates_GFp(group, Q, x, 1, ctx)) ABORT;
255 if (!EC_POINT_is_on_curve(group, Q, ctx))
256 {
257 if (!EC_POINT_get_affine_coordinates_GFp(group, Q, x, y, ctx)) ABORT;
258 fprintf(stderr, "Point is not on curve: x = 0x");
259 BN_print_fp(stderr, x);
260 fprintf(stderr, ", y = 0x");
261 BN_print_fp(stderr, y);
262 fprintf(stderr, "\n");
263 ABORT;
264 }
265
266 fprintf(stdout, "A cyclic subgroup:\n");
267 k = 100;
268 do
269 {
270 if (k-- == 0) ABORT;
271
272 if (EC_POINT_is_at_infinity(group, P))
273 fprintf(stdout, " point at infinity\n");
274 else
275 {
276 if (!EC_POINT_get_affine_coordinates_GFp(group, P, x, y, ctx)) ABORT;
277
278 fprintf(stdout, " x = 0x");
279 BN_print_fp(stdout, x);
280 fprintf(stdout, ", y = 0x");
281 BN_print_fp(stdout, y);
282 fprintf(stdout, "\n");
283 }
284
285 if (!EC_POINT_copy(R, P)) ABORT;
286 if (!EC_POINT_add(group, P, P, Q, ctx)) ABORT;
287
288 #if 0 /* optional */
289 {
290 EC_POINT *points[3];
291
292 points[0] = R;
293 points[1] = Q;
294 points[2] = P;
295 if (!EC_POINTs_make_affine(group, 2, points, ctx)) ABORT;
296 }
297 #endif
298
299 }
300 while (!EC_POINT_is_at_infinity(group, P));
301
302 if (!EC_POINT_add(group, P, Q, R, ctx)) ABORT;
303 if (!EC_POINT_is_at_infinity(group, P)) ABORT;
304
305 len = EC_POINT_point2oct(group, Q, POINT_CONVERSION_COMPRESSED, buf, sizeof buf, ctx);
306 if (len == 0) ABORT;
307 if (!EC_POINT_oct2point(group, P, buf, len, ctx)) ABORT;
308 if (0 != EC_POINT_cmp(group, P, Q, ctx)) ABORT;
309 fprintf(stdout, "Generator as octect string, compressed form:\n ");
310 for (i = 0; i < len; i++) fprintf(stdout, "%02X", buf[i]);
311
312 len = EC_POINT_point2oct(group, Q, POINT_CONVERSION_UNCOMPRESSED, buf, sizeof buf, ctx);
313 if (len == 0) ABORT;
314 if (!EC_POINT_oct2point(group, P, buf, len, ctx)) ABORT;
315 if (0 != EC_POINT_cmp(group, P, Q, ctx)) ABORT;
316 fprintf(stdout, "\nGenerator as octect string, uncompressed form:\n ");
317 for (i = 0; i < len; i++) fprintf(stdout, "%02X", buf[i]);
318
319 len = EC_POINT_point2oct(group, Q, POINT_CONVERSION_HYBRID, buf, sizeof buf, ctx);
320 if (len == 0) ABORT;
321 if (!EC_POINT_oct2point(group, P, buf, len, ctx)) ABORT;
322 if (0 != EC_POINT_cmp(group, P, Q, ctx)) ABORT;
323 fprintf(stdout, "\nGenerator as octect string, hybrid form:\n ");
324 for (i = 0; i < len; i++) fprintf(stdout, "%02X", buf[i]);
325
326 if (!EC_POINT_get_Jprojective_coordinates_GFp(group, R, x, y, z, ctx)) ABORT;
327 fprintf(stdout, "\nA representation of the inverse of that generator in\nJacobian projective coordinates:\n X = 0x");
328 BN_print_fp(stdout, x);
329 fprintf(stdout, ", Y = 0x");
330 BN_print_fp(stdout, y);
331 fprintf(stdout, ", Z = 0x");
332 BN_print_fp(stdout, z);
333 fprintf(stdout, "\n");
334
335 if (!EC_POINT_invert(group, P, ctx)) ABORT;
336 if (0 != EC_POINT_cmp(group, P, R, ctx)) ABORT;
337
338
339 /* Curve P-192 (FIPS PUB 186-2, App. 6) */
340
341 if (!BN_hex2bn(&p, "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFFFFFFFFFF")) ABORT;
342 if (1 != BN_is_prime(p, BN_prime_checks, 0, ctx, NULL)) ABORT;
343 if (!BN_hex2bn(&a, "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFFFFFFFFFC")) ABORT;
344 if (!BN_hex2bn(&b, "64210519E59C80E70FA7E9AB72243049FEB8DEECC146B9B1")) ABORT;
345 if (!EC_GROUP_set_curve_GFp(group, p, a, b, ctx)) ABORT;
346
347 if (!BN_hex2bn(&x, "188DA80EB03090F67CBF20EB43A18800F4FF0AFD82FF1012")) ABORT;
348 if (!EC_POINT_set_compressed_coordinates_GFp(group, P, x, 1, ctx)) ABORT;
349 if (!EC_POINT_is_on_curve(group, P, ctx)) ABORT;
350 if (!BN_hex2bn(&z, "FFFFFFFFFFFFFFFFFFFFFFFF99DEF836146BC9B1B4D22831")) ABORT;
351 if (!EC_GROUP_set_generator(group, P, z, BN_value_one())) ABORT;
352
353 if (!EC_POINT_get_affine_coordinates_GFp(group, P, x, y, ctx)) ABORT;
354 fprintf(stdout, "\nNIST curve P-192 -- Generator:\n x = 0x");
355 BN_print_fp(stdout, x);
356 fprintf(stdout, "\n y = 0x");
357 BN_print_fp(stdout, y);
358 fprintf(stdout, "\n");
359 /* G_y value taken from the standard: */
360 if (!BN_hex2bn(&z, "07192B95FFC8DA78631011ED6B24CDD573F977A11E794811")) ABORT;
361 if (0 != BN_cmp(y, z)) ABORT;
362
363 fprintf(stdout, "verify degree ...");
364 if (EC_GROUP_get_degree(group) != 192) ABORT;
365 fprintf(stdout, " ok\n");
366
367 fprintf(stdout, "verify group order ...");
368 fflush(stdout);
369 if (!EC_GROUP_get_order(group, z, ctx)) ABORT;
370 if (!EC_POINT_mul(group, Q, z, NULL, NULL, ctx)) ABORT;
371 if (!EC_POINT_is_at_infinity(group, Q)) ABORT;
372 fprintf(stdout, ".");
373 fflush(stdout);
374 if (!EC_GROUP_precompute_mult(group, ctx)) ABORT;
375 if (!EC_POINT_mul(group, Q, z, NULL, NULL, ctx)) ABORT;
376 if (!EC_POINT_is_at_infinity(group, Q)) ABORT;
377 fprintf(stdout, " ok\n");
378
379 if (!(P_192 = EC_GROUP_new(EC_GROUP_method_of(group)))) ABORT;
380 if (!EC_GROUP_copy(P_192, group)) ABORT;
381
382
383 /* Curve P-224 (FIPS PUB 186-2, App. 6) */
384
385 if (!BN_hex2bn(&p, "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF000000000000000000000001")) ABORT;
386 if (1 != BN_is_prime(p, BN_prime_checks, 0, ctx, NULL)) ABORT;
387 if (!BN_hex2bn(&a, "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFE")) ABORT;
388 if (!BN_hex2bn(&b, "B4050A850C04B3ABF54132565044B0B7D7BFD8BA270B39432355FFB4")) ABORT;
389 if (!EC_GROUP_set_curve_GFp(group, p, a, b, ctx)) ABORT;
390
391 if (!BN_hex2bn(&x, "B70E0CBD6BB4BF7F321390B94A03C1D356C21122343280D6115C1D21")) ABORT;
392 if (!EC_POINT_set_compressed_coordinates_GFp(group, P, x, 0, ctx)) ABORT;
393 if (!EC_POINT_is_on_curve(group, P, ctx)) ABORT;
394 if (!BN_hex2bn(&z, "FFFFFFFFFFFFFFFFFFFFFFFFFFFF16A2E0B8F03E13DD29455C5C2A3D")) ABORT;
395 if (!EC_GROUP_set_generator(group, P, z, BN_value_one())) ABORT;
396
397 if (!EC_POINT_get_affine_coordinates_GFp(group, P, x, y, ctx)) ABORT;
398 fprintf(stdout, "\nNIST curve P-224 -- Generator:\n x = 0x");
399 BN_print_fp(stdout, x);
400 fprintf(stdout, "\n y = 0x");
401 BN_print_fp(stdout, y);
402 fprintf(stdout, "\n");
403 /* G_y value taken from the standard: */
404 if (!BN_hex2bn(&z, "BD376388B5F723FB4C22DFE6CD4375A05A07476444D5819985007E34")) ABORT;
405 if (0 != BN_cmp(y, z)) ABORT;
406
407 fprintf(stdout, "verify degree ...");
408 if (EC_GROUP_get_degree(group) != 224) ABORT;
409 fprintf(stdout, " ok\n");
410
411 fprintf(stdout, "verify group order ...");
412 fflush(stdout);
413 if (!EC_GROUP_get_order(group, z, ctx)) ABORT;
414 if (!EC_POINT_mul(group, Q, z, NULL, NULL, ctx)) ABORT;
415 if (!EC_POINT_is_at_infinity(group, Q)) ABORT;
416 fprintf(stdout, ".");
417 fflush(stdout);
418 if (!EC_GROUP_precompute_mult(group, ctx)) ABORT;
419 if (!EC_POINT_mul(group, Q, z, NULL, NULL, ctx)) ABORT;
420 if (!EC_POINT_is_at_infinity(group, Q)) ABORT;
421 fprintf(stdout, " ok\n");
422
423 if (!(P_224 = EC_GROUP_new(EC_GROUP_method_of(group)))) ABORT;
424 if (!EC_GROUP_copy(P_224, group)) ABORT;
425
426
427 /* Curve P-256 (FIPS PUB 186-2, App. 6) */
428
429 if (!BN_hex2bn(&p, "FFFFFFFF00000001000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFF")) ABORT;
430 if (1 != BN_is_prime(p, BN_prime_checks, 0, ctx, NULL)) ABORT;
431 if (!BN_hex2bn(&a, "FFFFFFFF00000001000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFC")) ABORT;
432 if (!BN_hex2bn(&b, "5AC635D8AA3A93E7B3EBBD55769886BC651D06B0CC53B0F63BCE3C3E27D2604B")) ABORT;
433 if (!EC_GROUP_set_curve_GFp(group, p, a, b, ctx)) ABORT;
434
435 if (!BN_hex2bn(&x, "6B17D1F2E12C4247F8BCE6E563A440F277037D812DEB33A0F4A13945D898C296")) ABORT;
436 if (!EC_POINT_set_compressed_coordinates_GFp(group, P, x, 1, ctx)) ABORT;
437 if (!EC_POINT_is_on_curve(group, P, ctx)) ABORT;
438 if (!BN_hex2bn(&z, "FFFFFFFF00000000FFFFFFFFFFFFFFFFBCE6FAADA7179E"
439 "84F3B9CAC2FC632551")) ABORT;
440 if (!EC_GROUP_set_generator(group, P, z, BN_value_one())) ABORT;
441
442 if (!EC_POINT_get_affine_coordinates_GFp(group, P, x, y, ctx)) ABORT;
443 fprintf(stdout, "\nNIST curve P-256 -- Generator:\n x = 0x");
444 BN_print_fp(stdout, x);
445 fprintf(stdout, "\n y = 0x");
446 BN_print_fp(stdout, y);
447 fprintf(stdout, "\n");
448 /* G_y value taken from the standard: */
449 if (!BN_hex2bn(&z, "4FE342E2FE1A7F9B8EE7EB4A7C0F9E162BCE33576B315ECECBB6406837BF51F5")) ABORT;
450 if (0 != BN_cmp(y, z)) ABORT;
451
452 fprintf(stdout, "verify degree ...");
453 if (EC_GROUP_get_degree(group) != 256) ABORT;
454 fprintf(stdout, " ok\n");
455
456 fprintf(stdout, "verify group order ...");
457 fflush(stdout);
458 if (!EC_GROUP_get_order(group, z, ctx)) ABORT;
459 if (!EC_POINT_mul(group, Q, z, NULL, NULL, ctx)) ABORT;
460 if (!EC_POINT_is_at_infinity(group, Q)) ABORT;
461 fprintf(stdout, ".");
462 fflush(stdout);
463 if (!EC_GROUP_precompute_mult(group, ctx)) ABORT;
464 if (!EC_POINT_mul(group, Q, z, NULL, NULL, ctx)) ABORT;
465 if (!EC_POINT_is_at_infinity(group, Q)) ABORT;
466 fprintf(stdout, " ok\n");
467
468 if (!(P_256 = EC_GROUP_new(EC_GROUP_method_of(group)))) ABORT;
469 if (!EC_GROUP_copy(P_256, group)) ABORT;
470
471
472 /* Curve P-384 (FIPS PUB 186-2, App. 6) */
473
474 if (!BN_hex2bn(&p, "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
475 "FFFFFFFFFFFFFFFFFEFFFFFFFF0000000000000000FFFFFFFF")) ABORT;
476 if (1 != BN_is_prime(p, BN_prime_checks, 0, ctx, NULL)) ABORT;
477 if (!BN_hex2bn(&a, "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
478 "FFFFFFFFFFFFFFFFFEFFFFFFFF0000000000000000FFFFFFFC")) ABORT;
479 if (!BN_hex2bn(&b, "B3312FA7E23EE7E4988E056BE3F82D19181D9C6EFE8141"
480 "120314088F5013875AC656398D8A2ED19D2A85C8EDD3EC2AEF")) ABORT;
481 if (!EC_GROUP_set_curve_GFp(group, p, a, b, ctx)) ABORT;
482
483 if (!BN_hex2bn(&x, "AA87CA22BE8B05378EB1C71EF320AD746E1D3B628BA79B"
484 "9859F741E082542A385502F25DBF55296C3A545E3872760AB7")) ABORT;
485 if (!EC_POINT_set_compressed_coordinates_GFp(group, P, x, 1, ctx)) ABORT;
486 if (!EC_POINT_is_on_curve(group, P, ctx)) ABORT;
487 if (!BN_hex2bn(&z, "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
488 "FFC7634D81F4372DDF581A0DB248B0A77AECEC196ACCC52973")) ABORT;
489 if (!EC_GROUP_set_generator(group, P, z, BN_value_one())) ABORT;
490
491 if (!EC_POINT_get_affine_coordinates_GFp(group, P, x, y, ctx)) ABORT;
492 fprintf(stdout, "\nNIST curve P-384 -- Generator:\n x = 0x");
493 BN_print_fp(stdout, x);
494 fprintf(stdout, "\n y = 0x");
495 BN_print_fp(stdout, y);
496 fprintf(stdout, "\n");
497 /* G_y value taken from the standard: */
498 if (!BN_hex2bn(&z, "3617DE4A96262C6F5D9E98BF9292DC29F8F41DBD289A14"
499 "7CE9DA3113B5F0B8C00A60B1CE1D7E819D7A431D7C90EA0E5F")) ABORT;
500 if (0 != BN_cmp(y, z)) ABORT;
501
502 fprintf(stdout, "verify degree ...");
503 if (EC_GROUP_get_degree(group) != 384) ABORT;
504 fprintf(stdout, " ok\n");
505
506 fprintf(stdout, "verify group order ...");
507 fflush(stdout);
508 if (!EC_GROUP_get_order(group, z, ctx)) ABORT;
509 if (!EC_POINT_mul(group, Q, z, NULL, NULL, ctx)) ABORT;
510 if (!EC_POINT_is_at_infinity(group, Q)) ABORT;
511 fprintf(stdout, ".");
512 fflush(stdout);
513 if (!EC_GROUP_precompute_mult(group, ctx)) ABORT;
514 if (!EC_POINT_mul(group, Q, z, NULL, NULL, ctx)) ABORT;
515 if (!EC_POINT_is_at_infinity(group, Q)) ABORT;
516 fprintf(stdout, " ok\n");
517
518 if (!(P_384 = EC_GROUP_new(EC_GROUP_method_of(group)))) ABORT;
519 if (!EC_GROUP_copy(P_384, group)) ABORT;
520
521
522 /* Curve P-521 (FIPS PUB 186-2, App. 6) */
523
524 if (!BN_hex2bn(&p, "1FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
525 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
526 "FFFFFFFFFFFFFFFFFFFFFFFFFFFF")) ABORT;
527 if (1 != BN_is_prime(p, BN_prime_checks, 0, ctx, NULL)) ABORT;
528 if (!BN_hex2bn(&a, "1FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
529 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
530 "FFFFFFFFFFFFFFFFFFFFFFFFFFFC")) ABORT;
531 if (!BN_hex2bn(&b, "051953EB9618E1C9A1F929A21A0B68540EEA2DA725B99B"
532 "315F3B8B489918EF109E156193951EC7E937B1652C0BD3BB1BF073573"
533 "DF883D2C34F1EF451FD46B503F00")) ABORT;
534 if (!EC_GROUP_set_curve_GFp(group, p, a, b, ctx)) ABORT;
535
536 if (!BN_hex2bn(&x, "C6858E06B70404E9CD9E3ECB662395B4429C648139053F"
537 "B521F828AF606B4D3DBAA14B5E77EFE75928FE1DC127A2FFA8DE3348B"
538 "3C1856A429BF97E7E31C2E5BD66")) ABORT;
539 if (!EC_POINT_set_compressed_coordinates_GFp(group, P, x, 0, ctx)) ABORT;
540 if (!EC_POINT_is_on_curve(group, P, ctx)) ABORT;
541 if (!BN_hex2bn(&z, "1FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
542 "FFFFFFFFFFFFFFFFFFFFA51868783BF2F966B7FCC0148F709A5D03BB5"
543 "C9B8899C47AEBB6FB71E91386409")) ABORT;
544 if (!EC_GROUP_set_generator(group, P, z, BN_value_one())) ABORT;
545
546 if (!EC_POINT_get_affine_coordinates_GFp(group, P, x, y, ctx)) ABORT;
547 fprintf(stdout, "\nNIST curve P-521 -- Generator:\n x = 0x");
548 BN_print_fp(stdout, x);
549 fprintf(stdout, "\n y = 0x");
550 BN_print_fp(stdout, y);
551 fprintf(stdout, "\n");
552 /* G_y value taken from the standard: */
553 if (!BN_hex2bn(&z, "11839296A789A3BC0045C8A5FB42C7D1BD998F54449579"
554 "B446817AFBD17273E662C97EE72995EF42640C550B9013FAD0761353C"
555 "7086A272C24088BE94769FD16650")) ABORT;
556 if (0 != BN_cmp(y, z)) ABORT;
557
558 fprintf(stdout, "verify degree ...");
559 if (EC_GROUP_get_degree(group) != 521) ABORT;
560 fprintf(stdout, " ok\n");
561
562 fprintf(stdout, "verify group order ...");
563 fflush(stdout);
564 if (!EC_GROUP_get_order(group, z, ctx)) ABORT;
565 if (!EC_POINT_mul(group, Q, z, NULL, NULL, ctx)) ABORT;
566 if (!EC_POINT_is_at_infinity(group, Q)) ABORT;
567 fprintf(stdout, ".");
568 fflush(stdout);
569 if (!EC_GROUP_precompute_mult(group, ctx)) ABORT;
570 if (!EC_POINT_mul(group, Q, z, NULL, NULL, ctx)) ABORT;
571 if (!EC_POINT_is_at_infinity(group, Q)) ABORT;
572 fprintf(stdout, " ok\n");
573
574 if (!(P_521 = EC_GROUP_new(EC_GROUP_method_of(group)))) ABORT;
575 if (!EC_GROUP_copy(P_521, group)) ABORT;
576
577
578 /* more tests using the last curve */
579
580 if (!EC_POINT_copy(Q, P)) ABORT;
581 if (EC_POINT_is_at_infinity(group, Q)) ABORT;
582 if (!EC_POINT_dbl(group, P, P, ctx)) ABORT;
583 if (!EC_POINT_is_on_curve(group, P, ctx)) ABORT;
584 if (!EC_POINT_invert(group, Q, ctx)) ABORT; /* P = -2Q */
585
586 if (!EC_POINT_add(group, R, P, Q, ctx)) ABORT;
587 if (!EC_POINT_add(group, R, R, Q, ctx)) ABORT;
588 if (!EC_POINT_is_at_infinity(group, R)) ABORT; /* R = P + 2Q */
589
590 {
591 const EC_POINT *points[3];
592 const BIGNUM *scalars[3];
593
594 if (EC_POINT_is_at_infinity(group, Q)) ABORT;
595 points[0] = Q;
596 points[1] = Q;
597 points[2] = Q;
598
599 if (!BN_add(y, z, BN_value_one())) ABORT;
600 if (BN_is_odd(y)) ABORT;
601 if (!BN_rshift1(y, y)) ABORT;
602 scalars[0] = y; /* (group order + 1)/2, so y*Q + y*Q = Q */
603 scalars[1] = y;
604
605 fprintf(stdout, "combined multiplication ...");
606 fflush(stdout);
607
608 /* z is still the group order */
609 if (!EC_POINTs_mul(group, P, NULL, 2, points, scalars, ctx)) ABORT;
610 if (!EC_POINTs_mul(group, R, z, 2, points, scalars, ctx)) ABORT;
611 if (0 != EC_POINT_cmp(group, P, R, ctx)) ABORT;
612 if (0 != EC_POINT_cmp(group, R, Q, ctx)) ABORT;
613
614 fprintf(stdout, ".");
615 fflush(stdout);
616
617 if (!BN_pseudo_rand(y, BN_num_bits(y), 0, 0)) ABORT;
618 if (!BN_add(z, z, y)) ABORT;
619 z->neg = 1;
620 scalars[0] = y;
621 scalars[1] = z; /* z = -(order + y) */
622
623 if (!EC_POINTs_mul(group, P, NULL, 2, points, scalars, ctx)) ABORT;
624 if (!EC_POINT_is_at_infinity(group, P)) ABORT;
625
626 fprintf(stdout, ".");
627 fflush(stdout);
628
629 if (!BN_pseudo_rand(x, BN_num_bits(y) - 1, 0, 0)) ABORT;
630 if (!BN_add(z, x, y)) ABORT;
631 z->neg = 1;
632 scalars[0] = x;
633 scalars[1] = y;
634 scalars[2] = z; /* z = -(x+y) */
635
636 if (!EC_POINTs_mul(group, P, NULL, 3, points, scalars, ctx)) ABORT;
637 if (!EC_POINT_is_at_infinity(group, P)) ABORT;
638
639 fprintf(stdout, " ok\n\n");
640 }
641
642
643 #if 0
644 timings(P_192, 0, ctx);
645 timings(P_192, 1, ctx);
646 timings(P_224, 0, ctx);
647 timings(P_224, 1, ctx);
648 timings(P_256, 0, ctx);
649 timings(P_256, 1, ctx);
650 timings(P_384, 0, ctx);
651 timings(P_384, 1, ctx);
652 timings(P_521, 0, ctx);
653 timings(P_521, 1, ctx);
654 #endif
655
656
657 if (ctx)
658 BN_CTX_free(ctx);
659 BN_free(p); BN_free(a); BN_free(b);
660 EC_GROUP_free(group);
661 EC_POINT_free(P);
662 EC_POINT_free(Q);
663 EC_POINT_free(R);
664 BN_free(x); BN_free(y); BN_free(z);
665
666 if (P_192) EC_GROUP_free(P_192);
667 if (P_224) EC_GROUP_free(P_224);
668 if (P_256) EC_GROUP_free(P_256);
669 if (P_384) EC_GROUP_free(P_384);
670 if (P_521) EC_GROUP_free(P_521);
671
672 }
673
674 /* Change test based on whether binary point compression is enabled or not. */
675 #ifdef OPENSSL_EC_BIN_PT_COMP
676 #define CHAR2_CURVE_TEST_INTERNAL(_name, _p, _a, _b, _x, _y, _y_bit, _order, _cof, _degree, _variable) \
677 if (!BN_hex2bn(&x, _x)) ABORT; \
678 if (!EC_POINT_set_compressed_coordinates_GF2m(group, P, x, _y_bit, ctx)) ABORT; \
679 if (!EC_POINT_is_on_curve(group, P, ctx)) ABORT; \
680 if (!BN_hex2bn(&z, _order)) ABORT; \
681 if (!BN_hex2bn(&cof, _cof)) ABORT; \
682 if (!EC_GROUP_set_generator(group, P, z, cof)) ABORT; \
683 if (!EC_POINT_get_affine_coordinates_GF2m(group, P, x, y, ctx)) ABORT; \
684 fprintf(stdout, "\n%s -- Generator:\n x = 0x", _name); \
685 BN_print_fp(stdout, x); \
686 fprintf(stdout, "\n y = 0x"); \
687 BN_print_fp(stdout, y); \
688 fprintf(stdout, "\n"); \
689 /* G_y value taken from the standard: */ \
690 if (!BN_hex2bn(&z, _y)) ABORT; \
691 if (0 != BN_cmp(y, z)) ABORT;
692 #else
693 #define CHAR2_CURVE_TEST_INTERNAL(_name, _p, _a, _b, _x, _y, _y_bit, _order, _cof, _degree, _variable) \
694 if (!BN_hex2bn(&x, _x)) ABORT; \
695 if (!BN_hex2bn(&y, _y)) ABORT; \
696 if (!EC_POINT_set_affine_coordinates_GF2m(group, P, x, y, ctx)) ABORT; \
697 if (!EC_POINT_is_on_curve(group, P, ctx)) ABORT; \
698 if (!BN_hex2bn(&z, _order)) ABORT; \
699 if (!BN_hex2bn(&cof, _cof)) ABORT; \
700 if (!EC_GROUP_set_generator(group, P, z, cof)) ABORT; \
701 fprintf(stdout, "\n%s -- Generator:\n x = 0x", _name); \
702 BN_print_fp(stdout, x); \
703 fprintf(stdout, "\n y = 0x"); \
704 BN_print_fp(stdout, y); \
705 fprintf(stdout, "\n");
706 #endif
707
708 #define CHAR2_CURVE_TEST(_name, _p, _a, _b, _x, _y, _y_bit, _order, _cof, _degree, _variable) \
709 if (!BN_hex2bn(&p, _p)) ABORT; \
710 if (!BN_hex2bn(&a, _a)) ABORT; \
711 if (!BN_hex2bn(&b, _b)) ABORT; \
712 if (!EC_GROUP_set_curve_GF2m(group, p, a, b, ctx)) ABORT; \
713 CHAR2_CURVE_TEST_INTERNAL(_name, _p, _a, _b, _x, _y, _y_bit, _order, _cof, _degree, _variable) \
714 fprintf(stdout, "verify degree ..."); \
715 if (EC_GROUP_get_degree(group) != _degree) ABORT; \
716 fprintf(stdout, " ok\n"); \
717 fprintf(stdout, "verify group order ..."); \
718 fflush(stdout); \
719 if (!EC_GROUP_get_order(group, z, ctx)) ABORT; \
720 if (!EC_POINT_mul(group, Q, z, NULL, NULL, ctx)) ABORT; \
721 if (!EC_POINT_is_at_infinity(group, Q)) ABORT; \
722 fprintf(stdout, "."); \
723 fflush(stdout); \
724 if (!EC_GROUP_precompute_mult(group, ctx)) ABORT; \
725 if (!EC_POINT_mul(group, Q, z, NULL, NULL, ctx)) ABORT; \
726 if (!EC_POINT_is_at_infinity(group, Q)) ABORT; \
727 fprintf(stdout, " ok\n"); \
728 if (!(_variable = EC_GROUP_new(EC_GROUP_method_of(group)))) ABORT; \
729 if (!EC_GROUP_copy(_variable, group)) ABORT;
730
731 void char2_field_tests()
732 {
733 BN_CTX *ctx = NULL;
734 BIGNUM *p, *a, *b;
735 EC_GROUP *group;
736 EC_GROUP *C2_K163 = NULL, *C2_K233 = NULL, *C2_K283 = NULL, *C2_K409 = NULL, *C2_K571 = NULL;
737 EC_GROUP *C2_B163 = NULL, *C2_B233 = NULL, *C2_B283 = NULL, *C2_B409 = NULL, *C2_B571 = NULL;
738 EC_POINT *P, *Q, *R;
739 BIGNUM *x, *y, *z, *cof;
740 unsigned char buf[100];
741 size_t i, len;
742 int k;
743
744 #if 1 /* optional */
745 ctx = BN_CTX_new();
746 if (!ctx) ABORT;
747 #endif
748
749 p = BN_new();
750 a = BN_new();
751 b = BN_new();
752 if (!p || !a || !b) ABORT;
753
754 if (!BN_hex2bn(&p, "13")) ABORT;
755 if (!BN_hex2bn(&a, "3")) ABORT;
756 if (!BN_hex2bn(&b, "1")) ABORT;
757
758 group = EC_GROUP_new(EC_GF2m_simple_method()); /* applications should use EC_GROUP_new_curve_GF2m
759 * so that the library gets to choose the EC_METHOD */
760 if (!group) ABORT;
761 if (!EC_GROUP_set_curve_GF2m(group, p, a, b, ctx)) ABORT;
762
763 {
764 EC_GROUP *tmp;
765 tmp = EC_GROUP_new(EC_GROUP_method_of(group));
766 if (!tmp) ABORT;
767 if (!EC_GROUP_copy(tmp, group));
768 EC_GROUP_free(group);
769 group = tmp;
770 }
771
772 if (!EC_GROUP_get_curve_GF2m(group, p, a, b, ctx)) ABORT;
773
774 fprintf(stdout, "Curve defined by Weierstrass equation\n y^2 + x*y = x^3 + a*x^2 + b (mod 0x");
775 BN_print_fp(stdout, p);
776 fprintf(stdout, ")\n a = 0x");
777 BN_print_fp(stdout, a);
778 fprintf(stdout, "\n b = 0x");
779 BN_print_fp(stdout, b);
780 fprintf(stdout, "\n(0x... means binary polynomial)\n");
781
782 P = EC_POINT_new(group);
783 Q = EC_POINT_new(group);
784 R = EC_POINT_new(group);
785 if (!P || !Q || !R) ABORT;
786
787 if (!EC_POINT_set_to_infinity(group, P)) ABORT;
788 if (!EC_POINT_is_at_infinity(group, P)) ABORT;
789
790 buf[0] = 0;
791 if (!EC_POINT_oct2point(group, Q, buf, 1, ctx)) ABORT;
792
793 if (!EC_POINT_add(group, P, P, Q, ctx)) ABORT;
794 if (!EC_POINT_is_at_infinity(group, P)) ABORT;
795
796 x = BN_new();
797 y = BN_new();
798 z = BN_new();
799 cof = BN_new();
800 if (!x || !y || !z || !cof) ABORT;
801
802 if (!BN_hex2bn(&x, "6")) ABORT;
803 /* Change test based on whether binary point compression is enabled or not. */
804 #ifdef OPENSSL_EC_BIN_PT_COMP
805 if (!EC_POINT_set_compressed_coordinates_GF2m(group, Q, x, 1, ctx)) ABORT;
806 #else
807 if (!BN_hex2bn(&y, "8")) ABORT;
808 if (!EC_POINT_set_affine_coordinates_GF2m(group, Q, x, y, ctx)) ABORT;
809 #endif
810 if (!EC_POINT_is_on_curve(group, Q, ctx))
811 {
812 /* Change test based on whether binary point compression is enabled or not. */
813 #ifdef OPENSSL_EC_BIN_PT_COMP
814 if (!EC_POINT_get_affine_coordinates_GF2m(group, Q, x, y, ctx)) ABORT;
815 #endif
816 fprintf(stderr, "Point is not on curve: x = 0x");
817 BN_print_fp(stderr, x);
818 fprintf(stderr, ", y = 0x");
819 BN_print_fp(stderr, y);
820 fprintf(stderr, "\n");
821 ABORT;
822 }
823
824 fprintf(stdout, "A cyclic subgroup:\n");
825 k = 100;
826 do
827 {
828 if (k-- == 0) ABORT;
829
830 if (EC_POINT_is_at_infinity(group, P))
831 fprintf(stdout, " point at infinity\n");
832 else
833 {
834 if (!EC_POINT_get_affine_coordinates_GF2m(group, P, x, y, ctx)) ABORT;
835
836 fprintf(stdout, " x = 0x");
837 BN_print_fp(stdout, x);
838 fprintf(stdout, ", y = 0x");
839 BN_print_fp(stdout, y);
840 fprintf(stdout, "\n");
841 }
842
843 if (!EC_POINT_copy(R, P)) ABORT;
844 if (!EC_POINT_add(group, P, P, Q, ctx)) ABORT;
845 }
846 while (!EC_POINT_is_at_infinity(group, P));
847
848 if (!EC_POINT_add(group, P, Q, R, ctx)) ABORT;
849 if (!EC_POINT_is_at_infinity(group, P)) ABORT;
850
851 /* Change test based on whether binary point compression is enabled or not. */
852 #ifdef OPENSSL_EC_BIN_PT_COMP
853 len = EC_POINT_point2oct(group, Q, POINT_CONVERSION_COMPRESSED, buf, sizeof buf, ctx);
854 if (len == 0) ABORT;
855 if (!EC_POINT_oct2point(group, P, buf, len, ctx)) ABORT;
856 if (0 != EC_POINT_cmp(group, P, Q, ctx)) ABORT;
857 fprintf(stdout, "Generator as octet string, compressed form:\n ");
858 for (i = 0; i < len; i++) fprintf(stdout, "%02X", buf[i]);
859 #endif
860
861 len = EC_POINT_point2oct(group, Q, POINT_CONVERSION_UNCOMPRESSED, buf, sizeof buf, ctx);
862 if (len == 0) ABORT;
863 if (!EC_POINT_oct2point(group, P, buf, len, ctx)) ABORT;
864 if (0 != EC_POINT_cmp(group, P, Q, ctx)) ABORT;
865 fprintf(stdout, "\nGenerator as octet string, uncompressed form:\n ");
866 for (i = 0; i < len; i++) fprintf(stdout, "%02X", buf[i]);
867
868 /* Change test based on whether binary point compression is enabled or not. */
869 #ifdef OPENSSL_EC_BIN_PT_COMP
870 len = EC_POINT_point2oct(group, Q, POINT_CONVERSION_HYBRID, buf, sizeof buf, ctx);
871 if (len == 0) ABORT;
872 if (!EC_POINT_oct2point(group, P, buf, len, ctx)) ABORT;
873 if (0 != EC_POINT_cmp(group, P, Q, ctx)) ABORT;
874 fprintf(stdout, "\nGenerator as octet string, hybrid form:\n ");
875 for (i = 0; i < len; i++) fprintf(stdout, "%02X", buf[i]);
876 #endif
877
878 fprintf(stdout, "\n");
879
880 if (!EC_POINT_invert(group, P, ctx)) ABORT;
881 if (0 != EC_POINT_cmp(group, P, R, ctx)) ABORT;
882
883
884 /* Curve K-163 (FIPS PUB 186-2, App. 6) */
885 CHAR2_CURVE_TEST
886 (
887 "NIST curve K-163",
888 "0800000000000000000000000000000000000000C9",
889 "1",
890 "1",
891 "02FE13C0537BBC11ACAA07D793DE4E6D5E5C94EEE8",
892 "0289070FB05D38FF58321F2E800536D538CCDAA3D9",
893 1,
894 "04000000000000000000020108A2E0CC0D99F8A5EF",
895 "2",
896 163,
897 C2_K163
898 );
899
900 /* Curve B-163 (FIPS PUB 186-2, App. 6) */
901 CHAR2_CURVE_TEST
902 (
903 "NIST curve B-163",
904 "0800000000000000000000000000000000000000C9",
905 "1",
906 "020A601907B8C953CA1481EB10512F78744A3205FD",
907 "03F0EBA16286A2D57EA0991168D4994637E8343E36",
908 "00D51FBC6C71A0094FA2CDD545B11C5C0C797324F1",
909 1,
910 "040000000000000000000292FE77E70C12A4234C33",
911 "2",
912 163,
913 C2_B163
914 );
915
916 /* Curve K-233 (FIPS PUB 186-2, App. 6) */
917 CHAR2_CURVE_TEST
918 (
919 "NIST curve K-233",
920 "020000000000000000000000000000000000000004000000000000000001",
921 "0",
922 "1",
923 "017232BA853A7E731AF129F22FF4149563A419C26BF50A4C9D6EEFAD6126",
924 "01DB537DECE819B7F70F555A67C427A8CD9BF18AEB9B56E0C11056FAE6A3",
925 0,
926 "008000000000000000000000000000069D5BB915BCD46EFB1AD5F173ABDF",
927 "4",
928 233,
929 C2_K233
930 );
931
932 /* Curve B-233 (FIPS PUB 186-2, App. 6) */
933 CHAR2_CURVE_TEST
934 (
935 "NIST curve B-233",
936 "020000000000000000000000000000000000000004000000000000000001",
937 "000000000000000000000000000000000000000000000000000000000001",
938 "0066647EDE6C332C7F8C0923BB58213B333B20E9CE4281FE115F7D8F90AD",
939 "00FAC9DFCBAC8313BB2139F1BB755FEF65BC391F8B36F8F8EB7371FD558B",
940 "01006A08A41903350678E58528BEBF8A0BEFF867A7CA36716F7E01F81052",
941 1,
942 "01000000000000000000000000000013E974E72F8A6922031D2603CFE0D7",
943 "2",
944 233,
945 C2_B233
946 );
947
948 /* Curve K-283 (FIPS PUB 186-2, App. 6) */
949 CHAR2_CURVE_TEST
950 (
951 "NIST curve K-283",
952 "0800000000000000000000000000000000000000000000000000000000000000000010A1",
953 "0",
954 "1",
955 "0503213F78CA44883F1A3B8162F188E553CD265F23C1567A16876913B0C2AC2458492836",
956 "01CCDA380F1C9E318D90F95D07E5426FE87E45C0E8184698E45962364E34116177DD2259",
957 0,
958 "01FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFE9AE2ED07577265DFF7F94451E061E163C61",
959 "4",
960 283,
961 C2_K283
962 );
963
964 /* Curve B-283 (FIPS PUB 186-2, App. 6) */
965 CHAR2_CURVE_TEST
966 (
967 "NIST curve B-283",
968 "0800000000000000000000000000000000000000000000000000000000000000000010A1",
969 "000000000000000000000000000000000000000000000000000000000000000000000001",
970 "027B680AC8B8596DA5A4AF8A19A0303FCA97FD7645309FA2A581485AF6263E313B79A2F5",
971 "05F939258DB7DD90E1934F8C70B0DFEC2EED25B8557EAC9C80E2E198F8CDBECD86B12053",
972 "03676854FE24141CB98FE6D4B20D02B4516FF702350EDDB0826779C813F0DF45BE8112F4",
973 1,
974 "03FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEF90399660FC938A90165B042A7CEFADB307",
975 "2",
976 283,
977 C2_B283
978 );
979
980 /* Curve K-409 (FIPS PUB 186-2, App. 6) */
981 CHAR2_CURVE_TEST
982 (
983 "NIST curve K-409",
984 "02000000000000000000000000000000000000000000000000000000000000000000000000000000008000000000000000000001",
985 "0",
986 "1",
987 "0060F05F658F49C1AD3AB1890F7184210EFD0987E307C84C27ACCFB8F9F67CC2C460189EB5AAAA62EE222EB1B35540CFE9023746",
988 "01E369050B7C4E42ACBA1DACBF04299C3460782F918EA427E6325165E9EA10E3DA5F6C42E9C55215AA9CA27A5863EC48D8E0286B",
989 1,
990 "007FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFE5F83B2D4EA20400EC4557D5ED3E3E7CA5B4B5C83B8E01E5FCF",
991 "4",
992 409,
993 C2_K409
994 );
995
996 /* Curve B-409 (FIPS PUB 186-2, App. 6) */
997 CHAR2_CURVE_TEST
998 (
999 "NIST curve B-409",
1000 "02000000000000000000000000000000000000000000000000000000000000000000000000000000008000000000000000000001",
1001 "00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001",
1002 "0021A5C2C8EE9FEB5C4B9A753B7B476B7FD6422EF1F3DD674761FA99D6AC27C8A9A197B272822F6CD57A55AA4F50AE317B13545F",
1003 "015D4860D088DDB3496B0C6064756260441CDE4AF1771D4DB01FFE5B34E59703DC255A868A1180515603AEAB60794E54BB7996A7",
1004 "0061B1CFAB6BE5F32BBFA78324ED106A7636B9C5A7BD198D0158AA4F5488D08F38514F1FDF4B4F40D2181B3681C364BA0273C706",
1005 1,
1006 "010000000000000000000000000000000000000000000000000001E2AAD6A612F33307BE5FA47C3C9E052F838164CD37D9A21173",
1007 "2",
1008 409,
1009 C2_B409
1010 );
1011
1012 /* Curve K-571 (FIPS PUB 186-2, App. 6) */
1013 CHAR2_CURVE_TEST
1014 (
1015 "NIST curve K-571",
1016 "80000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000425",
1017 "0",
1018 "1",
1019 "026EB7A859923FBC82189631F8103FE4AC9CA2970012D5D46024804801841CA44370958493B205E647DA304DB4CEB08CBBD1BA39494776FB988B47174DCA88C7E2945283A01C8972",
1020 "0349DC807F4FBF374F4AEADE3BCA95314DD58CEC9F307A54FFC61EFC006D8A2C9D4979C0AC44AEA74FBEBBB9F772AEDCB620B01A7BA7AF1B320430C8591984F601CD4C143EF1C7A3",
1021 0,
1022 "020000000000000000000000000000000000000000000000000000000000000000000000131850E1F19A63E4B391A8DB917F4138B630D84BE5D639381E91DEB45CFE778F637C1001",
1023 "4",
1024 571,
1025 C2_K571
1026 );
1027
1028 /* Curve B-571 (FIPS PUB 186-2, App. 6) */
1029 CHAR2_CURVE_TEST
1030 (
1031 "NIST curve B-571",
1032 "80000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000425",
1033 "000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001",
1034 "02F40E7E2221F295DE297117B7F3D62F5C6A97FFCB8CEFF1CD6BA8CE4A9A18AD84FFABBD8EFA59332BE7AD6756A66E294AFD185A78FF12AA520E4DE739BACA0C7FFEFF7F2955727A",
1035 "0303001D34B856296C16C0D40D3CD7750A93D1D2955FA80AA5F40FC8DB7B2ABDBDE53950F4C0D293CDD711A35B67FB1499AE60038614F1394ABFA3B4C850D927E1E7769C8EEC2D19",
1036 "037BF27342DA639B6DCCFFFEB73D69D78C6C27A6009CBBCA1980F8533921E8A684423E43BAB08A576291AF8F461BB2A8B3531D2F0485C19B16E2F1516E23DD3C1A4827AF1B8AC15B",
1037 1,
1038 "03FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFE661CE18FF55987308059B186823851EC7DD9CA1161DE93D5174D66E8382E9BB2FE84E47",
1039 "2",
1040 571,
1041 C2_B571
1042 );
1043
1044 /* more tests using the last curve */
1045
1046 if (!EC_POINT_copy(Q, P)) ABORT;
1047 if (EC_POINT_is_at_infinity(group, Q)) ABORT;
1048 if (!EC_POINT_dbl(group, P, P, ctx)) ABORT;
1049 if (!EC_POINT_is_on_curve(group, P, ctx)) ABORT;
1050 if (!EC_POINT_invert(group, Q, ctx)) ABORT; /* P = -2Q */
1051
1052 if (!EC_POINT_add(group, R, P, Q, ctx)) ABORT;
1053 if (!EC_POINT_add(group, R, R, Q, ctx)) ABORT;
1054 if (!EC_POINT_is_at_infinity(group, R)) ABORT; /* R = P + 2Q */
1055
1056 {
1057 const EC_POINT *points[3];
1058 const BIGNUM *scalars[3];
1059
1060 if (EC_POINT_is_at_infinity(group, Q)) ABORT;
1061 points[0] = Q;
1062 points[1] = Q;
1063 points[2] = Q;
1064
1065 if (!BN_add(y, z, BN_value_one())) ABORT;
1066 if (BN_is_odd(y)) ABORT;
1067 if (!BN_rshift1(y, y)) ABORT;
1068 scalars[0] = y; /* (group order + 1)/2, so y*Q + y*Q = Q */
1069 scalars[1] = y;
1070
1071 fprintf(stdout, "combined multiplication ...");
1072 fflush(stdout);
1073
1074 /* z is still the group order */
1075 if (!EC_POINTs_mul(group, P, NULL, 2, points, scalars, ctx)) ABORT;
1076 if (!EC_POINTs_mul(group, R, z, 2, points, scalars, ctx)) ABORT;
1077 if (0 != EC_POINT_cmp(group, P, R, ctx)) ABORT;
1078 if (0 != EC_POINT_cmp(group, R, Q, ctx)) ABORT;
1079
1080 fprintf(stdout, ".");
1081 fflush(stdout);
1082
1083 if (!BN_pseudo_rand(y, BN_num_bits(y), 0, 0)) ABORT;
1084 if (!BN_add(z, z, y)) ABORT;
1085 z->neg = 1;
1086 scalars[0] = y;
1087 scalars[1] = z; /* z = -(order + y) */
1088
1089 if (!EC_POINTs_mul(group, P, NULL, 2, points, scalars, ctx)) ABORT;
1090 if (!EC_POINT_is_at_infinity(group, P)) ABORT;
1091
1092 fprintf(stdout, ".");
1093 fflush(stdout);
1094
1095 if (!BN_pseudo_rand(x, BN_num_bits(y) - 1, 0, 0)) ABORT;
1096 if (!BN_add(z, x, y)) ABORT;
1097 z->neg = 1;
1098 scalars[0] = x;
1099 scalars[1] = y;
1100 scalars[2] = z; /* z = -(x+y) */
1101
1102 if (!EC_POINTs_mul(group, P, NULL, 3, points, scalars, ctx)) ABORT;
1103 if (!EC_POINT_is_at_infinity(group, P)) ABORT;
1104
1105 fprintf(stdout, " ok\n\n");
1106 }
1107
1108
1109 #if 0
1110 timings(C2_K163, 0, ctx);
1111 timings(C2_K163, 1, ctx);
1112 timings(C2_B163, 0, ctx);
1113 timings(C2_B163, 1, ctx);
1114 timings(C2_K233, 0, ctx);
1115 timings(C2_K233, 1, ctx);
1116 timings(C2_B233, 0, ctx);
1117 timings(C2_B233, 1, ctx);
1118 timings(C2_K283, 0, ctx);
1119 timings(C2_K283, 1, ctx);
1120 timings(C2_B283, 0, ctx);
1121 timings(C2_B283, 1, ctx);
1122 timings(C2_K409, 0, ctx);
1123 timings(C2_K409, 1, ctx);
1124 timings(C2_B409, 0, ctx);
1125 timings(C2_B409, 1, ctx);
1126 timings(C2_K571, 0, ctx);
1127 timings(C2_K571, 1, ctx);
1128 timings(C2_B571, 0, ctx);
1129 timings(C2_B571, 1, ctx);
1130 #endif
1131
1132
1133 if (ctx)
1134 BN_CTX_free(ctx);
1135 BN_free(p); BN_free(a); BN_free(b);
1136 EC_GROUP_free(group);
1137 EC_POINT_free(P);
1138 EC_POINT_free(Q);
1139 EC_POINT_free(R);
1140 BN_free(x); BN_free(y); BN_free(z); BN_free(cof);
1141
1142 if (C2_K163) EC_GROUP_free(C2_K163);
1143 if (C2_B163) EC_GROUP_free(C2_B163);
1144 if (C2_K233) EC_GROUP_free(C2_K233);
1145 if (C2_B233) EC_GROUP_free(C2_B233);
1146 if (C2_K283) EC_GROUP_free(C2_K283);
1147 if (C2_B283) EC_GROUP_free(C2_B283);
1148 if (C2_K409) EC_GROUP_free(C2_K409);
1149 if (C2_B409) EC_GROUP_free(C2_B409);
1150 if (C2_K571) EC_GROUP_free(C2_K571);
1151 if (C2_B571) EC_GROUP_free(C2_B571);
1152
1153 }
1154
1155 static const char rnd_seed[] = "string to make the random number generator think it has entropy";
1156
1157 int main(int argc, char *argv[])
1158 {
1159
1160 /* enable memory leak checking unless explicitly disabled */
1161 if (!((getenv("OPENSSL_DEBUG_MEMORY") != NULL) && (0 == strcmp(getenv("OPENSSL_DEBUG_MEMORY"), "off"))))
1162 {
1163 CRYPTO_malloc_debug_init();
1164 CRYPTO_set_mem_debug_options(V_CRYPTO_MDEBUG_ALL);
1165 }
1166 else
1167 {
1168 /* OPENSSL_DEBUG_MEMORY=off */
1169 CRYPTO_set_mem_debug_functions(0, 0, 0, 0, 0);
1170 }
1171 CRYPTO_mem_ctrl(CRYPTO_MEM_CHECK_ON);
1172 ERR_load_crypto_strings();
1173
1174 RAND_seed(rnd_seed, sizeof rnd_seed); /* or BN_generate_prime may fail */
1175
1176 prime_field_tests();
1177 puts("");
1178 char2_field_tests();
1179
1180 ENGINE_cleanup();
1181 CRYPTO_cleanup_all_ex_data();
1182 ERR_free_strings();
1183 ERR_remove_state(0);
1184 CRYPTO_mem_leaks_fp(stderr);
1185
1186 return 0;
1187 }
1188 #endif