crypto/rsa/rsa_ossl.c:302: error: BUFFER_OVERRUN_L3
  Offset: [31, +oo] Size: [0, 8388607] by call to `rsa_blinding_convert`.
Showing all 21 steps of the trace


crypto/rsa/rsa_ossl.c:279:9: Call
277.           goto err;
278.   
279.       if (BN_bin2bn(buf, num, f) == NULL)
               ^
280.           goto err;
281.   

crypto/bn/bn_lib.c:372:1: Parameter `ret->top`
  370.   }
  371.   
  372. > BIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM *ret)
  373.   {
  374.       unsigned int i, m;

crypto/rsa/rsa_ossl.c:302:14: Call
300.               goto err;
301.           }
302.           if (!rsa_blinding_convert(blinding, f, unblind, ctx))
                    ^
303.               goto err;
304.       }

crypto/rsa/rsa_ossl.c:196:1: Parameter `f->top`
  194.   }
  195.   
  196. > static int rsa_blinding_convert(BN_BLINDING *b, BIGNUM *f, BIGNUM *unblind,
  197.                                   BN_CTX *ctx)
  198.   {

crypto/rsa/rsa_ossl.c:203:16: Call
  201.            * Local blinding: store the unblinding factor in BN_BLINDING.
  202.            */
  203.           return BN_BLINDING_convert_ex(f, NULL, b, ctx);
                        ^
  204.       } else {
  205.           /*

crypto/bn/bn_blind.c:134:1: Parameter `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:155:15: Call
    153.   
    154.       if (b->m_ctx != NULL)
    155.           ret = BN_mod_mul_montgomery(n, n, b->A, b->m_ctx, ctx);
                         ^
    156.       else
    157.           ret = BN_mod_mul(n, n, b->A, b->mod, ctx);

crypto/bn/bn_mont.c:26:1: Parameter `a->top`
      24.   #endif
      25.   
      26. > int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
      27.                             BN_MONT_CTX *mont, BN_CTX *ctx)
      28.   {

crypto/bn/bn_mont.c:29:15: Call
      27.                             BN_MONT_CTX *mont, BN_CTX *ctx)
      28.   {
      29.       int ret = bn_mul_mont_fixed_top(r, a, b, mont, ctx);
                          ^
      30.   
      31.       bn_correct_top(r);

crypto/bn/bn_mont.c:37:1: Parameter `b->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:67:14: Call
        65.       bn_check_top(tmp);
        66.       if (a == b) {
        67.           if (!bn_sqr_fixed_top(tmp, a, ctx))
                           ^
        68.               goto err;
        69.       } else {

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:115:5: Assignment
            113.       BN_ULONG *rp;
            114.   
            115.       max = n * 2;
                       ^
            116.       ap = a;
            117.       rp = r;

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:118:13: Array access: Offset: [31, +oo] Size: [0, 8388607] by call to `rsa_blinding_convert` 
            116.       ap = a;
            117.       rp = r;
            118.       rp[0] = rp[max - 1] = 0;
                               ^
            119.       rp++;
            120.       j = n;
