test/bntest.c:1078: error: BUFFER_OVERRUN_L3
  Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `BN_mod_exp_mont_consttime`.
Showing all 21 steps of the trace


test/bntest.c:1075:5: Call
1073.       e = BN_new();
1074.   
1075.       BN_one(a);
            ^
1076.       BN_one(b);
1077.       BN_zero(c);

crypto/bn/bn_lib.c:463:1: Parameter `a->top`
  461.   }
  462.   
  463. > int BN_set_word(BIGNUM *a, BN_ULONG w)
  464.   {
  465.       bn_check_top(a);

test/bntest.c:1078:9: Call
1076.       BN_one(b);
1077.       BN_zero(c);
1078.       if (BN_mod_exp_mont_consttime(d, a, b, c, ctx, NULL)) {
                ^
1079.           fprintf(stderr, "BN_mod_exp_mont_consttime with zero modulus "
1080.                   "succeeded\n");

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

crypto/bn/bn_exp.c:758:17: Call
  756.           if (!BN_to_montgomery(&am, &am, mont, ctx))
  757.               goto err;
  758.       } else if (!BN_to_montgomery(&am, a, mont, ctx))
                         ^
  759.           goto err;
  760.   

crypto/bn/bn_lib.c:945:1: Parameter `a->top`
    943.   }
    944.   
    945. > int BN_to_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
    946.                        BN_CTX *ctx)
    947.   {

crypto/bn/bn_lib.c:948:12: Call
    946.                        BN_CTX *ctx)
    947.   {
    948.       return BN_mod_mul_montgomery(r, a, &(mont->RR), mont, ctx);
                      ^
    949.   }
    950.   

crypto/bn/bn_mont.c:26:1: Parameter `a->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:53:14: Call
      51.       bn_check_top(tmp);
      52.       if (a == b) {
      53.           if (!BN_sqr(tmp, a, ctx))
                         ^
      54.               goto err;
      55.       } else {

crypto/bn/bn_sqr.c:17:1: Parameter `a->top`
        15.    * I've just gone over this and it is now %20 faster on x86 - eay - 27 Jun 96
        16.    */
        17. > int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
        18.   {
        19.       int max, al;

crypto/bn/bn_sqr.c:25:5: Assignment
        23.       bn_check_top(a);
        24.   
        25.       al = a->top;
                  ^
        26.       if (al <= 0) {
        27.           r->top = 0;

crypto/bn/bn_sqr.c:74:17: Call
        72.                   if (bn_wexpand(tmp, max) == NULL)
        73.                       goto err;
        74.                   bn_sqr_normal(rr->d, a->d, al, tmp->d);
                              ^
        75.               }
        76.           }

crypto/bn/bn_sqr.c:105:1: <Offset trace>
103.   
104.   /* tmp must have 2*n words */
105. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
106.   {
107.       int i, j, max;

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

crypto/bn/bn_sqr.c:116:5: Assignment
          114.       rp[0] = rp[max - 1] = 0;
          115.       rp++;
          116.       j = n;
                     ^
          117.   
          118.       if (--j > 0) {

crypto/bn/bn_sqr.c:118:9: Assignment
          116.       j = n;
          117.   
          118.       if (--j > 0) {
                         ^
          119.           ap++;
          120.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);

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

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

crypto/bn/bn_sqr.c:113:5: Assignment
          111.       max = n * 2;
          112.       ap = a;
          113.       rp = r;
                     ^
          114.       rp[0] = rp[max - 1] = 0;
          115.       rp++;

crypto/bn/bn_sqr.c:115:5: Assignment
          113.       rp = r;
          114.       rp[0] = rp[max - 1] = 0;
          115.       rp++;
                     ^
          116.       j = n;
          117.   

crypto/bn/bn_sqr.c:120:9: Array access: Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `BN_mod_exp_mont_consttime` 
          118.       if (--j > 0) {
          119.           ap++;
          120.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);
                         ^
          121.           rp += 2;
          122.       }
