3 /* crypto/bn/expspeed.c */
4 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
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.
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).
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.
25 * Redistribution and use in source and binary forms, with or without
26 * modification, are permitted provided that the following conditions
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)"
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
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.]
61 /* most of this code has been pilfered from my libdes speed.c program */
67 * determine timings for modexp, modmul, modsqr, gcd, Kronecker symbol,
68 * modular inverse, or modular square roots
77 #define P_MOD_64 9 /* least significant 6 bits for prime to be
78 * used for BN_sqrt timings */
80 #if defined(TEST_EXP) + defined(TEST_MUL) + defined(TEST_SQR) + defined(TEST_GCD) + defined(TEST_KRON) + defined(TEST_INV) +defined(TEST_SQRT) != 1
81 # error "choose one test"
84 #if defined(TEST_INV) || defined(TEST_SQRT)
86 static void genprime_cb(int p, int n, void *arg);
90 #define PROG bnspeed_main
96 #include <openssl/crypto.h>
97 #include <openssl/err.h>
98 #include <openssl/rand.h>
100 #if !defined(OPENSSL_SYS_MSDOS) && (!defined(OPENSSL_SYS_VMS) || defined(__DECC)) && !defined(OPENSSL_SYS_MACOSX)
108 # include <sys/types.h>
109 # include <sys/times.h>
113 * Depending on the VMS version, the tms structure is perhaps defined. The
114 * __TMS macro will show if it was. If it wasn't defined, we should undefine
115 * TIMES, since that tells the rest of the program how things should be
116 * handled. -- Richard Levitte
118 #if defined(OPENSSL_SYS_VMS_DECC) && !defined(__TMS)
123 # include <sys/timeb.h>
126 #if defined(sun) || defined(__ultrix)
127 # define _POSIX_SOURCE
129 # include <sys/param.h>
132 #include <openssl/bn.h>
133 #include <openssl/x509.h>
135 /* The following if from times(3) man page. It may need to be changed */
138 # ifndef _BSD_CLK_TCK_ /* FreeBSD hack */
140 # else /* _BSD_CLK_TCK_ */
141 # define HZ ((double)_BSD_CLK_TCK_)
144 # define HZ ((double)CLK_TCK)
149 #define BUFSIZE ((long)1024*8)
152 static double Time_F(int s);
156 static double Time_F(int s)
160 static struct tms tstart, tend;
167 ret = ((double)(tend.tms_utime - tstart.tms_utime)) / HZ;
168 return ((ret < 1e-3) ? 1e-3 : ret);
171 static struct timeb tstart, tend;
179 i = (long)tend.millitm - (long)tstart.millitm;
180 ret = ((double)(tend.time - tstart.time)) + ((double)i) / 1000.0;
181 return ((ret < 0.001) ? 0.001 : ret);
187 #if NUM_START > NUM_SIZES
188 # error "NUM_START > NUM_SIZES"
190 static int sizes[NUM_SIZES] = { 128, 256, 512, 1024, 2048, 4096, 8192 };
192 static int mul_c[NUM_SIZES] =
193 { 8 * 8 * 8 * 8 * 8 * 8, 8 * 8 * 8 * 8 * 8, 8 * 8 * 8 * 8, 8 * 8 * 8,
198 * static int sizes[NUM_SIZES]={59,179,299,419,539};
201 #define RAND_SEED(string) { const char str[] = string; RAND_seed(string, sizeof(str)); }
203 void do_mul_exp(BIGNUM *r, BIGNUM *a, BIGNUM *b, BIGNUM *c, BN_CTX *ctx);
205 int main(int argc, char **argv)
208 BIGNUM *a, *b, *c, *r;
211 if (!CRYPTO_set_mem_debug_functions(0, 0, 0, 0, 0))
221 while (!RAND_status())
222 /* not enough bits */
223 RAND_SEED("I demand a manual recount!");
225 do_mul_exp(r, a, b, c, ctx);
229 void do_mul_exp(BIGNUM *r, BIGNUM *a, BIGNUM *b, BIGNUM *c, BN_CTX *ctx)
236 for (i = NUM_START; i < NUM_SIZES; i++) {
239 if (!BN_set_word(a, 64))
241 if (!BN_set_word(b, P_MOD_64))
249 if (!BN_generate_prime(c, sizes[i], 0, ADD, REM, genprime_cb, NULL))
255 for (k = 0; k < num; k++) {
256 if (k % 50 == 0) { /* Average over num/50 different choices of
258 if (!BN_pseudo_rand(a, sizes[i], 1, 0))
261 if (!BN_pseudo_rand(b, sizes[i], 1, 0))
265 if (!BN_pseudo_rand(c, sizes[i], 1, 1))
270 if (!BN_mod_sqr(a, a, c, ctx))
272 if (!BN_mod_sqr(b, b, c, ctx))
275 if (!BN_nnmod(a, a, c, ctx))
277 if (!BN_nnmod(b, b, c, ctx))
284 #if defined(TEST_EXP)
285 if (!BN_mod_exp(r, a, b, c, ctx))
287 #elif defined(TEST_MUL)
290 for (i = 0; i < 50; i++)
291 if (!BN_mod_mul(r, a, b, c, ctx))
294 #elif defined(TEST_SQR)
297 for (i = 0; i < 50; i++) {
298 if (!BN_mod_sqr(r, a, c, ctx))
300 if (!BN_mod_sqr(r, b, c, ctx))
304 #elif defined(TEST_GCD)
305 if (!BN_gcd(r, a, b, ctx))
307 if (!BN_gcd(r, b, c, ctx))
309 if (!BN_gcd(r, c, a, ctx))
311 #elif defined(TEST_KRON)
312 if (-2 == BN_kronecker(a, b, ctx))
314 if (-2 == BN_kronecker(b, c, ctx))
316 if (-2 == BN_kronecker(c, a, ctx))
318 #elif defined(TEST_INV)
319 if (!BN_mod_inverse(r, a, c, ctx))
321 if (!BN_mod_inverse(r, b, c, ctx))
323 #else /* TEST_SQRT */
324 if (!BN_mod_sqrt(r, a, c, ctx))
326 if (!BN_mod_sqrt(r, b, c, ctx))
332 #if defined(TEST_EXP)
333 "modexp %4d ^ %4d %% %4d"
334 #elif defined(TEST_MUL)
335 "50*modmul %4d %4d %4d"
336 #elif defined(TEST_SQR)
337 "100*modsqr %4d %4d %4d"
338 #elif defined(TEST_GCD)
340 #elif defined(TEST_KRON)
341 "3*kronecker %4d %4d %4d"
342 #elif defined(TEST_INV)
343 "2*inv %4d %4d mod %4d"
344 #else /* TEST_SQRT */
345 "2*sqrt [prime == %d (mod 64)] %4d %4d mod %4d"
347 " -> %8.6fms %5.1f (%ld)\n",
351 sizes[i], sizes[i], sizes[i], tm * 1000.0 / num,
352 tm * mul_c[i] / num, num);
360 ERR_print_errors_fp(stderr);
364 static void genprime_cb(int p, int n, void *arg)