crypto/dh/dh_key.c:144: error: BUFFER_OVERRUN_L3
  Offset: 14 (⇐ 8 + 6) Size: [0, +oo] by call to `BN_mod_exp_mont`.
Showing all 15 steps of the trace


crypto/dh/dh_key.c:121:1: Parameter `dh->method_mont_p->RR.d`
119.   	}
120.   
121. > int DH_compute_key(unsigned char *key, BIGNUM *pub_key, DH *dh)
122.   	{
123.   	BN_CTX ctx;

crypto/dh/dh_key.c:144:7: Call
142.   
143.   	mont=(BN_MONT_CTX *)dh->method_mont_p;
144.   	if (!BN_mod_exp_mont(tmp,pub_key,dh->priv_key,dh->p,&ctx,mont))
             ^
145.   		{
146.   		DHerr(DH_F_DH_COMPUTE_KEY,ERR_R_BN_LIB);

crypto/bn/bn_exp.c:301:1: Parameter `*in_mont->RR.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 `*b->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_exp.c:379:14: Call
  377.   	wend=0;		/* The bottom bit of the window */
  378.   
  379.           if (!BN_to_montgomery(r,BN_value_one(),mont,ctx)) goto err;
                      ^
  380.   	for (;;)
  381.   		{

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,
    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 `*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: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 `*b`
        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 `*b`
          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:542:2: Array access: Offset: 14 (⇐ 8 + 6) Size: [0, +oo] by call to `BN_mod_exp_mont` 
          540.   	mul_add_c(a[2],b[4],c1,c2,c3);
          541.   	mul_add_c(a[1],b[5],c1,c2,c3);
          542.   	mul_add_c(a[0],b[6],c1,c2,c3);
                  ^
          543.   	r[6]=c1;
          544.   	c1=0;
