test/bntest.c:1556: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_GF2m_mod_sqrt`.
Showing all 14 steps of the trace


test/bntest.c:1555:13: Call
1553.           BN_bntest_rand(a, 512, 0, 0);
1554.           for (j = 0; j < 2; j++) {
1555.               BN_GF2m_mod(c, a, b[j]);
                    ^
1556.               BN_GF2m_mod_sqrt(d, a, b[j], ctx);
1557.               BN_GF2m_mod_sqr(e, d, b[j], ctx);

crypto/bn/bn_gf2m.c:469:1: Parameter `r->top`
  467.    * BN_GF2m_mod_arr function.
  468.    */
  469. > int BN_GF2m_mod(BIGNUM *r, const BIGNUM *a, const BIGNUM *p)
  470.   {
  471.       int ret = 0;

test/bntest.c:1556:13: Call
1554.           for (j = 0; j < 2; j++) {
1555.               BN_GF2m_mod(c, a, b[j]);
1556.               BN_GF2m_mod_sqrt(d, a, b[j], ctx);
                    ^
1557.               BN_GF2m_mod_sqr(e, d, b[j], ctx);
1558.               BN_GF2m_add(f, c, e);

crypto/bn/bn_gf2m.c:1087:1: Parameter `*a->d`
  1085.    * for best performance, use the BN_GF2m_mod_sqrt_arr function.
  1086.    */
  1087. > int BN_GF2m_mod_sqrt(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx)
  1088.   {
  1089.       int ret = 0;

crypto/bn/bn_gf2m.c:1101:11: Call
  1099.           goto err;
  1100.       }
  1101.       ret = BN_GF2m_mod_sqrt_arr(r, a, arr, ctx);
                    ^
  1102.       bn_check_top(r);
  1103.    err:

crypto/bn/bn_gf2m.c:1053:1: Parameter `*a->d`
    1051.    * r could be a. Uses exponentiation as in algorithm A.4.1 from IEEE P1363.
    1052.    */
    1053. > int BN_GF2m_mod_sqrt_arr(BIGNUM *r, const BIGNUM *a, const int p[],
    1054.                            BN_CTX *ctx)
    1055.   {

crypto/bn/bn_gf2m.c:1073:11: Call
    1071.       if (!BN_set_bit(u, p[0] - 1))
    1072.           goto err;
    1073.       ret = BN_GF2m_mod_exp_arr(r, a, u, p, ctx);
                      ^
    1074.       bn_check_top(r);
    1075.   

crypto/bn/bn_gf2m.c:980:1: Parameter `*a->d`
      978.    * P1363.
      979.    */
      980. > int BN_GF2m_mod_exp_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
      981.                           const int p[], BN_CTX *ctx)
      982.   {

crypto/bn/bn_gf2m.c:1007:18: Call
      1005.               goto err;
      1006.           if (BN_is_bit_set(b, i)) {
      1007.               if (!BN_GF2m_mod_mul_arr(u, u, a, p, ctx))
                               ^
      1008.                   goto err;
      1009.           }

crypto/bn/bn_gf2m.c:489:1: <Offset trace>
487.    * the result in r.  r could be a or b; a could be b.
488.    */
489. > int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
490.                           const int p[], BN_CTX *ctx)
491.   {

crypto/bn/bn_gf2m.c:489:1: Parameter `b->top`
        487.    * the result in r.  r could be a or b; a could be b.
        488.    */
        489. > int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
        490.                           const int p[], BN_CTX *ctx)
        491.   {

crypto/bn/bn_gf2m.c:489:1: <Length trace>
487.    * the result in r.  r could be a or b; a could be b.
488.    */
489. > int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
490.                           const int p[], BN_CTX *ctx)
491.   {

crypto/bn/bn_gf2m.c:489:1: Parameter `*b->d`
        487.    * the result in r.  r could be a or b; a could be b.
        488.    */
        489. > int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
        490.                           const int p[], BN_CTX *ctx)
        491.   {

crypto/bn/bn_gf2m.c:517:40: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_GF2m_mod_sqrt` 
        515.       for (j = 0; j < b->top; j += 2) {
        516.           y0 = b->d[j];
        517.           y1 = ((j + 1) == b->top) ? 0 : b->d[j + 1];
                                                      ^
        518.           for (i = 0; i < a->top; i += 2) {
        519.               x0 = a->d[i];
