crypto/pem/pvkfmt.c:312: error: BUFFER_OVERRUN_L3
  Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `BN_mod_exp`.
Showing all 26 steps of the trace


crypto/pem/pvkfmt.c:294:10: Call
292.       if (dsa == NULL || ret == NULL)
293.           goto memerr;
294.       if (!read_lebn(&p, nbyte, &dsa->p))
                ^
295.           goto memerr;
296.       if (!read_lebn(&p, 20, &dsa->q))

crypto/pem/pvkfmt.c:96:10: Call
  94.   static int read_lebn(const unsigned char **in, unsigned int nbyte, BIGNUM **r)
  95.   {
  96.       *r = BN_lebin2bn(*in, nbyte, NULL);
                 ^
  97.       if (*r == NULL)
  98.           return 0;

crypto/bn/bn_lib.c:631:9: Assignment
    629.       n = len;
    630.       if (n == 0) {
    631.           ret->top = 0;
                   ^
    632.           return ret;
    633.       }

crypto/pem/pvkfmt.c:312:14: Call
310.               goto memerr;
311.   
312.           if (!BN_mod_exp(dsa->pub_key, dsa->g, dsa->priv_key, dsa->p, ctx))
                    ^
313.               goto memerr;
314.           BN_CTX_free(ctx);

crypto/bn/bn_exp.c:190:1: Parameter `a->top`
  188.   }
  189.   
  190. > int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, const BIGNUM *m,
  191.                  BN_CTX *ctx)
  192.   {

crypto/bn/bn_exp.c:250:19: Call
  248.           } else
  249.   # endif
  250.               ret = BN_mod_exp_mont(r, a, p, m, ctx, NULL);
                           ^
  251.       } else
  252.   #endif

crypto/bn/bn_exp.c:400:1: Parameter `a->top`
    398.   }
    399.   
    400. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
    401.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
    402.   {

crypto/bn/bn_exp.c:412:16: Call
    410.   
    411.       if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0) {
    412.           return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);
                          ^
    413.       }
    414.   

crypto/bn/bn_exp.c:654:1: Parameter `a->top`
      652.    * http://www.daemonology.net/hyperthreading-considered-harmful/)
      653.    */
      654. > int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
      655.                                 const BIGNUM *m, BN_CTX *ctx,
      656.                                 BN_MONT_CTX *in_mont)

crypto/bn/bn_exp.c:811:17: Call
      809.           if (!BN_to_montgomery(&am, &am, mont, ctx))
      810.               goto err;
      811.       } else if (!BN_to_montgomery(&am, a, mont, ctx))
                             ^
      812.           goto err;
      813.   

crypto/bn/bn_lib.c:1000:1: Parameter `a->top`
        998.   }
        999.   
        1000. > int BN_to_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
        1001.                        BN_CTX *ctx)
        1002.   {

crypto/bn/bn_lib.c:1003:12: Call
        1001.                        BN_CTX *ctx)
        1002.   {
        1003.       return BN_mod_mul_montgomery(r, a, &(mont->RR), mont, ctx);
                           ^
        1004.   }
        1005.   

crypto/bn/bn_mont.c:127:1: Parameter `a->top`
          125.   #endif
          126.   
          127. > int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
          128.                             BN_MONT_CTX *mont, BN_CTX *ctx)
          129.   {

crypto/bn/bn_mont.c:154:14: Call
          152.       bn_check_top(tmp);
          153.       if (a == b) {
          154.           if (!BN_sqr(tmp, a, ctx))
                              ^
          155.               goto err;
          156.       } else {

crypto/bn/bn_sqr.c:65:1: Parameter `a->top`
            63.    * I've just gone over this and it is now %20 faster on x86 - eay - 27 Jun 96
            64.    */
            65. > int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
            66.   {
            67.       int max, al;

crypto/bn/bn_sqr.c:73:5: Assignment
            71.       bn_check_top(a);
            72.   
            73.       al = a->top;
                      ^
            74.       if (al <= 0) {
            75.           r->top = 0;

crypto/bn/bn_sqr.c:122:17: Call
            120.                   if (bn_wexpand(tmp, max) == NULL)
            121.                       goto err;
            122.                   bn_sqr_normal(rr->d, a->d, al, tmp->d);
                                   ^
            123.               }
            124.           }

crypto/bn/bn_sqr.c:152:1: <Offset trace>
150.   
151.   /* tmp must have 2*n words */
152. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
153.   {
154.       int i, j, max;

crypto/bn/bn_sqr.c:152:1: Parameter `n`
              150.   
              151.   /* tmp must have 2*n words */
              152. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
              153.   {
              154.       int i, j, max;

crypto/bn/bn_sqr.c:163:5: Assignment
              161.       rp[0] = rp[max - 1] = 0;
              162.       rp++;
              163.       j = n;
                         ^
              164.   
              165.       if (--j > 0) {

crypto/bn/bn_sqr.c:165:9: Assignment
              163.       j = n;
              164.   
              165.       if (--j > 0) {
                             ^
              166.           ap++;
              167.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);

crypto/bn/bn_sqr.c:152:1: <Length trace>
150.   
151.   /* tmp must have 2*n words */
152. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
153.   {
154.       int i, j, max;

crypto/bn/bn_sqr.c:152:1: Parameter `*r`
              150.   
              151.   /* tmp must have 2*n words */
              152. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
              153.   {
              154.       int i, j, max;

crypto/bn/bn_sqr.c:160:5: Assignment
              158.       max = n * 2;
              159.       ap = a;
              160.       rp = r;
                         ^
              161.       rp[0] = rp[max - 1] = 0;
              162.       rp++;

crypto/bn/bn_sqr.c:162:5: Assignment
              160.       rp = r;
              161.       rp[0] = rp[max - 1] = 0;
              162.       rp++;
                         ^
              163.       j = n;
              164.   

crypto/bn/bn_sqr.c:167:9: Array access: Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `BN_mod_exp` 
              165.       if (--j > 0) {
              166.           ap++;
              167.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);
                             ^
              168.           rp += 2;
              169.       }
