crypto/bn/bn_exp.c:1087: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] (⇐ [0, +oo] + [1, +oo]) Size: [0, 8388607] by call to `BN_from_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:1087:10: Call
1085.       } else
1086.   #endif
1087.       if (!BN_from_montgomery(rr, &tmp, mont, ctx))
                 ^
1088.           goto err;
1089.       ret = 1;

crypto/bn/bn_mont.c:151:1: Parameter `mont->N.top`
  149.   #endif                          /* MONT_WORD */
  150.   
  151. > int BN_from_montgomery(BIGNUM *ret, const BIGNUM *a, BN_MONT_CTX *mont,
  152.                          BN_CTX *ctx)
  153.   {

crypto/bn/bn_mont.c:160:16: Call
  158.       BN_CTX_start(ctx);
  159.       if ((t = BN_CTX_get(ctx)) && BN_copy(t, a))
  160.           retn = BN_from_montgomery_word(ret, t, mont);
                        ^
  161.       BN_CTX_end(ctx);
  162.   #else                           /* !MONT_WORD */

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

crypto/bn/bn_mont.c:111:21: Assignment
    109.        * includes |carry| which is stored separately.
    110.        */
    111.       for (carry = 0, i = 0; i < nl; i++, rp++) {
                               ^
    112.           v = bn_mul_add_words(rp, np, nl, (rp[0] * n0) & BN_MASK2);
    113.           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:941:1: Parameter `*a->d`
      939.   }
      940.   
      941. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
      942.   {
      943.       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:113:26: Array access: Offset: [1, +oo] (⇐ [0, +oo] + [1, +oo]) Size: [0, 8388607] by call to `BN_from_montgomery` 
    111.       for (carry = 0, i = 0; i < nl; i++, rp++) {
    112.           v = bn_mul_add_words(rp, np, nl, (rp[0] * n0) & BN_MASK2);
    113.           v = (v + carry + rp[nl]) & BN_MASK2;
                                    ^
    114.           carry |= (v != rp[nl]);
    115.           carry &= (v <= rp[nl]);
