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


crypto/evp/evp_pkey.c:161:24: Call
159.   		}
160.   		/* Calculate public key (ouch!) */
161.   		if (!(dsa->pub_key = BN_new())) {
                              ^
162.   			EVPerr(EVP_F_EVP_PKCS82PKEY,ERR_R_MALLOC_FAILURE);
163.   			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:172:8: Call
170.   		}
171.   			
172.   		if (!BN_mod_exp(dsa->pub_key, dsa->g,
              ^
173.   						 dsa->priv_key, dsa->p, ctx)) {
174.   			

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

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

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

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

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,
      72.   			  BN_MONT_CTX *mont, 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 `*a->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:674:4: Call
        672.   			bn_wexpand(t,k*2);
        673.   			bn_wexpand(rr,k*2);
        674.   			bn_mul_recursive(rr->d,a->d,b->d,al,t->d);
                  ^
        675.   			}
        676.   		else

crypto/bn/bn_mul.c:74:1: Parameter `*a`
          72.    * a[1]*b[1]
          73.    */
          74. > void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
          75.   	     BN_ULONG *t)
          76.   	{

crypto/bn/bn_mul.c:158:3: Call
          156.   		
          157.   		bn_mul_comba8(r,a,b);
          158.   		bn_mul_comba8(&(r[n2]),&(a[n]),&(b[n]));
                   ^
          159.   		}
          160.   	else

crypto/bn/bn_asm.c:490:1: <Length trace>
488.   #endif
489.   
490. > void bn_mul_comba8(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
491.   	{
492.   #ifdef BN_LLONG

crypto/bn/bn_asm.c:490:1: Parameter `*a`
            488.   #endif
            489.   
            490. > void bn_mul_comba8(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
            491.   	{
            492.   #ifdef BN_LLONG

crypto/bn/bn_asm.c:536:2: Array access: Offset: 14 (⇐ 8 + 6) Size: [0, +oo] by call to `BN_mod_exp` 
            534.   	r[5]=c3;
            535.   	c3=0;
            536.   	mul_add_c(a[6],b[0],c1,c2,c3);
                    ^
            537.   	mul_add_c(a[5],b[1],c1,c2,c3);
            538.   	mul_add_c(a[4],b[2],c1,c2,c3);
