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


crypto/rsa/rsa_ossl.c:192:16: Call
190.            * Local blinding: store the unblinding factor in BN_BLINDING.
191.            */
192.           return BN_BLINDING_convert_ex(f, NULL, b, ctx);
                      ^
193.       else {
194.           /*

crypto/bn/bn_blind.c:130:1: Parameter `b->mod->top`
  128.   }
  129.   
  130. > int BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b, BN_CTX *ctx)
  131.   {
  132.       int ret = 1;

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

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

crypto/bn/bn_blind.c:112:14: Call
    110.               goto err;
    111.       } else if (!(b->flags & BN_BLINDING_NO_UPDATE)) {
    112.           if (!BN_mod_mul(b->A, b->A, b->A, b->mod, ctx))
                        ^
    113.               goto err;
    114.           if (!BN_mod_mul(b->Ai, b->Ai, b->Ai, b->mod, ctx))

crypto/bn/bn_mod.c:73:1: Parameter `m->top`
      71.   
      72.   /* slow but works */
      73. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
      74.                  BN_CTX *ctx)
      75.   {

crypto/bn/bn_mod.c:93:10: Call
      91.               goto err;
      92.       }
      93.       if (!BN_nnmod(r, t, m, ctx))
                     ^
      94.           goto err;
      95.       bn_check_top(r);

crypto/bn/bn_mod.c:13:1: Parameter `d->top`
        11.   #include "bn_lcl.h"
        12.   
        13. > int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx)
        14.   {
        15.       /*

crypto/bn/bn_mod.c:20:11: Call
        18.        */
        19.   
        20.       if (!(BN_mod(r, m, d, ctx)))
                        ^
        21.           return 0;
        22.       if (!r->neg)

crypto/bn/bn_div.c:205:31: Call
          203.   
          204.       /* First we normalise the numbers */
          205.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
                                               ^
          206.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
          207.           goto err;

crypto/bn/bn_lib.c:167:9: Assignment
            165.   
            166.       if (BN_is_zero(a))
            167.           return 0;
                           ^
            168.       return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));
            169.   }

crypto/bn/bn_div.c:205:5: Assignment
          203.   
          204.       /* First we normalise the numbers */
          205.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
                     ^
          206.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
          207.           goto err;

crypto/bn/bn_div.c:206:11: Call
          204.       /* First we normalise the numbers */
          205.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
          206.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
                           ^
          207.           goto err;
          208.       sdiv->neg = 0;

crypto/bn/bn_shift.c:83:1: <Offset trace>
81.   }
82.   
83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
84.   {
85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:83:1: Parameter `n`
            81.   }
            82.   
            83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
            84.   {
            85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:97:5: Assignment
            95.       }
            96.   
            97.       nw = n / BN_BITS2;
                       ^
            98.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
            99.           return (0);

crypto/bn/bn_shift.c:83:1: <Length trace>
81.   }
82.   
83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
84.   {
85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:83:1: Parameter `*r->d`
            81.   }
            82.   
            83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
            84.   {
            85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:98:9: Call
            96.   
            97.       nw = n / BN_BITS2;
            98.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                           ^
            99.           return (0);
            100.       r->neg = a->neg;

crypto/bn/bn_lib.c:1016:1: Parameter `*a->d`
              1014.   }
              1015.   
              1016. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
              1017.   {
              1018.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_shift.c:104:5: Assignment
            102.       rb = BN_BITS2 - lb;
            103.       f = a->d;
            104.       t = r->d;
                       ^
            105.       t[a->top + nw] = 0;
            106.       if (lb == 0)

crypto/bn/bn_shift.c:112:13: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_BLINDING_convert_ex` 
            110.           for (i = a->top - 1; i >= 0; i--) {
            111.               l = f[i];
            112.               t[nw + i + 1] |= (l >> rb) & BN_MASK2;
                               ^
            113.               t[nw + i] = (l << lb) & BN_MASK2;
            114.           }
