crypto/ec/ecdsa_ossl.c:200: 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


crypto/ec/ecdsa_ossl.c:127:22: Call
125.           do
126.               if (dgst != NULL) {
127.                   if (!BN_generate_dsa_nonce
                            ^
128.                       (k, order, EC_KEY_get0_private_key(eckey), dgst, dlen,
129.                        ctx)) {

crypto/bn/bn_rand.c:299:1: Parameter `out->top`
  297.    * used.
  298.    */
  299. > int BN_generate_dsa_nonce(BIGNUM *out, const BIGNUM *range,
  300.                             const BIGNUM *priv, const unsigned char *message,
  301.                             size_t message_len, BN_CTX *ctx)

crypto/ec/ecdsa_ossl.c:200:14: Call
198.           }
199.           BN_set_flags(X, BN_FLG_CONSTTIME);
200.           if (!BN_mod_exp_mont_consttime
                    ^
201.               (k, k, X, order, ctx, EC_GROUP_get_mont_data(group))) {
202.               ECerr(EC_F_ECDSA_SIGN_SETUP, ERR_R_BN_LIB);

crypto/bn/bn_exp.c:655:1: Parameter `a->top`
  653.    * http://www.daemonology.net/hyperthreading-considered-harmful/)
  654.    */
  655. > int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
  656.                                 const BIGNUM *m, BN_CTX *ctx,
  657.                                 BN_MONT_CTX *in_mont)

crypto/bn/bn_exp.c:812:17: Call
  810.           if (!BN_to_montgomery(&am, &am, mont, ctx))
  811.               goto err;
  812.       } else if (!BN_to_montgomery(&am, a, mont, ctx))
                         ^
  813.           goto err;
  814.   

crypto/bn/bn_lib.c:924:1: Parameter `a->top`
    922.   }
    923.   
    924. > int BN_to_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
    925.                        BN_CTX *ctx)
    926.   {

crypto/bn/bn_lib.c:927:12: Call
    925.                        BN_CTX *ctx)
    926.   {
    927.       return BN_mod_mul_montgomery(r, a, &(mont->RR), mont, ctx);
                      ^
    928.   }
    929.   

crypto/bn/bn_mont.c:128:1: Parameter `a->top`
      126.   #endif
      127.   
      128. > int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
      129.                             BN_MONT_CTX *mont, BN_CTX *ctx)
      130.   {

crypto/bn/bn_mont.c:155:14: Call
      153.       bn_check_top(tmp);
      154.       if (a == b) {
      155.           if (!BN_sqr(tmp, a, ctx))
                          ^
      156.               goto err;
      157.       } else {

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

crypto/bn/bn_sqr.c:74:5: Assignment
        72.       bn_check_top(a);
        73.   
        74.       al = a->top;
                  ^
        75.       if (al <= 0) {
        76.           r->top = 0;

crypto/bn/bn_sqr.c:123:17: Call
        121.                   if (bn_wexpand(tmp, max) == NULL)
        122.                       goto err;
        123.                   bn_sqr_normal(rr->d, a->d, al, tmp->d);
                               ^
        124.               }
        125.           }

crypto/bn/bn_sqr.c:153:1: <Offset trace>
151.   
152.   /* tmp must have 2*n words */
153. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
154.   {
155.       int i, j, max;

crypto/bn/bn_sqr.c:153:1: Parameter `n`
          151.   
          152.   /* tmp must have 2*n words */
          153. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
          154.   {
          155.       int i, j, max;

crypto/bn/bn_sqr.c:164:5: Assignment
          162.       rp[0] = rp[max - 1] = 0;
          163.       rp++;
          164.       j = n;
                     ^
          165.   
          166.       if (--j > 0) {

crypto/bn/bn_sqr.c:166:9: Assignment
          164.       j = n;
          165.   
          166.       if (--j > 0) {
                         ^
          167.           ap++;
          168.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);

crypto/bn/bn_sqr.c:153:1: <Length trace>
151.   
152.   /* tmp must have 2*n words */
153. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
154.   {
155.       int i, j, max;

crypto/bn/bn_sqr.c:153:1: Parameter `*r`
          151.   
          152.   /* tmp must have 2*n words */
          153. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
          154.   {
          155.       int i, j, max;

crypto/bn/bn_sqr.c:161:5: Assignment
          159.       max = n * 2;
          160.       ap = a;
          161.       rp = r;
                     ^
          162.       rp[0] = rp[max - 1] = 0;
          163.       rp++;

crypto/bn/bn_sqr.c:163:5: Assignment
          161.       rp = r;
          162.       rp[0] = rp[max - 1] = 0;
          163.       rp++;
                     ^
          164.       j = n;
          165.   

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