crypto/srp/srp_lib.c:204: error: BUFFER_OVERRUN_L3
  Offset added: [8, +oo] Size: [0, 67108856] by call to `BN_mod_exp`.
Showing all 38 steps of the trace


crypto/srp/srp_lib.c:176:1: Parameter `N->top`
174.   }
175.   
176. > BIGNUM *SRP_Calc_client_key(const BIGNUM *N, const BIGNUM *B, const BIGNUM *g,
177.                               const BIGNUM *x, const BIGNUM *a, const BIGNUM *u)
178.   {

crypto/srp/srp_lib.c:191:10: Call
189.           goto err;
190.   
191.       if (!BN_mod_exp(tmp, g, x, N, bn_ctx))
                ^
192.           goto err;
193.       if ((k = srp_Calc_k(N, g)) == NULL)

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:141:19: Call
  139.               && (BN_get_flags(m, BN_FLG_CONSTTIME) == 0)) {
  140.               BN_ULONG A = a->d[0];
  141.               ret = BN_mod_exp_mont_word(r, A, p, m, ctx, NULL);
                           ^
  142.           } else
  143.   # endif

crypto/bn/bn_exp.c:1127:1: Parameter `m->top`
    1125.   }
    1126.   
    1127. > int BN_mod_exp_mont_word(BIGNUM *rr, BN_ULONG a, const BIGNUM *p,
    1128.                            const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
    1129.   {

crypto/srp/srp_lib.c:193:14: Call
191.       if (!BN_mod_exp(tmp, g, x, N, bn_ctx))
192.           goto err;
193.       if ((k = srp_Calc_k(N, g)) == NULL)
                    ^
194.           goto err;
195.       if (!BN_mod_mul(tmp2, tmp, k, N, bn_ctx))

crypto/srp/srp_lib.c:46:1: Parameter `N->top`
  44.   }
  45.   
  46. > static BIGNUM *srp_Calc_k(const BIGNUM *N, const BIGNUM *g)
  47.   {
  48.       /* k = SHA1(N | PAD(g)) -- tls-srp RFC 5054 */

crypto/srp/srp_lib.c:49:12: Call
  47.   {
  48.       /* k = SHA1(N | PAD(g)) -- tls-srp RFC 5054 */
  49.       return srp_Calc_xy(N, g, N);
                   ^
  50.   }
  51.   

crypto/srp/srp_lib.c:23:1: Parameter `N->top`
    21.   /* calculate = SHA1(PAD(x) || PAD(y)) */
    22.   
    23. > static BIGNUM *srp_Calc_xy(const BIGNUM *x, const BIGNUM *y, const BIGNUM *N)
    24.   {
    25.       unsigned char digest[SHA_DIGEST_LENGTH];

crypto/srp/srp_lib.c:27:16: Call
    25.       unsigned char digest[SHA_DIGEST_LENGTH];
    26.       unsigned char *tmp = NULL;
    27.       int numN = BN_num_bytes(N);
                         ^
    28.       BIGNUM *res = NULL;
    29.   

crypto/bn/bn_lib.c:140:9: Call
      138.       bn_check_top(a);
      139.   
      140.       if (BN_is_zero(a))
                     ^
      141.           return 0;
      142.       return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));

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/srp/srp_lib.c:195:10: Call
193.       if ((k = srp_Calc_k(N, g)) == NULL)
194.           goto err;
195.       if (!BN_mod_mul(tmp2, tmp, k, N, bn_ctx))
                ^
196.           goto err;
197.       if (!BN_mod_sub(tmp, B, tmp2, N, bn_ctx))

crypto/bn/bn_mod.c:193:1: Parameter `m->top`
  191.   
  192.   /* slow but works */
  193. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  194.                  BN_CTX *ctx)
  195.   {

crypto/srp/srp_lib.c:197:10: Call
195.       if (!BN_mod_mul(tmp2, tmp, k, N, bn_ctx))
196.           goto err;
197.       if (!BN_mod_sub(tmp, B, tmp2, N, bn_ctx))
                ^
198.           goto err;
199.       if (!BN_mul(tmp3, u, x, bn_ctx))

crypto/bn/bn_mod.c:106:1: Parameter `m->top`
  104.   }
  105.   
  106. > int BN_mod_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  107.                  BN_CTX *ctx)
  108.   {

crypto/srp/srp_lib.c:204:23: Call
202.           goto err;
203.       K = BN_new();
204.       if (K != NULL && !BN_mod_exp(K, tmp, tmp2, N, bn_ctx)) {
                             ^
205.           BN_free(K);
206.           K = NULL;

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:141:19: Call
  139.               && (BN_get_flags(m, BN_FLG_CONSTTIME) == 0)) {
  140.               BN_ULONG A = a->d[0];
  141.               ret = BN_mod_exp_mont_word(r, A, p, m, ctx, NULL);
                           ^
  142.           } else
  143.   # endif

crypto/bn/bn_exp.c:1127:1: Parameter `m->top`
    1125.   }
    1126.   
    1127. > int BN_mod_exp_mont_word(BIGNUM *rr, BN_ULONG a, const BIGNUM *p,
    1128.                            const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
    1129.   {

crypto/bn/bn_exp.c:1163:10: Call
    1161.       bn_check_top(m);
    1162.   
    1163.       if (!BN_is_odd(m)) {
                     ^
    1164.           BNerr(BN_F_BN_MOD_EXP_MONT_WORD, BN_R_CALLED_WITH_EVEN_MODULUS);
    1165.           return 0;

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:1198:14: Call
    1196.           if ((mont = BN_MONT_CTX_new()) == NULL)
    1197.               goto err;
    1198.           if (!BN_MONT_CTX_set(mont, m, ctx))
                         ^
    1199.               goto err;
    1200.       }

crypto/bn/bn_mont.c:263:1: Parameter `mod->top`
      261.   }
      262.   
      263. > int BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *mod, BN_CTX *ctx)
      264.   {
      265.       int i, ret = 0;

crypto/bn/bn_mont.c:268:9: Call
      266.       BIGNUM *Ri, *R;
      267.   
      268.       if (BN_is_zero(mod))
                     ^
      269.           return 0;
      270.   

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_mont.c:275:10: Call
      273.           goto err;
      274.       R = &(mont->RR);            /* grab RR as a temp */
      275.       if (!BN_copy(&(mont->N), mod))
                      ^
      276.           goto err;               /* Set N */
      277.       if (BN_get_flags(mod, BN_FLG_CONSTTIME) != 0)

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;
