crypto/ec/ecdsa_ossl.c:205: 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:132:22: Call
130.           do
131.               if (dgst != NULL) {
132.                   if (!BN_generate_dsa_nonce
                            ^
133.                       (k, order, EC_KEY_get0_private_key(eckey), dgst, dlen,
134.                        ctx)) {

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

crypto/ec/ecdsa_ossl.c:205:14: Call
203.           }
204.           BN_set_flags(X, BN_FLG_CONSTTIME);
205.           if (!BN_mod_exp_mont_consttime
                    ^
206.               (k, k, X, order, ctx, EC_GROUP_get_mont_data(group))) {
207.               ECerr(EC_F_ECDSA_SIGN_SETUP, ERR_R_BN_LIB);

crypto/bn/bn_exp.c:693:1: Parameter `a->top`
  691.    * http://www.daemonology.net/hyperthreading-considered-harmful/)
  692.    */
  693. > int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
  694.                                 const BIGNUM *m, BN_CTX *ctx,
  695.                                 BN_MONT_CTX *in_mont)

crypto/bn/bn_exp.c:850:17: Call
  848.           if (!BN_to_montgomery(&am, &am, mont, ctx))
  849.               goto err;
  850.       } else if (!BN_to_montgomery(&am, a, mont, ctx))
                         ^
  851.           goto err;
  852.   

crypto/bn/bn_lib.c:996:1: Parameter `a->top`
    994.   }
    995.   
    996. > int BN_to_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
    997.                        BN_CTX *ctx)
    998.   {

crypto/bn/bn_lib.c:999:12: Call
    997.                        BN_CTX *ctx)
    998.   {
    999.       return BN_mod_mul_montgomery(r, a, &(mont->RR), mont, ctx);
                       ^
    1000.   }
    1001.   

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

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

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

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

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

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

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

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

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

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

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

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

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

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