2 /* Copyright (C) 1995-1997 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.]
62 #include <openssl/opensslconf.h>
74 /* This next option uses the C libraries (2 word)/(1 word) function.
75 * If it is not defined, I use my C version (which is slower).
76 * The reason for this flag is that when the particular C compiler
77 * library routine is used, and the library is linked with a different
78 * compiler, the library is missing. This mostly happens when the
79 * library is built with gcc and then linked using nornal cc. This would
80 * be a common occurance because gcc normally produces code that is
81 * 2 times faster than system compilers for the big number stuff.
82 * For machines with only one compiler (or shared libraries), this should
83 * be on. Again this in only really a problem on machines
84 * using "long long's", are 32bit, and are not using my assember code. */
85 #if defined(MSDOS) || defined(WINDOWS) || defined(linux)
89 /* assuming long is 64bit - this is the DEC Alpha
90 * unsigned long long is only 64 bits :-(, don't define
91 * BN_LLONG for the DEC Alpha */
92 #ifdef SIXTY_FOUR_BIT_LONG
93 #define BN_ULLONG unsigned long long
94 #define BN_ULONG unsigned long
100 #define BN_MASK (0xffffffffffffffffffffffffffffffffLL)
101 #define BN_MASK2 (0xffffffffffffffffL)
102 #define BN_MASK2l (0xffffffffL)
103 #define BN_MASK2h (0xffffffff00000000L)
104 #define BN_MASK2h1 (0xffffffff80000000L)
105 #define BN_TBIT (0x8000000000000000L)
106 #define BN_DEC_CONV (10000000000000000000UL)
107 #define BN_DEC_FMT1 "%lu"
108 #define BN_DEC_FMT2 "%019lu"
109 #define BN_DEC_NUM 19
112 /* This is where the long long data type is 64 bits, but long is 32.
113 * For machines where there are 64bit registers, this is the mode to use.
114 * IRIX, on R4000 and above should use this mode, along with the relevent
115 * assember code :-). Do NOT define BN_ULLONG.
117 #ifdef SIXTY_FOUR_BIT
119 /* #define BN_ULLONG unsigned long long */
120 #define BN_ULONG unsigned long long
121 #define BN_LONG long long
126 #define BN_MASK2 (0xffffffffffffffffLL)
127 #define BN_MASK2l (0xffffffffL)
128 #define BN_MASK2h (0xffffffff00000000LL)
129 #define BN_MASK2h1 (0xffffffff80000000LL)
130 #define BN_TBIT (0x8000000000000000LL)
131 #define BN_DEC_CONV (10000000000000000000LL)
132 #define BN_DEC_FMT1 "%llu"
133 #define BN_DEC_FMT2 "%019llu"
134 #define BN_DEC_NUM 19
137 #ifdef THIRTY_TWO_BIT
139 #define BN_ULLONG unsigned _int64
141 #define BN_ULLONG unsigned long long
143 #define BN_ULONG unsigned long
150 /* VC++ doesn't like the LL suffix */
151 #define BN_MASK (0xffffffffffffffffL)
153 #define BN_MASK (0xffffffffffffffffLL)
155 #define BN_MASK2 (0xffffffffL)
156 #define BN_MASK2l (0xffff)
157 #define BN_MASK2h1 (0xffff8000L)
158 #define BN_MASK2h (0xffff0000L)
159 #define BN_TBIT (0x80000000L)
160 #define BN_DEC_CONV (1000000000L)
161 #define BN_DEC_FMT1 "%lu"
162 #define BN_DEC_FMT2 "%09lu"
170 #define BN_ULLONG unsigned long
171 #define BN_ULONG unsigned short
172 #define BN_LONG short
177 #define BN_MASK (0xffffffff)
178 #define BN_MASK2 (0xffff)
179 #define BN_MASK2l (0xff)
180 #define BN_MASK2h1 (0xff80)
181 #define BN_MASK2h (0xff00)
182 #define BN_TBIT (0x8000)
183 #define BN_DEC_CONV (100000)
184 #define BN_DEC_FMT1 "%u"
185 #define BN_DEC_FMT2 "%05u"
193 #define BN_ULLONG unsigned short
194 #define BN_ULONG unsigned char
200 #define BN_MASK (0xffff)
201 #define BN_MASK2 (0xff)
202 #define BN_MASK2l (0xf)
203 #define BN_MASK2h1 (0xf8)
204 #define BN_MASK2h (0xf0)
205 #define BN_TBIT (0x80)
206 #define BN_DEC_CONV (100)
207 #define BN_DEC_FMT1 "%u"
208 #define BN_DEC_FMT2 "%02u"
212 #define BN_DEFAULT_BITS 1280
218 #define BN_FLG_MALLOCED 0x01
219 #define BN_FLG_STATIC_DATA 0x02
220 #define BN_FLG_FREE 0x8000 /* used for debuging */
221 #define BN_set_flags(b,n) ((b)->flags|=(n))
222 #define BN_get_flags(b,n) ((b)->flags&(n))
224 typedef struct bignum_st
226 BN_ULONG *d; /* Pointer to an array of 'BN_BITS2' bit chunks. */
227 int top; /* Index of last used d +1. */
228 /* The next are internal book keeping for bn_expand. */
229 int max; /* Size of the d array. */
230 int neg; /* one if the number is negative */
234 /* Used for temp variables */
235 #define BN_CTX_NUM 12
236 typedef struct bignum_ctx
239 BIGNUM bn[BN_CTX_NUM+1];
243 typedef struct bn_blinding_st
248 BIGNUM *mod; /* just a reference */
251 /* Used for montgomery multiplication */
252 typedef struct bn_mont_ctx_st
254 int use_word; /* 0 for word form, 1 for long form */
255 int ri; /* number of bits in R */
256 BIGNUM RR; /* used to convert to montgomery form */
257 BIGNUM N; /* The modulus */
258 BIGNUM Ni; /* The inverse of N */
259 BN_ULONG n0; /* word form of inverse, normally only one of
260 * Ni or n0 is defined */
264 /* Used for reciprocal division/mod functions
265 * It cannot be shared between threads
267 typedef struct bn_recp_ctx_st
269 BIGNUM N; /* the divisor */
270 BIGNUM Nr; /* the reciprocal */
276 #define BN_to_montgomery(r,a,mont,ctx) BN_mod_mul_montgomery(\
277 r,a,&((mont)->RR),(mont),ctx)
279 #define BN_prime_checks (5)
281 #define BN_num_bytes(a) ((BN_num_bits(a)+7)/8)
282 #define BN_is_word(a,w) (((a)->top == 1) && ((a)->d[0] == (BN_ULONG)(w)))
283 #define BN_is_zero(a) (((a)->top == 0) || BN_is_word(a,0))
284 #define BN_is_one(a) (BN_is_word((a),1))
285 #define BN_is_odd(a) (((a)->top > 0) && ((a)->d[0] & 1))
286 #define BN_one(a) (BN_set_word((a),1))
287 #define BN_zero(a) (BN_set_word((a),0))
289 /*#define BN_ascii2bn(a) BN_hex2bn(a) */
290 /*#define BN_bn2ascii(a) BN_bn2hex(a) */
292 #define bn_expand(n,b) ((((((b+BN_BITS2-1))/BN_BITS2)) <= (n)->max)?\
293 (n):bn_expand2((n),(b)/BN_BITS2+1))
294 #define bn_wexpand(n,b) (((b) <= (n)->max)?(n):bn_expand2((n),(b)))
296 #define bn_fix_top(a) \
301 for (ftl= &((a)->d[(a)->top-1]); (a)->top > 0; (a)->top--) \
302 if (*(ftl--)) break; \
307 BIGNUM *BN_value_one(void);
308 char * BN_options(void);
309 BN_CTX *BN_CTX_new(void);
310 void BN_CTX_init(BN_CTX *c);
311 void BN_CTX_free(BN_CTX *c);
312 int BN_rand(BIGNUM *rnd, int bits, int top,int bottom);
313 int BN_num_bits(BIGNUM *a);
314 int BN_num_bits_word(BN_ULONG);
315 BIGNUM *BN_new(void);
316 void BN_init(BIGNUM *);
317 void BN_clear_free(BIGNUM *a);
318 BIGNUM *BN_copy(BIGNUM *a, BIGNUM *b);
319 BIGNUM *BN_bin2bn(const unsigned char *s,int len,BIGNUM *ret);
320 int BN_bn2bin(BIGNUM *a, unsigned char *to);
321 BIGNUM *BN_mpi2bn(unsigned char *s,int len,BIGNUM *ret);
322 int BN_bn2mpi(BIGNUM *a, unsigned char *to);
323 int BN_sub(BIGNUM *r, BIGNUM *a, BIGNUM *b);
324 int BN_usub(BIGNUM *r, BIGNUM *a, BIGNUM *b);
325 int BN_uadd(BIGNUM *r, BIGNUM *a, BIGNUM *b);
326 int BN_add(BIGNUM *r, BIGNUM *a, BIGNUM *b);
327 int BN_mod(BIGNUM *rem, BIGNUM *m, BIGNUM *d, BN_CTX *ctx);
328 int BN_div(BIGNUM *dv, BIGNUM *rem, BIGNUM *m, BIGNUM *d, BN_CTX *ctx);
329 int BN_mul(BIGNUM *r, BIGNUM *a, BIGNUM *b,BN_CTX *ctx);
330 int BN_sqr(BIGNUM *r, BIGNUM *a,BN_CTX *ctx);
331 BN_ULONG BN_mod_word(BIGNUM *a, BN_ULONG w);
332 BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w);
333 int BN_mul_word(BIGNUM *a, BN_ULONG w);
334 int BN_add_word(BIGNUM *a, BN_ULONG w);
335 int BN_sub_word(BIGNUM *a, BN_ULONG w);
336 int BN_set_word(BIGNUM *a, BN_ULONG w);
337 BN_ULONG BN_get_word(BIGNUM *a);
338 int BN_cmp(BIGNUM *a, BIGNUM *b);
339 void BN_free(BIGNUM *a);
340 int BN_is_bit_set(BIGNUM *a, int n);
341 int BN_lshift(BIGNUM *r, BIGNUM *a, int n);
342 int BN_lshift1(BIGNUM *r, BIGNUM *a);
343 int BN_exp(BIGNUM *r, BIGNUM *a, BIGNUM *p,BN_CTX *ctx);
344 int BN_mod_exp(BIGNUM *r, BIGNUM *a, BIGNUM *p, BIGNUM *m,BN_CTX *ctx);
345 int BN_mod_exp_mont(BIGNUM *r, BIGNUM *a, BIGNUM *p, BIGNUM *m,BN_CTX *ctx,
347 int BN_mod_exp2_mont(BIGNUM *r, BIGNUM *a1, BIGNUM *p1,BIGNUM *a2,
348 BIGNUM *p2,BIGNUM *m,BN_CTX *ctx,BN_MONT_CTX *m_ctx);
349 int BN_mod_exp_simple(BIGNUM *r, BIGNUM *a, BIGNUM *p,
350 BIGNUM *m,BN_CTX *ctx);
351 int BN_mask_bits(BIGNUM *a,int n);
352 int BN_mod_mul(BIGNUM *ret, BIGNUM *a, BIGNUM *b, BIGNUM *m,
355 int BN_print_fp(FILE *fp, BIGNUM *a);
358 int BN_print(BIO *fp, BIGNUM *a);
360 int BN_print(char *fp, BIGNUM *a);
362 int BN_reciprocal(BIGNUM *r, BIGNUM *m, int len, BN_CTX *ctx);
363 int BN_rshift(BIGNUM *r, BIGNUM *a, int n);
364 int BN_rshift1(BIGNUM *r, BIGNUM *a);
365 void BN_clear(BIGNUM *a);
366 BIGNUM *bn_expand2(BIGNUM *b, int bits);
367 BIGNUM *BN_dup(BIGNUM *a);
368 int BN_ucmp(BIGNUM *a, BIGNUM *b);
369 int BN_set_bit(BIGNUM *a, int n);
370 int BN_clear_bit(BIGNUM *a, int n);
371 char * BN_bn2hex(BIGNUM *a);
372 char * BN_bn2dec(BIGNUM *a);
373 int BN_hex2bn(BIGNUM **a,char *str);
374 int BN_dec2bn(BIGNUM **a,char *str);
375 int BN_gcd(BIGNUM *r,BIGNUM *in_a,BIGNUM *in_b,BN_CTX *ctx);
376 BIGNUM *BN_mod_inverse(BIGNUM *ret,BIGNUM *a, BIGNUM *n,BN_CTX *ctx);
377 BIGNUM *BN_generate_prime(BIGNUM *ret,int bits,int strong,BIGNUM *add,
378 BIGNUM *rem,void (*callback)(int,int,char *),char *cb_arg);
379 int BN_is_prime(BIGNUM *p,int nchecks,void (*callback)(int,int,char *),
380 BN_CTX *ctx,char *cb_arg);
381 void ERR_load_BN_strings(void );
383 BN_ULONG bn_mul_add_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w);
384 BN_ULONG bn_mul_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w);
385 void bn_sqr_words(BN_ULONG *rp, BN_ULONG *ap, int num);
386 BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d);
387 BN_ULONG bn_add_words(BN_ULONG *rp, BN_ULONG *ap, BN_ULONG *bp,int num);
388 BN_ULONG bn_sub_words(BN_ULONG *rp, BN_ULONG *ap, BN_ULONG *bp,int num);
390 BN_MONT_CTX *BN_MONT_CTX_new(void );
391 void BN_MONT_CTX_init(BN_MONT_CTX *ctx);
392 int BN_mod_mul_montgomery(BIGNUM *r,BIGNUM *a,BIGNUM *b,BN_MONT_CTX *mont,
394 int BN_from_montgomery(BIGNUM *r,BIGNUM *a,BN_MONT_CTX *mont,BN_CTX *ctx);
395 void BN_MONT_CTX_free(BN_MONT_CTX *mont);
396 int BN_MONT_CTX_set(BN_MONT_CTX *mont,BIGNUM *modulus,BN_CTX *ctx);
397 BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to,BN_MONT_CTX *from);
399 BN_BLINDING *BN_BLINDING_new(BIGNUM *A,BIGNUM *Ai,BIGNUM *mod);
400 void BN_BLINDING_free(BN_BLINDING *b);
401 int BN_BLINDING_update(BN_BLINDING *b,BN_CTX *ctx);
402 int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *r, BN_CTX *ctx);
403 int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
405 void BN_set_params(int mul,int high,int low,int mont);
406 int BN_get_params(int which); /* 0, mul, 1 high, 2 low, 3 mont */
408 void bn_mul_normal(BN_ULONG *r,BN_ULONG *a,int na,BN_ULONG *b,int nb);
409 void bn_mul_comba8(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b);
410 void bn_mul_comba4(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b);
411 void bn_sqr_normal(BN_ULONG *r, BN_ULONG *a, int n, BN_ULONG *tmp);
412 void bn_sqr_comba8(BN_ULONG *r,BN_ULONG *a);
413 void bn_sqr_comba4(BN_ULONG *r,BN_ULONG *a);
414 int bn_cmp_words(BN_ULONG *a,BN_ULONG *b,int n);
415 void bn_mul_recursive(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b,int n2,BN_ULONG *t);
416 void bn_mul_part_recursive(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b,
417 int tn, int n,BN_ULONG *t);
418 void bn_sqr_recursive(BN_ULONG *r,BN_ULONG *a, int n2, BN_ULONG *t);
419 void bn_mul_low_normal(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b, int n);
421 void BN_RECP_CTX_init(BN_RECP_CTX *recp);
422 BN_RECP_CTX *BN_RECP_CTX_new(void);
423 void BN_RECP_CTX_free(BN_RECP_CTX *recp);
424 int BN_RECP_CTX_set(BN_RECP_CTX *recp,BIGNUM *rdiv,BN_CTX *ctx);
425 int BN_mod_mul_reciprocal(BIGNUM *r, BIGNUM *x, BIGNUM *y,
426 BN_RECP_CTX *recp,BN_CTX *ctx);
427 int BN_mod_exp_recp(BIGNUM *r, BIGNUM *a, BIGNUM *p, BIGNUM *m,BN_CTX *ctx);
428 int BN_div_recp(BIGNUM *dv, BIGNUM *rem, BIGNUM *m,
429 BN_RECP_CTX *recp, BN_CTX *ctx);
434 BIGNUM *BN_value_one();
436 BN_CTX *BN_CTX_new();
441 int BN_num_bits_word();
444 void BN_clear_free();
458 BN_ULONG BN_mod_word();
459 BN_ULONG BN_div_word();
464 unsigned long BN_get_word();
472 int BN_mod_exp_mont();
473 int BN_mod_exp_recp();
474 int BN_mod_exp_simple();
476 int BN_mod_mul_reciprocal();
486 BIGNUM *bn_expand2();
496 BIGNUM *BN_mod_inverse();
497 BIGNUM *BN_generate_prime();
499 void ERR_load_BN_strings();
501 BN_ULONG bn_mul_add_words();
502 BN_ULONG bn_mul_words();
504 BN_ULONG bn_div_words();
505 BN_ULONG bn_add_words();
506 BN_ULONG bn_sub_words();
508 int BN_mod_mul_montgomery();
509 int BN_from_montgomery();
510 BN_MONT_CTX *BN_MONT_CTX_new();
511 void BN_MONT_CTX_init();
512 void BN_MONT_CTX_free();
513 int BN_MONT_CTX_set();
514 BN_MONT_CTX *BN_MONT_CTX_copy();
516 BN_BLINDING *BN_BLINDING_new();
517 void BN_BLINDING_free();
518 int BN_BLINDING_update();
519 int BN_BLINDING_convert();
520 int BN_BLINDING_invert();
522 void BN_set_params();
525 void bn_mul_normal();
526 void bn_mul_comba8();
527 void bn_mul_comba4();
528 void bn_sqr_normal();
529 void bn_sqr_comba8();
530 void bn_sqr_comba4();
532 void bn_mul_recursive();
533 void bn_mul_part_recursive();
534 void bn_sqr_recursive();
535 void bn_mul_low_normal();
537 void BN_RECP_CTX_init();
538 BN_RECP_CTX *BN_RECP_CTX_new();
539 void BN_RECP_CTX_free();
540 int BN_RECP_CTX_set();
541 int BN_mod_mul_reciprocal();
542 int BN_mod_exp_recp();
547 /* BEGIN ERROR CODES */
548 /* Error codes for the BN functions. */
550 /* Function codes. */
551 #define BN_F_BN_BLINDING_CONVERT 100
552 #define BN_F_BN_BLINDING_INVERT 101
553 #define BN_F_BN_BLINDING_NEW 102
554 #define BN_F_BN_BLINDING_UPDATE 103
555 #define BN_F_BN_BN2DEC 104
556 #define BN_F_BN_BN2HEX 105
557 #define BN_F_BN_CTX_NEW 106
558 #define BN_F_BN_DIV 107
559 #define BN_F_BN_EXPAND2 108
560 #define BN_F_BN_MOD_EXP_MONT 109
561 #define BN_F_BN_MOD_INVERSE 110
562 #define BN_F_BN_MOD_MUL_RECIPROCAL 111
563 #define BN_F_BN_MPI2BN 112
564 #define BN_F_BN_NEW 113
565 #define BN_F_BN_RAND 114
566 #define BN_F_BN_USUB 115
569 #define BN_R_ARG2_LT_ARG3 100
570 #define BN_R_BAD_RECIPROCAL 101
571 #define BN_R_CALLED_WITH_EVEN_MODULUS 102
572 #define BN_R_DIV_BY_ZERO 103
573 #define BN_R_ENCODING_ERROR 104
574 #define BN_R_EXPAND_ON_STATIC_BIGNUM_DATA 105
575 #define BN_R_INVALID_LENGTH 106
576 #define BN_R_NOT_INITIALIZED 107
577 #define BN_R_NO_INVERSE 108