1 /* crypto/bn/expspeed.c */
2 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
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.
9 * This library is free for commercial and non-commercial use as long as
10 * the following conditions are aheared to. The following conditions
11 * apply to all code found in this distribution, be it the RC4, RSA,
12 * lhash, DES, etc., code; not just the SSL code. The SSL documentation
13 * included with this distribution is covered by the same copyright terms
14 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
16 * Copyright remains Eric Young's, and as such any Copyright notices in
17 * the code are not to be removed.
18 * If this package is used in a product, Eric Young should be given attribution
19 * as the author of the parts of the library used.
20 * This can be in the form of a textual message at program startup or
21 * in documentation (online or textual) provided with the package.
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
26 * 1. Redistributions of source code must retain the copyright
27 * notice, this list of conditions and the following disclaimer.
28 * 2. Redistributions in binary form must reproduce the above copyright
29 * notice, this list of conditions and the following disclaimer in the
30 * documentation and/or other materials provided with the distribution.
31 * 3. All advertising materials mentioning features or use of this software
32 * must display the following acknowledgement:
33 * "This product includes cryptographic software written by
34 * Eric Young (eay@cryptsoft.com)"
35 * The word 'cryptographic' can be left out if the rouines from the library
36 * being used are not cryptographic related :-).
37 * 4. If you include any Windows specific code (or a derivative thereof) from
38 * the apps directory (application code) you must include an acknowledgement:
39 * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
41 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
42 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
43 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
44 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
45 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
46 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
47 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
48 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
49 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
50 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
53 * The licence and distribution terms for any publically available version or
54 * derivative of this code cannot be changed. i.e. this code cannot simply be
55 * copied and put under another distribution licence
56 * [including the GNU Public Licence.]
59 /* most of this code has been pilfered from my libdes speed.c program */
70 #define DEFAULT_SIZE 512
71 #define DEFAULT_TIME 3
75 typedef struct parms_st
89 void do_mul_exp(int num,PARMS *p);
90 void do_mul(int num,PARMS *p);
91 void do_sqr(int num,PARMS *p);
92 void do_mul_low(int num,PARMS *p);
93 void do_mul_high(int num,PARMS *p);
94 void do_from_montgomery(int num,PARMS *p);
95 int time_it(int sec, PARMS *p);
96 void do_it(int sec, PARMS *p);
115 mont=BN_MONT_CTX_new();
129 if (argv[1][0] == '-')
133 case 'e': type=P_EXP; break;
134 case 'm': type=P_MUL; break;
135 case 's': type=P_SQR; break;
136 case 'l': type=P_MULL; break;
137 case 'h': type=P_MULH; break;
138 case 'r': type=P_MRED; break;
140 fprintf(stderr,"options: -[emslhr]\n");
157 printf("bit size:%5d\n",size);
159 BN_rand(&p.a,size,1,0);
160 BN_rand(&p.b,size,1,0);
161 BN_rand(&p.c,size,1,1);
162 BN_mod(&p.a,&p.a,&p.c,p.ctx);
163 BN_mod(&p.b,&p.b,&p.c,p.ctx);
166 BN_mul(&p.low,&p.a,&p.b,p.ctx);
189 p.name="r=high(a*b)";
193 p.name="r=montgomery_reduction(a)";
194 p.func=do_from_montgomery;
198 fprintf(stderr,"options: -[emslhr]\n");
202 num=time_it(DEFAULT_TIME,&p);
217 number=BN_num_bits_word((BN_ULONG)BN_num_bits(&(p->c)))-
218 BN_num_bits_word(BN_BITS2)+2;
219 for (i=number-1; i >=0; i--)
221 if (i == 1) continue;
222 BN_set_params(i,i,i,1);
224 BN_MONT_CTX_set(p->mont,&(p->c),p->ctx);
226 printf("Timing %5d (%2d bit) %2d %2d %2d %2d :",
237 d=ms_time_diff(start,end);
238 printf("%6.6f sec, or %d in %.4f seconds\n",
239 (double)d/num,num,d);
252 BN_MONT_CTX_set(p->mont,&(p->c),p->ctx);
261 printf("timing %s for %d interations\n",p->name,i);
266 d=ms_time_diff(start,end);
268 if (d < 0.01) i*=100;
269 else if (d < 0.1 ) i*=10;
270 else if (d > (double)sec) break;
273 i=(int)(1.0*i*sec/d);
278 printf("using %d interations\n",i);
282 void do_mul_exp(num,p)
288 for (i=0; i<num; i++)
289 BN_mod_exp_mont(&(p->r),&(p->a),&(p->b),&(p->c),
299 for (i=0; i<num; i++)
300 BN_mul(&(p->r),&(p->a),&(p->b),p->ctx);
309 for (i=0; i<num; i++)
310 BN_sqr(&(p->r),&(p->a),p->ctx);
313 void do_mul_low(num,p)
319 for (i=0; i<num; i++)
320 BN_mul_low(&(p->r),&(p->a),&(p->b),p->w,p->ctx);
323 void do_mul_high(num,p)
329 for (i=0; i<num; i++)
330 BN_mul_low(&(p->r),&(p->a),&(p->b),&(p->low),p->w,p->ctx);
333 void do_from_montgomery(num,p)
339 for (i=0; i<num; i++)
340 BN_from_montgomery(&(p->r),&(p->a),p->mont,p->ctx);