crypto/rsa/rsa_eay.c:278: error: BUFFER_OVERRUN_L3
  Offset: [9, +oo] (⇐ [9, +oo] + [0, +oo]) Size: [0, +oo] by call to `BN_BLINDING_convert`.
Showing all 19 steps of the trace


crypto/rsa/rsa_eay.c:273:6: Call
271.   
272.   	/* make data into a big number */
273.   	if (BN_bin2bn(from,(int)flen,&f) == NULL) goto err;
            ^
274.   
275.   	if ((rsa->flags & RSA_FLAG_BLINDING) && (rsa->blinding == NULL))

crypto/bn/bn_lib.c:595:1: Parameter `*ret->d`
  593.   
  594.   /* ignore negative */
  595. > BIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM *ret)
  596.   	{
  597.   	unsigned int i,m;

crypto/rsa/rsa_eay.c:278:8: Call
276.   		RSA_blinding_on(rsa,ctx);
277.   	if (rsa->flags & RSA_FLAG_BLINDING)
278.   		if (!BN_BLINDING_convert(&f,rsa->blinding,ctx)) goto err;
              ^
279.   
280.   	/* 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, const 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: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:264:4: Call
        262.   		if (j == 0)
        263.   			{
        264.   			bn_mul_recursive(&(r[n2]),&(a[n]),&(b[n]),i,p);
                  ^
        265.   			memset(&(r[n2+i*2]),0,sizeof(BN_ULONG)*(n2-i*2));
        266.   			}

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:103:5: Call
          101.   		}
          102.   	/* r=(a[0]-a[1])*(b[1]-b[0]) */
          103.   	c1=bn_cmp_words(a,&(a[n]),n);
                     ^
          104.   	c2=bn_cmp_words(&(b[n]),b,n);
          105.   	zero=neg=0;

crypto/bn/bn_lib.c:769:1: <Offset trace>
767.   	}
768.   
769. > int bn_cmp_words(BN_ULONG *a, BN_ULONG *b, int n)
770.   	{
771.   	int i;

crypto/bn/bn_lib.c:769:1: Parameter `n`
            767.   	}
            768.   
            769. > int bn_cmp_words(BN_ULONG *a, BN_ULONG *b, int n)
            770.   	{
            771.   	int i;

crypto/bn/bn_lib.c:777:7: Assignment
            775.   	bb=b[n-1];
            776.   	if (aa != bb) return((aa > bb)?1:-1);
            777.   	for (i=n-2; i>=0; i--)
                         ^
            778.   		{
            779.   		aa=a[i];

crypto/bn/bn_lib.c:769:1: <Length trace>
767.   	}
768.   
769. > int bn_cmp_words(BN_ULONG *a, BN_ULONG *b, int n)
770.   	{
771.   	int i;

crypto/bn/bn_lib.c:769:1: Parameter `*a`
            767.   	}
            768.   
            769. > int bn_cmp_words(BN_ULONG *a, BN_ULONG *b, int n)
            770.   	{
            771.   	int i;

crypto/bn/bn_lib.c:779:6: Array access: Offset: [9, +oo] (⇐ [9, +oo] + [0, +oo]) Size: [0, +oo] by call to `BN_BLINDING_convert` 
            777.   	for (i=n-2; i>=0; i--)
            778.   		{
            779.   		aa=a[i];
                        ^
            780.   		bb=b[i];
            781.   		if (aa != bb) return((aa > bb)?1:-1);
