On Sat, Dec 02, 2000 at 01:18:58PM +0100, Richard Levitte - VMS Whacker wrote:
> Personally, I do prefer a lot to work under that assumption and work
> toward holding that assumption true rather than suddenly have to check
> for zeroes near the top in every operation where that is crucial.
> When operating with BIGNUMs, normalisation is crucial.
That's all fine, but bn_cmp_part_words() operates on chunks of BN_ULONG,
not on BIGNUMs:
void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int tn,
^^^^^^^^^
int n, BN_ULONG *t)
{
// ...
/* r=(a[0]-a[1])*(b[1]-b[0]) */
c1=bn_cmp_part_words(a,&(a[n]),tn,n-tn);
c2=bn_cmp_part_words(&(b[n]),b,tn,tn-n);
^^^^
______________________________________________________________________
OpenSSL Project http://www.openssl.org
Development Mailing List [EMAIL PROTECTED]
Automated List Manager [EMAIL PROTECTED]
