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

crypto/bn/bn_exp.c:1072:18: Call
1070.   
1071.               /* Multiply the result into the intermediate result */
1072.               if (!BN_mod_mul_montgomery(&tmp, &tmp, &am, mont, ctx))
                         ^
1073.                   goto err;
1074.           }

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:61:10: Call
  59.       /* reduce from aRR to aR */
  60.   #ifdef MONT_WORD
  61.       if (!BN_from_montgomery_word(r, tmp, mont))
                 ^
  62.           goto err;
  63.   #else

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

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

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

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

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

crypto/bn/bn_lib.c:910:1: Parameter `*a->d`
      908.   }
      909.   
      910. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
      911.   {
      912.       return (words <= a->dmax) ? a : bn_expand2(a, words);

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

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