crypto/evp/evp_pkey.c:165: error: BUFFER_OVERRUN_L3
  Offset: [12, +oo] (⇐ [8, +oo] + 4) Size: [0, +oo] by call to `BN_mod_exp`.
Showing all 19 steps of the trace


crypto/evp/evp_pkey.c:154:24: Call
152.   		}
153.   		/* Calculate public key (ouch!) */
154.   		if (!(dsa->pub_key = BN_new())) {
                              ^
155.   			EVPerr(EVP_F_EVP_PKCS82PKEY,ERR_R_MALLOC_FAILURE);
156.   			DSA_free (dsa);

crypto/bn/bn_lib.c:303:2: Assignment
  301.   	ret->neg=0;
  302.   	ret->max=0;
  303.   	ret->d=NULL;
          ^
  304.   	return(ret);
  305.   	}

crypto/evp/evp_pkey.c:165:8: Call
163.   		}
164.   			
165.   		if (!BN_mod_exp(dsa->pub_key, dsa->g,
              ^
166.   						 dsa->priv_key, dsa->p, ctx)) {
167.   			

crypto/bn/bn_exp.c:157:1: Parameter `*a->d`
  155.   	}
  156.   
  157. > int BN_mod_exp(BIGNUM *r, BIGNUM *a, BIGNUM *p, BIGNUM *m, BN_CTX *ctx)
  158.   	{
  159.   	int ret;

crypto/bn/bn_exp.c:173:9: Call
  171.   
  172.   	if (BN_is_odd(m))
  173.   		{ ret=BN_mod_exp_mont(r,a,p,m,ctx,NULL); }
                 ^
  174.   	else
  175.   #endif

crypto/bn/bn_exp.c:343:3: Call
    341.   	if (BN_ucmp(a,m) >= 0)
    342.   		{
    343.   		BN_mod(&(val[0]),a,m,ctx);
             ^
    344.   		aa= &(val[0]);
    345.   		}

crypto/bn/bn_div.c:286:1: Parameter `*rem->d`
      284.   
      285.   /* rem != m */
      286. > int BN_mod(BIGNUM *rem, BIGNUM *m, BIGNUM *d, BN_CTX *ctx)
      287.   	{
      288.   #if 0 /* The old slow way */

crypto/bn/bn_div.c:312:9: Call
      310.   	return(1);
      311.   #else
      312.   	return(BN_div(NULL,rem,m,d,ctx));
                     ^
      313.   #endif
      314.   	}

crypto/bn/bn_div.c:120:1: Parameter `*rm->d`
        118.   #else
        119.   
        120. > int BN_div(BIGNUM *dv, BIGNUM *rm, BIGNUM *num, BIGNUM *divisor,
        121.   	     BN_CTX *ctx)
        122.   	{

crypto/bn/bn_exp.c:419:8: Call
    417.   		
    418.   		/* wvalue will be an odd number < 2^window */
    419.   		if (!BN_mod_mul_montgomery(r,r,&(val[wvalue>>1]),mont,ctx))
                  ^
    420.   			goto err;
    421.   

crypto/bn/bn_mont.c:71:1: Parameter `*b->d`
      69.   #define MONT_WORD
      70.   
      71. > int BN_mod_mul_montgomery(BIGNUM *r, BIGNUM *a, BIGNUM *b, BN_MONT_CTX *mont,
      72.   	     BN_CTX *ctx)
      73.   	{

crypto/bn/bn_mont.c:98:8: Call
      96.   	else
      97.   		{
      98.   		if (!BN_mul(tmp,a,b,ctx)) goto err;
                    ^
      99.   		}
      100.   	/* reduce from aRR to aR */

crypto/bn/bn_mul.c:560:1: Parameter `*b->d`
        558.   #endif
        559.   
        560. > int BN_mul(BIGNUM *r, BIGNUM *a, BIGNUM *b, BN_CTX *ctx)
        561.   	{
        562.   	int top,al,bl;

crypto/bn/bn_mul.c:686:4: Call
        684.   			for (i=b->top; i<k; i++)
        685.   				b->d[i]=0;
        686.   			bn_mul_part_recursive(rr->d,a->d,b->d,al-j,j,t->d);
                  ^
        687.   			}
        688.   		rr->top=top;

crypto/bn/bn_mul.c:218:1: Parameter `n`
          216.   /* n+tn is the word length
          217.    * t needs to be n*4 is size, as does r */
          218. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int tn,
          219.   	     int n, BN_ULONG *t)
          220.   	{

crypto/bn/bn_mul.c:250:3: Call
          248.   		bn_mul_comba8(&(t[n2]),t,&(t[n]));
          249.   		bn_mul_comba8(r,a,b);
          250.   		bn_mul_normal(&(r[n2]),&(a[n]),tn,&(b[n]),tn);
                   ^
          251.   		memset(&(r[n2+tn*2]),0,sizeof(BN_ULONG)*(n2-tn*2));
          252.   		}

crypto/bn/bn_mul.c:699:1: <Length trace>
697.   	}
698.   
699. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
700.   	{
701.   	BN_ULONG *rr;

crypto/bn/bn_mul.c:699:1: Parameter `*b`
            697.   	}
            698.   
            699. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
            700.   	{
            701.   	BN_ULONG *rr;

crypto/bn/bn_mul.c:728:39: Array access: Offset: [12, +oo] (⇐ [8, +oo] + 4) Size: [0, +oo] by call to `BN_mod_exp` 
            726.   		rr[3]=bn_mul_add_words(&(r[3]),a,na,b[3]);
            727.   		if (--nb <= 0) return;
            728.   		rr[4]=bn_mul_add_words(&(r[4]),a,na,b[4]);
                                                         ^
            729.   		rr+=4;
            730.   		r+=4;
