crypto/bn/bn_sqrt.c:98: error: BUFFER_OVERRUN_L3
  Offset added: [8, +oo] Size: [0, 67108856] by call to `BN_mod_exp`.
Showing all 30 steps of the trace


crypto/bn/bn_sqrt.c:13:1: Parameter `p->top`
11.   #include "bn_lcl.h"
12.   
13. > BIGNUM *BN_mod_sqrt(BIGNUM *in, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx)
14.   /*
15.    * Returns 'ret' such that ret^2 == a (mod p), using the Tonelli/Shanks

crypto/bn/bn_sqrt.c:26:10: Call
24.       int e, i, j;
25.   
26.       if (!BN_is_odd(p) || BN_abs_is_word(p, 1)) {
               ^
27.           if (BN_abs_is_word(p, 2)) {
28.               if (ret == NULL)

crypto/bn/bn_lib.c:858:1: Parameter `a->top`
  856.   }
  857.   
  858. > int BN_is_odd(const BIGNUM *a)
  859.   {
  860.       return (a->top > 0) && (a->d[0] & 1);

crypto/bn/bn_sqrt.c:26:26: Call
24.       int e, i, j;
25.   
26.       if (!BN_is_odd(p) || BN_abs_is_word(p, 1)) {
                               ^
27.           if (BN_abs_is_word(p, 2)) {
28.               if (ret == NULL)

crypto/bn/bn_lib.c:838:1: Parameter `a->top`
  836.   }
  837.   
  838. > int BN_abs_is_word(const BIGNUM *a, const BN_ULONG w)
  839.   {
  840.       return ((a->top == 1) && (a->d[0] == w)) || ((w == 0) && (a->top == 0));

crypto/bn/bn_sqrt.c:75:10: Call
73.   
74.       /* A = a mod p */
75.       if (!BN_nnmod(A, a, p, ctx))
               ^
76.           goto end;
77.   

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:214:9: Call
    212.       int ret;
    213.   
    214.       if (BN_is_zero(divisor)) {
                   ^
    215.           BNerr(BN_F_BN_DIV, BN_R_DIV_BY_ZERO);
    216.           return 0;

crypto/bn/bn_lib.c:843:1: Parameter `a->top`
      841.   }
      842.   
      843. > int BN_is_zero(const BIGNUM *a)
      844.   {
      845.       return a->top == 0;

crypto/bn/bn_sqrt.c:80:13: Call
78.       /* now write  |p| - 1  as  2^e*q  where  q  is odd */
79.       e = 1;
80.       while (!BN_is_bit_set(p, e))
                  ^
81.           e++;
82.       /* we'll set  q  later (if needed) */

crypto/bn/bn_lib.c:649:1: Parameter `a->top`
  647.   }
  648.   
  649. > int BN_is_bit_set(const BIGNUM *a, int n)
  650.   {
  651.       int i, j;

crypto/bn/bn_sqrt.c:93:14: Call
91.            * so we can use exponent  (|p|+1)/4,  i.e.  (|p|-3)/4 + 1.
92.            */
93.           if (!BN_rshift(q, p, 2))
                   ^
94.               goto end;
95.           q->neg = 0;

crypto/bn/bn_shift.c:153:1: Parameter `a->top`
  151.   }
  152.   
  153. > int BN_rshift(BIGNUM *r, const BIGNUM *a, int n)
  154.   {
  155.       int i, j, nw, lb, rb;

crypto/bn/bn_sqrt.c:98:14: Call
96.           if (!BN_add_word(q, 1))
97.               goto end;
98.           if (!BN_mod_exp(ret, A, q, p, ctx))
                    ^
99.               goto end;
100.           err = 0;

crypto/bn/bn_exp.c:89:1: Parameter `m->top`
  87.   }
  88.   
  89. > int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, const BIGNUM *m,
  90.                  BN_CTX *ctx)
  91.   {

crypto/bn/bn_exp.c:134:9: Call
  132.   
  133.   #ifdef MONT_MUL_MOD
  134.       if (BN_is_odd(m)) {
                 ^
  135.   # ifdef MONT_EXP_WORD
  136.           if (a->top == 1 && !a->neg

crypto/bn/bn_lib.c:858:1: Parameter `a->top`
    856.   }
    857.   
    858. > int BN_is_odd(const BIGNUM *a)
    859.   {
    860.       return (a->top > 0) && (a->d[0] & 1);

crypto/bn/bn_exp.c:149:15: Call
  147.   #ifdef RECP_MUL_MOD
  148.       {
  149.           ret = BN_mod_exp_recp(r, a, p, m, ctx);
                       ^
  150.       }
  151.   #else

crypto/bn/bn_exp.c:161:1: Parameter `m->top`
    159.   }
    160.   
    161. > int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
    162.                       const BIGNUM *m, BN_CTX *ctx)
    163.   {

crypto/bn/bn_exp.c:206:13: Call
    204.               goto err;
    205.       } else {
    206.           if (BN_RECP_CTX_set(&recp, m, ctx) <= 0)
                       ^
    207.               goto err;
    208.       }

crypto/bn/bn_recp.c:45:1: Parameter `d->top`
      43.   }
      44.   
      45. > int BN_RECP_CTX_set(BN_RECP_CTX *recp, const BIGNUM *d, BN_CTX *ctx)
      46.   {
      47.       if (!BN_copy(&(recp->N), d))

crypto/bn/bn_recp.c:47:10: Call
      45.   int BN_RECP_CTX_set(BN_RECP_CTX *recp, const BIGNUM *d, BN_CTX *ctx)
      46.   {
      47.       if (!BN_copy(&(recp->N), d))
                     ^
      48.           return 0;
      49.       BN_zero(&(recp->Nr));

crypto/bn/bn_lib.c:281:1: <Offset trace>
279.   }
280.   
281. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
282.   {
283.       bn_check_top(b);

crypto/bn/bn_lib.c:281:1: Parameter `b->top`
        279.   }
        280.   
        281. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
        282.   {
        283.       bn_check_top(b);

crypto/bn/bn_lib.c:281:1: <Length trace>
279.   }
280.   
281. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
282.   {
283.       bn_check_top(b);

crypto/bn/bn_lib.c:281:1: Parameter `*a->d`
        279.   }
        280.   
        281. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
        282.   {
        283.       bn_check_top(b);

crypto/bn/bn_lib.c:287:9: Call
        285.       if (a == b)
        286.           return a;
        287.       if (bn_wexpand(a, b->top) == NULL)
                       ^
        288.           return NULL;
        289.   

crypto/bn/bn_lib.c:939:1: Parameter `*a->d`
          937.   }
          938.   
          939. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
          940.   {
          941.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:291:9: Array access: Offset added: [8, +oo] Size: [0, 67108856] by call to `BN_mod_exp` 
        289.   
        290.       if (b->top > 0)
        291.           memcpy(a->d, b->d, sizeof(b->d[0]) * b->top);
                       ^
        292.   
        293.       a->neg = b->neg;
