提交 18384774 编写于 作者: B Bodo Möller

fix bn_expand2

上级 bac60123
......@@ -284,7 +284,7 @@ int BN_GF2m_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
if (a->top < b->top) { at = b; bt = a; }
else { at = a; bt = b; }
bn_wexpand(r, at->top);
bn_expand2(r, at->top);
for (i = 0; i < bt->top; i++)
{
......
......@@ -453,13 +453,14 @@ BIGNUM *bn_expand2(BIGNUM *b, int words)
if ((b != NULL) && (b->top < b->dmax))
{
A = &(b->d[b->top]);
for (i=(words - b->top)>>3; i>0; i--,A+=8)
for (i=(b->dmax - b->top)>>3; i>0; i--,A+=8)
{
A[0]=0; A[1]=0; A[2]=0; A[3]=0;
A[4]=0; A[5]=0; A[6]=0; A[7]=0;
}
for (i=(words - b->top)&7; i>0; i--,A++)
for (i=(b->dmax - b->top)&7; i>0; i--,A++)
A[0]=0;
assert(A == &(b->d[b->dmax]));
}
return b;
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册