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


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

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

crypto/bn/bn_mont.c:37:1: Parameter `mont->N.top`
  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:75:10: Call
  73.       /* reduce from aRR to aR */
  74.   #ifdef MONT_WORD
  75.       if (!bn_from_montgomery_word(r, tmp, mont))
                 ^
  76.           goto err;
  77.   #else

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

crypto/bn/bn_mont.c:123:21: Assignment
    121.        * includes |carry| which is stored separately.
    122.        */
    123.       for (carry = 0, i = 0; i < nl; i++, rp++) {
                               ^
    124.           v = bn_mul_add_words(rp, np, nl, (rp[0] * n0) & BN_MASK2);
    125.           v = (v + carry + rp[nl]) & BN_MASK2;

crypto/bn/bn_mont.c:88:1: <Length trace>
86.   
87.   #ifdef MONT_WORD
88. > static int bn_from_montgomery_word(BIGNUM *ret, BIGNUM *r, BN_MONT_CTX *mont)
89.   {
90.       BIGNUM *n;

crypto/bn/bn_mont.c:88:1: Parameter `*r->d`
    86.   
    87.   #ifdef MONT_WORD
    88. > static int bn_from_montgomery_word(BIGNUM *ret, BIGNUM *r, BN_MONT_CTX *mont)
    89.   {
    90.       BIGNUM *n;

crypto/bn/bn_mont.c:102:9: Call
    100.   
    101.       max = (2 * nl);             /* carry is stored separately */
    102.       if (bn_wexpand(r, max) == NULL)
                   ^
    103.           return 0;
    104.   

crypto/bn/bn_lib.c:949:1: Parameter `*a->d`
      947.   }
      948.   
      949. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
      950.   {
      951.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_mont.c:107:5: Assignment
    105.       r->neg ^= n->neg;
    106.       np = n->d;
    107.       rp = r->d;
               ^
    108.   
    109.       /* clear the top words of T */

crypto/bn/bn_mont.c:125:26: Array access: Offset: [1, +oo] (⇐ [0, +oo] + [1, +oo]) Size: [0, 8388607] by call to `bn_mul_mont_fixed_top` 
    123.       for (carry = 0, i = 0; i < nl; i++, rp++) {
    124.           v = bn_mul_add_words(rp, np, nl, (rp[0] * n0) & BN_MASK2);
    125.           v = (v + carry + rp[nl]) & BN_MASK2;
                                    ^
    126.           carry |= (v != rp[nl]);
    127.           carry &= (v <= rp[nl]);
