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


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

crypto/dsa/dsa_vrf.c:120:7: Call
118.   #else
119.   	{
120.   	if (!BN_mod_exp2_mont(&t1,dsa->g,&u1,dsa->pub_key,&u2,dsa->p,ctx,mont))
             ^
121.   		goto err;
122.   	/* 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_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:237:2: Call
        235.   	/* r=(a[0]-a[1])*(b[1]-b[0]) */
        236.   	bn_sub_words(t,      a,      &(a[n]),n); /* + */
        237.   	bn_sub_words(&(t[n]),b,      &(b[n]),n); /* - */
                ^
        238.   
        239.   /*	if (n == 4)

crypto/bn/bn_asm.c:389:1: <Length trace>
387.   #endif
388.   
389. > BN_ULONG bn_sub_words(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n)
390.           {
391.   	BN_ULONG t1,t2;

crypto/bn/bn_asm.c:389:1: Parameter `*b`
          387.   #endif
          388.   
          389. > BN_ULONG bn_sub_words(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n)
          390.           {
          391.   	BN_ULONG t1,t2;

crypto/bn/bn_asm.c:404:15: Array access: Offset: [9, +oo] (⇐ [8, +oo] + 1) Size: [0, +oo] by call to `BN_mod_exp2_mont` 
          402.   		if (--n <= 0) break;
          403.   
          404.   		t1=a[1]; t2=b[1];
                               ^
          405.   		r[1]=(t1-t2-c)&BN_MASK2;
          406.   		if (t1 != t2) c=(t1 < t2);
