crypto/rsa/rsa_ossl.c:888: error: BUFFER_OVERRUN_L3
  Offset: 0 (⇐ 1 + -1) Size: [0, 8388607] by call to `BN_mod_exp_mont`.
Showing all 20 steps of the trace


crypto/rsa/rsa_ossl.c:687:17: Call
685.                                         ctx)
686.               /* r0 = r1 * q + m1 */
687.               || !bn_mul_fixed_top(r0, r1, rsa->q, ctx)
                       ^
688.               || !bn_mod_add_fixed_top(r0, r0, m1, rsa->n))
689.               goto err;

crypto/bn/bn_mul.c:507:1: Parameter `*r->d`
  505.   }
  506.   
  507. > int bn_mul_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
  508.   {
  509.       int ret = 0;

crypto/rsa/rsa_ossl.c:688:17: Call
686.               /* r0 = r1 * q + m1 */
687.               || !bn_mul_fixed_top(r0, r1, rsa->q, ctx)
688.               || !bn_mod_add_fixed_top(r0, r0, m1, rsa->n))
                       ^
689.               goto err;
690.   

crypto/bn/bn_mod.c:48:1: Parameter `*a->d`
  46.    * move depending on whether or not subtraction borrowed.
  47.    */
  48. > int bn_mod_add_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  49.                            const BIGNUM *m)
  50.   {

crypto/rsa/rsa_ossl.c:888:18: Call
886.       if (rsa->e && rsa->n) {
887.           if (rsa->meth->bn_mod_exp == BN_mod_exp_mont) {
888.               if (!BN_mod_exp_mont(vrfy, r0, rsa->e, rsa->n, ctx,
                        ^
889.                                    rsa->_method_mod_n))
890.                   goto err;

crypto/bn/bn_exp.c:296:1: Parameter `*a->d`
  294.   }
  295.   
  296. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
  297.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
  298.   {

crypto/bn/bn_exp.c:310:16: Call
  308.               || BN_get_flags(a, BN_FLG_CONSTTIME) != 0
  309.               || BN_get_flags(m, BN_FLG_CONSTTIME) != 0) {
  310.           return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);
                        ^
  311.       }
  312.   

crypto/bn/bn_exp.c:592:1: Parameter `*a->d`
    590.    * http://www.daemonology.net/hyperthreading-considered-harmful/)
    591.    */
    592. > int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
    593.                                 const BIGNUM *m, BN_CTX *ctx,
    594.                                 BN_MONT_CTX *in_mont)

crypto/bn/bn_exp.c:757:10: Call
    755.   
    756.       /* prepare a^1 in Montgomery domain */
    757.       if (!bn_to_mont_fixed_top(&am, a, mont, ctx))
                    ^
    758.           goto err;
    759.   

crypto/bn/bn_mont.c:222:1: Parameter `*a->d`
      220.   }
      221.   
      222. > int bn_to_mont_fixed_top(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
      223.                            BN_CTX *ctx)
      224.   {

crypto/bn/bn_mont.c:225:12: Call
      223.                            BN_CTX *ctx)
      224.   {
      225.       return bn_mul_mont_fixed_top(r, a, &(mont->RR), mont, ctx);
                        ^
      226.   }
      227.   

crypto/bn/bn_mont.c:37:1: Parameter `*a->d`
        35.   }
        36.   
        37. > int bn_mul_mont_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
        38.                             BN_MONT_CTX *mont, BN_CTX *ctx)
        39.   {

crypto/bn/bn_mont.c:67:14: Call
        65.       bn_check_top(tmp);
        66.       if (a == b) {
        67.           if (!bn_sqr_fixed_top(tmp, a, ctx))
                           ^
        68.               goto err;
        69.       } else {

crypto/bn/bn_sqr.c:27:1: Parameter `*a->d`
          25.   }
          26.   
          27. > int bn_sqr_fixed_top(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
          28.   {
          29.       int max, al;

crypto/bn/bn_sqr.c:70:13: Call
          68.           if (al < BN_SQR_RECURSIVE_SIZE_NORMAL) {
          69.               BN_ULONG t[BN_SQR_RECURSIVE_SIZE_NORMAL * 2];
          70.               bn_sqr_normal(rr->d, a->d, al, t);
                            ^
          71.           } else {
          72.               int j, k;

crypto/bn/bn_sqr.c:109:1: <Length trace>
107.   
108.   /* tmp must have 2*n words */
109. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
110.   {
111.       int i, j, max;

crypto/bn/bn_sqr.c:109:1: Parameter `*a`
            107.   
            108.   /* tmp must have 2*n words */
            109. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
            110.   {
            111.       int i, j, max;

crypto/bn/bn_sqr.c:116:5: Assignment
            114.   
            115.       max = n * 2;
            116.       ap = a;
                       ^
            117.       rp = r;
            118.       rp[0] = rp[max - 1] = 0;

crypto/bn/bn_sqr.c:123:9: Assignment
            121.   
            122.       if (--j > 0) {
            123.           ap++;
                           ^
            124.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);
            125.           rp += 2;

crypto/bn/bn_sqr.c:124:41: Array access: Offset: 0 (⇐ 1 + -1) Size: [0, 8388607] by call to `BN_mod_exp_mont` 
            122.       if (--j > 0) {
            123.           ap++;
            124.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);
                                                           ^
            125.           rp += 2;
            126.       }
