| bn_sqr.c (68651) | bn_sqr.c (89837) |
|---|---|
| 1/* crypto/bn/bn_sqr.c */ 2/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) 3 * All rights reserved. 4 * 5 * This package is an SSL implementation written 6 * by Eric Young (eay@cryptsoft.com). 7 * The implementation was written so as to conform with Netscapes SSL. 8 * --- 231 unchanged lines hidden (view full) --- 240 zero=1; 241 242 /* The result will always be negative unless it is zero */ 243 p= &(t[n2*2]); 244 245 if (!zero) 246 bn_sqr_recursive(&(t[n2]),t,n,p); 247 else | 1/* crypto/bn/bn_sqr.c */ 2/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) 3 * All rights reserved. 4 * 5 * This package is an SSL implementation written 6 * by Eric Young (eay@cryptsoft.com). 7 * The implementation was written so as to conform with Netscapes SSL. 8 * --- 231 unchanged lines hidden (view full) --- 240 zero=1; 241 242 /* The result will always be negative unless it is zero */ 243 p= &(t[n2*2]); 244 245 if (!zero) 246 bn_sqr_recursive(&(t[n2]),t,n,p); 247 else |
| 248 memset(&(t[n2]),0,n*sizeof(BN_ULONG)); | 248 memset(&(t[n2]),0,n2*sizeof(BN_ULONG)); |
| 249 bn_sqr_recursive(r,a,n,p); 250 bn_sqr_recursive(&(r[n2]),&(a[n]),n,p); 251 252 /* t[32] holds (a[0]-a[1])*(a[1]-a[0]), it is negative or zero 253 * r[10] holds (a[0]*b[0]) 254 * r[32] holds (b[1]*b[1]) 255 */ 256 --- 32 unchanged lines hidden --- | 249 bn_sqr_recursive(r,a,n,p); 250 bn_sqr_recursive(&(r[n2]),&(a[n]),n,p); 251 252 /* t[32] holds (a[0]-a[1])*(a[1]-a[0]), it is negative or zero 253 * r[10] holds (a[0]*b[0]) 254 * r[32] holds (b[1]*b[1]) 255 */ 256 --- 32 unchanged lines hidden --- |