crypto/dsa/dsa_ameth.c:178: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_mod_exp`.
Showing all 21 steps of the trace


crypto/dsa/dsa_ameth.c:164:13: Call
162.       /* We have parameters now set private key */
163.       if ((dsa->priv_key = BN_secure_new()) == NULL
164.           || !ASN1_INTEGER_to_BN(privkey, dsa->priv_key)) {
                   ^
165.           DSAerr(DSA_F_DSA_PRIV_DECODE, DSA_R_BN_ERROR);
166.           goto dsaerr;

crypto/asn1/a_int.c:580:12: Call
  578.   BIGNUM *ASN1_INTEGER_to_BN(const ASN1_INTEGER *ai, BIGNUM *bn)
  579.   {
  580.       return asn1_string_to_bn(ai, bn, V_ASN1_INTEGER);
                    ^
  581.   }
  582.   

crypto/asn1/a_int.c:514:1: Parameter `bn->top`
    512.   }
    513.   
    514. > static BIGNUM *asn1_string_to_bn(const ASN1_INTEGER *ai, BIGNUM *bn,
    515.                                    int itype)
    516.   {

crypto/dsa/dsa_ameth.c:178:10: Call
176.       }
177.   
178.       if (!BN_mod_exp(dsa->pub_key, dsa->g, dsa->priv_key, dsa->p, ctx)) {
                ^
179.           DSAerr(DSA_F_DSA_PRIV_DECODE, DSA_R_BN_ERROR);
180.           goto dsaerr;

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

crypto/bn/bn_exp.c:150:19: Call
  148.           } else
  149.   # endif
  150.               ret = BN_mod_exp_mont(r, a, p, m, ctx, NULL);
                           ^
  151.       } else
  152.   #endif

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

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

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:745:14: Call
      743.       /* prepare a^1 in Montgomery domain */
      744.       if (a->neg || BN_ucmp(a, m) >= 0) {
      745.           if (!BN_mod(&am, a, m, ctx))
                          ^
      746.               goto err;
      747.           if (!BN_to_montgomery(&am, &am, mont, ctx))

crypto/bn/bn_div.c:140:1: Parameter `num->top`
        138.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
        139.    */
        140. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
        141.              BN_CTX *ctx)
        142.   {

crypto/bn/bn_div.c:210:11: Call
        208.       sdiv->neg = 0;
        209.       norm_shift += BN_BITS2;
        210.       if (!(BN_lshift(snum, num, norm_shift)))
                         ^
        211.           goto err;
        212.       snum->neg = 0;

crypto/bn/bn_shift.c:81:1: <Offset trace>
79.   }
80.   
81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
82.   {
83.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:81:1: Parameter `n`
          79.   }
          80.   
          81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
          82.   {
          83.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:96:5: Assignment
          94.   
          95.       r->neg = a->neg;
          96.       nw = n / BN_BITS2;
                    ^
          97.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
          98.           return (0);

crypto/bn/bn_shift.c:81:1: <Length trace>
79.   }
80.   
81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
82.   {
83.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:81:1: Parameter `*r->d`
          79.   }
          80.   
          81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
          82.   {
          83.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:97:9: Call
          95.       r->neg = a->neg;
          96.       nw = n / BN_BITS2;
          97.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                         ^
          98.           return (0);
          99.       lb = n % BN_BITS2;

crypto/bn/bn_lib.c:1014:1: Parameter `*a->d`
            1012.   }
            1013.   
            1014. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
            1015.   {
            1016.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_shift.c:102:5: Assignment
          100.       rb = BN_BITS2 - lb;
          101.       f = a->d;
          102.       t = r->d;
                     ^
          103.       t[a->top + nw] = 0;
          104.       if (lb == 0)

crypto/bn/bn_shift.c:110:13: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_mod_exp` 
          108.           for (i = a->top - 1; i >= 0; i--) {
          109.               l = f[i];
          110.               t[nw + i + 1] |= (l >> rb) & BN_MASK2;
                             ^
          111.               t[nw + i] = (l << lb) & BN_MASK2;
          112.           }
