diff options
Diffstat (limited to 'src/lib/libcrypto/bn/bn_gf2m.c')
-rw-r--r-- | src/lib/libcrypto/bn/bn_gf2m.c | 19 |
1 files changed, 9 insertions, 10 deletions
diff --git a/src/lib/libcrypto/bn/bn_gf2m.c b/src/lib/libcrypto/bn/bn_gf2m.c index 62395f60eb..8562b3f87e 100644 --- a/src/lib/libcrypto/bn/bn_gf2m.c +++ b/src/lib/libcrypto/bn/bn_gf2m.c | |||
@@ -1,4 +1,4 @@ | |||
1 | /* $OpenBSD: bn_gf2m.c,v 1.22 2016/09/03 14:37:00 bcook Exp $ */ | 1 | /* $OpenBSD: bn_gf2m.c,v 1.23 2017/01/29 17:49:22 beck Exp $ */ |
2 | /* ==================================================================== | 2 | /* ==================================================================== |
3 | * Copyright 2002 Sun Microsystems, Inc. ALL RIGHTS RESERVED. | 3 | * Copyright 2002 Sun Microsystems, Inc. ALL RIGHTS RESERVED. |
4 | * | 4 | * |
@@ -470,7 +470,7 @@ BN_GF2m_mod(BIGNUM *r, const BIGNUM *a, const BIGNUM *p) | |||
470 | bn_check_top(p); | 470 | bn_check_top(p); |
471 | ret = BN_GF2m_poly2arr(p, arr, sizeof(arr) / sizeof(arr[0])); | 471 | ret = BN_GF2m_poly2arr(p, arr, sizeof(arr) / sizeof(arr[0])); |
472 | if (!ret || ret > (int)(sizeof(arr) / sizeof(arr[0]))) { | 472 | if (!ret || ret > (int)(sizeof(arr) / sizeof(arr[0]))) { |
473 | BNerr(BN_F_BN_GF2M_MOD, BN_R_INVALID_LENGTH); | 473 | BNerror(BN_R_INVALID_LENGTH); |
474 | return 0; | 474 | return 0; |
475 | } | 475 | } |
476 | ret = BN_GF2m_mod_arr(r, a, arr); | 476 | ret = BN_GF2m_mod_arr(r, a, arr); |
@@ -553,7 +553,7 @@ BN_GF2m_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *p, | |||
553 | goto err; | 553 | goto err; |
554 | ret = BN_GF2m_poly2arr(p, arr, max); | 554 | ret = BN_GF2m_poly2arr(p, arr, max); |
555 | if (!ret || ret > max) { | 555 | if (!ret || ret > max) { |
556 | BNerr(BN_F_BN_GF2M_MOD_MUL, BN_R_INVALID_LENGTH); | 556 | BNerror(BN_R_INVALID_LENGTH); |
557 | goto err; | 557 | goto err; |
558 | } | 558 | } |
559 | ret = BN_GF2m_mod_mul_arr(r, a, b, arr, ctx); | 559 | ret = BN_GF2m_mod_mul_arr(r, a, b, arr, ctx); |
@@ -615,7 +615,7 @@ BN_GF2m_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx) | |||
615 | goto err; | 615 | goto err; |
616 | ret = BN_GF2m_poly2arr(p, arr, max); | 616 | ret = BN_GF2m_poly2arr(p, arr, max); |
617 | if (!ret || ret > max) { | 617 | if (!ret || ret > max) { |
618 | BNerr(BN_F_BN_GF2M_MOD_SQR, BN_R_INVALID_LENGTH); | 618 | BNerror(BN_R_INVALID_LENGTH); |
619 | goto err; | 619 | goto err; |
620 | } | 620 | } |
621 | ret = BN_GF2m_mod_sqr_arr(r, a, arr, ctx); | 621 | ret = BN_GF2m_mod_sqr_arr(r, a, arr, ctx); |
@@ -1052,7 +1052,7 @@ BN_GF2m_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *p, | |||
1052 | goto err; | 1052 | goto err; |
1053 | ret = BN_GF2m_poly2arr(p, arr, max); | 1053 | ret = BN_GF2m_poly2arr(p, arr, max); |
1054 | if (!ret || ret > max) { | 1054 | if (!ret || ret > max) { |
1055 | BNerr(BN_F_BN_GF2M_MOD_EXP, BN_R_INVALID_LENGTH); | 1055 | BNerror(BN_R_INVALID_LENGTH); |
1056 | goto err; | 1056 | goto err; |
1057 | } | 1057 | } |
1058 | ret = BN_GF2m_mod_exp_arr(r, a, b, arr, ctx); | 1058 | ret = BN_GF2m_mod_exp_arr(r, a, b, arr, ctx); |
@@ -1114,7 +1114,7 @@ BN_GF2m_mod_sqrt(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx) | |||
1114 | goto err; | 1114 | goto err; |
1115 | ret = BN_GF2m_poly2arr(p, arr, max); | 1115 | ret = BN_GF2m_poly2arr(p, arr, max); |
1116 | if (!ret || ret > max) { | 1116 | if (!ret || ret > max) { |
1117 | BNerr(BN_F_BN_GF2M_MOD_SQRT, BN_R_INVALID_LENGTH); | 1117 | BNerror(BN_R_INVALID_LENGTH); |
1118 | goto err; | 1118 | goto err; |
1119 | } | 1119 | } |
1120 | ret = BN_GF2m_mod_sqrt_arr(r, a, arr, ctx); | 1120 | ret = BN_GF2m_mod_sqrt_arr(r, a, arr, ctx); |
@@ -1206,8 +1206,7 @@ BN_GF2m_mod_solve_quad_arr(BIGNUM *r, const BIGNUM *a_, const int p[], | |||
1206 | count++; | 1206 | count++; |
1207 | } while (BN_is_zero(w) && (count < MAX_ITERATIONS)); | 1207 | } while (BN_is_zero(w) && (count < MAX_ITERATIONS)); |
1208 | if (BN_is_zero(w)) { | 1208 | if (BN_is_zero(w)) { |
1209 | BNerr(BN_F_BN_GF2M_MOD_SOLVE_QUAD_ARR, | 1209 | BNerror(BN_R_TOO_MANY_ITERATIONS); |
1210 | BN_R_TOO_MANY_ITERATIONS); | ||
1211 | goto err; | 1210 | goto err; |
1212 | } | 1211 | } |
1213 | } | 1212 | } |
@@ -1217,7 +1216,7 @@ BN_GF2m_mod_solve_quad_arr(BIGNUM *r, const BIGNUM *a_, const int p[], | |||
1217 | if (!BN_GF2m_add(w, z, w)) | 1216 | if (!BN_GF2m_add(w, z, w)) |
1218 | goto err; | 1217 | goto err; |
1219 | if (BN_GF2m_cmp(w, a)) { | 1218 | if (BN_GF2m_cmp(w, a)) { |
1220 | BNerr(BN_F_BN_GF2M_MOD_SOLVE_QUAD_ARR, BN_R_NO_SOLUTION); | 1219 | BNerror(BN_R_NO_SOLUTION); |
1221 | goto err; | 1220 | goto err; |
1222 | } | 1221 | } |
1223 | 1222 | ||
@@ -1251,7 +1250,7 @@ BN_GF2m_mod_solve_quad(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx) | |||
1251 | goto err; | 1250 | goto err; |
1252 | ret = BN_GF2m_poly2arr(p, arr, max); | 1251 | ret = BN_GF2m_poly2arr(p, arr, max); |
1253 | if (!ret || ret > max) { | 1252 | if (!ret || ret > max) { |
1254 | BNerr(BN_F_BN_GF2M_MOD_SOLVE_QUAD, BN_R_INVALID_LENGTH); | 1253 | BNerror(BN_R_INVALID_LENGTH); |
1255 | goto err; | 1254 | goto err; |
1256 | } | 1255 | } |
1257 | ret = BN_GF2m_mod_solve_quad_arr(r, a, arr, ctx); | 1256 | ret = BN_GF2m_mod_solve_quad_arr(r, a, arr, ctx); |