crypto/rsa/rsa_ossl.c:211: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] (⇐ [0, +oo] + [1, +oo]) Size: [0, 8388607] by call to `BN_BLINDING_convert_ex`.
Showing all 15 steps of the trace


crypto/rsa/rsa_ossl.c:211:15: Call
209.   
210.           BN_BLINDING_lock(b);
211.           ret = BN_BLINDING_convert_ex(f, unblind, b, ctx);
                     ^
212.           BN_BLINDING_unlock(b);
213.   

crypto/bn/bn_blind.c:134:1: Parameter `b->m_ctx->N.top`
  132.   }
  133.   
  134. > int BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b, BN_CTX *ctx)
  135.   {
  136.       int ret = 1;

crypto/bn/bn_blind.c:148:15: Call
  146.           /* Fresh blinding, doesn't need updating. */
  147.           b->counter = 0;
  148.       else if (!BN_BLINDING_update(b, ctx))
                       ^
  149.           return 0;
  150.   

crypto/bn/bn_blind.c:93:1: Parameter `b->m_ctx->N.top`
    91.   }
    92.   
    93. > int BN_BLINDING_update(BN_BLINDING *b, BN_CTX *ctx)
    94.   {
    95.       int ret = 0;

crypto/bn/bn_blind.c:113:21: Call
    111.           if (b->m_ctx != NULL) {
    112.               if (!bn_mul_mont_fixed_top(b->Ai, b->Ai, b->Ai, b->m_ctx, ctx)
    113.                   || !bn_mul_mont_fixed_top(b->A, b->A, b->A, b->m_ctx, ctx))
                               ^
    114.                   goto err;
    115.           } else {

crypto/bn/bn_mont.c:37:1: Parameter `mont->N.top`
      35.   }
      36.   
      37. > int bn_mul_mont_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
      38.                             BN_MONT_CTX *mont, BN_CTX *ctx)
      39.   {

crypto/bn/bn_mont.c:75:10: Call
      73.       /* reduce from aRR to aR */
      74.   #ifdef MONT_WORD
      75.       if (!bn_from_montgomery_word(r, tmp, mont))
                     ^
      76.           goto err;
      77.   #else

crypto/bn/bn_mont.c:125:21: <Offset trace>
123.        * includes |carry| which is stored separately.
124.        */
125.       for (carry = 0, i = 0; i < nl; i++, rp++) {
                           ^
126.           v = bn_mul_add_words(rp, np, nl, (rp[0] * n0) & BN_MASK2);
127.           v = (v + carry + rp[nl]) & BN_MASK2;

crypto/bn/bn_mont.c:125:21: Assignment
        123.        * includes |carry| which is stored separately.
        124.        */
        125.       for (carry = 0, i = 0; i < nl; i++, rp++) {
                                   ^
        126.           v = bn_mul_add_words(rp, np, nl, (rp[0] * n0) & BN_MASK2);
        127.           v = (v + carry + rp[nl]) & BN_MASK2;

crypto/bn/bn_mont.c:88:1: <Length trace>
86.   
87.   #ifdef MONT_WORD
88. > static int bn_from_montgomery_word(BIGNUM *ret, BIGNUM *r, BN_MONT_CTX *mont)
89.   {
90.       BIGNUM *n;

crypto/bn/bn_mont.c:88:1: Parameter `*r->d`
        86.   
        87.   #ifdef MONT_WORD
        88. > static int bn_from_montgomery_word(BIGNUM *ret, BIGNUM *r, BN_MONT_CTX *mont)
        89.   {
        90.       BIGNUM *n;

crypto/bn/bn_mont.c:103:9: Call
        101.   
        102.       max = (2 * nl);             /* carry is stored separately */
        103.       if (bn_wexpand(r, max) == NULL)
                       ^
        104.           return 0;
        105.   

crypto/bn/bn_lib.c:948:1: Parameter `*a->d`
          946.   }
          947.   
          948. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
          949.   {
          950.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_mont.c:108:5: Assignment
        106.       r->neg ^= n->neg;
        107.       np = n->d;
        108.       rp = r->d;
                   ^
        109.   
        110.       /* clear the top words of T */

crypto/bn/bn_mont.c:127:26: Array access: Offset: [1, +oo] (⇐ [0, +oo] + [1, +oo]) Size: [0, 8388607] by call to `BN_BLINDING_convert_ex` 
        125.       for (carry = 0, i = 0; i < nl; i++, rp++) {
        126.           v = bn_mul_add_words(rp, np, nl, (rp[0] * n0) & BN_MASK2);
        127.           v = (v + carry + rp[nl]) & BN_MASK2;
                                        ^
        128.           carry |= (v != rp[nl]);
        129.           carry &= (v <= rp[nl]);

static int bn_from_montgomery_word(BIGNUM *ret, BIGNUM *r, BN_MONT_CTX *mont)
{
    BIGNUM *n;
    BN_ULONG *ap, *np, *rp, n0, v, carry;
    int nl, max, i;
    unsigned int rtop;
    n = &(mont->N);
    nl = n->top;
    if (nl == 0) {
        ret->top = 0;
        return 1;
    }
    max = (2 * nl);
    if (bn_wexpand(r, max) == NULL)
        return 0;
    r->neg ^= n->neg;
    np = n->d;
    rp = r->d;
    for (rtop = r->top, i = 0; i < max; i++) {
        v = (BN_ULONG)0 - ((i - rtop) >> (8 * sizeof(rtop) - 1));
        rp[i] &= v;
    }
    r->top = max;
    r->flags |= BN_FLG_FIXED_TOP;
    n0 = mont->n0[0];
    for (carry = 0, i = 0; i < nl; i++, rp++) {
        v = bn_mul_add_words(rp, np, nl, (rp[0] * n0) & BN_MASK2);
        v = (v + carry + rp[nl]) & BN_MASK2;
        carry |= (v != rp[nl]);
        carry &= (v <= rp[nl]);
        rp[nl] = v;
    }
    if (bn_wexpand(ret, nl) == NULL)
        return 0;
    ret->top = nl;
    ret->flags |= BN_FLG_FIXED_TOP;
    ret->neg = r->neg;
    rp = ret->d;
    ap = &(r->d[nl]);
    carry -= bn_sub_words(rp, ap, np, nl);
    for (i = 0; i < nl; i++) {
        rp[i] = (carry & ap[i]) | (~carry & rp[i]);
        ap[i] = 0;
    }
    return 1;
}
['static int rsa_blinding_convert(BN_BLINDING *b, BIGNUM *f, BIGNUM *unblind,\n                                BN_CTX *ctx)\n{\n    if (unblind == NULL) {\n        return BN_BLINDING_convert_ex(f, NULL, b, ctx);\n    } else {\n        int ret;\n        BN_BLINDING_lock(b);\n        ret = BN_BLINDING_convert_ex(f, unblind, b, ctx);\n        BN_BLINDING_unlock(b);\n        return ret;\n    }\n}', 'int BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b, BN_CTX *ctx)\n{\n    int ret = 1;\n    bn_check_top(n);\n    if ((b->A == NULL) || (b->Ai == NULL)) {\n        BNerr(BN_F_BN_BLINDING_CONVERT_EX, BN_R_NOT_INITIALIZED);\n        return 0;\n    }\n    if (b->counter == -1)\n        b->counter = 0;\n    else if (!BN_BLINDING_update(b, ctx))\n        return 0;\n    if (r != NULL && (BN_copy(r, b->Ai) == NULL))\n        return 0;\n    if (b->m_ctx != NULL)\n        ret = BN_mod_mul_montgomery(n, n, b->A, b->m_ctx, ctx);\n    else\n        ret = BN_mod_mul(n, n, b->A, b->mod, ctx);\n    return ret;\n}', 'int BN_BLINDING_update(BN_BLINDING *b, BN_CTX *ctx)\n{\n    int ret = 0;\n    if ((b->A == NULL) || (b->Ai == NULL)) {\n        BNerr(BN_F_BN_BLINDING_UPDATE, BN_R_NOT_INITIALIZED);\n        goto err;\n    }\n    if (b->counter == -1)\n        b->counter = 0;\n    if (++b->counter == BN_BLINDING_COUNTER && b->e != NULL &&\n        !(b->flags & BN_BLINDING_NO_RECREATE)) {\n        if (!BN_BLINDING_create_param(b, NULL, NULL, ctx, NULL, NULL))\n            goto err;\n    } else if (!(b->flags & BN_BLINDING_NO_UPDATE)) {\n        if (b->m_ctx != NULL) {\n            if (!bn_mul_mont_fixed_top(b->Ai, b->Ai, b->Ai, b->m_ctx, ctx)\n                || !bn_mul_mont_fixed_top(b->A, b->A, b->A, b->m_ctx, ctx))\n                goto err;\n        } else {\n            if (!BN_mod_mul(b->Ai, b->Ai, b->Ai, b->mod, ctx)\n                || !BN_mod_mul(b->A, b->A, b->A, b->mod, ctx))\n                goto err;\n        }\n    }\n    ret = 1;\n err:\n    if (b->counter == BN_BLINDING_COUNTER)\n        b->counter = 0;\n    return ret;\n}', 'int bn_mul_mont_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\n                          BN_MONT_CTX *mont, BN_CTX *ctx)\n{\n    BIGNUM *tmp;\n    int ret = 0;\n    int num = mont->N.top;\n#if defined(OPENSSL_BN_ASM_MONT) && defined(MONT_WORD)\n    if (num > 1 && a->top == num && b->top == num) {\n        if (bn_wexpand(r, num) == NULL)\n            return 0;\n        if (bn_mul_mont(r->d, a->d, b->d, mont->N.d, mont->n0, num)) {\n            r->neg = a->neg ^ b->neg;\n            r->top = num;\n            r->flags |= BN_FLG_FIXED_TOP;\n            return 1;\n        }\n    }\n#endif\n    if ((a->top + b->top) > 2 * num)\n        return 0;\n    BN_CTX_start(ctx);\n    tmp = BN_CTX_get(ctx);\n    if (tmp == NULL)\n        goto err;\n    bn_check_top(tmp);\n    if (a == b) {\n        if (!bn_sqr_fixed_top(tmp, a, ctx))\n            goto err;\n    } else {\n        if (!bn_mul_fixed_top(tmp, a, b, ctx))\n            goto err;\n    }\n#ifdef MONT_WORD\n    if (!bn_from_montgomery_word(r, tmp, mont))\n        goto err;\n#else\n    if (!BN_from_montgomery(r, tmp, mont, ctx))\n        goto err;\n#endif\n    ret = 1;\n err:\n    BN_CTX_end(ctx);\n    return ret;\n}', 'static int bn_from_montgomery_word(BIGNUM *ret, BIGNUM *r, BN_MONT_CTX *mont)\n{\n    BIGNUM *n;\n    BN_ULONG *ap, *np, *rp, n0, v, carry;\n    int nl, max, i;\n    unsigned int rtop;\n    n = &(mont->N);\n    nl = n->top;\n    if (nl == 0) {\n        ret->top = 0;\n        return 1;\n    }\n    max = (2 * nl);\n    if (bn_wexpand(r, max) == NULL)\n        return 0;\n    r->neg ^= n->neg;\n    np = n->d;\n    rp = r->d;\n    for (rtop = r->top, i = 0; i < max; i++) {\n        v = (BN_ULONG)0 - ((i - rtop) >> (8 * sizeof(rtop) - 1));\n        rp[i] &= v;\n    }\n    r->top = max;\n    r->flags |= BN_FLG_FIXED_TOP;\n    n0 = mont->n0[0];\n    for (carry = 0, i = 0; i < nl; i++, rp++) {\n        v = bn_mul_add_words(rp, np, nl, (rp[0] * n0) & BN_MASK2);\n        v = (v + carry + rp[nl]) & BN_MASK2;\n        carry |= (v != rp[nl]);\n        carry &= (v <= rp[nl]);\n        rp[nl] = v;\n    }\n    if (bn_wexpand(ret, nl) == NULL)\n        return 0;\n    ret->top = nl;\n    ret->flags |= BN_FLG_FIXED_TOP;\n    ret->neg = r->neg;\n    rp = ret->d;\n    ap = &(r->d[nl]);\n    carry -= bn_sub_words(rp, ap, np, nl);\n    for (i = 0; i < nl; i++) {\n        rp[i] = (carry & ap[i]) | (~carry & rp[i]);\n        ap[i] = 0;\n    }\n    return 1;\n}', 'BIGNUM *bn_wexpand(BIGNUM *a, int words)\n{\n    return (words <= a->dmax) ? a : bn_expand2(a, words);\n}']