crypto/bn/bn_exp.c:1098: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] (⇐ [0, +oo] + [1, +oo]) Size: [0, 8388607] by call to `BN_mod_mul_montgomery`.
Showing all 12 steps of the trace


crypto/bn/bn_exp.c:596:1: Parameter `in_mont->N.top`
594.    * http://www.daemonology.net/hyperthreading-considered-harmful/)
595.    */
596. > int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
597.                                 const BIGNUM *m, BN_CTX *ctx,
598.                                 BN_MONT_CTX *in_mont)

crypto/bn/bn_exp.c:1098:18: Call
1096.   
1097.               /* Multiply the result into the intermediate result */
1098.               if (!BN_mod_mul_montgomery(&tmp, &tmp, &am, mont, ctx))
                         ^
1099.                   goto err;
1100.           }

crypto/bn/bn_mont.c:26:1: Parameter `mont->N.top`
  24.   #endif
  25.   
  26. > int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  27.                             BN_MONT_CTX *mont, BN_CTX *ctx)
  28.   {

crypto/bn/bn_mont.c:64:10: Call
  62.       /* reduce from aRR to aR */
  63.   #ifdef MONT_WORD
  64.       if (!BN_from_montgomery_word(r, tmp, mont))
                 ^
  65.           goto err;
  66.   #else

crypto/bn/bn_mont.c:112:21: <Offset trace>
110.        * includes |carry| which is stored separately.
111.        */
112.       for (carry = 0, i = 0; i < nl; i++, rp++) {
                           ^
113.           v = bn_mul_add_words(rp, np, nl, (rp[0] * n0) & BN_MASK2);
114.           v = (v + carry + rp[nl]) & BN_MASK2;

crypto/bn/bn_mont.c:112:21: Assignment
    110.        * includes |carry| which is stored separately.
    111.        */
    112.       for (carry = 0, i = 0; i < nl; i++, rp++) {
                               ^
    113.           v = bn_mul_add_words(rp, np, nl, (rp[0] * n0) & BN_MASK2);
    114.           v = (v + carry + rp[nl]) & BN_MASK2;

crypto/bn/bn_mont.c:78:1: <Length trace>
76.   
77.   #ifdef MONT_WORD
78. > static int BN_from_montgomery_word(BIGNUM *ret, BIGNUM *r, BN_MONT_CTX *mont)
79.   {
80.       BIGNUM *n;

crypto/bn/bn_mont.c:78:1: Parameter `*r->d`
    76.   
    77.   #ifdef MONT_WORD
    78. > static int BN_from_montgomery_word(BIGNUM *ret, BIGNUM *r, BN_MONT_CTX *mont)
    79.   {
    80.       BIGNUM *n;

crypto/bn/bn_mont.c:92:9: Call
    90.   
    91.       max = (2 * nl);             /* carry is stored separately */
    92.       if (bn_wexpand(r, max) == NULL)
                  ^
    93.           return 0;
    94.   

crypto/bn/bn_lib.c:942:1: Parameter `*a->d`
      940.   }
      941.   
      942. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
      943.   {
      944.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_mont.c:97:5: Assignment
    95.       r->neg ^= n->neg;
    96.       np = n->d;
    97.       rp = r->d;
               ^
    98.   
    99.       /* clear the top words of T */

crypto/bn/bn_mont.c:114:26: Array access: Offset: [1, +oo] (⇐ [0, +oo] + [1, +oo]) Size: [0, 8388607] by call to `BN_mod_mul_montgomery` 
    112.       for (carry = 0, i = 0; i < nl; i++, rp++) {
    113.           v = bn_mul_add_words(rp, np, nl, (rp[0] * n0) & BN_MASK2);
    114.           v = (v + carry + rp[nl]) & BN_MASK2;
                                    ^
    115.           carry |= (v != rp[nl]);
    116.           carry &= (v <= rp[nl]);
