diff options
Diffstat (limited to 'nss/lib/freebl/ecl/tests')
| -rw-r--r-- | nss/lib/freebl/ecl/tests/ec2_test.c | 482 | ||||
| -rw-r--r-- | nss/lib/freebl/ecl/tests/ec_naft.c | 178 | ||||
| -rw-r--r-- | nss/lib/freebl/ecl/tests/ecp_fpt.c | 1088 | ||||
| -rw-r--r-- | nss/lib/freebl/ecl/tests/ecp_test.c | 683 |
4 files changed, 424 insertions, 2007 deletions
diff --git a/nss/lib/freebl/ecl/tests/ec2_test.c b/nss/lib/freebl/ecl/tests/ec2_test.c deleted file mode 100644 index 1b4d8c3..0000000 --- a/nss/lib/freebl/ecl/tests/ec2_test.c +++ /dev/null @@ -1,482 +0,0 @@ -/* This Source Code Form is subject to the terms of the Mozilla Public - * License, v. 2.0. If a copy of the MPL was not distributed with this - * file, You can obtain one at http://mozilla.org/MPL/2.0/. */ - -#include "mpi.h" -#include "mplogic.h" -#include "mpprime.h" -#include "mp_gf2m.h" -#include "ecl.h" -#include "ecl-curve.h" -#include "ec2.h" -#include <stdio.h> -#include <strings.h> -#include <assert.h> - -#include <time.h> -#include <sys/time.h> -#include <sys/resource.h> - -/* Time k repetitions of operation op. */ -#define M_TimeOperation(op, k) { \ - double dStart, dNow, dUserTime; \ - struct rusage ru; \ - int i; \ - getrusage(RUSAGE_SELF, &ru); \ - dStart = (double)ru.ru_utime.tv_sec+(double)ru.ru_utime.tv_usec*0.000001; \ - for (i = 0; i < k; i++) { \ - { op; } \ - }; \ - getrusage(RUSAGE_SELF, &ru); \ - dNow = (double)ru.ru_utime.tv_sec+(double)ru.ru_utime.tv_usec*0.000001; \ - dUserTime = dNow-dStart; \ - if (dUserTime) printf(" %-45s k: %6i, t: %6.2f sec\n", #op, k, dUserTime); \ -} - -/* Test curve using generic field arithmetic. */ -#define ECTEST_GENERIC_GF2M(name_c, name) \ - printf("Testing %s using generic implementation...\n", name_c); \ - params = EC_GetNamedCurveParams(name); \ - if (params == NULL) { \ - printf(" Error: could not construct params.\n"); \ - res = MP_NO; \ - goto CLEANUP; \ - } \ - ECGroup_free(group); \ - group = ECGroup_fromHex(params); \ - if (group == NULL) { \ - printf(" Error: could not construct group.\n"); \ - res = MP_NO; \ - goto CLEANUP; \ - } \ - MP_CHECKOK( ectest_curve_GF2m(group, ectestPrint, ectestTime, 1) ); \ - printf("... okay.\n"); - -/* Test curve using specific field arithmetic. */ -#define ECTEST_NAMED_GF2M(name_c, name) \ - printf("Testing %s using specific implementation...\n", name_c); \ - ECGroup_free(group); \ - group = ECGroup_fromName(name); \ - if (group == NULL) { \ - printf(" Warning: could not construct group.\n"); \ - printf("... failed; continuing with remaining tests.\n"); \ - } else { \ - MP_CHECKOK( ectest_curve_GF2m(group, ectestPrint, ectestTime, 0) ); \ - printf("... okay.\n"); \ - } - -/* Performs basic tests of elliptic curve cryptography over binary - * polynomial fields. If tests fail, then it prints an error message, - * aborts, and returns an error code. Otherwise, returns 0. */ -int -ectest_curve_GF2m(ECGroup *group, int ectestPrint, int ectestTime, - int generic) -{ - - mp_int one, order_1, gx, gy, rx, ry, n; - int size; - mp_err res; - char s[1000]; - - /* initialize values */ - MP_CHECKOK(mp_init(&one)); - MP_CHECKOK(mp_init(&order_1)); - MP_CHECKOK(mp_init(&gx)); - MP_CHECKOK(mp_init(&gy)); - MP_CHECKOK(mp_init(&rx)); - MP_CHECKOK(mp_init(&ry)); - MP_CHECKOK(mp_init(&n)); - - MP_CHECKOK(mp_set_int(&one, 1)); - MP_CHECKOK(mp_sub(&group->order, &one, &order_1)); - - /* encode base point */ - if (group->meth->field_dec) { - MP_CHECKOK(group->meth->field_dec(&group->genx, &gx, group->meth)); - MP_CHECKOK(group->meth->field_dec(&group->geny, &gy, group->meth)); - } else { - MP_CHECKOK(mp_copy(&group->genx, &gx)); - MP_CHECKOK(mp_copy(&group->geny, &gy)); - } - - if (ectestPrint) { - /* output base point */ - printf(" base point P:\n"); - MP_CHECKOK(mp_toradix(&gx, s, 16)); - printf(" %s\n", s); - MP_CHECKOK(mp_toradix(&gy, s, 16)); - printf(" %s\n", s); - if (group->meth->field_enc) { - printf(" base point P (encoded):\n"); - MP_CHECKOK(mp_toradix(&group->genx, s, 16)); - printf(" %s\n", s); - MP_CHECKOK(mp_toradix(&group->geny, s, 16)); - printf(" %s\n", s); - } - } - -#ifdef ECL_ENABLE_GF2M_PT_MUL_AFF - /* multiply base point by order - 1 and check for negative of base - * point */ - MP_CHECKOK(ec_GF2m_pt_mul_aff - (&order_1, &group->genx, &group->geny, &rx, &ry, group)); - if (ectestPrint) { - printf(" (order-1)*P (affine):\n"); - MP_CHECKOK(mp_toradix(&rx, s, 16)); - printf(" %s\n", s); - MP_CHECKOK(mp_toradix(&ry, s, 16)); - printf(" %s\n", s); - } - MP_CHECKOK(group->meth->field_add(&ry, &rx, &ry, group->meth)); - if ((mp_cmp(&rx, &group->genx) != 0) - || (mp_cmp(&ry, &group->geny) != 0)) { - printf(" Error: invalid result (expected (- base point)).\n"); - res = MP_NO; - goto CLEANUP; - } -#endif - - /* multiply base point by order - 1 and check for negative of base - * point */ - MP_CHECKOK(ec_GF2m_pt_mul_mont - (&order_1, &group->genx, &group->geny, &rx, &ry, group)); - if (ectestPrint) { - printf(" (order-1)*P (montgomery):\n"); - MP_CHECKOK(mp_toradix(&rx, s, 16)); - printf(" %s\n", s); - MP_CHECKOK(mp_toradix(&ry, s, 16)); - printf(" %s\n", s); - } - MP_CHECKOK(group->meth->field_add(&ry, &rx, &ry, group->meth)); - if ((mp_cmp(&rx, &group->genx) != 0) - || (mp_cmp(&ry, &group->geny) != 0)) { - printf(" Error: invalid result (expected (- base point)).\n"); - res = MP_NO; - goto CLEANUP; - } - -#ifdef ECL_ENABLE_GF2M_PROJ - /* multiply base point by order - 1 and check for negative of base - * point */ - MP_CHECKOK(ec_GF2m_pt_mul_proj - (&order_1, &group->genx, &group->geny, &rx, &ry, group)); - if (ectestPrint) { - printf(" (order-1)*P (projective):\n"); - MP_CHECKOK(mp_toradix(&rx, s, 16)); - printf(" %s\n", s); - MP_CHECKOK(mp_toradix(&ry, s, 16)); - printf(" %s\n", s); - } - MP_CHECKOK(group->meth->field_add(&ry, &rx, &ry, group->meth)); - if ((mp_cmp(&rx, &group->genx) != 0) - || (mp_cmp(&ry, &group->geny) != 0)) { - printf(" Error: invalid result (expected (- base point)).\n"); - res = MP_NO; - goto CLEANUP; - } -#endif - - /* multiply base point by order - 1 and check for negative of base - * point */ - MP_CHECKOK(ECPoint_mul(group, &order_1, NULL, NULL, &rx, &ry)); - if (ectestPrint) { - printf(" (order-1)*P (ECPoint_mul):\n"); - MP_CHECKOK(mp_toradix(&rx, s, 16)); - printf(" %s\n", s); - MP_CHECKOK(mp_toradix(&ry, s, 16)); - printf(" %s\n", s); - } - MP_CHECKOK(ec_GF2m_add(&ry, &rx, &ry, group->meth)); - if ((mp_cmp(&rx, &gx) != 0) || (mp_cmp(&ry, &gy) != 0)) { - printf(" Error: invalid result (expected (- base point)).\n"); - res = MP_NO; - goto CLEANUP; - } - - /* multiply base point by order - 1 and check for negative of base - * point */ - MP_CHECKOK(ECPoint_mul(group, &order_1, &gx, &gy, &rx, &ry)); - if (ectestPrint) { - printf(" (order-1)*P (ECPoint_mul):\n"); - MP_CHECKOK(mp_toradix(&rx, s, 16)); - printf(" %s\n", s); - MP_CHECKOK(mp_toradix(&ry, s, 16)); - printf(" %s\n", s); - } - MP_CHECKOK(ec_GF2m_add(&ry, &rx, &ry, group->meth)); - if ((mp_cmp(&rx, &gx) != 0) || (mp_cmp(&ry, &gy) != 0)) { - printf(" Error: invalid result (expected (- base point)).\n"); - res = MP_NO; - goto CLEANUP; - } - -#ifdef ECL_ENABLE_GF2M_PT_MUL_AFF - /* multiply base point by order and check for point at infinity */ - MP_CHECKOK(ec_GF2m_pt_mul_aff - (&group->order, &group->genx, &group->geny, &rx, &ry, - group)); - if (ectestPrint) { - printf(" (order)*P (affine):\n"); - MP_CHECKOK(mp_toradix(&rx, s, 16)); - printf(" %s\n", s); - MP_CHECKOK(mp_toradix(&ry, s, 16)); - printf(" %s\n", s); - } - if (ec_GF2m_pt_is_inf_aff(&rx, &ry) != MP_YES) { - printf(" Error: invalid result (expected point at infinity).\n"); - res = MP_NO; - goto CLEANUP; - } -#endif - - /* multiply base point by order and check for point at infinity */ - MP_CHECKOK(ec_GF2m_pt_mul_mont - (&group->order, &group->genx, &group->geny, &rx, &ry, - group)); - if (ectestPrint) { - printf(" (order)*P (montgomery):\n"); - MP_CHECKOK(mp_toradix(&rx, s, 16)); - printf(" %s\n", s); - MP_CHECKOK(mp_toradix(&ry, s, 16)); - printf(" %s\n", s); - } - if (ec_GF2m_pt_is_inf_aff(&rx, &ry) != MP_YES) { - printf(" Error: invalid result (expected point at infinity).\n"); - res = MP_NO; - goto CLEANUP; - } - -#ifdef ECL_ENABLE_GF2M_PROJ - /* multiply base point by order and check for point at infinity */ - MP_CHECKOK(ec_GF2m_pt_mul_proj - (&group->order, &group->genx, &group->geny, &rx, &ry, - group)); - if (ectestPrint) { - printf(" (order)*P (projective):\n"); - MP_CHECKOK(mp_toradix(&rx, s, 16)); - printf(" %s\n", s); - MP_CHECKOK(mp_toradix(&ry, s, 16)); - printf(" %s\n", s); - } - if (ec_GF2m_pt_is_inf_aff(&rx, &ry) != MP_YES) { - printf(" Error: invalid result (expected point at infinity).\n"); - res = MP_NO; - goto CLEANUP; - } -#endif - - /* multiply base point by order and check for point at infinity */ - MP_CHECKOK(ECPoint_mul(group, &group->order, NULL, NULL, &rx, &ry)); - if (ectestPrint) { - printf(" (order)*P (ECPoint_mul):\n"); - MP_CHECKOK(mp_toradix(&rx, s, 16)); - printf(" %s\n", s); - MP_CHECKOK(mp_toradix(&ry, s, 16)); - printf(" %s\n", s); - } - if (ec_GF2m_pt_is_inf_aff(&rx, &ry) != MP_YES) { - printf(" Error: invalid result (expected point at infinity).\n"); - res = MP_NO; - goto CLEANUP; - } - - /* multiply base point by order and check for point at infinity */ - MP_CHECKOK(ECPoint_mul(group, &group->order, &gx, &gy, &rx, &ry)); - if (ectestPrint) { - printf(" (order)*P (ECPoint_mul):\n"); - MP_CHECKOK(mp_toradix(&rx, s, 16)); - printf(" %s\n", s); - MP_CHECKOK(mp_toradix(&ry, s, 16)); - printf(" %s\n", s); - } - if (ec_GF2m_pt_is_inf_aff(&rx, &ry) != MP_YES) { - printf(" Error: invalid result (expected point at infinity).\n"); - res = MP_NO; - goto CLEANUP; - } - - /* check that (order-1)P + (order-1)P + P == (order-1)P */ - MP_CHECKOK(ECPoints_mul - (group, &order_1, &order_1, &gx, &gy, &rx, &ry)); - MP_CHECKOK(ECPoints_mul(group, &one, &one, &rx, &ry, &rx, &ry)); - if (ectestPrint) { - printf - (" (order-1)*P + (order-1)*P + P == (order-1)*P (ECPoints_mul):\n"); - MP_CHECKOK(mp_toradix(&rx, s, 16)); - printf(" %s\n", s); - MP_CHECKOK(mp_toradix(&ry, s, 16)); - printf(" %s\n", s); - } - MP_CHECKOK(ec_GF2m_add(&ry, &rx, &ry, group->meth)); - if ((mp_cmp(&rx, &gx) != 0) || (mp_cmp(&ry, &gy) != 0)) { - printf(" Error: invalid result (expected (- base point)).\n"); - res = MP_NO; - goto CLEANUP; - } - - /* test validate_point function */ - if (ECPoint_validate(group, &gx, &gy) != MP_YES) { - printf(" Error: validate point on base point failed.\n"); - res = MP_NO; - goto CLEANUP; - } - MP_CHECKOK(mp_add_d(&gy, 1, &ry)); - if (ECPoint_validate(group, &gx, &ry) != MP_NO) { - printf(" Error: validate point on invalid point passed.\n"); - res = MP_NO; - goto CLEANUP; - } - - if (ectestTime) { - /* compute random scalar */ - size = mpl_significant_bits(&group->meth->irr); - if (size < MP_OKAY) { - goto CLEANUP; - } - MP_CHECKOK(mpp_random_size(&n, (size + ECL_BITS - 1) / ECL_BITS)); - MP_CHECKOK(group->meth->field_mod(&n, &n, group->meth)); - /* timed test */ - if (generic) { -#ifdef ECL_ENABLE_GF2M_PT_MUL_AFF - M_TimeOperation(MP_CHECKOK - (ec_GF2m_pt_mul_aff - (&n, &group->genx, &group->geny, &rx, &ry, - group)), 100); -#endif - M_TimeOperation(MP_CHECKOK - (ECPoint_mul(group, &n, NULL, NULL, &rx, &ry)), - 100); - M_TimeOperation(MP_CHECKOK - (ECPoints_mul - (group, &n, &n, &gx, &gy, &rx, &ry)), 100); - } else { - M_TimeOperation(MP_CHECKOK - (ECPoint_mul(group, &n, NULL, NULL, &rx, &ry)), - 100); - M_TimeOperation(MP_CHECKOK - (ECPoint_mul(group, &n, &gx, &gy, &rx, &ry)), - 100); - M_TimeOperation(MP_CHECKOK - (ECPoints_mul - (group, &n, &n, &gx, &gy, &rx, &ry)), 100); - } - } - - CLEANUP: - mp_clear(&one); - mp_clear(&order_1); - mp_clear(&gx); - mp_clear(&gy); - mp_clear(&rx); - mp_clear(&ry); - mp_clear(&n); - if (res != MP_OKAY) { - printf(" Error: exiting with error value %i\n", res); - } - return res; -} - -/* Prints help information. */ -void -printUsage() -{ - printf("Usage: ecp_test [--print] [--time]\n"); - printf - (" --print Print out results of each point arithmetic test.\n"); - printf - (" --time Benchmark point operations and print results.\n"); -} - -/* Performs tests of elliptic curve cryptography over binary polynomial - * fields. If tests fail, then it prints an error message, aborts, and - * returns an error code. Otherwise, returns 0. */ -int -main(int argv, char **argc) -{ - - int ectestTime = 0; - int ectestPrint = 0; - int i; - ECGroup *group = NULL; - ECCurveParams *params = NULL; - mp_err res; - - /* read command-line arguments */ - for (i = 1; i < argv; i++) { - if ((strcasecmp(argc[i], "time") == 0) - || (strcasecmp(argc[i], "-time") == 0) - || (strcasecmp(argc[i], "--time") == 0)) { - ectestTime = 1; - } else if ((strcasecmp(argc[i], "print") == 0) - || (strcasecmp(argc[i], "-print") == 0) - || (strcasecmp(argc[i], "--print") == 0)) { - ectestPrint = 1; - } else { - printUsage(); - return 0; - } - } - - /* generic arithmetic tests */ - ECTEST_GENERIC_GF2M("SECT-131R1", ECCurve_SECG_CHAR2_131R1); - - /* specific arithmetic tests */ - ECTEST_NAMED_GF2M("NIST-K163", ECCurve_NIST_K163); - ECTEST_NAMED_GF2M("NIST-B163", ECCurve_NIST_B163); - ECTEST_NAMED_GF2M("NIST-K233", ECCurve_NIST_K233); - ECTEST_NAMED_GF2M("NIST-B233", ECCurve_NIST_B233); - ECTEST_NAMED_GF2M("NIST-K283", ECCurve_NIST_K283); - ECTEST_NAMED_GF2M("NIST-B283", ECCurve_NIST_B283); - ECTEST_NAMED_GF2M("NIST-K409", ECCurve_NIST_K409); - ECTEST_NAMED_GF2M("NIST-B409", ECCurve_NIST_B409); - ECTEST_NAMED_GF2M("NIST-K571", ECCurve_NIST_K571); - ECTEST_NAMED_GF2M("NIST-B571", ECCurve_NIST_B571); - ECTEST_NAMED_GF2M("ANSI X9.62 C2PNB163V1", ECCurve_X9_62_CHAR2_PNB163V1); - ECTEST_NAMED_GF2M("ANSI X9.62 C2PNB163V2", ECCurve_X9_62_CHAR2_PNB163V2); - ECTEST_NAMED_GF2M("ANSI X9.62 C2PNB163V3", ECCurve_X9_62_CHAR2_PNB163V3); - ECTEST_NAMED_GF2M("ANSI X9.62 C2PNB176V1", ECCurve_X9_62_CHAR2_PNB176V1); - ECTEST_NAMED_GF2M("ANSI X9.62 C2TNB191V1", ECCurve_X9_62_CHAR2_TNB191V1); - ECTEST_NAMED_GF2M("ANSI X9.62 C2TNB191V2", ECCurve_X9_62_CHAR2_TNB191V2); - ECTEST_NAMED_GF2M("ANSI X9.62 C2TNB191V3", ECCurve_X9_62_CHAR2_TNB191V3); - ECTEST_NAMED_GF2M("ANSI X9.62 C2PNB208W1", ECCurve_X9_62_CHAR2_PNB208W1); - ECTEST_NAMED_GF2M("ANSI X9.62 C2TNB239V1", ECCurve_X9_62_CHAR2_TNB239V1); - ECTEST_NAMED_GF2M("ANSI X9.62 C2TNB239V2", ECCurve_X9_62_CHAR2_TNB239V2); - ECTEST_NAMED_GF2M("ANSI X9.62 C2TNB239V3", ECCurve_X9_62_CHAR2_TNB239V3); - ECTEST_NAMED_GF2M("ANSI X9.62 C2PNB272W1", ECCurve_X9_62_CHAR2_PNB272W1); - ECTEST_NAMED_GF2M("ANSI X9.62 C2PNB304W1", ECCurve_X9_62_CHAR2_PNB304W1); - ECTEST_NAMED_GF2M("ANSI X9.62 C2TNB359V1", ECCurve_X9_62_CHAR2_TNB359V1); - ECTEST_NAMED_GF2M("ANSI X9.62 C2PNB368W1", ECCurve_X9_62_CHAR2_PNB368W1); - ECTEST_NAMED_GF2M("ANSI X9.62 C2TNB431R1", ECCurve_X9_62_CHAR2_TNB431R1); - ECTEST_NAMED_GF2M("SECT-113R1", ECCurve_SECG_CHAR2_113R1); - ECTEST_NAMED_GF2M("SECT-113R2", ECCurve_SECG_CHAR2_113R2); - ECTEST_NAMED_GF2M("SECT-131R1", ECCurve_SECG_CHAR2_131R1); - ECTEST_NAMED_GF2M("SECT-131R2", ECCurve_SECG_CHAR2_131R2); - ECTEST_NAMED_GF2M("SECT-163K1", ECCurve_SECG_CHAR2_163K1); - ECTEST_NAMED_GF2M("SECT-163R1", ECCurve_SECG_CHAR2_163R1); - ECTEST_NAMED_GF2M("SECT-163R2", ECCurve_SECG_CHAR2_163R2); - ECTEST_NAMED_GF2M("SECT-193R1", ECCurve_SECG_CHAR2_193R1); - ECTEST_NAMED_GF2M("SECT-193R2", ECCurve_SECG_CHAR2_193R2); - ECTEST_NAMED_GF2M("SECT-233K1", ECCurve_SECG_CHAR2_233K1); - ECTEST_NAMED_GF2M("SECT-233R1", ECCurve_SECG_CHAR2_233R1); - ECTEST_NAMED_GF2M("SECT-239K1", ECCurve_SECG_CHAR2_239K1); - ECTEST_NAMED_GF2M("SECT-283K1", ECCurve_SECG_CHAR2_283K1); - ECTEST_NAMED_GF2M("SECT-283R1", ECCurve_SECG_CHAR2_283R1); - ECTEST_NAMED_GF2M("SECT-409K1", ECCurve_SECG_CHAR2_409K1); - ECTEST_NAMED_GF2M("SECT-409R1", ECCurve_SECG_CHAR2_409R1); - ECTEST_NAMED_GF2M("SECT-571K1", ECCurve_SECG_CHAR2_571K1); - ECTEST_NAMED_GF2M("SECT-571R1", ECCurve_SECG_CHAR2_571R1); - ECTEST_NAMED_GF2M("WTLS-1 (113)", ECCurve_WTLS_1); - ECTEST_NAMED_GF2M("WTLS-3 (163)", ECCurve_WTLS_3); - ECTEST_NAMED_GF2M("WTLS-4 (113)", ECCurve_WTLS_4); - ECTEST_NAMED_GF2M("WTLS-5 (163)", ECCurve_WTLS_5); - ECTEST_NAMED_GF2M("WTLS-10 (233)", ECCurve_WTLS_10); - ECTEST_NAMED_GF2M("WTLS-11 (233)", ECCurve_WTLS_11); - - CLEANUP: - EC_FreeCurveParams(params); - ECGroup_free(group); - if (res != MP_OKAY) { - printf("Error: exiting with error value %i\n", res); - } - return res; -} diff --git a/nss/lib/freebl/ecl/tests/ec_naft.c b/nss/lib/freebl/ecl/tests/ec_naft.c index 833daea..61ef15c 100644 --- a/nss/lib/freebl/ecl/tests/ec_naft.c +++ b/nss/lib/freebl/ecl/tests/ec_naft.c @@ -14,7 +14,7 @@ #include <sys/time.h> #include <sys/resource.h> -/* Returns 2^e as an integer. This is meant to be used for small powers of +/* Returns 2^e as an integer. This is meant to be used for small powers of * two. */ int ec_twoTo(int e); @@ -22,96 +22,100 @@ int ec_twoTo(int e); #define BITSIZE 160 /* Time k repetitions of operation op. */ -#define M_TimeOperation(op, k) { \ - double dStart, dNow, dUserTime; \ - struct rusage ru; \ - int i; \ - getrusage(RUSAGE_SELF, &ru); \ - dStart = (double)ru.ru_utime.tv_sec+(double)ru.ru_utime.tv_usec*0.000001; \ - for (i = 0; i < k; i++) { \ - { op; } \ - }; \ - getrusage(RUSAGE_SELF, &ru); \ - dNow = (double)ru.ru_utime.tv_sec+(double)ru.ru_utime.tv_usec*0.000001; \ - dUserTime = dNow-dStart; \ - if (dUserTime) printf(" %-45s\n k: %6i, t: %6.2f sec\n", #op, k, dUserTime); \ -} - -/* Tests wNAF computation. Non-adjacent-form is discussed in the paper: D. +#define M_TimeOperation(op, k) \ + { \ + double dStart, dNow, dUserTime; \ + struct rusage ru; \ + int i; \ + getrusage(RUSAGE_SELF, &ru); \ + dStart = (double)ru.ru_utime.tv_sec + (double)ru.ru_utime.tv_usec * 0.000001; \ + for (i = 0; i < k; i++) { \ + { \ + op; \ + } \ + }; \ + getrusage(RUSAGE_SELF, &ru); \ + dNow = (double)ru.ru_utime.tv_sec + (double)ru.ru_utime.tv_usec * 0.000001; \ + dUserTime = dNow - dStart; \ + if (dUserTime) \ + printf(" %-45s\n k: %6i, t: %6.2f sec\n", #op, k, dUserTime); \ + } + +/* Tests wNAF computation. Non-adjacent-form is discussed in the paper: D. * Hankerson, J. Hernandez and A. Menezes, "Software implementation of * elliptic curve cryptography over binary fields", Proc. CHES 2000. */ mp_err main(void) { - signed char naf[BITSIZE + 1]; - ECGroup *group = NULL; - mp_int k; - mp_int *scalar; - int i, count; - int res; - int w = 5; - char s[1000]; - - /* Get a 160 bit scalar to compute wNAF from */ - group = ECGroup_fromName(ECCurve_SECG_PRIME_160R1); - scalar = &group->genx; - - /* Compute wNAF representation of scalar */ - ec_compute_wNAF(naf, BITSIZE, scalar, w); - - /* Verify correctness of representation */ - mp_init(&k); /* init k to 0 */ - - for (i = BITSIZE; i >= 0; i--) { - mp_add(&k, &k, &k); - /* digits in mp_???_d are unsigned */ - if (naf[i] >= 0) { - mp_add_d(&k, naf[i], &k); - } else { - mp_sub_d(&k, -naf[i], &k); - } - } - - if (mp_cmp(&k, scalar) != 0) { - printf("Error: incorrect NAF value.\n"); - MP_CHECKOK(mp_toradix(&k, s, 16)); - printf("NAF value %s\n", s); - MP_CHECKOK(mp_toradix(scalar, s, 16)); - printf("original value %s\n", s); - goto CLEANUP; - } - - /* Verify digits of representation are valid */ - for (i = 0; i <= BITSIZE; i++) { - if (naf[i] % 2 == 0 && naf[i] != 0) { - printf("Error: Even non-zero digit found.\n"); - goto CLEANUP; - } - if (naf[i] < -(ec_twoTo(w - 1)) || naf[i] >= ec_twoTo(w - 1)) { - printf("Error: Magnitude of naf digit too large.\n"); - goto CLEANUP; - } - } - - /* Verify sparsity of representation */ - count = w - 1; - for (i = 0; i <= BITSIZE; i++) { - if (naf[i] != 0) { - if (count < w - 1) { - printf("Error: Sparsity failed.\n"); - goto CLEANUP; - } - count = 0; - } else - count++; - } - - /* Check timing */ - M_TimeOperation(ec_compute_wNAF(naf, BITSIZE, scalar, w), 10000); - - printf("Test passed.\n"); - CLEANUP: - ECGroup_free(group); - return MP_OKAY; + signed char naf[BITSIZE + 1]; + ECGroup *group = NULL; + mp_int k; + mp_int *scalar; + int i, count; + int res; + int w = 5; + char s[1000]; + + /* Get a 160 bit scalar to compute wNAF from */ + group = ECGroup_fromName(ECCurve_SECG_PRIME_160R1); + scalar = &group->genx; + + /* Compute wNAF representation of scalar */ + ec_compute_wNAF(naf, BITSIZE, scalar, w); + + /* Verify correctness of representation */ + mp_init(&k); /* init k to 0 */ + + for (i = BITSIZE; i >= 0; i--) { + mp_add(&k, &k, &k); + /* digits in mp_???_d are unsigned */ + if (naf[i] >= 0) { + mp_add_d(&k, naf[i], &k); + } else { + mp_sub_d(&k, -naf[i], &k); + } + } + + if (mp_cmp(&k, scalar) != 0) { + printf("Error: incorrect NAF value.\n"); + MP_CHECKOK(mp_toradix(&k, s, 16)); + printf("NAF value %s\n", s); + MP_CHECKOK(mp_toradix(scalar, s, 16)); + printf("original value %s\n", s); + goto CLEANUP; + } + + /* Verify digits of representation are valid */ + for (i = 0; i <= BITSIZE; i++) { + if (naf[i] % 2 == 0 && naf[i] != 0) { + printf("Error: Even non-zero digit found.\n"); + goto CLEANUP; + } + if (naf[i] < -(ec_twoTo(w - 1)) || naf[i] >= ec_twoTo(w - 1)) { + printf("Error: Magnitude of naf digit too large.\n"); + goto CLEANUP; + } + } + + /* Verify sparsity of representation */ + count = w - 1; + for (i = 0; i <= BITSIZE; i++) { + if (naf[i] != 0) { + if (count < w - 1) { + printf("Error: Sparsity failed.\n"); + goto CLEANUP; + } + count = 0; + } else + count++; + } + + /* Check timing */ + M_TimeOperation(ec_compute_wNAF(naf, BITSIZE, scalar, w), 10000); + + printf("Test passed.\n"); +CLEANUP: + ECGroup_free(group); + return MP_OKAY; } diff --git a/nss/lib/freebl/ecl/tests/ecp_fpt.c b/nss/lib/freebl/ecl/tests/ecp_fpt.c deleted file mode 100644 index 3c91796..0000000 --- a/nss/lib/freebl/ecl/tests/ecp_fpt.c +++ /dev/null @@ -1,1088 +0,0 @@ -/* This Source Code Form is subject to the terms of the Mozilla Public - * License, v. 2.0. If a copy of the MPL was not distributed with this - * file, You can obtain one at http://mozilla.org/MPL/2.0/. */ - -#include "ecp_fp.h" -#include "mpprime.h" - -#include <stdio.h> -#include <time.h> -#include <sys/time.h> -#include <sys/resource.h> - -/* Time k repetitions of operation op. */ -#define M_TimeOperation(op, k) { \ - double dStart, dNow, dUserTime; \ - struct rusage ru; \ - int i; \ - getrusage(RUSAGE_SELF, &ru); \ - dStart = (double)ru.ru_utime.tv_sec+(double)ru.ru_utime.tv_usec*0.000001; \ - for (i = 0; i < k; i++) { \ - { op; } \ - }; \ - getrusage(RUSAGE_SELF, &ru); \ - dNow = (double)ru.ru_utime.tv_sec+(double)ru.ru_utime.tv_usec*0.000001; \ - dUserTime = dNow-dStart; \ - if (dUserTime) printf(" %-45s\n k: %6i, t: %6.2f sec, k/t: %6.2f ops/sec\n", #op, k, dUserTime, k/dUserTime); \ -} - -/* Test curve using specific floating point field arithmetic. */ -#define M_TestCurve(name_c, name) { \ - printf("Testing %s using specific floating point implementation...\n", name_c); \ - ECGroup_free(ecgroup); \ - ecgroup = ECGroup_fromName(name); \ - if (ecgroup == NULL) { \ - printf(" Warning: could not construct group.\n"); \ - printf("%s failed.\n", name_c); \ - res = MP_NO; \ - goto CLEANUP; \ - } else { \ - MP_CHECKOK( testCurve(ecgroup)); \ - printf("%s passed.\n", name_c); \ - } \ -} - -/* Outputs a floating point double (currently not used) */ -void -d_output(const double *u, int len, char *name, const EC_group_fp * group) -{ - int i; - - printf("%s: ", name); - for (i = 0; i < len; i++) { - printf("+ %.2f * 2^%i ", u[i] / ecfp_exp[i], - group->doubleBitSize * i); - } - printf("\n"); -} - -/* Tests a point p in Jacobian coordinates, comparing against the - * expected affine result (x, y). */ -mp_err -testJacPoint(ecfp_jac_pt * p, mp_int *x, mp_int *y, ECGroup *ecgroup) -{ - char s[1000]; - mp_int rx, ry, rz; - mp_err res = MP_OKAY; - - MP_DIGITS(&rx) = 0; - MP_DIGITS(&ry) = 0; - MP_DIGITS(&rz) = 0; - - MP_CHECKOK(mp_init(&rx)); - MP_CHECKOK(mp_init(&ry)); - MP_CHECKOK(mp_init(&rz)); - - ecfp_fp2i(&rx, p->x, ecgroup); - ecfp_fp2i(&ry, p->y, ecgroup); - ecfp_fp2i(&rz, p->z, ecgroup); - - /* convert result R to affine coordinates */ - ec_GFp_pt_jac2aff(&rx, &ry, &rz, &rx, &ry, ecgroup); - - /* Compare to expected result */ - if ((mp_cmp(&rx, x) != 0) || (mp_cmp(&ry, y) != 0)) { - printf(" Error: Jacobian Floating Point Incorrect.\n"); - MP_CHECKOK(mp_toradix(&rx, s, 16)); - printf("floating point result\nrx %s\n", s); - MP_CHECKOK(mp_toradix(&ry, s, 16)); - printf("ry %s\n", s); - MP_CHECKOK(mp_toradix(x, s, 16)); - printf("integer result\nx %s\n", s); - MP_CHECKOK(mp_toradix(y, s, 16)); - printf("y %s\n", s); - res = MP_NO; - goto CLEANUP; - } - - CLEANUP: - mp_clear(&rx); - mp_clear(&ry); - mp_clear(&rz); - - return res; -} - -/* Tests a point p in Chudnovsky Jacobian coordinates, comparing against - * the expected affine result (x, y). */ -mp_err -testChudPoint(ecfp_chud_pt * p, mp_int *x, mp_int *y, ECGroup *ecgroup) -{ - - char s[1000]; - mp_int rx, ry, rz, rz2, rz3, test; - mp_err res = MP_OKAY; - - /* Initialization */ - MP_DIGITS(&rx) = 0; - MP_DIGITS(&ry) = 0; - MP_DIGITS(&rz) = 0; - MP_DIGITS(&rz2) = 0; - MP_DIGITS(&rz3) = 0; - MP_DIGITS(&test) = 0; - - MP_CHECKOK(mp_init(&rx)); - MP_CHECKOK(mp_init(&ry)); - MP_CHECKOK(mp_init(&rz)); - MP_CHECKOK(mp_init(&rz2)); - MP_CHECKOK(mp_init(&rz3)); - MP_CHECKOK(mp_init(&test)); - - /* Convert to integers */ - ecfp_fp2i(&rx, p->x, ecgroup); - ecfp_fp2i(&ry, p->y, ecgroup); - ecfp_fp2i(&rz, p->z, ecgroup); - ecfp_fp2i(&rz2, p->z2, ecgroup); - ecfp_fp2i(&rz3, p->z3, ecgroup); - - /* Verify z2, z3 are valid */ - mp_sqrmod(&rz, &ecgroup->meth->irr, &test); - if (mp_cmp(&test, &rz2) != 0) { - printf(" Error: rzp2 not valid\n"); - res = MP_NO; - goto CLEANUP; - } - mp_mulmod(&test, &rz, &ecgroup->meth->irr, &test); - if (mp_cmp(&test, &rz3) != 0) { - printf(" Error: rzp2 not valid\n"); - res = MP_NO; - goto CLEANUP; - } - - /* convert result R to affine coordinates */ - ec_GFp_pt_jac2aff(&rx, &ry, &rz, &rx, &ry, ecgroup); - - /* Compare against expected result */ - if ((mp_cmp(&rx, x) != 0) || (mp_cmp(&ry, y) != 0)) { - printf(" Error: Chudnovsky Floating Point Incorrect.\n"); - MP_CHECKOK(mp_toradix(&rx, s, 16)); - printf("floating point result\nrx %s\n", s); - MP_CHECKOK(mp_toradix(&ry, s, 16)); - printf("ry %s\n", s); - MP_CHECKOK(mp_toradix(x, s, 16)); - printf("integer result\nx %s\n", s); - MP_CHECKOK(mp_toradix(y, s, 16)); - printf("y %s\n", s); - res = MP_NO; - goto CLEANUP; - } - - CLEANUP: - mp_clear(&rx); - mp_clear(&ry); - mp_clear(&rz); - mp_clear(&rz2); - mp_clear(&rz3); - mp_clear(&test); - - return res; -} - -/* Tests a point p in Modified Jacobian coordinates, comparing against the - * expected affine result (x, y). */ -mp_err -testJmPoint(ecfp_jm_pt * r, mp_int *x, mp_int *y, ECGroup *ecgroup) -{ - - char s[1000]; - mp_int rx, ry, rz, raz4, test; - mp_err res = MP_OKAY; - - /* Initialization */ - MP_DIGITS(&rx) = 0; - MP_DIGITS(&ry) = 0; - MP_DIGITS(&rz) = 0; - MP_DIGITS(&raz4) = 0; - MP_DIGITS(&test) = 0; - - MP_CHECKOK(mp_init(&rx)); - MP_CHECKOK(mp_init(&ry)); - MP_CHECKOK(mp_init(&rz)); - MP_CHECKOK(mp_init(&raz4)); - MP_CHECKOK(mp_init(&test)); - - /* Convert to integer */ - ecfp_fp2i(&rx, r->x, ecgroup); - ecfp_fp2i(&ry, r->y, ecgroup); - ecfp_fp2i(&rz, r->z, ecgroup); - ecfp_fp2i(&raz4, r->az4, ecgroup); - - /* Verify raz4 = rz^4 * a */ - mp_sqrmod(&rz, &ecgroup->meth->irr, &test); - mp_sqrmod(&test, &ecgroup->meth->irr, &test); - mp_mulmod(&test, &ecgroup->curvea, &ecgroup->meth->irr, &test); - if (mp_cmp(&test, &raz4) != 0) { - printf(" Error: a*z^4 not valid\n"); - MP_CHECKOK(mp_toradix(&ecgroup->curvea, s, 16)); - printf("a %s\n", s); - MP_CHECKOK(mp_toradix(&rz, s, 16)); - printf("rz %s\n", s); - MP_CHECKOK(mp_toradix(&raz4, s, 16)); - printf("raz4 %s\n", s); - res = MP_NO; - goto CLEANUP; - } - - /* convert result R to affine coordinates */ - ec_GFp_pt_jac2aff(&rx, &ry, &rz, &rx, &ry, ecgroup); - - /* Compare against expected result */ - if ((mp_cmp(&rx, x) != 0) || (mp_cmp(&ry, y) != 0)) { - printf(" Error: Modified Jacobian Floating Point Incorrect.\n"); - MP_CHECKOK(mp_toradix(&rx, s, 16)); - printf("floating point result\nrx %s\n", s); - MP_CHECKOK(mp_toradix(&ry, s, 16)); - printf("ry %s\n", s); - MP_CHECKOK(mp_toradix(x, s, 16)); - printf("integer result\nx %s\n", s); - MP_CHECKOK(mp_toradix(y, s, 16)); - printf("y %s\n", s); - res = MP_NO; - goto CLEANUP; - } - CLEANUP: - mp_clear(&rx); - mp_clear(&ry); - mp_clear(&rz); - mp_clear(&raz4); - mp_clear(&test); - - return res; -} - -/* Tests point addition of Jacobian + Affine -> Jacobian */ -mp_err -testPointAddJacAff(ECGroup *ecgroup) -{ - mp_err res; - mp_int pz, rx2, ry2, rz2; - ecfp_jac_pt p, r; - ecfp_aff_pt q; - EC_group_fp *group = (EC_group_fp *) ecgroup->extra1; - - /* Init */ - MP_DIGITS(&pz) = 0; - MP_DIGITS(&rx2) = 0; - MP_DIGITS(&ry2) = 0; - MP_DIGITS(&rz2) = 0; - MP_CHECKOK(mp_init(&pz)); - MP_CHECKOK(mp_init(&rx2)); - MP_CHECKOK(mp_init(&ry2)); - MP_CHECKOK(mp_init(&rz2)); - - MP_CHECKOK(mp_set_int(&pz, 5)); - - /* Set p */ - ecfp_i2fp(p.x, &ecgroup->genx, ecgroup); - ecfp_i2fp(p.y, &ecgroup->geny, ecgroup); - ecfp_i2fp(p.z, &pz, ecgroup); - /* Set q */ - ecfp_i2fp(q.x, &ecgroup->geny, ecgroup); - ecfp_i2fp(q.y, &ecgroup->genx, ecgroup); - - /* Do calculations */ - group->pt_add_jac_aff(&p, &q, &r, group); - - /* Do calculation in integer to compare against */ - MP_CHECKOK(ec_GFp_pt_add_jac_aff - (&ecgroup->genx, &ecgroup->geny, &pz, &ecgroup->geny, - &ecgroup->genx, &rx2, &ry2, &rz2, ecgroup)); - /* convert result R to affine coordinates */ - ec_GFp_pt_jac2aff(&rx2, &ry2, &rz2, &rx2, &ry2, ecgroup); - - MP_CHECKOK(testJacPoint(&r, &rx2, &ry2, ecgroup)); - - CLEANUP: - if (res == MP_OKAY) - printf(" Test Passed - Point Addition - Jacobian & Affine\n"); - else - printf("TEST FAILED - Point Addition - Jacobian & Affine\n"); - - mp_clear(&pz); - mp_clear(&rx2); - mp_clear(&ry2); - mp_clear(&rz2); - - return res; -} - -/* Tests point addition in Jacobian coordinates */ -mp_err -testPointAddJac(ECGroup *ecgroup) -{ - mp_err res; - mp_int pz, qz, qx, qy, rx2, ry2, rz2; - ecfp_jac_pt p, q, r; - EC_group_fp *group = (EC_group_fp *) ecgroup->extra1; - - /* Init */ - MP_DIGITS(&pz) = 0; - MP_DIGITS(&qx) = 0; - MP_DIGITS(&qy) = 0; - MP_DIGITS(&qz) = 0; - MP_DIGITS(&rx2) = 0; - MP_DIGITS(&ry2) = 0; - MP_DIGITS(&rz2) = 0; - MP_CHECKOK(mp_init(&pz)); - MP_CHECKOK(mp_init(&qx)); - MP_CHECKOK(mp_init(&qy)); - MP_CHECKOK(mp_init(&qz)); - MP_CHECKOK(mp_init(&rx2)); - MP_CHECKOK(mp_init(&ry2)); - MP_CHECKOK(mp_init(&rz2)); - - MP_CHECKOK(mp_set_int(&pz, 5)); - MP_CHECKOK(mp_set_int(&qz, 105)); - - /* Set p */ - ecfp_i2fp(p.x, &ecgroup->genx, ecgroup); - ecfp_i2fp(p.y, &ecgroup->geny, ecgroup); - ecfp_i2fp(p.z, &pz, ecgroup); - /* Set q */ - ecfp_i2fp(q.x, &ecgroup->geny, ecgroup); - ecfp_i2fp(q.y, &ecgroup->genx, ecgroup); - ecfp_i2fp(q.z, &qz, ecgroup); - - /* Do calculations */ - group->pt_add_jac(&p, &q, &r, group); - - /* Do calculation in integer to compare against */ - ec_GFp_pt_jac2aff(&ecgroup->geny, &ecgroup->genx, &qz, &qx, &qy, - ecgroup); - MP_CHECKOK(ec_GFp_pt_add_jac_aff - (&ecgroup->genx, &ecgroup->geny, &pz, &qx, &qy, &rx2, &ry2, - &rz2, ecgroup)); - /* convert result R to affine coordinates */ - ec_GFp_pt_jac2aff(&rx2, &ry2, &rz2, &rx2, &ry2, ecgroup); - - MP_CHECKOK(testJacPoint(&r, &rx2, &ry2, ecgroup)); - - CLEANUP: - if (res == MP_OKAY) - printf(" Test Passed - Point Addition - Jacobian\n"); - else - printf("TEST FAILED - Point Addition - Jacobian\n"); - - mp_clear(&pz); - mp_clear(&qx); - mp_clear(&qy); - mp_clear(&qz); - mp_clear(&rx2); - mp_clear(&ry2); - mp_clear(&rz2); - - return res; -} - -/* Tests point addition in Chudnovsky Jacobian Coordinates */ -mp_err -testPointAddChud(ECGroup *ecgroup) -{ - mp_err res; - mp_int rx2, ry2, ix, iy, iz, test, pz, qx, qy, qz; - ecfp_chud_pt p, q, r; - EC_group_fp *group = (EC_group_fp *) ecgroup->extra1; - - MP_DIGITS(&qx) = 0; - MP_DIGITS(&qy) = 0; - MP_DIGITS(&qz) = 0; - MP_DIGITS(&pz) = 0; - MP_DIGITS(&rx2) = 0; - MP_DIGITS(&ry2) = 0; - MP_DIGITS(&ix) = 0; - MP_DIGITS(&iy) = 0; - MP_DIGITS(&iz) = 0; - MP_DIGITS(&test) = 0; - - MP_CHECKOK(mp_init(&qx)); - MP_CHECKOK(mp_init(&qy)); - MP_CHECKOK(mp_init(&qz)); - MP_CHECKOK(mp_init(&pz)); - MP_CHECKOK(mp_init(&rx2)); - MP_CHECKOK(mp_init(&ry2)); - MP_CHECKOK(mp_init(&ix)); - MP_CHECKOK(mp_init(&iy)); - MP_CHECKOK(mp_init(&iz)); - MP_CHECKOK(mp_init(&test)); - - /* Test Chudnovsky form addition */ - /* Set p */ - MP_CHECKOK(mp_set_int(&pz, 5)); - ecfp_i2fp(p.x, &ecgroup->genx, ecgroup); - ecfp_i2fp(p.y, &ecgroup->geny, ecgroup); - ecfp_i2fp(p.z, &pz, ecgroup); - mp_sqrmod(&pz, &ecgroup->meth->irr, &test); - ecfp_i2fp(p.z2, &test, ecgroup); - mp_mulmod(&test, &pz, &ecgroup->meth->irr, &test); - ecfp_i2fp(p.z3, &test, ecgroup); - - /* Set q */ - MP_CHECKOK(mp_set_int(&qz, 105)); - ecfp_i2fp(q.x, &ecgroup->geny, ecgroup); - ecfp_i2fp(q.y, &ecgroup->genx, ecgroup); - ecfp_i2fp(q.z, &qz, ecgroup); - mp_sqrmod(&qz, &ecgroup->meth->irr, &test); - ecfp_i2fp(q.z2, &test, ecgroup); - mp_mulmod(&test, &qz, &ecgroup->meth->irr, &test); - ecfp_i2fp(q.z3, &test, ecgroup); - - group->pt_add_chud(&p, &q, &r, group); - - /* Calculate addition to compare against */ - ec_GFp_pt_jac2aff(&ecgroup->geny, &ecgroup->genx, &qz, &qx, &qy, - ecgroup); - ec_GFp_pt_add_jac_aff(&ecgroup->genx, &ecgroup->geny, &pz, &qx, &qy, - &ix, &iy, &iz, ecgroup); - ec_GFp_pt_jac2aff(&ix, &iy, &iz, &rx2, &ry2, ecgroup); - - MP_CHECKOK(testChudPoint(&r, &rx2, &ry2, ecgroup)); - - CLEANUP: - if (res == MP_OKAY) - printf(" Test Passed - Point Addition - Chudnovsky Jacobian\n"); - else - printf("TEST FAILED - Point Addition - Chudnovsky Jacobian\n"); - - mp_clear(&qx); - mp_clear(&qy); - mp_clear(&qz); - mp_clear(&pz); - mp_clear(&rx2); - mp_clear(&ry2); - mp_clear(&ix); - mp_clear(&iy); - mp_clear(&iz); - mp_clear(&test); - - return res; -} - -/* Tests point addition in Modified Jacobian + Chudnovsky Jacobian -> - * Modified Jacobian coordinates. */ -mp_err -testPointAddJmChud(ECGroup *ecgroup) -{ - mp_err res; - mp_int rx2, ry2, ix, iy, iz, test, pz, paz4, qx, qy, qz; - ecfp_chud_pt q; - ecfp_jm_pt p, r; - EC_group_fp *group = (EC_group_fp *) ecgroup->extra1; - - MP_DIGITS(&qx) = 0; - MP_DIGITS(&qy) = 0; - MP_DIGITS(&qz) = 0; - MP_DIGITS(&pz) = 0; - MP_DIGITS(&paz4) = 0; - MP_DIGITS(&iz) = 0; - MP_DIGITS(&rx2) = 0; - MP_DIGITS(&ry2) = 0; - MP_DIGITS(&ix) = 0; - MP_DIGITS(&iy) = 0; - MP_DIGITS(&iz) = 0; - MP_DIGITS(&test) = 0; - - MP_CHECKOK(mp_init(&qx)); - MP_CHECKOK(mp_init(&qy)); - MP_CHECKOK(mp_init(&qz)); - MP_CHECKOK(mp_init(&pz)); - MP_CHECKOK(mp_init(&paz4)); - MP_CHECKOK(mp_init(&rx2)); - MP_CHECKOK(mp_init(&ry2)); - MP_CHECKOK(mp_init(&ix)); - MP_CHECKOK(mp_init(&iy)); - MP_CHECKOK(mp_init(&iz)); - MP_CHECKOK(mp_init(&test)); - - /* Test Modified Jacobian form addition */ - /* Set p */ - ecfp_i2fp(p.x, &ecgroup->genx, ecgroup); - ecfp_i2fp(p.y, &ecgroup->geny, ecgroup); - ecfp_i2fp(group->curvea, &ecgroup->curvea, ecgroup); - /* paz4 = az^4 */ - MP_CHECKOK(mp_set_int(&pz, 5)); - mp_sqrmod(&pz, &ecgroup->meth->irr, &paz4); - mp_sqrmod(&paz4, &ecgroup->meth->irr, &paz4); - mp_mulmod(&paz4, &ecgroup->curvea, &ecgroup->meth->irr, &paz4); - ecfp_i2fp(p.z, &pz, ecgroup); - ecfp_i2fp(p.az4, &paz4, ecgroup); - - /* Set q */ - MP_CHECKOK(mp_set_int(&qz, 105)); - ecfp_i2fp(q.x, &ecgroup->geny, ecgroup); - ecfp_i2fp(q.y, &ecgroup->genx, ecgroup); - ecfp_i2fp(q.z, &qz, ecgroup); - mp_sqrmod(&qz, &ecgroup->meth->irr, &test); - ecfp_i2fp(q.z2, &test, ecgroup); - mp_mulmod(&test, &qz, &ecgroup->meth->irr, &test); - ecfp_i2fp(q.z3, &test, ecgroup); - - /* Do calculation */ - group->pt_add_jm_chud(&p, &q, &r, group); - - /* Calculate addition to compare against */ - ec_GFp_pt_jac2aff(&ecgroup->geny, &ecgroup->genx, &qz, &qx, &qy, - ecgroup); - ec_GFp_pt_add_jac_aff(&ecgroup->genx, &ecgroup->geny, &pz, &qx, &qy, - &ix, &iy, &iz, ecgroup); - ec_GFp_pt_jac2aff(&ix, &iy, &iz, &rx2, &ry2, ecgroup); - - MP_CHECKOK(testJmPoint(&r, &rx2, &ry2, ecgroup)); - - CLEANUP: - if (res == MP_OKAY) - printf - (" Test Passed - Point Addition - Modified & Chudnovsky Jacobian\n"); - else - printf - ("TEST FAILED - Point Addition - Modified & Chudnovsky Jacobian\n"); - - mp_clear(&qx); - mp_clear(&qy); - mp_clear(&qz); - mp_clear(&pz); - mp_clear(&paz4); - mp_clear(&rx2); - mp_clear(&ry2); - mp_clear(&ix); - mp_clear(&iy); - mp_clear(&iz); - mp_clear(&test); - - return res; -} - -/* Tests point doubling in Modified Jacobian coordinates */ -mp_err -testPointDoubleJm(ECGroup *ecgroup) -{ - mp_err res; - mp_int pz, paz4, rx2, ry2, rz2, raz4; - ecfp_jm_pt p, r; - EC_group_fp *group = (EC_group_fp *) ecgroup->extra1; - - MP_DIGITS(&pz) = 0; - MP_DIGITS(&paz4) = 0; - MP_DIGITS(&rx2) = 0; - MP_DIGITS(&ry2) = 0; - MP_DIGITS(&rz2) = 0; - MP_DIGITS(&raz4) = 0; - - MP_CHECKOK(mp_init(&pz)); - MP_CHECKOK(mp_init(&paz4)); - MP_CHECKOK(mp_init(&rx2)); - MP_CHECKOK(mp_init(&ry2)); - MP_CHECKOK(mp_init(&rz2)); - MP_CHECKOK(mp_init(&raz4)); - - /* Set p */ - ecfp_i2fp(p.x, &ecgroup->genx, ecgroup); - ecfp_i2fp(p.y, &ecgroup->geny, ecgroup); - ecfp_i2fp(group->curvea, &ecgroup->curvea, ecgroup); - - /* paz4 = az^4 */ - MP_CHECKOK(mp_set_int(&pz, 5)); - mp_sqrmod(&pz, &ecgroup->meth->irr, &paz4); - mp_sqrmod(&paz4, &ecgroup->meth->irr, &paz4); - mp_mulmod(&paz4, &ecgroup->curvea, &ecgroup->meth->irr, &paz4); - - ecfp_i2fp(p.z, &pz, ecgroup); - ecfp_i2fp(p.az4, &paz4, ecgroup); - - group->pt_dbl_jm(&p, &r, group); - - M_TimeOperation(group->pt_dbl_jm(&p, &r, group), 100000); - - /* Calculate doubling to compare against */ - ec_GFp_pt_dbl_jac(&ecgroup->genx, &ecgroup->geny, &pz, &rx2, &ry2, - &rz2, ecgroup); - ec_GFp_pt_jac2aff(&rx2, &ry2, &rz2, &rx2, &ry2, ecgroup); - - /* Do comparison and check az^4 */ - MP_CHECKOK(testJmPoint(&r, &rx2, &ry2, ecgroup)); - - CLEANUP: - if (res == MP_OKAY) - printf(" Test Passed - Point Doubling - Modified Jacobian\n"); - else - printf("TEST FAILED - Point Doubling - Modified Jacobian\n"); - mp_clear(&pz); - mp_clear(&paz4); - mp_clear(&rx2); - mp_clear(&ry2); - mp_clear(&rz2); - mp_clear(&raz4); - - return res; - -} - -/* Tests point doubling in Chudnovsky Jacobian coordinates */ -mp_err -testPointDoubleChud(ECGroup *ecgroup) -{ - mp_err res; - mp_int px, py, pz, rx2, ry2, rz2; - ecfp_aff_pt p; - ecfp_chud_pt p2; - EC_group_fp *group = (EC_group_fp *) ecgroup->extra1; - - MP_DIGITS(&rx2) = 0; - MP_DIGITS(&ry2) = 0; - MP_DIGITS(&rz2) = 0; - MP_DIGITS(&px) = 0; - MP_DIGITS(&py) = 0; - MP_DIGITS(&pz) = 0; - - MP_CHECKOK(mp_init(&rx2)); - MP_CHECKOK(mp_init(&ry2)); - MP_CHECKOK(mp_init(&rz2)); - MP_CHECKOK(mp_init(&px)); - MP_CHECKOK(mp_init(&py)); - MP_CHECKOK(mp_init(&pz)); - - /* Set p2 = 2P */ - ecfp_i2fp(p.x, &ecgroup->genx, ecgroup); - ecfp_i2fp(p.y, &ecgroup->geny, ecgroup); - ecfp_i2fp(group->curvea, &ecgroup->curvea, ecgroup); - - group->pt_dbl_aff2chud(&p, &p2, group); - - /* Calculate doubling to compare against */ - MP_CHECKOK(mp_set_int(&pz, 1)); - ec_GFp_pt_dbl_jac(&ecgroup->genx, &ecgroup->geny, &pz, &rx2, &ry2, - &rz2, ecgroup); - ec_GFp_pt_jac2aff(&rx2, &ry2, &rz2, &rx2, &ry2, ecgroup); - - /* Do comparison and check az^4 */ - MP_CHECKOK(testChudPoint(&p2, &rx2, &ry2, ecgroup)); - - CLEANUP: - if (res == MP_OKAY) - printf(" Test Passed - Point Doubling - Chudnovsky Jacobian\n"); - else - printf("TEST FAILED - Point Doubling - Chudnovsky Jacobian\n"); - - mp_clear(&rx2); - mp_clear(&ry2); - mp_clear(&rz2); - mp_clear(&px); - mp_clear(&py); - mp_clear(&pz); - - return res; -} - -/* Test point doubling in Jacobian coordinates */ -mp_err -testPointDoubleJac(ECGroup *ecgroup) -{ - mp_err res; - mp_int pz, rx, ry, rz, rx2, ry2, rz2; - ecfp_jac_pt p, p2; - EC_group_fp *group = (EC_group_fp *) ecgroup->extra1; - - MP_DIGITS(&pz) = 0; - MP_DIGITS(&rx) = 0; - MP_DIGITS(&ry) = 0; - MP_DIGITS(&rz) = 0; - MP_DIGITS(&rx2) = 0; - MP_DIGITS(&ry2) = 0; - MP_DIGITS(&rz2) = 0; - - MP_CHECKOK(mp_init(&pz)); - MP_CHECKOK(mp_init(&rx)); - MP_CHECKOK(mp_init(&ry)); - MP_CHECKOK(mp_init(&rz)); - MP_CHECKOK(mp_init(&rx2)); - MP_CHECKOK(mp_init(&ry2)); - MP_CHECKOK(mp_init(&rz2)); - - MP_CHECKOK(mp_set_int(&pz, 5)); - - /* Set p2 = 2P */ - ecfp_i2fp(p.x, &ecgroup->genx, ecgroup); - ecfp_i2fp(p.y, &ecgroup->geny, ecgroup); - ecfp_i2fp(p.z, &pz, ecgroup); - ecfp_i2fp(group->curvea, &ecgroup->curvea, ecgroup); - - group->pt_dbl_jac(&p, &p2, group); - M_TimeOperation(group->pt_dbl_jac(&p, &p2, group), 100000); - - /* Calculate doubling to compare against */ - ec_GFp_pt_dbl_jac(&ecgroup->genx, &ecgroup->geny, &pz, &rx2, &ry2, - &rz2, ecgroup); - ec_GFp_pt_jac2aff(&rx2, &ry2, &rz2, &rx2, &ry2, ecgroup); - - /* Do comparison */ - MP_CHECKOK(testJacPoint(&p2, &rx2, &ry2, ecgroup)); - - CLEANUP: - if (res == MP_OKAY) - printf(" Test Passed - Point Doubling - Jacobian\n"); - else - printf("TEST FAILED - Point Doubling - Jacobian\n"); - - mp_clear(&pz); - mp_clear(&rx); - mp_clear(&ry); - mp_clear(&rz); - mp_clear(&rx2); - mp_clear(&ry2); - mp_clear(&rz2); - - return res; -} - -/* Tests a point multiplication (various algorithms) */ -mp_err -testPointMul(ECGroup *ecgroup) -{ - mp_err res; - char s[1000]; - mp_int rx, ry, order_1; - - /* Init */ - MP_DIGITS(&rx) = 0; - MP_DIGITS(&ry) = 0; - MP_DIGITS(&order_1) = 0; - - MP_CHECKOK(mp_init(&rx)); - MP_CHECKOK(mp_init(&ry)); - MP_CHECKOK(mp_init(&order_1)); - - MP_CHECKOK(mp_set_int(&order_1, 1)); - MP_CHECKOK(mp_sub(&ecgroup->order, &order_1, &order_1)); - - /* Test Algorithm 1: Jacobian-Affine Double & Add */ - ec_GFp_pt_mul_jac_fp(&order_1, &ecgroup->genx, &ecgroup->geny, &rx, - &ry, ecgroup); - MP_CHECKOK(ecgroup->meth->field_neg(&ry, &ry, ecgroup->meth)); - if ((mp_cmp(&rx, &ecgroup->genx) != 0) - || (mp_cmp(&ry, &ecgroup->geny) != 0)) { - printf - (" Error: ec_GFp_pt_mul_jac_fp invalid result (expected (- base point)).\n"); - MP_CHECKOK(mp_toradix(&rx, s, 16)); - printf("rx %s\n", s); - MP_CHECKOK(mp_toradix(&ry, s, 16)); - printf("ry %s\n", s); - res = MP_NO; - goto CLEANUP; - } - - ec_GFp_pt_mul_jac_fp(&ecgroup->order, &ecgroup->genx, &ecgroup->geny, - &rx, &ry, ecgroup); - if (ec_GFp_pt_is_inf_aff(&rx, &ry) != MP_YES) { - printf - (" Error: ec_GFp_pt_mul_jac_fp invalid result (expected point at infinity.\n"); - MP_CHECKOK(mp_toradix(&rx, s, 16)); - printf("rx %s\n", s); - MP_CHECKOK(mp_toradix(&ry, s, 16)); - printf("ry %s\n", s); - res = MP_NO; - goto CLEANUP; - } - - /* Test Algorithm 2: 4-bit Window in Jacobian */ - ec_GFp_point_mul_jac_4w_fp(&order_1, &ecgroup->genx, &ecgroup->geny, - &rx, &ry, ecgroup); - MP_CHECKOK(ecgroup->meth->field_neg(&ry, &ry, ecgroup->meth)); - if ((mp_cmp(&rx, &ecgroup->genx) != 0) - || (mp_cmp(&ry, &ecgroup->geny) != 0)) { - printf - (" Error: ec_GFp_point_mul_jac_4w_fp invalid result (expected (- base point)).\n"); - MP_CHECKOK(mp_toradix(&rx, s, 16)); - printf("rx %s\n", s); - MP_CHECKOK(mp_toradix(&ry, s, 16)); - printf("ry %s\n", s); - res = MP_NO; - goto CLEANUP; - } - - ec_GFp_point_mul_jac_4w_fp(&ecgroup->order, &ecgroup->genx, - &ecgroup->geny, &rx, &ry, ecgroup); - if (ec_GFp_pt_is_inf_aff(&rx, &ry) != MP_YES) { - printf - (" Error: ec_GFp_point_mul_jac_4w_fp invalid result (expected point at infinity.\n"); - MP_CHECKOK(mp_toradix(&rx, s, 16)); - printf("rx %s\n", s); - MP_CHECKOK(mp_toradix(&ry, s, 16)); - printf("ry %s\n", s); - res = MP_NO; - goto CLEANUP; - } - - /* Test Algorithm 3: wNAF with modified Jacobian coordinates */ - ec_GFp_point_mul_wNAF_fp(&order_1, &ecgroup->genx, &ecgroup->geny, &rx, - &ry, ecgroup); - MP_CHECKOK(ecgroup->meth->field_neg(&ry, &ry, ecgroup->meth)); - if ((mp_cmp(&rx, &ecgroup->genx) != 0) - || (mp_cmp(&ry, &ecgroup->geny) != 0)) { - printf - (" Error: ec_GFp_pt_mul_wNAF_fp invalid result (expected (- base point)).\n"); - MP_CHECKOK(mp_toradix(&rx, s, 16)); - printf("rx %s\n", s); - MP_CHECKOK(mp_toradix(&ry, s, 16)); - printf("ry %s\n", s); - res = MP_NO; - goto CLEANUP; - } - - ec_GFp_point_mul_wNAF_fp(&ecgroup->order, &ecgroup->genx, - &ecgroup->geny, &rx, &ry, ecgroup); - if (ec_GFp_pt_is_inf_aff(&rx, &ry) != MP_YES) { - printf - (" Error: ec_GFp_pt_mul_wNAF_fp invalid result (expected point at infinity.\n"); - MP_CHECKOK(mp_toradix(&rx, s, 16)); - printf("rx %s\n", s); - MP_CHECKOK(mp_toradix(&ry, s, 16)); - printf("ry %s\n", s); - res = MP_NO; - goto CLEANUP; - } - - CLEANUP: - if (res == MP_OKAY) - printf(" Test Passed - Point Multiplication\n"); - else - printf("TEST FAILED - Point Multiplication\n"); - mp_clear(&rx); - mp_clear(&ry); - mp_clear(&order_1); - - return res; -} - -/* Tests point multiplication with a random scalar repeatedly, comparing - * for consistency within different algorithms. */ -mp_err -testPointMulRandom(ECGroup *ecgroup) -{ - mp_err res; - mp_int rx, ry, rx2, ry2, n; - int i, size; - EC_group_fp *group = (EC_group_fp *) ecgroup->extra1; - - MP_DIGITS(&rx) = 0; - MP_DIGITS(&ry) = 0; - MP_DIGITS(&rx2) = 0; - MP_DIGITS(&ry2) = 0; - MP_DIGITS(&n) = 0; - - MP_CHECKOK(mp_init(&rx)); - MP_CHECKOK(mp_init(&ry)); - MP_CHECKOK(mp_init(&rx2)); - MP_CHECKOK(mp_init(&ry2)); - MP_CHECKOK(mp_init(&n)); - - for (i = 0; i < 100; i++) { - /* compute random scalar */ - size = mpl_significant_bits(&ecgroup->meth->irr); - if (size < MP_OKAY) { - res = MP_NO; - goto CLEANUP; - } - MP_CHECKOK(mpp_random_size(&n, group->orderBitSize)); - MP_CHECKOK(mp_mod(&n, &ecgroup->order, &n)); - - ec_GFp_pt_mul_jac(&n, &ecgroup->genx, &ecgroup->geny, &rx, &ry, - ecgroup); - ec_GFp_pt_mul_jac_fp(&n, &ecgroup->genx, &ecgroup->geny, &rx2, - &ry2, ecgroup); - - if ((mp_cmp(&rx, &rx2) != 0) || (mp_cmp(&ry, &ry2) != 0)) { - printf - (" Error: different results for Point Multiplication - Double & Add.\n"); - res = MP_NO; - goto CLEANUP; - } - - ec_GFp_point_mul_wNAF_fp(&n, &ecgroup->genx, &ecgroup->geny, &rx, - &ry, ecgroup); - if ((mp_cmp(&rx, &rx2) != 0) || (mp_cmp(&ry, &ry2) != 0)) { - printf - (" Error: different results for Point Multiplication - wNAF.\n"); - res = MP_NO; - goto CLEANUP; - } - - ec_GFp_point_mul_jac_4w_fp(&n, &ecgroup->genx, &ecgroup->geny, &rx, - &ry, ecgroup); - if ((mp_cmp(&rx, &rx2) != 0) || (mp_cmp(&ry, &ry2) != 0)) { - printf - (" Error: different results for Point Multiplication - 4 bit window.\n"); - res = MP_NO; - goto CLEANUP; - } - - } - - CLEANUP: - if (res == MP_OKAY) - printf(" Test Passed - Point Random Multiplication\n"); - else - printf("TEST FAILED - Point Random Multiplication\n"); - mp_clear(&rx); - mp_clear(&ry); - mp_clear(&rx2); - mp_clear(&ry2); - mp_clear(&n); - - return res; -} - -/* Tests the time required for a point multiplication */ -mp_err -testPointMulTime(ECGroup *ecgroup) -{ - mp_err res = MP_OKAY; - mp_int rx, ry, n; - int size; - - MP_DIGITS(&rx) = 0; - MP_DIGITS(&ry) = 0; - MP_DIGITS(&n) = 0; - - MP_CHECKOK(mp_init(&rx)); - MP_CHECKOK(mp_init(&ry)); - MP_CHECKOK(mp_init(&n)); - - /* compute random scalar */ - size = mpl_significant_bits(&ecgroup->meth->irr); - if (size < MP_OKAY) { - res = MP_NO; - goto CLEANUP; - } - - MP_CHECKOK(mpp_random_size(&n, (size + ECL_BITS - 1) / ECL_BITS)); - MP_CHECKOK(ecgroup->meth->field_mod(&n, &n, ecgroup->meth)); - - M_TimeOperation(ec_GFp_pt_mul_jac_fp - (&n, &ecgroup->genx, &ecgroup->geny, &rx, &ry, - ecgroup), 1000); - - M_TimeOperation(ec_GFp_point_mul_jac_4w_fp - (&n, &ecgroup->genx, &ecgroup->geny, &rx, &ry, - ecgroup), 1000); - - M_TimeOperation(ec_GFp_point_mul_wNAF_fp - (&n, &ecgroup->genx, &ecgroup->geny, &rx, &ry, - ecgroup), 1000); - - M_TimeOperation(ec_GFp_pt_mul_jac - (&n, &ecgroup->genx, &ecgroup->geny, &rx, &ry, - ecgroup), 100); - - CLEANUP: - if (res == MP_OKAY) - printf(" Test Passed - Point Multiplication Timing\n"); - else - printf("TEST FAILED - Point Multiplication Timing\n"); - mp_clear(&rx); - mp_clear(&ry); - mp_clear(&n); - - return res; -} - -/* Tests pre computation of Chudnovsky Jacobian points used in wNAF form */ -mp_err -testPreCompute(ECGroup *ecgroup) -{ - ecfp_chud_pt precomp[16]; - ecfp_aff_pt p; - EC_group_fp *group = (EC_group_fp *) ecgroup->extra1; - int i; - mp_err res; - - mp_int x, y, ny, x2, y2; - - MP_DIGITS(&x) = 0; - MP_DIGITS(&y) = 0; - MP_DIGITS(&ny) = 0; - MP_DIGITS(&x2) = 0; - MP_DIGITS(&y2) = 0; - - MP_CHECKOK(mp_init(&x)); - MP_CHECKOK(mp_init(&y)); - MP_CHECKOK(mp_init(&ny)); - MP_CHECKOK(mp_init(&x2)); - MP_CHECKOK(mp_init(&y2)); - - ecfp_i2fp(p.x, &ecgroup->genx, ecgroup); - ecfp_i2fp(p.y, &ecgroup->geny, ecgroup); - ecfp_i2fp(group->curvea, &(ecgroup->curvea), ecgroup); - - /* Perform precomputation */ - group->precompute_chud(precomp, &p, group); - - M_TimeOperation(group->precompute_chud(precomp, &p, group), 10000); - - /* Calculate addition to compare against */ - MP_CHECKOK(mp_copy(&ecgroup->genx, &x)); - MP_CHECKOK(mp_copy(&ecgroup->geny, &y)); - MP_CHECKOK(ecgroup->meth->field_neg(&y, &ny, ecgroup->meth)); - - ec_GFp_pt_dbl_aff(&x, &y, &x2, &y2, ecgroup); - - for (i = 0; i < 8; i++) { - MP_CHECKOK(testChudPoint(&precomp[8 + i], &x, &y, ecgroup)); - MP_CHECKOK(testChudPoint(&precomp[7 - i], &x, &ny, ecgroup)); - ec_GFp_pt_add_aff(&x, &y, &x2, &y2, &x, &y, ecgroup); - MP_CHECKOK(ecgroup->meth->field_neg(&y, &ny, ecgroup->meth)); - } - - CLEANUP: - if (res == MP_OKAY) - printf(" Test Passed - Precomputation\n"); - else - printf("TEST FAILED - Precomputation\n"); - - mp_clear(&x); - mp_clear(&y); - mp_clear(&ny); - mp_clear(&x2); - mp_clear(&y2); - return res; -} - -/* Given a curve using floating point arithmetic, test it. This method - * specifies which of the above tests to run. */ -mp_err -testCurve(ECGroup *ecgroup) -{ - int res = MP_OKAY; - - MP_CHECKOK(testPointAddJacAff(ecgroup)); - MP_CHECKOK(testPointAddJac(ecgroup)); - MP_CHECKOK(testPointAddChud(ecgroup)); - MP_CHECKOK(testPointAddJmChud(ecgroup)); - MP_CHECKOK(testPointDoubleJac(ecgroup)); - MP_CHECKOK(testPointDoubleChud(ecgroup)); - MP_CHECKOK(testPointDoubleJm(ecgroup)); - MP_CHECKOK(testPreCompute(ecgroup)); - MP_CHECKOK(testPointMul(ecgroup)); - MP_CHECKOK(testPointMulRandom(ecgroup)); - MP_CHECKOK(testPointMulTime(ecgroup)); - CLEANUP: - return res; -} - -/* Tests a number of curves optimized using floating point arithmetic */ -int -main(void) -{ - mp_err res = MP_OKAY; - ECGroup *ecgroup = NULL; - - /* specific arithmetic tests */ - M_TestCurve("SECG-160R1", ECCurve_SECG_PRIME_160R1); - M_TestCurve("SECG-192R1", ECCurve_SECG_PRIME_192R1); - M_TestCurve("SEGC-224R1", ECCurve_SECG_PRIME_224R1); - - CLEANUP: - ECGroup_free(ecgroup); - if (res != MP_OKAY) { - printf("Error: exiting with error value %i\n", res); - } - return res; -} diff --git a/nss/lib/freebl/ecl/tests/ecp_test.c b/nss/lib/freebl/ecl/tests/ecp_test.c index e9a448e..dcec4d7 100644 --- a/nss/lib/freebl/ecl/tests/ecp_test.c +++ b/nss/lib/freebl/ecl/tests/ecp_test.c @@ -17,336 +17,322 @@ #include <sys/resource.h> /* Time k repetitions of operation op. */ -#define M_TimeOperation(op, k) { \ - double dStart, dNow, dUserTime; \ - struct rusage ru; \ - int i; \ - getrusage(RUSAGE_SELF, &ru); \ - dStart = (double)ru.ru_utime.tv_sec+(double)ru.ru_utime.tv_usec*0.000001; \ - for (i = 0; i < k; i++) { \ - { op; } \ - }; \ - getrusage(RUSAGE_SELF, &ru); \ - dNow = (double)ru.ru_utime.tv_sec+(double)ru.ru_utime.tv_usec*0.000001; \ - dUserTime = dNow-dStart; \ - if (dUserTime) printf(" %-45s k: %6i, t: %6.2f sec\n", #op, k, dUserTime); \ -} +#define M_TimeOperation(op, k) \ + { \ + double dStart, dNow, dUserTime; \ + struct rusage ru; \ + int i; \ + getrusage(RUSAGE_SELF, &ru); \ + dStart = (double)ru.ru_utime.tv_sec + (double)ru.ru_utime.tv_usec * 0.000001; \ + for (i = 0; i < k; i++) { \ + { \ + op; \ + } \ + }; \ + getrusage(RUSAGE_SELF, &ru); \ + dNow = (double)ru.ru_utime.tv_sec + (double)ru.ru_utime.tv_usec * 0.000001; \ + dUserTime = dNow - dStart; \ + if (dUserTime) \ + printf(" %-45s k: %6i, t: %6.2f sec\n", #op, k, dUserTime); \ + } /* Test curve using generic field arithmetic. */ -#define ECTEST_GENERIC_GFP(name_c, name) \ - printf("Testing %s using generic implementation...\n", name_c); \ - params = EC_GetNamedCurveParams(name); \ - if (params == NULL) { \ - printf(" Error: could not construct params.\n"); \ - res = MP_NO; \ - goto CLEANUP; \ - } \ - ECGroup_free(group); \ - group = ECGroup_fromHex(params); \ - if (group == NULL) { \ - printf(" Error: could not construct group.\n"); \ - res = MP_NO; \ - goto CLEANUP; \ - } \ - MP_CHECKOK( ectest_curve_GFp(group, ectestPrint, ectestTime, 1) ); \ - printf("... okay.\n"); +#define ECTEST_GENERIC_GFP(name_c, name) \ + printf("Testing %s using generic implementation...\n", name_c); \ + params = EC_GetNamedCurveParams(name); \ + if (params == NULL) { \ + printf(" Error: could not construct params.\n"); \ + res = MP_NO; \ + goto CLEANUP; \ + } \ + ECGroup_free(group); \ + group = ECGroup_fromHex(params); \ + if (group == NULL) { \ + printf(" Error: could not construct group.\n"); \ + res = MP_NO; \ + goto CLEANUP; \ + } \ + MP_CHECKOK(ectest_curve_GFp(group, ectestPrint, ectestTime, 1)); \ + printf("... okay.\n"); /* Test curve using specific field arithmetic. */ -#define ECTEST_NAMED_GFP(name_c, name) \ - printf("Testing %s using specific implementation...\n", name_c); \ - ECGroup_free(group); \ - group = ECGroup_fromName(name); \ - if (group == NULL) { \ - printf(" Warning: could not construct group.\n"); \ - printf("... failed; continuing with remaining tests.\n"); \ - } else { \ - MP_CHECKOK( ectest_curve_GFp(group, ectestPrint, ectestTime, 0) ); \ - printf("... okay.\n"); \ - } +#define ECTEST_NAMED_GFP(name_c, name) \ + printf("Testing %s using specific implementation...\n", name_c); \ + ECGroup_free(group); \ + group = ECGroup_fromName(name); \ + if (group == NULL) { \ + printf(" Warning: could not construct group.\n"); \ + printf("... failed; continuing with remaining tests.\n"); \ + } else { \ + MP_CHECKOK(ectest_curve_GFp(group, ectestPrint, ectestTime, 0)); \ + printf("... okay.\n"); \ + } /* Performs basic tests of elliptic curve cryptography over prime fields. * If tests fail, then it prints an error message, aborts, and returns an * error code. Otherwise, returns 0. */ int ectest_curve_GFp(ECGroup *group, int ectestPrint, int ectestTime, - int generic) + int generic) { - mp_int one, order_1, gx, gy, rx, ry, n; - int size; - mp_err res; - char s[1000]; + mp_int one, order_1, gx, gy, rx, ry, n; + int size; + mp_err res; + char s[1000]; - /* initialize values */ - MP_CHECKOK(mp_init(&one)); - MP_CHECKOK(mp_init(&order_1)); - MP_CHECKOK(mp_init(&gx)); - MP_CHECKOK(mp_init(&gy)); - MP_CHECKOK(mp_init(&rx)); - MP_CHECKOK(mp_init(&ry)); - MP_CHECKOK(mp_init(&n)); + /* initialize values */ + MP_CHECKOK(mp_init(&one)); + MP_CHECKOK(mp_init(&order_1)); + MP_CHECKOK(mp_init(&gx)); + MP_CHECKOK(mp_init(&gy)); + MP_CHECKOK(mp_init(&rx)); + MP_CHECKOK(mp_init(&ry)); + MP_CHECKOK(mp_init(&n)); - MP_CHECKOK(mp_set_int(&one, 1)); - MP_CHECKOK(mp_sub(&group->order, &one, &order_1)); + MP_CHECKOK(mp_set_int(&one, 1)); + MP_CHECKOK(mp_sub(&group->order, &one, &order_1)); - /* encode base point */ - if (group->meth->field_dec) { - MP_CHECKOK(group->meth->field_dec(&group->genx, &gx, group->meth)); - MP_CHECKOK(group->meth->field_dec(&group->geny, &gy, group->meth)); - } else { - MP_CHECKOK(mp_copy(&group->genx, &gx)); - MP_CHECKOK(mp_copy(&group->geny, &gy)); - } - if (ectestPrint) { - /* output base point */ - printf(" base point P:\n"); - MP_CHECKOK(mp_toradix(&gx, s, 16)); - printf(" %s\n", s); - MP_CHECKOK(mp_toradix(&gy, s, 16)); - printf(" %s\n", s); - if (group->meth->field_enc) { - printf(" base point P (encoded):\n"); - MP_CHECKOK(mp_toradix(&group->genx, s, 16)); - printf(" %s\n", s); - MP_CHECKOK(mp_toradix(&group->geny, s, 16)); - printf(" %s\n", s); - } - } + /* encode base point */ + if (group->meth->field_dec) { + MP_CHECKOK(group->meth->field_dec(&group->genx, &gx, group->meth)); + MP_CHECKOK(group->meth->field_dec(&group->geny, &gy, group->meth)); + } else { + MP_CHECKOK(mp_copy(&group->genx, &gx)); + MP_CHECKOK(mp_copy(&group->geny, &gy)); + } + if (ectestPrint) { + /* output base point */ + printf(" base point P:\n"); + MP_CHECKOK(mp_toradix(&gx, s, 16)); + printf(" %s\n", s); + MP_CHECKOK(mp_toradix(&gy, s, 16)); + printf(" %s\n", s); + if (group->meth->field_enc) { + printf(" base point P (encoded):\n"); + MP_CHECKOK(mp_toradix(&group->genx, s, 16)); + printf(" %s\n", s); + MP_CHECKOK(mp_toradix(&group->geny, s, 16)); + printf(" %s\n", s); + } + } #ifdef ECL_ENABLE_GFP_PT_MUL_AFF - /* multiply base point by order - 1 and check for negative of base - * point */ - MP_CHECKOK(ec_GFp_pt_mul_aff - (&order_1, &group->genx, &group->geny, &rx, &ry, group)); - if (ectestPrint) { - printf(" (order-1)*P (affine):\n"); - MP_CHECKOK(mp_toradix(&rx, s, 16)); - printf(" %s\n", s); - MP_CHECKOK(mp_toradix(&ry, s, 16)); - printf(" %s\n", s); - } - MP_CHECKOK(group->meth->field_neg(&ry, &ry, group->meth)); - if ((mp_cmp(&rx, &group->genx) != 0) - || (mp_cmp(&ry, &group->geny) != 0)) { - printf(" Error: invalid result (expected (- base point)).\n"); - res = MP_NO; - goto CLEANUP; - } + /* multiply base point by order - 1 and check for negative of base + * point */ + MP_CHECKOK(ec_GFp_pt_mul_aff(&order_1, &group->genx, &group->geny, &rx, &ry, group)); + if (ectestPrint) { + printf(" (order-1)*P (affine):\n"); + MP_CHECKOK(mp_toradix(&rx, s, 16)); + printf(" %s\n", s); + MP_CHECKOK(mp_toradix(&ry, s, 16)); + printf(" %s\n", s); + } + MP_CHECKOK(group->meth->field_neg(&ry, &ry, group->meth)); + if ((mp_cmp(&rx, &group->genx) != 0) || (mp_cmp(&ry, &group->geny) != 0)) { + printf(" Error: invalid result (expected (- base point)).\n"); + res = MP_NO; + goto CLEANUP; + } #endif #ifdef ECL_ENABLE_GFP_PT_MUL_AFF - /* multiply base point by order - 1 and check for negative of base - * point */ - MP_CHECKOK(ec_GFp_pt_mul_jac - (&order_1, &group->genx, &group->geny, &rx, &ry, group)); - if (ectestPrint) { - printf(" (order-1)*P (jacobian):\n"); - MP_CHECKOK(mp_toradix(&rx, s, 16)); - printf(" %s\n", s); - MP_CHECKOK(mp_toradix(&ry, s, 16)); - printf(" %s\n", s); - } - MP_CHECKOK(group->meth->field_neg(&ry, &ry, group->meth)); - if ((mp_cmp(&rx, &group->genx) != 0) - || (mp_cmp(&ry, &group->geny) != 0)) { - printf(" Error: invalid result (expected (- base point)).\n"); - res = MP_NO; - goto CLEANUP; - } + /* multiply base point by order - 1 and check for negative of base + * point */ + MP_CHECKOK(ec_GFp_pt_mul_jac(&order_1, &group->genx, &group->geny, &rx, &ry, group)); + if (ectestPrint) { + printf(" (order-1)*P (jacobian):\n"); + MP_CHECKOK(mp_toradix(&rx, s, 16)); + printf(" %s\n", s); + MP_CHECKOK(mp_toradix(&ry, s, 16)); + printf(" %s\n", s); + } + MP_CHECKOK(group->meth->field_neg(&ry, &ry, group->meth)); + if ((mp_cmp(&rx, &group->genx) != 0) || (mp_cmp(&ry, &group->geny) != 0)) { + printf(" Error: invalid result (expected (- base point)).\n"); + res = MP_NO; + goto CLEANUP; + } #endif - /* multiply base point by order - 1 and check for negative of base - * point */ - MP_CHECKOK(ECPoint_mul(group, &order_1, NULL, NULL, &rx, &ry)); - if (ectestPrint) { - printf(" (order-1)*P (ECPoint_mul):\n"); - MP_CHECKOK(mp_toradix(&rx, s, 16)); - printf(" %s\n", s); - MP_CHECKOK(mp_toradix(&ry, s, 16)); - printf(" %s\n", s); - } - MP_CHECKOK(mp_submod(&group->meth->irr, &ry, &group->meth->irr, &ry)); - if ((mp_cmp(&rx, &gx) != 0) || (mp_cmp(&ry, &gy) != 0)) { - printf(" Error: invalid result (expected (- base point)).\n"); - res = MP_NO; - goto CLEANUP; - } + /* multiply base point by order - 1 and check for negative of base + * point */ + MP_CHECKOK(ECPoint_mul(group, &order_1, NULL, NULL, &rx, &ry)); + if (ectestPrint) { + printf(" (order-1)*P (ECPoint_mul):\n"); + MP_CHECKOK(mp_toradix(&rx, s, 16)); + printf(" %s\n", s); + MP_CHECKOK(mp_toradix(&ry, s, 16)); + printf(" %s\n", s); + } + MP_CHECKOK(mp_submod(&group->meth->irr, &ry, &group->meth->irr, &ry)); + if ((mp_cmp(&rx, &gx) != 0) || (mp_cmp(&ry, &gy) != 0)) { + printf(" Error: invalid result (expected (- base point)).\n"); + res = MP_NO; + goto CLEANUP; + } - /* multiply base point by order - 1 and check for negative of base - * point */ - MP_CHECKOK(ECPoint_mul(group, &order_1, &gx, &gy, &rx, &ry)); - if (ectestPrint) { - printf(" (order-1)*P (ECPoint_mul):\n"); - MP_CHECKOK(mp_toradix(&rx, s, 16)); - printf(" %s\n", s); - MP_CHECKOK(mp_toradix(&ry, s, 16)); - printf(" %s\n", s); - } - MP_CHECKOK(mp_submod(&group->meth->irr, &ry, &group->meth->irr, &ry)); - if ((mp_cmp(&rx, &gx) != 0) || (mp_cmp(&ry, &gy) != 0)) { - printf(" Error: invalid result (expected (- base point)).\n"); - res = MP_NO; - goto CLEANUP; - } + /* multiply base point by order - 1 and check for negative of base + * point */ + MP_CHECKOK(ECPoint_mul(group, &order_1, &gx, &gy, &rx, &ry)); + if (ectestPrint) { + printf(" (order-1)*P (ECPoint_mul):\n"); + MP_CHECKOK(mp_toradix(&rx, s, 16)); + printf(" %s\n", s); + MP_CHECKOK(mp_toradix(&ry, s, 16)); + printf(" %s\n", s); + } + MP_CHECKOK(mp_submod(&group->meth->irr, &ry, &group->meth->irr, &ry)); + if ((mp_cmp(&rx, &gx) != 0) || (mp_cmp(&ry, &gy) != 0)) { + printf(" Error: invalid result (expected (- base point)).\n"); + res = MP_NO; + goto CLEANUP; + } #ifdef ECL_ENABLE_GFP_PT_MUL_AFF - /* multiply base point by order and check for point at infinity */ - MP_CHECKOK(ec_GFp_pt_mul_aff - (&group->order, &group->genx, &group->geny, &rx, &ry, - group)); - if (ectestPrint) { - printf(" (order)*P (affine):\n"); - MP_CHECKOK(mp_toradix(&rx, s, 16)); - printf(" %s\n", s); - MP_CHECKOK(mp_toradix(&ry, s, 16)); - printf(" %s\n", s); - } - if (ec_GFp_pt_is_inf_aff(&rx, &ry) != MP_YES) { - printf(" Error: invalid result (expected point at infinity).\n"); - res = MP_NO; - goto CLEANUP; - } + /* multiply base point by order and check for point at infinity */ + MP_CHECKOK(ec_GFp_pt_mul_aff(&group->order, &group->genx, &group->geny, &rx, &ry, + group)); + if (ectestPrint) { + printf(" (order)*P (affine):\n"); + MP_CHECKOK(mp_toradix(&rx, s, 16)); + printf(" %s\n", s); + MP_CHECKOK(mp_toradix(&ry, s, 16)); + printf(" %s\n", s); + } + if (ec_GFp_pt_is_inf_aff(&rx, &ry) != MP_YES) { + printf(" Error: invalid result (expected point at infinity).\n"); + res = MP_NO; + goto CLEANUP; + } #endif #ifdef ECL_ENABLE_GFP_PT_MUL_JAC - /* multiply base point by order and check for point at infinity */ - MP_CHECKOK(ec_GFp_pt_mul_jac - (&group->order, &group->genx, &group->geny, &rx, &ry, - group)); - if (ectestPrint) { - printf(" (order)*P (jacobian):\n"); - MP_CHECKOK(mp_toradix(&rx, s, 16)); - printf(" %s\n", s); - MP_CHECKOK(mp_toradix(&ry, s, 16)); - printf(" %s\n", s); - } - if (ec_GFp_pt_is_inf_aff(&rx, &ry) != MP_YES) { - printf(" Error: invalid result (expected point at infinity).\n"); - res = MP_NO; - goto CLEANUP; - } + /* multiply base point by order and check for point at infinity */ + MP_CHECKOK(ec_GFp_pt_mul_jac(&group->order, &group->genx, &group->geny, &rx, &ry, + group)); + if (ectestPrint) { + printf(" (order)*P (jacobian):\n"); + MP_CHECKOK(mp_toradix(&rx, s, 16)); + printf(" %s\n", s); + MP_CHECKOK(mp_toradix(&ry, s, 16)); + printf(" %s\n", s); + } + if (ec_GFp_pt_is_inf_aff(&rx, &ry) != MP_YES) { + printf(" Error: invalid result (expected point at infinity).\n"); + res = MP_NO; + goto CLEANUP; + } #endif - /* multiply base point by order and check for point at infinity */ - MP_CHECKOK(ECPoint_mul(group, &group->order, NULL, NULL, &rx, &ry)); - if (ectestPrint) { - printf(" (order)*P (ECPoint_mul):\n"); - MP_CHECKOK(mp_toradix(&rx, s, 16)); - printf(" %s\n", s); - MP_CHECKOK(mp_toradix(&ry, s, 16)); - printf(" %s\n", s); - } - if (ec_GFp_pt_is_inf_aff(&rx, &ry) != MP_YES) { - printf(" Error: invalid result (expected point at infinity).\n"); - res = MP_NO; - goto CLEANUP; - } + /* multiply base point by order and check for point at infinity */ + MP_CHECKOK(ECPoint_mul(group, &group->order, NULL, NULL, &rx, &ry)); + if (ectestPrint) { + printf(" (order)*P (ECPoint_mul):\n"); + MP_CHECKOK(mp_toradix(&rx, s, 16)); + printf(" %s\n", s); + MP_CHECKOK(mp_toradix(&ry, s, 16)); + printf(" %s\n", s); + } + if (ec_GFp_pt_is_inf_aff(&rx, &ry) != MP_YES) { + printf(" Error: invalid result (expected point at infinity).\n"); + res = MP_NO; + goto CLEANUP; + } - /* multiply base point by order and check for point at infinity */ - MP_CHECKOK(ECPoint_mul(group, &group->order, &gx, &gy, &rx, &ry)); - if (ectestPrint) { - printf(" (order)*P (ECPoint_mul):\n"); - MP_CHECKOK(mp_toradix(&rx, s, 16)); - printf(" %s\n", s); - MP_CHECKOK(mp_toradix(&ry, s, 16)); - printf(" %s\n", s); - } - if (ec_GFp_pt_is_inf_aff(&rx, &ry) != MP_YES) { - printf(" Error: invalid result (expected point at infinity).\n"); - res = MP_NO; - goto CLEANUP; - } + /* multiply base point by order and check for point at infinity */ + MP_CHECKOK(ECPoint_mul(group, &group->order, &gx, &gy, &rx, &ry)); + if (ectestPrint) { + printf(" (order)*P (ECPoint_mul):\n"); + MP_CHECKOK(mp_toradix(&rx, s, 16)); + printf(" %s\n", s); + MP_CHECKOK(mp_toradix(&ry, s, 16)); + printf(" %s\n", s); + } + if (ec_GFp_pt_is_inf_aff(&rx, &ry) != MP_YES) { + printf(" Error: invalid result (expected point at infinity).\n"); + res = MP_NO; + goto CLEANUP; + } - /* check that (order-1)P + (order-1)P + P == (order-1)P */ - MP_CHECKOK(ECPoints_mul - (group, &order_1, &order_1, &gx, &gy, &rx, &ry)); - MP_CHECKOK(ECPoints_mul(group, &one, &one, &rx, &ry, &rx, &ry)); - if (ectestPrint) { - printf - (" (order-1)*P + (order-1)*P + P == (order-1)*P (ECPoints_mul):\n"); - MP_CHECKOK(mp_toradix(&rx, s, 16)); - printf(" %s\n", s); - MP_CHECKOK(mp_toradix(&ry, s, 16)); - printf(" %s\n", s); - } - MP_CHECKOK(mp_submod(&group->meth->irr, &ry, &group->meth->irr, &ry)); - if ((mp_cmp(&rx, &gx) != 0) || (mp_cmp(&ry, &gy) != 0)) { - printf(" Error: invalid result (expected (- base point)).\n"); - res = MP_NO; - goto CLEANUP; - } + /* check that (order-1)P + (order-1)P + P == (order-1)P */ + MP_CHECKOK(ECPoints_mul(group, &order_1, &order_1, &gx, &gy, &rx, &ry)); + MP_CHECKOK(ECPoints_mul(group, &one, &one, &rx, &ry, &rx, &ry)); + if (ectestPrint) { + printf(" (order-1)*P + (order-1)*P + P == (order-1)*P (ECPoints_mul):\n"); + MP_CHECKOK(mp_toradix(&rx, s, 16)); + printf(" %s\n", s); + MP_CHECKOK(mp_toradix(&ry, s, 16)); + printf(" %s\n", s); + } + MP_CHECKOK(mp_submod(&group->meth->irr, &ry, &group->meth->irr, &ry)); + if ((mp_cmp(&rx, &gx) != 0) || (mp_cmp(&ry, &gy) != 0)) { + printf(" Error: invalid result (expected (- base point)).\n"); + res = MP_NO; + goto CLEANUP; + } - /* test validate_point function */ - if (ECPoint_validate(group, &gx, &gy) != MP_YES) { - printf(" Error: validate point on base point failed.\n"); - res = MP_NO; - goto CLEANUP; - } - MP_CHECKOK(mp_add_d(&gy, 1, &ry)); - if (ECPoint_validate(group, &gx, &ry) != MP_NO) { - printf(" Error: validate point on invalid point passed.\n"); - res = MP_NO; - goto CLEANUP; - } + /* test validate_point function */ + if (ECPoint_validate(group, &gx, &gy) != MP_YES) { + printf(" Error: validate point on base point failed.\n"); + res = MP_NO; + goto CLEANUP; + } + MP_CHECKOK(mp_add_d(&gy, 1, &ry)); + if (ECPoint_validate(group, &gx, &ry) != MP_NO) { + printf(" Error: validate point on invalid point passed.\n"); + res = MP_NO; + goto CLEANUP; + } - if (ectestTime) { - /* compute random scalar */ - size = mpl_significant_bits(&group->meth->irr); - if (size < MP_OKAY) { - goto CLEANUP; - } - MP_CHECKOK(mpp_random_size(&n, (size + ECL_BITS - 1) / ECL_BITS)); - MP_CHECKOK(group->meth->field_mod(&n, &n, group->meth)); - /* timed test */ - if (generic) { + if (ectestTime) { + /* compute random scalar */ + size = mpl_significant_bits(&group->meth->irr); + if (size < MP_OKAY) { + goto CLEANUP; + } + MP_CHECKOK(mpp_random_size(&n, (size + ECL_BITS - 1) / ECL_BITS)); + MP_CHECKOK(group->meth->field_mod(&n, &n, group->meth)); + /* timed test */ + if (generic) { #ifdef ECL_ENABLE_GFP_PT_MUL_AFF - M_TimeOperation(MP_CHECKOK - (ec_GFp_pt_mul_aff - (&n, &group->genx, &group->geny, &rx, &ry, - group)), 100); + M_TimeOperation(MP_CHECKOK(ec_GFp_pt_mul_aff(&n, &group->genx, &group->geny, &rx, &ry, + group)), + 100); #endif - M_TimeOperation(MP_CHECKOK - (ECPoint_mul(group, &n, NULL, NULL, &rx, &ry)), - 100); - M_TimeOperation(MP_CHECKOK - (ECPoints_mul - (group, &n, &n, &gx, &gy, &rx, &ry)), 100); - } else { - M_TimeOperation(MP_CHECKOK - (ECPoint_mul(group, &n, NULL, NULL, &rx, &ry)), - 100); - M_TimeOperation(MP_CHECKOK - (ECPoint_mul(group, &n, &gx, &gy, &rx, &ry)), - 100); - M_TimeOperation(MP_CHECKOK - (ECPoints_mul - (group, &n, &n, &gx, &gy, &rx, &ry)), 100); - } - } + M_TimeOperation(MP_CHECKOK(ECPoint_mul(group, &n, NULL, NULL, &rx, &ry)), + 100); + M_TimeOperation(MP_CHECKOK(ECPoints_mul(group, &n, &n, &gx, &gy, &rx, &ry)), 100); + } else { + M_TimeOperation(MP_CHECKOK(ECPoint_mul(group, &n, NULL, NULL, &rx, &ry)), + 100); + M_TimeOperation(MP_CHECKOK(ECPoint_mul(group, &n, &gx, &gy, &rx, &ry)), + 100); + M_TimeOperation(MP_CHECKOK(ECPoints_mul(group, &n, &n, &gx, &gy, &rx, &ry)), 100); + } + } - CLEANUP: - mp_clear(&one); - mp_clear(&order_1); - mp_clear(&gx); - mp_clear(&gy); - mp_clear(&rx); - mp_clear(&ry); - mp_clear(&n); - if (res != MP_OKAY) { - printf(" Error: exiting with error value %i\n", res); - } - return res; +CLEANUP: + mp_clear(&one); + mp_clear(&order_1); + mp_clear(&gx); + mp_clear(&gy); + mp_clear(&rx); + mp_clear(&ry); + mp_clear(&n); + if (res != MP_OKAY) { + printf(" Error: exiting with error value %i\n", res); + } + return res; } /* Prints help information. */ void printUsage() { - printf("Usage: ecp_test [--print] [--time]\n"); - printf - (" --print Print out results of each point arithmetic test.\n"); - printf - (" --time Benchmark point operations and print results.\n"); + printf("Usage: ecp_test [--print] [--time]\n"); + printf(" --print Print out results of each point arithmetic test.\n"); + printf(" --time Benchmark point operations and print results.\n"); } /* Performs tests of elliptic curve cryptography over prime fields If @@ -356,71 +342,68 @@ int main(int argv, char **argc) { - int ectestTime = 0; - int ectestPrint = 0; - int i; - ECGroup *group = NULL; - ECCurveParams *params = NULL; - mp_err res; + int ectestTime = 0; + int ectestPrint = 0; + int i; + ECGroup *group = NULL; + ECCurveParams *params = NULL; + mp_err res; - /* read command-line arguments */ - for (i = 1; i < argv; i++) { - if ((strcasecmp(argc[i], "time") == 0) - || (strcasecmp(argc[i], "-time") == 0) - || (strcasecmp(argc[i], "--time") == 0)) { - ectestTime = 1; - } else if ((strcasecmp(argc[i], "print") == 0) - || (strcasecmp(argc[i], "-print") == 0) - || (strcasecmp(argc[i], "--print") == 0)) { - ectestPrint = 1; - } else { - printUsage(); - return 0; - } - } + /* read command-line arguments */ + for (i = 1; i < argv; i++) { + if ((strcasecmp(argc[i], "time") == 0) || (strcasecmp(argc[i], "-time") == 0) || (strcasecmp(argc[i], "--time") == 0)) { + ectestTime = 1; + } else if ((strcasecmp(argc[i], "print") == 0) || (strcasecmp(argc[i], "-print") == 0) || (strcasecmp(argc[i], "--print") == 0)) { + ectestPrint = 1; + } else { + printUsage(); + return 0; + } + } - /* generic arithmetic tests */ - ECTEST_GENERIC_GFP("SECP-160R1", ECCurve_SECG_PRIME_160R1); + /* generic arithmetic tests */ + ECTEST_GENERIC_GFP("SECP-160R1", ECCurve_SECG_PRIME_160R1); - /* specific arithmetic tests */ - ECTEST_NAMED_GFP("NIST-P192", ECCurve_NIST_P192); - ECTEST_NAMED_GFP("NIST-P224", ECCurve_NIST_P224); - ECTEST_NAMED_GFP("NIST-P256", ECCurve_NIST_P256); - ECTEST_NAMED_GFP("NIST-P384", ECCurve_NIST_P384); - ECTEST_NAMED_GFP("NIST-P521", ECCurve_NIST_P521); - ECTEST_NAMED_GFP("ANSI X9.62 PRIME192v1", ECCurve_X9_62_PRIME_192V1); - ECTEST_NAMED_GFP("ANSI X9.62 PRIME192v2", ECCurve_X9_62_PRIME_192V2); - ECTEST_NAMED_GFP("ANSI X9.62 PRIME192v3", ECCurve_X9_62_PRIME_192V3); - ECTEST_NAMED_GFP("ANSI X9.62 PRIME239v1", ECCurve_X9_62_PRIME_239V1); - ECTEST_NAMED_GFP("ANSI X9.62 PRIME239v2", ECCurve_X9_62_PRIME_239V2); - ECTEST_NAMED_GFP("ANSI X9.62 PRIME239v3", ECCurve_X9_62_PRIME_239V3); - ECTEST_NAMED_GFP("ANSI X9.62 PRIME256v1", ECCurve_X9_62_PRIME_256V1); - ECTEST_NAMED_GFP("SECP-112R1", ECCurve_SECG_PRIME_112R1); - ECTEST_NAMED_GFP("SECP-112R2", ECCurve_SECG_PRIME_112R2); - ECTEST_NAMED_GFP("SECP-128R1", ECCurve_SECG_PRIME_128R1); - ECTEST_NAMED_GFP("SECP-128R2", ECCurve_SECG_PRIME_128R2); - ECTEST_NAMED_GFP("SECP-160K1", ECCurve_SECG_PRIME_160K1); - ECTEST_NAMED_GFP("SECP-160R1", ECCurve_SECG_PRIME_160R1); - ECTEST_NAMED_GFP("SECP-160R2", ECCurve_SECG_PRIME_160R2); - ECTEST_NAMED_GFP("SECP-192K1", ECCurve_SECG_PRIME_192K1); - ECTEST_NAMED_GFP("SECP-192R1", ECCurve_SECG_PRIME_192R1); - ECTEST_NAMED_GFP("SECP-224K1", ECCurve_SECG_PRIME_224K1); - ECTEST_NAMED_GFP("SECP-224R1", ECCurve_SECG_PRIME_224R1); - ECTEST_NAMED_GFP("SECP-256K1", ECCurve_SECG_PRIME_256K1); - ECTEST_NAMED_GFP("SECP-256R1", ECCurve_SECG_PRIME_256R1); - ECTEST_NAMED_GFP("SECP-384R1", ECCurve_SECG_PRIME_384R1); - ECTEST_NAMED_GFP("SECP-521R1", ECCurve_SECG_PRIME_521R1); - ECTEST_NAMED_GFP("WTLS-6 (112)", ECCurve_WTLS_6); - ECTEST_NAMED_GFP("WTLS-7 (160)", ECCurve_WTLS_7); - ECTEST_NAMED_GFP("WTLS-8 (112)", ECCurve_WTLS_8); - ECTEST_NAMED_GFP("WTLS-9 (160)", ECCurve_WTLS_9); - ECTEST_NAMED_GFP("WTLS-12 (224)", ECCurve_WTLS_12); + /* specific arithmetic tests */ + ECTEST_NAMED_GFP("NIST-P192", ECCurve_NIST_P192); + ECTEST_NAMED_GFP("NIST-P224", ECCurve_NIST_P224); + ECTEST_NAMED_GFP("NIST-P256", ECCurve_NIST_P256); + ECTEST_NAMED_GFP("NIST-P384", ECCurve_NIST_P384); + ECTEST_NAMED_GFP("NIST-P521", ECCurve_NIST_P521); + ECTEST_NAMED_GFP("ANSI X9.62 PRIME192v1", ECCurve_X9_62_PRIME_192V1); + ECTEST_NAMED_GFP("ANSI X9.62 PRIME192v2", ECCurve_X9_62_PRIME_192V2); + ECTEST_NAMED_GFP("ANSI X9.62 PRIME192v3", ECCurve_X9_62_PRIME_192V3); + ECTEST_NAMED_GFP("ANSI X9.62 PRIME239v1", ECCurve_X9_62_PRIME_239V1); + ECTEST_NAMED_GFP("ANSI X9.62 PRIME239v2", ECCurve_X9_62_PRIME_239V2); + ECTEST_NAMED_GFP("ANSI X9.62 PRIME239v3", ECCurve_X9_62_PRIME_239V3); + ECTEST_NAMED_GFP("ANSI X9.62 PRIME256v1", ECCurve_X9_62_PRIME_256V1); + ECTEST_NAMED_GFP("SECP-112R1", ECCurve_SECG_PRIME_112R1); + ECTEST_NAMED_GFP("SECP-112R2", ECCurve_SECG_PRIME_112R2); + ECTEST_NAMED_GFP("SECP-128R1", ECCurve_SECG_PRIME_128R1); + ECTEST_NAMED_GFP("SECP-128R2", ECCurve_SECG_PRIME_128R2); + ECTEST_NAMED_GFP("SECP-160K1", ECCurve_SECG_PRIME_160K1); + ECTEST_NAMED_GFP("SECP-160R1", ECCurve_SECG_PRIME_160R1); + ECTEST_NAMED_GFP("SECP-160R2", ECCurve_SECG_PRIME_160R2); + ECTEST_NAMED_GFP("SECP-192K1", ECCurve_SECG_PRIME_192K1); + ECTEST_NAMED_GFP("SECP-192R1", ECCurve_SECG_PRIME_192R1); + ECTEST_NAMED_GFP("SECP-224K1", ECCurve_SECG_PRIME_224K1); + ECTEST_NAMED_GFP("SECP-224R1", ECCurve_SECG_PRIME_224R1); + ECTEST_NAMED_GFP("SECP-256K1", ECCurve_SECG_PRIME_256K1); + ECTEST_NAMED_GFP("SECP-256R1", ECCurve_SECG_PRIME_256R1); + ECTEST_NAMED_GFP("SECP-384R1", ECCurve_SECG_PRIME_384R1); + ECTEST_NAMED_GFP("SECP-521R1", ECCurve_SECG_PRIME_521R1); + ECTEST_NAMED_GFP("WTLS-6 (112)", ECCurve_WTLS_6); + ECTEST_NAMED_GFP("WTLS-7 (160)", ECCurve_WTLS_7); + ECTEST_NAMED_GFP("WTLS-8 (112)", ECCurve_WTLS_8); + ECTEST_NAMED_GFP("WTLS-9 (160)", ECCurve_WTLS_9); + ECTEST_NAMED_GFP("WTLS-12 (224)", ECCurve_WTLS_12); + ECTEST_NAMED_GFP("Curve25519", ECCurve25519); - CLEANUP: - EC_FreeCurveParams(params); - ECGroup_free(group); - if (res != MP_OKAY) { - printf("Error: exiting with error value %i\n", res); - } - return res; +CLEANUP: + EC_FreeCurveParams(params); + ECGroup_free(group); + if (res != MP_OKAY) { + printf("Error: exiting with error value %i\n", res); + } + return res; } |