test/rsa_sp800_56b_test.c:352: error: BUFFER_OVERRUN_L3
  Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `rsa_check_crt_components`.
Showing all 26 steps of the trace


test/rsa_sp800_56b_test.c:343:14: Call
341.             && TEST_ptr(q = BN_new())
342.             && TEST_ptr(e = BN_new())
343.             && TEST_true(BN_set_word(p, P))
                    ^
344.             && TEST_true(BN_set_word(q, Q))
345.             && TEST_true(BN_set_word(e, E))

crypto/bn/bn_lib.c:366:15: Assignment
  364.       a->neg = 0;
  365.       a->d[0] = w;
  366.       a->top = (w ? 1 : 0);
                       ^
  367.       a->flags &= ~BN_FLG_FIXED_TOP;
  368.       bn_check_top(a);

crypto/bn/bn_lib.c:366:5: Assignment
  364.       a->neg = 0;
  365.       a->d[0] = w;
  366.       a->top = (w ? 1 : 0);
             ^
  367.       a->flags &= ~BN_FLG_FIXED_TOP;
  368.       bn_check_top(a);

test/rsa_sp800_56b_test.c:352:14: Call
350.             && TEST_BN_eq_word(key->dmq1, DQ)
351.             && TEST_BN_eq_word(key->iqmp, QINV)
352.             && TEST_true(rsa_check_crt_components(key, ctx))
                    ^
353.             /* (a) 1 < dP < (p – 1). */
354.             && TEST_true(BN_set_word(key->dmp1, 1))

crypto/rsa/rsa_sp800_56b_check.c:24:1: Parameter `rsa->dmp1->top`
  22.    *   6.4.1.3.3: rsakpv2-crt Step 7
  23.    */
  24. > int rsa_check_crt_components(const RSA *rsa, BN_CTX *ctx)
  25.   {
  26.       int ret = 0;

crypto/rsa/rsa_sp800_56b_check.c:48:15: Call
  46.             && BN_sub_word(q1, 1)
  47.             /* (a) 1 < dP < (p – 1). */
  48.             && (BN_cmp(rsa->dmp1, BN_value_one()) > 0)
                      ^
  49.             && (BN_cmp(rsa->dmp1, p1) < 0)
  50.             /* (b) 1 < dQ < (q - 1). */

crypto/bn/bn_lib.c:579:1: Parameter `a->top`
    577.   }
    578.   
    579. > int BN_cmp(const BIGNUM *a, const BIGNUM *b)
    580.   {
    581.       int i;

crypto/rsa/rsa_sp800_56b_check.c:49:15: Call
  47.             /* (a) 1 < dP < (p – 1). */
  48.             && (BN_cmp(rsa->dmp1, BN_value_one()) > 0)
  49.             && (BN_cmp(rsa->dmp1, p1) < 0)
                      ^
  50.             /* (b) 1 < dQ < (q - 1). */
  51.             && (BN_cmp(rsa->dmq1, BN_value_one()) > 0)

crypto/bn/bn_lib.c:579:1: Parameter `a->top`
    577.   }
    578.   
    579. > int BN_cmp(const BIGNUM *a, const BIGNUM *b)
    580.   {
    581.       int i;

crypto/rsa/rsa_sp800_56b_check.c:57:14: Call
  55.             && (BN_cmp(rsa->iqmp, rsa->p) < 0)
  56.             /* (d) 1 = (dP . e) mod (p - 1)*/
  57.             && BN_mod_mul(r, rsa->dmp1, rsa->e, p1, ctx)
                     ^
  58.             && BN_is_one(r)
  59.             /* (e) 1 = (dQ . e) mod (q - 1) */

crypto/bn/bn_mod.c:193:1: Parameter `a->top`
    191.   
    192.   /* slow but works */
    193. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
    194.                  BN_CTX *ctx)
    195.   {

crypto/bn/bn_mod.c:207:14: Call
    205.           goto err;
    206.       if (a == b) {
    207.           if (!BN_sqr(t, a, ctx))
                        ^
    208.               goto err;
    209.       } else {

crypto/bn/bn_sqr.c:17:1: Parameter `*r->d`
      15.    * I've just gone over this and it is now %20 faster on x86 - eay - 27 Jun 96
      16.    */
      17. > int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
      18.   {
      19.       int ret = bn_sqr_fixed_top(r, a, ctx);

crypto/bn/bn_sqr.c:19:15: Call
      17.   int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
      18.   {
      19.       int ret = bn_sqr_fixed_top(r, a, ctx);
                          ^
      20.   
      21.       bn_correct_top(r);

crypto/bn/bn_sqr.c:27:1: Parameter `a->top`
        25.   }
        26.   
        27. > int bn_sqr_fixed_top(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
        28.   {
        29.       int max, al;

crypto/bn/bn_sqr.c:35:5: Assignment
        33.       bn_check_top(a);
        34.   
        35.       al = a->top;
                  ^
        36.       if (al <= 0) {
        37.           r->top = 0;

crypto/bn/bn_sqr.c:84:17: Call
        82.                   if (bn_wexpand(tmp, max) == NULL)
        83.                       goto err;
        84.                   bn_sqr_normal(rr->d, a->d, al, tmp->d);
                              ^
        85.               }
        86.           }

crypto/bn/bn_sqr.c:109:1: <Offset trace>
107.   
108.   /* tmp must have 2*n words */
109. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
110.   {
111.       int i, j, max;

crypto/bn/bn_sqr.c:109:1: Parameter `n`
          107.   
          108.   /* tmp must have 2*n words */
          109. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
          110.   {
          111.       int i, j, max;

crypto/bn/bn_sqr.c:120:5: Assignment
          118.       rp[0] = rp[max - 1] = 0;
          119.       rp++;
          120.       j = n;
                     ^
          121.   
          122.       if (--j > 0) {

crypto/bn/bn_sqr.c:122:9: Assignment
          120.       j = n;
          121.   
          122.       if (--j > 0) {
                         ^
          123.           ap++;
          124.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);

crypto/bn/bn_sqr.c:109:1: <Length trace>
107.   
108.   /* tmp must have 2*n words */
109. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
110.   {
111.       int i, j, max;

crypto/bn/bn_sqr.c:109:1: Parameter `*r`
          107.   
          108.   /* tmp must have 2*n words */
          109. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
          110.   {
          111.       int i, j, max;

crypto/bn/bn_sqr.c:117:5: Assignment
          115.       max = n * 2;
          116.       ap = a;
          117.       rp = r;
                     ^
          118.       rp[0] = rp[max - 1] = 0;
          119.       rp++;

crypto/bn/bn_sqr.c:119:5: Assignment
          117.       rp = r;
          118.       rp[0] = rp[max - 1] = 0;
          119.       rp++;
                     ^
          120.       j = n;
          121.   

crypto/bn/bn_sqr.c:124:9: Array access: Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `rsa_check_crt_components` 
          122.       if (--j > 0) {
          123.           ap++;
          124.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);
                         ^
          125.           rp += 2;
          126.       }

void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
{
    int i, j, max;
    const BN_ULONG *ap;
    BN_ULONG *rp;
    max = n * 2;
    ap = a;
    rp = r;
    rp[0] = rp[max - 1] = 0;
    rp++;
    j = n;
    if (--j > 0) {
        ap++;
        rp[j] = bn_mul_words(rp, ap, j, ap[-1]);
        rp += 2;
    }
    for (i = n - 2; i > 0; i--) {
        j--;
        ap++;
        rp[j] = bn_mul_add_words(rp, ap, j, ap[-1]);
        rp += 2;
    }
    bn_add_words(r, r, r, max);
    bn_sqr_words(tmp, a, n);
    bn_add_words(r, r, tmp, max);
}
['static int test_check_crt_components(void)\n{\n    const int P = 15;\n    const int Q = 17;\n    const int E = 5;\n    const int N = P*Q;\n    const int DP = 3;\n    const int DQ = 13;\n    const int QINV = 8;\n    int ret = 0;\n    RSA *key = NULL;\n    BN_CTX *ctx = NULL;\n    BIGNUM *p = NULL, *q = NULL, *e = NULL;\n    ret = TEST_ptr(key = RSA_new())\n          && TEST_ptr(ctx = BN_CTX_new())\n          && TEST_ptr(p = BN_new())\n          && TEST_ptr(q = BN_new())\n          && TEST_ptr(e = BN_new())\n          && TEST_true(BN_set_word(p, P))\n          && TEST_true(BN_set_word(q, Q))\n          && TEST_true(BN_set_word(e, E))\n          && TEST_true(RSA_set0_factors(key, p, q))\n          && TEST_true(rsa_sp800_56b_derive_params_from_pq(key, 8, e, ctx))\n          && TEST_BN_eq_word(key->n, N)\n          && TEST_BN_eq_word(key->dmp1, DP)\n          && TEST_BN_eq_word(key->dmq1, DQ)\n          && TEST_BN_eq_word(key->iqmp, QINV)\n          && TEST_true(rsa_check_crt_components(key, ctx))\n          && TEST_true(BN_set_word(key->dmp1, 1))\n          && TEST_false(rsa_check_crt_components(key, ctx))\n          && TEST_true(BN_set_word(key->dmp1, P-1))\n          && TEST_false(rsa_check_crt_components(key, ctx))\n          && TEST_true(BN_set_word(key->dmp1, DP))\n          && TEST_true(BN_set_word(key->dmq1, 1))\n          && TEST_false(rsa_check_crt_components(key, ctx))\n          && TEST_true(BN_set_word(key->dmq1, Q-1))\n          && TEST_false(rsa_check_crt_components(key, ctx))\n          && TEST_true(BN_set_word(key->dmq1, DQ))\n          && TEST_true(BN_set_word(key->iqmp, 1))\n          && TEST_false(rsa_check_crt_components(key, ctx))\n          && TEST_true(BN_set_word(key->iqmp, P))\n          && TEST_false(rsa_check_crt_components(key, ctx))\n          && TEST_true(BN_set_word(key->iqmp, QINV))\n          && TEST_true(BN_set_word(key->dmp1, DP+1))\n          && TEST_false(rsa_check_crt_components(key, ctx))\n          && TEST_true(BN_set_word(key->dmp1, DP))\n          && TEST_true(BN_set_word(key->dmq1, DQ-1))\n          && TEST_false(rsa_check_crt_components(key, ctx))\n          && TEST_true(BN_set_word(key->dmq1, DQ))\n          && TEST_true(BN_set_word(key->iqmp, QINV+1))\n          && TEST_false(rsa_check_crt_components(key, ctx))\n          && TEST_true(BN_set_word(key->iqmp, QINV))\n          && TEST_true(rsa_check_crt_components(key, ctx));\n    BN_free(e);\n    RSA_free(key);\n    BN_CTX_free(ctx);\n    return ret;\n}', 'int BN_set_word(BIGNUM *a, BN_ULONG w)\n{\n    bn_check_top(a);\n    if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)\n        return 0;\n    a->neg = 0;\n    a->d[0] = w;\n    a->top = (w ? 1 : 0);\n    a->flags &= ~BN_FLG_FIXED_TOP;\n    bn_check_top(a);\n    return 1;\n}', 'int rsa_check_crt_components(const RSA *rsa, BN_CTX *ctx)\n{\n    int ret = 0;\n    BIGNUM *r = NULL, *p1 = NULL, *q1 = NULL;\n    if (rsa->dmp1 == NULL || rsa->dmq1 == NULL || rsa->iqmp == NULL) {\n        if (rsa->dmp1 != NULL || rsa->dmq1 != NULL || rsa->iqmp != NULL)\n            return 0;\n        return 1;\n    }\n    BN_CTX_start(ctx);\n    r = BN_CTX_get(ctx);\n    p1 = BN_CTX_get(ctx);\n    q1 = BN_CTX_get(ctx);\n    ret = (q1 != NULL)\n          && (BN_copy(p1, rsa->p) != NULL)\n          && BN_sub_word(p1, 1)\n          && (BN_copy(q1, rsa->q) != NULL)\n          && BN_sub_word(q1, 1)\n          && (BN_cmp(rsa->dmp1, BN_value_one()) > 0)\n          && (BN_cmp(rsa->dmp1, p1) < 0)\n          && (BN_cmp(rsa->dmq1, BN_value_one()) > 0)\n          && (BN_cmp(rsa->dmq1, q1) < 0)\n          && (BN_cmp(rsa->iqmp, BN_value_one()) > 0)\n          && (BN_cmp(rsa->iqmp, rsa->p) < 0)\n          && BN_mod_mul(r, rsa->dmp1, rsa->e, p1, ctx)\n          && BN_is_one(r)\n          && BN_mod_mul(r, rsa->dmq1, rsa->e, q1, ctx)\n          && BN_is_one(r)\n          && BN_mod_mul(r, rsa->iqmp, rsa->q, rsa->p, ctx)\n          && BN_is_one(r);\n    BN_clear(p1);\n    BN_clear(q1);\n    BN_CTX_end(ctx);\n    return ret;\n}', 'int BN_cmp(const BIGNUM *a, const BIGNUM *b)\n{\n    int i;\n    int gt, lt;\n    BN_ULONG t1, t2;\n    if ((a == NULL) || (b == NULL)) {\n        if (a != NULL)\n            return -1;\n        else if (b != NULL)\n            return 1;\n        else\n            return 0;\n    }\n    bn_check_top(a);\n    bn_check_top(b);\n    if (a->neg != b->neg) {\n        if (a->neg)\n            return -1;\n        else\n            return 1;\n    }\n    if (a->neg == 0) {\n        gt = 1;\n        lt = -1;\n    } else {\n        gt = -1;\n        lt = 1;\n    }\n    if (a->top > b->top)\n        return gt;\n    if (a->top < b->top)\n        return lt;\n    for (i = a->top - 1; i >= 0; i--) {\n        t1 = a->d[i];\n        t2 = b->d[i];\n        if (t1 > t2)\n            return gt;\n        if (t1 < t2)\n            return lt;\n    }\n    return 0;\n}', 'int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,\n               BN_CTX *ctx)\n{\n    BIGNUM *t;\n    int ret = 0;\n    bn_check_top(a);\n    bn_check_top(b);\n    bn_check_top(m);\n    BN_CTX_start(ctx);\n    if ((t = BN_CTX_get(ctx)) == NULL)\n        goto err;\n    if (a == b) {\n        if (!BN_sqr(t, a, ctx))\n            goto err;\n    } else {\n        if (!BN_mul(t, a, b, ctx))\n            goto err;\n    }\n    if (!BN_nnmod(r, t, m, ctx))\n        goto err;\n    bn_check_top(r);\n    ret = 1;\n err:\n    BN_CTX_end(ctx);\n    return ret;\n}', 'int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)\n{\n    int ret = bn_sqr_fixed_top(r, a, ctx);\n    bn_correct_top(r);\n    bn_check_top(r);\n    return ret;\n}', 'int bn_sqr_fixed_top(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)\n{\n    int max, al;\n    int ret = 0;\n    BIGNUM *tmp, *rr;\n    bn_check_top(a);\n    al = a->top;\n    if (al <= 0) {\n        r->top = 0;\n        r->neg = 0;\n        return 1;\n    }\n    BN_CTX_start(ctx);\n    rr = (a != r) ? r : BN_CTX_get(ctx);\n    tmp = BN_CTX_get(ctx);\n    if (rr == NULL || tmp == NULL)\n        goto err;\n    max = 2 * al;\n    if (bn_wexpand(rr, max) == NULL)\n        goto err;\n    if (al == 4) {\n#ifndef BN_SQR_COMBA\n        BN_ULONG t[8];\n        bn_sqr_normal(rr->d, a->d, 4, t);\n#else\n        bn_sqr_comba4(rr->d, a->d);\n#endif\n    } else if (al == 8) {\n#ifndef BN_SQR_COMBA\n        BN_ULONG t[16];\n        bn_sqr_normal(rr->d, a->d, 8, t);\n#else\n        bn_sqr_comba8(rr->d, a->d);\n#endif\n    } else {\n#if defined(BN_RECURSION)\n        if (al < BN_SQR_RECURSIVE_SIZE_NORMAL) {\n            BN_ULONG t[BN_SQR_RECURSIVE_SIZE_NORMAL * 2];\n            bn_sqr_normal(rr->d, a->d, al, t);\n        } else {\n            int j, k;\n            j = BN_num_bits_word((BN_ULONG)al);\n            j = 1 << (j - 1);\n            k = j + j;\n            if (al == j) {\n                if (bn_wexpand(tmp, k * 2) == NULL)\n                    goto err;\n                bn_sqr_recursive(rr->d, a->d, al, tmp->d);\n            } else {\n                if (bn_wexpand(tmp, max) == NULL)\n                    goto err;\n                bn_sqr_normal(rr->d, a->d, al, tmp->d);\n            }\n        }\n#else\n        if (bn_wexpand(tmp, max) == NULL)\n            goto err;\n        bn_sqr_normal(rr->d, a->d, al, tmp->d);\n#endif\n    }\n    rr->neg = 0;\n    rr->top = max;\n    rr->flags |= BN_FLG_FIXED_TOP;\n    if (r != rr && BN_copy(r, rr) == NULL)\n        goto err;\n    ret = 1;\n err:\n    bn_check_top(rr);\n    bn_check_top(tmp);\n    BN_CTX_end(ctx);\n    return ret;\n}', 'void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)\n{\n    int i, j, max;\n    const BN_ULONG *ap;\n    BN_ULONG *rp;\n    max = n * 2;\n    ap = a;\n    rp = r;\n    rp[0] = rp[max - 1] = 0;\n    rp++;\n    j = n;\n    if (--j > 0) {\n        ap++;\n        rp[j] = bn_mul_words(rp, ap, j, ap[-1]);\n        rp += 2;\n    }\n    for (i = n - 2; i > 0; i--) {\n        j--;\n        ap++;\n        rp[j] = bn_mul_add_words(rp, ap, j, ap[-1]);\n        rp += 2;\n    }\n    bn_add_words(r, r, r, max);\n    bn_sqr_words(tmp, a, n);\n    bn_add_words(r, r, tmp, max);\n}']