crypto/ec/ecdsa_ossl.c:120: error: BUFFER_OVERRUN_L3
  Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `ec_group_do_inverse_ord`.
Showing all 27 steps of the trace


crypto/ec/ecdsa_ossl.c:77:10: Call
75.       /* Preallocate space */
76.       order_bits = BN_num_bits(order);
77.       if (!BN_set_bit(k, order_bits)
               ^
78.           || !BN_set_bit(r, order_bits)
79.           || !BN_set_bit(X, order_bits))

crypto/bn/bn_lib.c:608:1: Parameter `a->top`
  606.   }
  607.   
  608. > int BN_set_bit(BIGNUM *a, int n)
  609.   {
  610.       int i, j, k;

crypto/ec/ecdsa_ossl.c:120:10: Call
118.   
119.       /* compute the inverse of k */
120.       if (!ec_group_do_inverse_ord(group, k, k, ctx)) {
                ^
121.           ECerr(EC_F_ECDSA_SIGN_SETUP, ERR_R_BN_LIB);
122.           goto err;

crypto/ec/ec_lib.c:1096:1: Parameter `x->top`
  1094.    * other functionality.
  1095.    */
  1096. > int ec_group_do_inverse_ord(const EC_GROUP *group, BIGNUM *res,
  1097.                               const BIGNUM *x, BN_CTX *ctx)
  1098.   {

crypto/ec/ec_lib.c:1102:16: Call
  1100.           return group->meth->field_inverse_mod_ord(group, res, x, ctx);
  1101.       else
  1102.           return ec_field_inverse_mod_ord(group, res, x, ctx);
                         ^
  1103.   }
  1104.   

crypto/ec/ec_lib.c:1042:1: Parameter `x->top`
    1040.   }
    1041.   
    1042. > static int ec_field_inverse_mod_ord(const EC_GROUP *group, BIGNUM *r,
    1043.                                       const BIGNUM *x, BN_CTX *ctx)
    1044.   {

crypto/ec/ec_lib.c:1071:10: Call
    1069.        * No need for scatter-gather or BN_FLG_CONSTTIME.
    1070.        */
    1071.       if (!BN_mod_exp_mont(r, x, e, group->order, ctx, group->mont_data))
                     ^
    1072.           goto err;
    1073.   

crypto/bn/bn_exp.c:296:1: Parameter `a->top`
      294.   }
      295.   
      296. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
      297.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
      298.   {

crypto/bn/bn_exp.c:310:16: Call
      308.               || BN_get_flags(a, BN_FLG_CONSTTIME) != 0
      309.               || BN_get_flags(m, BN_FLG_CONSTTIME) != 0) {
      310.           return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);
                            ^
      311.       }
      312.   

crypto/bn/bn_exp.c:592:1: Parameter `a->top`
        590.    * http://www.daemonology.net/hyperthreading-considered-harmful/)
        591.    */
        592. > int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
        593.                                 const BIGNUM *m, BN_CTX *ctx,
        594.                                 BN_MONT_CTX *in_mont)

crypto/bn/bn_exp.c:755:17: Call
        753.           if (!bn_to_mont_fixed_top(&am, &am, mont, ctx))
        754.               goto err;
        755.       } else if (!bn_to_mont_fixed_top(&am, a, mont, ctx))
                               ^
        756.           goto err;
        757.   

crypto/bn/bn_mont.c:222:1: Parameter `a->top`
          220.   }
          221.   
          222. > int bn_to_mont_fixed_top(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
          223.                            BN_CTX *ctx)
          224.   {

crypto/bn/bn_mont.c:225:12: Call
          223.                            BN_CTX *ctx)
          224.   {
          225.       return bn_mul_mont_fixed_top(r, a, &(mont->RR), mont, ctx);
                            ^
          226.   }
          227.   

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: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 `ec_group_do_inverse_ord` 
                122.       if (--j > 0) {
                123.           ap++;
                124.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);
                               ^
                125.           rp += 2;
                126.       }
