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


crypto/dsa/dsa_vrf.c:69:1: Parameter `dsa->method_mont_p->RR.d`
67.   #include <openssl/asn1_mac.h>
68.   
69. > int DSA_do_verify(const unsigned char *dgst, int dgst_len, DSA_SIG *sig,
70.   		  DSA *dsa)
71.   	{

crypto/dsa/dsa_vrf.c:121:7: Call
119.   #else
120.   	{
121.   	if (!BN_mod_exp2_mont(&t1,dsa->g,&u1,dsa->pub_key,&u2,dsa->p,ctx,mont))
             ^
122.   		goto err;
123.   	/* BN_copy(&u1,&t1); */

crypto/bn/bn_exp2.c:18:1: Parameter `*in_mont->RR.d`
  16.   #define EXP2_TABLE_SIZE	4 /* 2  4  8 16 32  */
  17.   
  18. > int BN_mod_exp2_mont(BIGNUM *rr, BIGNUM *a1, BIGNUM *p1, BIGNUM *a2,
  19.   	     BIGNUM *p2, BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
  20.   	{

crypto/bn/bn_exp2.c:79:7: Call
  77.   	else
  78.   		aa2=a2;
  79.   	if (!BN_to_montgomery(&(val[1][0]),aa1,mont,ctx)) goto err;
              ^
  80.   	if (!BN_to_montgomery(&(val[0][1]),aa2,mont,ctx)) goto err;
  81.   	if (!BN_mod_mul_montgomery(&(val[1][1]),

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_exp2.c:80:7: Call
  78.   		aa2=a2;
  79.   	if (!BN_to_montgomery(&(val[1][0]),aa1,mont,ctx)) goto err;
  80.   	if (!BN_to_montgomery(&(val[0][1]),aa2,mont,ctx)) goto err;
              ^
  81.   	if (!BN_mod_mul_montgomery(&(val[1][1]),
  82.   		&(val[1][0]),&(val[0][1]),mont,ctx))

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: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:489:1: <Length trace>
487.   #endif
488.   
489. > void bn_mul_comba8(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
490.   	{
491.   #ifdef BN_LLONG

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

crypto/bn/bn_asm.c:541:2: Array access: Offset: 14 (⇐ 8 + 6) Size: [0, +oo] by call to `BN_mod_exp2_mont` 
          539.   	mul_add_c(a[2],b[4],c1,c2,c3);
          540.   	mul_add_c(a[1],b[5],c1,c2,c3);
          541.   	mul_add_c(a[0],b[6],c1,c2,c3);
                  ^
          542.   	r[6]=c1;
          543.   	c1=0;
