]>
Commit | Line | Data |
---|---|---|
0c50e02b BM |
1 | /* unused */ |
2 | ||
58964a49 RE |
3 | /* crypto/bn/expspeed.c */ |
4 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) | |
5 | * All rights reserved. | |
6 | * | |
7 | * This package is an SSL implementation written | |
8 | * by Eric Young (eay@cryptsoft.com). | |
9 | * The implementation was written so as to conform with Netscapes SSL. | |
10 | * | |
11 | * This library is free for commercial and non-commercial use as long as | |
12 | * the following conditions are aheared to. The following conditions | |
13 | * apply to all code found in this distribution, be it the RC4, RSA, | |
14 | * lhash, DES, etc., code; not just the SSL code. The SSL documentation | |
15 | * included with this distribution is covered by the same copyright terms | |
16 | * except that the holder is Tim Hudson (tjh@cryptsoft.com). | |
17 | * | |
18 | * Copyright remains Eric Young's, and as such any Copyright notices in | |
19 | * the code are not to be removed. | |
20 | * If this package is used in a product, Eric Young should be given attribution | |
21 | * as the author of the parts of the library used. | |
22 | * This can be in the form of a textual message at program startup or | |
23 | * in documentation (online or textual) provided with the package. | |
24 | * | |
25 | * Redistribution and use in source and binary forms, with or without | |
26 | * modification, are permitted provided that the following conditions | |
27 | * are met: | |
28 | * 1. Redistributions of source code must retain the copyright | |
29 | * notice, this list of conditions and the following disclaimer. | |
30 | * 2. Redistributions in binary form must reproduce the above copyright | |
31 | * notice, this list of conditions and the following disclaimer in the | |
32 | * documentation and/or other materials provided with the distribution. | |
33 | * 3. All advertising materials mentioning features or use of this software | |
34 | * must display the following acknowledgement: | |
35 | * "This product includes cryptographic software written by | |
36 | * Eric Young (eay@cryptsoft.com)" | |
37 | * The word 'cryptographic' can be left out if the rouines from the library | |
38 | * being used are not cryptographic related :-). | |
39 | * 4. If you include any Windows specific code (or a derivative thereof) from | |
40 | * the apps directory (application code) you must include an acknowledgement: | |
41 | * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" | |
42 | * | |
43 | * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND | |
44 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
45 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
46 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE | |
47 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
48 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
49 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
50 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
51 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
52 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
53 | * SUCH DAMAGE. | |
54 | * | |
55 | * The licence and distribution terms for any publically available version or | |
56 | * derivative of this code cannot be changed. i.e. this code cannot simply be | |
57 | * copied and put under another distribution licence | |
58 | * [including the GNU Public Licence.] | |
59 | */ | |
60 | ||
61 | /* most of this code has been pilfered from my libdes speed.c program */ | |
62 | ||
5a12df5c | 63 | #define BASENUM 5000 |
499e167f BM |
64 | #define NUM_START 0 |
65 | ||
66 | ||
f7356b67 BM |
67 | /* determine timings for modexp, modmul, modsqr, gcd, Kronecker symbol, |
68 | * modular inverse, or modular square roots */ | |
5a12df5c | 69 | #define TEST_EXP |
f7356b67 BM |
70 | #undef TEST_MUL |
71 | #undef TEST_SQR | |
499e167f | 72 | #undef TEST_GCD |
5a12df5c | 73 | #undef TEST_KRON |
499e167f | 74 | #undef TEST_INV |
5a12df5c BM |
75 | #undef TEST_SQRT |
76 | #define P_MOD_64 9 /* least significant 6 bits for prime to be used for BN_sqrt timings */ | |
77 | ||
f7356b67 | 78 | #if defined(TEST_EXP) + defined(TEST_MUL) + defined(TEST_SQR) + defined(TEST_GCD) + defined(TEST_KRON) + defined(TEST_INV) +defined(TEST_SQRT) != 1 |
5a12df5c BM |
79 | # error "choose one test" |
80 | #endif | |
81 | ||
82 | #if defined(TEST_INV) || defined(TEST_SQRT) | |
83 | # define C_PRIME | |
84 | static void genprime_cb(int p, int n, void *arg); | |
85 | #endif | |
86 | ||
499e167f BM |
87 | |
88 | ||
58964a49 RE |
89 | #undef PROG |
90 | #define PROG bnspeed_main | |
91 | ||
92 | #include <stdio.h> | |
93 | #include <stdlib.h> | |
94 | #include <signal.h> | |
95 | #include <string.h> | |
ec577822 BM |
96 | #include <openssl/crypto.h> |
97 | #include <openssl/err.h> | |
03a08489 | 98 | #include <openssl/rand.h> |
58964a49 | 99 | |
bc36ee62 | 100 | #if !defined(OPENSSL_SYS_MSDOS) && (!defined(OPENSSL_SYS_VMS) || defined(__DECC)) |
58964a49 RE |
101 | #define TIMES |
102 | #endif | |
103 | ||
58964a49 RE |
104 | #ifndef _IRIX |
105 | #include <time.h> | |
106 | #endif | |
107 | #ifdef TIMES | |
108 | #include <sys/types.h> | |
109 | #include <sys/times.h> | |
110 | #endif | |
7d7d2cbc UM |
111 | |
112 | /* Depending on the VMS version, the tms structure is perhaps defined. | |
113 | The __TMS macro will show if it was. If it wasn't defined, we should | |
114 | undefine TIMES, since that tells the rest of the program how things | |
115 | should be handled. -- Richard Levitte */ | |
bc36ee62 | 116 | #if defined(OPENSSL_SYS_VMS_DECC) && !defined(__TMS) |
7d7d2cbc | 117 | #undef TIMES |
58964a49 | 118 | #endif |
7d7d2cbc | 119 | |
58964a49 RE |
120 | #ifndef TIMES |
121 | #include <sys/timeb.h> | |
122 | #endif | |
123 | ||
dfeab068 RE |
124 | #if defined(sun) || defined(__ultrix) |
125 | #define _POSIX_SOURCE | |
58964a49 RE |
126 | #include <limits.h> |
127 | #include <sys/param.h> | |
128 | #endif | |
129 | ||
ec577822 BM |
130 | #include <openssl/bn.h> |
131 | #include <openssl/x509.h> | |
58964a49 RE |
132 | |
133 | /* The following if from times(3) man page. It may need to be changed */ | |
134 | #ifndef HZ | |
135 | # ifndef CLK_TCK | |
136 | # ifndef _BSD_CLK_TCK_ /* FreeBSD hack */ | |
5c83b4c9 | 137 | # define HZ 100.0 |
58964a49 RE |
138 | # else /* _BSD_CLK_TCK_ */ |
139 | # define HZ ((double)_BSD_CLK_TCK_) | |
140 | # endif | |
141 | # else /* CLK_TCK */ | |
142 | # define HZ ((double)CLK_TCK) | |
143 | # endif | |
144 | #endif | |
145 | ||
146 | #undef BUFSIZE | |
147 | #define BUFSIZE ((long)1024*8) | |
148 | int run=0; | |
149 | ||
58964a49 | 150 | static double Time_F(int s); |
58964a49 RE |
151 | #define START 0 |
152 | #define STOP 1 | |
153 | ||
6b691a5c | 154 | static double Time_F(int s) |
58964a49 RE |
155 | { |
156 | double ret; | |
157 | #ifdef TIMES | |
158 | static struct tms tstart,tend; | |
159 | ||
160 | if (s == START) | |
161 | { | |
162 | times(&tstart); | |
163 | return(0); | |
164 | } | |
165 | else | |
166 | { | |
167 | times(&tend); | |
168 | ret=((double)(tend.tms_utime-tstart.tms_utime))/HZ; | |
169 | return((ret < 1e-3)?1e-3:ret); | |
170 | } | |
171 | #else /* !times() */ | |
172 | static struct timeb tstart,tend; | |
173 | long i; | |
174 | ||
175 | if (s == START) | |
176 | { | |
177 | ftime(&tstart); | |
178 | return(0); | |
179 | } | |
180 | else | |
181 | { | |
182 | ftime(&tend); | |
183 | i=(long)tend.millitm-(long)tstart.millitm; | |
184 | ret=((double)(tend.time-tstart.time))+((double)i)/1000.0; | |
185 | return((ret < 0.001)?0.001:ret); | |
186 | } | |
187 | #endif | |
188 | } | |
189 | ||
499e167f BM |
190 | #define NUM_SIZES 7 |
191 | #if NUM_START > NUM_SIZES | |
192 | # error "NUM_START > NUM_SIZES" | |
193 | #endif | |
194 | static int sizes[NUM_SIZES]={128,256,512,1024,2048,4096,8192}; | |
195 | static int mul_c[NUM_SIZES]={8*8*8*8*8*8,8*8*8*8*8,8*8*8*8,8*8*8,8*8,8,1}; | |
58964a49 RE |
196 | /*static int sizes[NUM_SIZES]={59,179,299,419,539}; */ |
197 | ||
03a08489 | 198 | #define RAND_SEED(string) { const char str[] = string; RAND_seed(string, sizeof str); } |
499e167f | 199 | |
58964a49 RE |
200 | void do_mul_exp(BIGNUM *r,BIGNUM *a,BIGNUM *b,BIGNUM *c,BN_CTX *ctx); |
201 | ||
6b691a5c | 202 | int main(int argc, char **argv) |
58964a49 RE |
203 | { |
204 | BN_CTX *ctx; | |
205 | BIGNUM *a,*b,*c,*r; | |
206 | ||
5a12df5c BM |
207 | #if 1 |
208 | if (!CRYPTO_set_mem_debug_functions(0,0,0,0,0)) | |
209 | abort(); | |
210 | #endif | |
211 | ||
58964a49 RE |
212 | ctx=BN_CTX_new(); |
213 | a=BN_new(); | |
214 | b=BN_new(); | |
215 | c=BN_new(); | |
216 | r=BN_new(); | |
217 | ||
499e167f BM |
218 | while (!RAND_status()) |
219 | /* not enough bits */ | |
220 | RAND_SEED("I demand a manual recount!"); | |
221 | ||
58964a49 | 222 | do_mul_exp(r,a,b,c,ctx); |
03a08489 | 223 | return 0; |
58964a49 RE |
224 | } |
225 | ||
6b691a5c | 226 | void do_mul_exp(BIGNUM *r, BIGNUM *a, BIGNUM *b, BIGNUM *c, BN_CTX *ctx) |
58964a49 RE |
227 | { |
228 | int i,k; | |
229 | double tm; | |
230 | long num; | |
58964a49 RE |
231 | |
232 | num=BASENUM; | |
499e167f | 233 | for (i=NUM_START; i<NUM_SIZES; i++) |
58964a49 | 234 | { |
499e167f | 235 | #ifdef C_PRIME |
5a12df5c BM |
236 | # ifdef TEST_SQRT |
237 | if (!BN_set_word(a, 64)) goto err; | |
238 | if (!BN_set_word(b, P_MOD_64)) goto err; | |
239 | # define ADD a | |
240 | # define REM b | |
241 | # else | |
242 | # define ADD NULL | |
243 | # define REM NULL | |
244 | # endif | |
245 | if (!BN_generate_prime(c,sizes[i],0,ADD,REM,genprime_cb,NULL)) goto err; | |
499e167f BM |
246 | putc('\n', stderr); |
247 | fflush(stderr); | |
248 | #endif | |
58964a49 | 249 | |
58964a49 | 250 | for (k=0; k<num; k++) |
499e167f BM |
251 | { |
252 | if (k%50 == 0) /* Average over num/50 different choices of random numbers. */ | |
253 | { | |
254 | if (!BN_pseudo_rand(a,sizes[i],1,0)) goto err; | |
5a12df5c | 255 | |
499e167f | 256 | if (!BN_pseudo_rand(b,sizes[i],1,0)) goto err; |
5a12df5c | 257 | |
499e167f BM |
258 | #ifndef C_PRIME |
259 | if (!BN_pseudo_rand(c,sizes[i],1,1)) goto err; | |
260 | #endif | |
5a12df5c BM |
261 | |
262 | #ifdef TEST_SQRT | |
263 | if (!BN_mod_sqr(a,a,c,ctx)) goto err; | |
264 | if (!BN_mod_sqr(b,b,c,ctx)) goto err; | |
265 | #else | |
266 | if (!BN_nnmod(a,a,c,ctx)) goto err; | |
267 | if (!BN_nnmod(b,b,c,ctx)) goto err; | |
268 | #endif | |
269 | ||
270 | if (k == 0) | |
271 | Time_F(START); | |
499e167f | 272 | } |
5a12df5c | 273 | |
499e167f BM |
274 | #if defined(TEST_EXP) |
275 | if (!BN_mod_exp(r,a,b,c,ctx)) goto err; | |
f7356b67 BM |
276 | #elif defined(TEST_MUL) |
277 | { | |
278 | int i = 0; | |
279 | for (i = 0; i < 50; i++) | |
280 | if (!BN_mod_mul(r,a,b,c,ctx)) goto err; | |
281 | } | |
282 | #elif defined(TEST_SQR) | |
283 | { | |
284 | int i = 0; | |
285 | for (i = 0; i < 50; i++) | |
286 | { | |
287 | if (!BN_mod_sqr(r,a,c,ctx)) goto err; | |
288 | if (!BN_mod_sqr(r,b,c,ctx)) goto err; | |
289 | } | |
290 | } | |
499e167f BM |
291 | #elif defined(TEST_GCD) |
292 | if (!BN_gcd(r,a,b,ctx)) goto err; | |
293 | if (!BN_gcd(r,b,c,ctx)) goto err; | |
a08bcccc BM |
294 | if (!BN_gcd(r,c,a,ctx)) goto err; |
295 | #elif defined(TEST_KRON) | |
296 | if (-2 == BN_kronecker(a,b,ctx)) goto err; | |
297 | if (-2 == BN_kronecker(b,c,ctx)) goto err; | |
298 | if (-2 == BN_kronecker(c,a,ctx)) goto err; | |
5a12df5c | 299 | #elif defined(TEST_INV) |
499e167f BM |
300 | if (!BN_mod_inverse(r,a,c,ctx)) goto err; |
301 | if (!BN_mod_inverse(r,b,c,ctx)) goto err; | |
5a12df5c BM |
302 | #else /* TEST_SQRT */ |
303 | if (!BN_mod_sqrt(r,a,c,ctx)) goto err; | |
304 | if (!BN_mod_sqrt(r,b,c,ctx)) goto err; | |
499e167f BM |
305 | #endif |
306 | } | |
58964a49 | 307 | tm=Time_F(STOP); |
499e167f BM |
308 | printf( |
309 | #if defined(TEST_EXP) | |
310 | "modexp %4d ^ %4d %% %4d" | |
f7356b67 BM |
311 | #elif defined(TEST_MUL) |
312 | "50*modmul %4d %4d %4d" | |
313 | #elif defined(TEST_SQR) | |
314 | "100*modsqr %4d %4d %4d" | |
499e167f BM |
315 | #elif defined(TEST_GCD) |
316 | "3*gcd %4d %4d %4d" | |
a08bcccc BM |
317 | #elif defined(TEST_KRON) |
318 | "3*kronecker %4d %4d %4d" | |
5a12df5c | 319 | #elif defined(TEST_INV) |
499e167f | 320 | "2*inv %4d %4d mod %4d" |
5a12df5c BM |
321 | #else /* TEST_SQRT */ |
322 | "2*sqrt [prime == %d (mod 64)] %4d %4d mod %4d" | |
323 | #endif | |
324 | " -> %8.3fms %5.1f (%ld)\n", | |
325 | #ifdef TEST_SQRT | |
326 | P_MOD_64, | |
499e167f | 327 | #endif |
5a12df5c | 328 | sizes[i],sizes[i],sizes[i],tm*1000.0/num,tm*mul_c[i]/num, num); |
58964a49 RE |
329 | num/=7; |
330 | if (num <= 0) num=1; | |
331 | } | |
499e167f | 332 | return; |
58964a49 | 333 | |
499e167f BM |
334 | err: |
335 | ERR_print_errors_fp(stderr); | |
58964a49 RE |
336 | } |
337 | ||
5a12df5c BM |
338 | |
339 | #ifdef C_PRIME | |
340 | static void genprime_cb(int p, int n, void *arg) | |
341 | { | |
342 | char c='*'; | |
343 | ||
344 | if (p == 0) c='.'; | |
345 | if (p == 1) c='+'; | |
346 | if (p == 2) c='*'; | |
347 | if (p == 3) c='\n'; | |
348 | putc(c, stderr); | |
349 | fflush(stderr); | |
350 | (void)n; | |
351 | (void)arg; | |
352 | } | |
353 | #endif |