| bn_sqr.c (59191) | bn_sqr.c (68651) |
|---|---|
| 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 * --- 174 unchanged lines hidden (view full) --- 183 184 bn_sqr_words(tmp,a,n); 185 186 bn_add_words(r,r,tmp,max); 187 } 188 189#ifdef BN_RECURSION 190/* r is 2*n words in size, | 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 * --- 174 unchanged lines hidden (view full) --- 183 184 bn_sqr_words(tmp,a,n); 185 186 bn_add_words(r,r,tmp,max); 187 } 188 189#ifdef BN_RECURSION 190/* r is 2*n words in size, |
| 191 * a and b are both n words in size. | 191 * a and b are both n words in size. (There's not actually a 'b' here ...) |
| 192 * n must be a power of 2. 193 * We multiply and return the result. 194 * t must be 2*n words in size 195 * We calculate 196 * a[0]*b[0] 197 * a[0]*b[0]+a[1]*b[1]+(a[0]-a[1])*(b[1]-b[0]) 198 * a[1]*b[1] 199 */ --- 89 unchanged lines hidden --- | 192 * n must be a power of 2. 193 * We multiply and return the result. 194 * t must be 2*n words in size 195 * We calculate 196 * a[0]*b[0] 197 * a[0]*b[0]+a[1]*b[1]+(a[0]-a[1])*(b[1]-b[0]) 198 * a[1]*b[1] 199 */ --- 89 unchanged lines hidden --- |