crypto/rsa/rsa_eay.c:287: error: BUFFER_OVERRUN_L3
  Offset: 6 (⇐ 4 + 2) Size: [0, +oo] by call to `BN_BLINDING_convert`.
Showing all 14 steps of the trace


crypto/rsa/rsa_eay.c:282:6: Call
280.   
281.   	/* make data into a big number */
282.   	if (BN_bin2bn(from,(int)flen,&f) == NULL) goto err;
            ^
283.   
284.   	if ((rsa->flags & RSA_FLAG_BLINDING) && (rsa->blinding == NULL))

crypto/bn/bn_lib.c:574:1: Parameter `*ret->d`
  572.   
  573.   /* ignore negative */
  574. > BIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM *ret)
  575.   	{
  576.   	unsigned int i,m;

crypto/rsa/rsa_eay.c:287:8: Call
285.   		RSA_blinding_on(rsa,ctx);
286.   	if (rsa->flags & RSA_FLAG_BLINDING)
287.   		if (!BN_BLINDING_convert(&f,rsa->blinding,ctx)) goto err;
              ^
288.   
289.   	/* do the decrypt */

crypto/bn/bn_blind.c:115:1: Parameter `*n->d`
  113.   	}
  114.   
  115. > int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx)
  116.   	{
  117.   	bn_check_top(n);

crypto/bn/bn_blind.c:124:9: Call
  122.   		return(0);
  123.   		}
  124.   	return(BN_mod_mul(n,n,b->A,b->mod,ctx));
                 ^
  125.   	}
  126.   

crypto/bn/bn_exp.c:66:1: Parameter `*a->d`
    64.   
    65.   /* slow but works */
    66. > int BN_mod_mul(BIGNUM *ret, BIGNUM *a, BIGNUM *b, BIGNUM *m, BN_CTX *ctx)
    67.   	{
    68.   	BIGNUM *t;

crypto/bn/bn_exp.c:79:10: Call
    77.   		{ if (!BN_sqr(t,a,ctx)) goto err; }
    78.   	else
    79.   		{ if (!BN_mul(t,a,b,ctx)) goto err; }
                   ^
    80.   	if (!BN_mod(ret,t,m,ctx)) goto err;
    81.   	r=1;

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:148:3: Call
        146.   		
        147.   		bn_mul_comba4(r,a,b);
        148.   		bn_mul_comba4(&(r[n2]),&(a[n]),&(b[n]));
                 ^
        149.   		}
        150.   	else if (n == 8)

crypto/bn/bn_asm.c:598:1: <Length trace>
596.   	}
597.   
598. > void bn_mul_comba4(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
599.   	{
600.   #ifdef BN_LLONG

crypto/bn/bn_asm.c:598:1: Parameter `*a`
          596.   	}
          597.   
          598. > void bn_mul_comba4(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
          599.   	{
          600.   #ifdef BN_LLONG

crypto/bn/bn_asm.c:618:2: Array access: Offset: 6 (⇐ 4 + 2) Size: [0, +oo] by call to `BN_BLINDING_convert` 
          616.   	r[1]=c2;
          617.   	c2=0;
          618.   	mul_add_c(a[2],b[0],c3,c1,c2);
                  ^
          619.   	mul_add_c(a[1],b[1],c3,c1,c2);
          620.   	mul_add_c(a[0],b[2],c3,c1,c2);
