apps/s_client.c:312: error: BUFFER_OVERRUN_L3
  Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `srp_Verify_N_and_g`.
Showing all 34 steps of the trace


apps/s_client.c:293:9: Call
291.           BIO_printf(bio_err, "SRP parameters:\n");
292.           BIO_printf(bio_err, "\tN=");
293.           BN_print(bio_err, N);
               ^
294.           BIO_printf(bio_err, "\n\tg=");
295.           BN_print(bio_err, g);

crypto/bn/bn_print.c:296:1: Parameter `a->top`
  294.   # endif
  295.   
  296. > int BN_print(BIO *bp, const BIGNUM *a)
  297.   {
  298.       int i, j, v, z = 0;

apps/s_client.c:295:9: Call
293.           BN_print(bio_err, N);
294.           BIO_printf(bio_err, "\n\tg=");
295.           BN_print(bio_err, g);
               ^
296.           BIO_printf(bio_err, "\n");
297.       }

crypto/bn/bn_print.c:296:1: Parameter `a->top`
  294.   # endif
  295.   
  296. > int BN_print(BIO *bp, const BIGNUM *a)
  297.   {
  298.       int i, j, v, z = 0;

apps/s_client.c:299:9: Call
297.       }
298.   
299.       if (SRP_check_known_gN_param(g, N))
               ^
300.           return 1;
301.   

crypto/srp/srp_lib.c:296:1: Parameter `g->top`
  294.    * from the ietf-tls-srp draft version 8
  295.    */
  296. > char *SRP_check_known_gN_param(const BIGNUM *g, const BIGNUM *N)
  297.   {
  298.       size_t i;

apps/s_client.c:312:13: Call
310.            * has already been tested.
311.            */
312.           if (BN_num_bits(g) <= BN_BITS && srp_Verify_N_and_g(N, g))
                   ^
313.               return 1;
314.       }

crypto/bn/bn_lib.c:166:9: Call
  164.       bn_check_top(a);
  165.   
  166.       if (BN_is_zero(a))
                 ^
  167.           return 0;
  168.       return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));

crypto/bn/bn_lib.c:920:1: Parameter `a->top`
    918.   }
    919.   
    920. > int BN_is_zero(const BIGNUM *a)
    921.   {
    922.       return a->top == 0;

apps/s_client.c:312:42: Call
310.            * has already been tested.
311.            */
312.           if (BN_num_bits(g) <= BN_BITS && srp_Verify_N_and_g(N, g))
                                                ^
313.               return 1;
314.       }

apps/s_client.c:245:1: Parameter `g->top`
  243.   # define SRP_NUMBER_ITERATIONS_FOR_PRIME 64
  244.   
  245. > static int srp_Verify_N_and_g(const BIGNUM *N, const BIGNUM *g)
  246.   {
  247.       BN_CTX *bn_ctx = BN_CTX_new();

apps/s_client.c:258:9: Call
  256.           r != NULL &&
  257.           /* verify g^((N-1)/2) == -1 (mod N) */
  258.           BN_mod_exp(r, g, p, N, bn_ctx) &&
                 ^
  259.           BN_add_word(r, 1) && BN_cmp(r, N) == 0;
  260.   

crypto/bn/bn_exp.c:90:1: Parameter `a->top`
    88.   }
    89.   
    90. > int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, const BIGNUM *m,
    91.                  BN_CTX *ctx)
    92.   {

crypto/bn/bn_exp.c:150:19: Call
    148.           } else
    149.   # endif
    150.               ret = BN_mod_exp_mont(r, a, p, m, ctx, NULL);
                             ^
    151.       } else
    152.   #endif

crypto/bn/bn_exp.c:300:1: Parameter `a->top`
      298.   }
      299.   
      300. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
      301.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
      302.   {

crypto/bn/bn_exp.c:312:16: Call
      310.   
      311.       if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0) {
      312.           return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);
                            ^
      313.       }
      314.   

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

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

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:104:1: <Offset trace>
102.   
103.   /* tmp must have 2*n words */
104. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
105.   {
106.       int i, j, max;

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

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

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

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

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

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

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

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