crypto/evp/evp_pkey.c:165: error: BUFFER_OVERRUN_L3
  Offset: [7, +oo] (⇐ [0, +oo] + 7) Size: [0, +oo] by call to `BN_mod_exp`.
Showing all 15 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:299:1: Parameter `*a->d`
    297.   
    298.   /* #ifdef MONT_MUL_MOD */
    299. > int BN_mod_exp_mont(BIGNUM *rr, BIGNUM *a, BIGNUM *p, BIGNUM *m, BN_CTX *ctx,
    300.   	     BN_MONT_CTX *in_mont)
    301.   	{

crypto/bn/bn_exp.c:348:7: Call
    346.   	else
    347.   		aa=a;
    348.   	if (!BN_to_montgomery(&(val[0]),aa,mont,ctx)) goto err; /* 1 */
                 ^
    349.   	if (!BN_mod_mul_montgomery(d,&(val[0]),&(val[0]),mont,ctx)) goto err; /* 2 */
    350.   

crypto/bn/bn_mont.c:71:1: Parameter `*a->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:93:8: Call
      91.   			tmp->top--;
      92.   #else
      93.   		if (!BN_sqr(tmp,a,ctx)) goto err;
                   ^
      94.   #endif
      95.   		}

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

crypto/bn/bn_sqr.c:123:9: Call
        121.   			if (al == j)
        122.   				{
        123.   				if (bn_wexpand(a,k*2) == NULL) return(0);
                       ^
        124.   				if (bn_wexpand(tmp,k*2) == NULL) return(0);
        125.   				bn_sqr_recursive(rr->d,a->d,al,tmp->d);

crypto/bn/bn_lib.c:344:1: <Length trace>
342.   	}
343.   
344. > BIGNUM *bn_expand2(BIGNUM *b, int words)
345.   	{
346.   	BN_ULONG *A,*B,*a;

crypto/bn/bn_lib.c:344:1: Parameter `*b->d`
          342.   	}
          343.   
          344. > BIGNUM *bn_expand2(BIGNUM *b, int words)
          345.   	{
          346.   	BN_ULONG *A,*B,*a;

crypto/bn/bn_lib.c:367:3: Assignment
          365.   memset(A,0x5c,sizeof(BN_ULONG)*(words+1));
          366.   #if 1
          367.   		B=b->d;
                   ^
          368.   		/* Check if the previous number needs to be copied */
          369.   		if (B != NULL)

crypto/bn/bn_lib.c:377:43: Array access: Offset: [7, +oo] (⇐ [0, +oo] + 7) Size: [0, +oo] by call to `BN_mod_exp` 
          375.   				{
          376.   				A[0]=B[0]; A[1]=B[1]; A[2]=B[2]; A[3]=B[3];
          377.   				A[4]=B[4]; A[5]=B[5]; A[6]=B[6]; A[7]=B[7];
                                                           ^
          378.   				A+=8;
          379.   				B+=8;
