crypto/ec/ecp_smpl.c:561: error: BUFFER_OVERRUN_L3
  Offset: [31, +oo] Size: [0, 8388607] by call to `BN_mod_sqr`.
Showing all 16 steps of the trace


crypto/ec/ecp_smpl.c:550:14: Call
548.           }
549.       } else {
550.           if (!BN_mod_inverse(Z_1, Z_, group->field, ctx)) {
                    ^
551.               ECerr(EC_F_EC_GFP_SIMPLE_POINT_GET_AFFINE_COORDINATES,
552.                     ERR_R_BN_LIB);

crypto/bn/bn_gcd.c:129:10: Call
  127.       BIGNUM *rv;
  128.       int noinv;
  129.       rv = int_bn_mod_inverse(in, a, n, ctx, &noinv);
                  ^
  130.       if (noinv)
  131.           BNerr(BN_F_BN_MOD_INVERSE, BN_R_NO_INVERSE);

crypto/bn/bn_gcd.c:135:1: Parameter `in->top`
    133.   }
    134.   
    135. > BIGNUM *int_bn_mod_inverse(BIGNUM *in,
    136.                              const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx,
    137.                              int *pnoinv)

crypto/ec/ecp_smpl.c:561:18: Call
559.                   goto err;
560.           } else {
561.               if (!BN_mod_sqr(Z_2, Z_1, group->field, ctx))
                        ^
562.                   goto err;
563.           }

crypto/bn/bn_mod.c:102:1: Parameter `*r->d`
  100.   }
  101.   
  102. > int BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx)
  103.   {
  104.       if (!BN_sqr(r, a, ctx))

crypto/bn/bn_mod.c:104:10: Call
  102.   int BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx)
  103.   {
  104.       if (!BN_sqr(r, a, ctx))
                  ^
  105.           return 0;
  106.       /* r->neg == 0,  thus we don't need BN_nnmod */

crypto/bn/bn_sqr.c:17:1: Parameter `a->top`
    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 max, al;

crypto/bn/bn_sqr.c:25:5: Assignment
    23.       bn_check_top(a);
    24.   
    25.       al = a->top;
              ^
    26.       if (al <= 0) {
    27.           r->top = 0;

crypto/bn/bn_sqr.c:74:17: Call
    72.                   if (bn_wexpand(tmp, max) == NULL)
    73.                       goto err;
    74.                   bn_sqr_normal(rr->d, a->d, al, tmp->d);
                          ^
    75.               }
    76.           }

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

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

crypto/bn/bn_sqr.c:111:5: Assignment
      109.       BN_ULONG *rp;
      110.   
      111.       max = n * 2;
                 ^
      112.       ap = a;
      113.       rp = r;

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

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

crypto/bn/bn_sqr.c:113:5: Assignment
      111.       max = n * 2;
      112.       ap = a;
      113.       rp = r;
                 ^
      114.       rp[0] = rp[max - 1] = 0;
      115.       rp++;

crypto/bn/bn_sqr.c:114:13: Array access: Offset: [31, +oo] Size: [0, 8388607] by call to `BN_mod_sqr` 
      112.       ap = a;
      113.       rp = r;
      114.       rp[0] = rp[max - 1] = 0;
                         ^
      115.       rp++;
      116.       j = n;
