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.]
63 #include <stdio.h> /* FILE */
65 #include <openssl/opensslconf.h>
77 /* This next option uses the C libraries (2 word)/(1 word) function.
78 * If it is not defined, I use my C version (which is slower).
79 * The reason for this flag is that when the particular C compiler
80 * library routine is used, and the library is linked with a different
81 * compiler, the library is missing. This mostly happens when the
82 * library is built with gcc and then linked using nornal cc. This would
83 * be a common occurance because gcc normally produces code that is
84 * 2 times faster than system compilers for the big number stuff.
85 * For machines with only one compiler (or shared libraries), this should
86 * be on. Again this in only really a problem on machines
87 * using "long long's", are 32bit, and are not using my assember code. */
88 #if defined(MSDOS) || defined(WINDOWS) || defined(linux)
92 /* assuming long is 64bit - this is the DEC Alpha
93 * unsigned long long is only 64 bits :-(, don't define
94 * BN_LLONG for the DEC Alpha */
95 #ifdef SIXTY_FOUR_BIT_LONG
96 #define BN_ULLONG unsigned long long
97 #define BN_ULONG unsigned long
103 #define BN_MASK (0xffffffffffffffffffffffffffffffffLL)
104 #define BN_MASK2 (0xffffffffffffffffL)
105 #define BN_MASK2l (0xffffffffL)
106 #define BN_MASK2h (0xffffffff00000000L)
107 #define BN_MASK2h1 (0xffffffff80000000L)
108 #define BN_TBIT (0x8000000000000000L)
109 #define BN_DEC_CONV (10000000000000000000UL)
110 #define BN_DEC_FMT1 "%lu"
111 #define BN_DEC_FMT2 "%019lu"
112 #define BN_DEC_NUM 19
115 /* This is where the long long data type is 64 bits, but long is 32.
116 * For machines where there are 64bit registers, this is the mode to use.
117 * IRIX, on R4000 and above should use this mode, along with the relevent
118 * assember code :-). Do NOT define BN_ULLONG.
120 #ifdef SIXTY_FOUR_BIT
122 /* #define BN_ULLONG unsigned long long */
123 #define BN_ULONG unsigned long long
124 #define BN_LONG long long
129 #define BN_MASK2 (0xffffffffffffffffLL)
130 #define BN_MASK2l (0xffffffffL)
131 #define BN_MASK2h (0xffffffff00000000LL)
132 #define BN_MASK2h1 (0xffffffff80000000LL)
133 #define BN_TBIT (0x8000000000000000LL)
134 #define BN_DEC_CONV (10000000000000000000LL)
135 #define BN_DEC_FMT1 "%llu"
136 #define BN_DEC_FMT2 "%019llu"
137 #define BN_DEC_NUM 19
140 #ifdef THIRTY_TWO_BIT
142 #define BN_ULLONG unsigned _int64
144 #define BN_ULLONG unsigned long long
146 #define BN_ULONG unsigned long
153 /* VC++ doesn't like the LL suffix */
154 #define BN_MASK (0xffffffffffffffffL)
156 #define BN_MASK (0xffffffffffffffffLL)
158 #define BN_MASK2 (0xffffffffL)
159 #define BN_MASK2l (0xffff)
160 #define BN_MASK2h1 (0xffff8000L)
161 #define BN_MASK2h (0xffff0000L)
162 #define BN_TBIT (0x80000000L)
163 #define BN_DEC_CONV (1000000000L)
164 #define BN_DEC_FMT1 "%lu"
165 #define BN_DEC_FMT2 "%09lu"
173 #define BN_ULLONG unsigned long
174 #define BN_ULONG unsigned short
175 #define BN_LONG short
180 #define BN_MASK (0xffffffff)
181 #define BN_MASK2 (0xffff)
182 #define BN_MASK2l (0xff)
183 #define BN_MASK2h1 (0xff80)
184 #define BN_MASK2h (0xff00)
185 #define BN_TBIT (0x8000)
186 #define BN_DEC_CONV (100000)
187 #define BN_DEC_FMT1 "%u"
188 #define BN_DEC_FMT2 "%05u"
196 #define BN_ULLONG unsigned short
197 #define BN_ULONG unsigned char
203 #define BN_MASK (0xffff)
204 #define BN_MASK2 (0xff)
205 #define BN_MASK2l (0xf)
206 #define BN_MASK2h1 (0xf8)
207 #define BN_MASK2h (0xf0)
208 #define BN_TBIT (0x80)
209 #define BN_DEC_CONV (100)
210 #define BN_DEC_FMT1 "%u"
211 #define BN_DEC_FMT2 "%02u"
215 #define BN_DEFAULT_BITS 1280
221 #define BN_FLG_MALLOCED 0x01
222 #define BN_FLG_STATIC_DATA 0x02
223 #define BN_FLG_FREE 0x8000 /* used for debuging */
224 #define BN_set_flags(b,n) ((b)->flags|=(n))
225 #define BN_get_flags(b,n) ((b)->flags&(n))
227 typedef struct bignum_st
229 BN_ULONG *d; /* Pointer to an array of 'BN_BITS2' bit chunks. */
230 int top; /* Index of last used d +1. */
231 /* The next are internal book keeping for bn_expand. */
232 int max; /* Size of the d array. */
233 int neg; /* one if the number is negative */
237 /* Used for temp variables */
238 #define BN_CTX_NUM 12
239 typedef struct bignum_ctx
242 BIGNUM bn[BN_CTX_NUM+1];
246 typedef struct bn_blinding_st
251 BIGNUM *mod; /* just a reference */
254 /* Used for montgomery multiplication */
255 typedef struct bn_mont_ctx_st
257 int use_word; /* 0 for word form, 1 for long form */
258 int ri; /* number of bits in R */
259 BIGNUM RR; /* used to convert to montgomery form */
260 BIGNUM N; /* The modulus */
261 BIGNUM Ni; /* The inverse of N */
262 BN_ULONG n0; /* word form of inverse, normally only one of
263 * Ni or n0 is defined */
267 /* Used for reciprocal division/mod functions
268 * It cannot be shared between threads
270 typedef struct bn_recp_ctx_st
272 BIGNUM N; /* the divisor */
273 BIGNUM Nr; /* the reciprocal */
279 #define BN_to_montgomery(r,a,mont,ctx) BN_mod_mul_montgomery(\
280 r,a,&((mont)->RR),(mont),ctx)
282 #define BN_prime_checks (5)
284 #define BN_num_bytes(a) ((BN_num_bits(a)+7)/8)
285 #define BN_is_word(a,w) (((a)->top == 1) && ((a)->d[0] == (BN_ULONG)(w)))
286 #define BN_is_zero(a) (((a)->top == 0) || BN_is_word(a,0))
287 #define BN_is_one(a) (BN_is_word((a),1))
288 #define BN_is_odd(a) (((a)->top > 0) && ((a)->d[0] & 1))
289 #define BN_one(a) (BN_set_word((a),1))
290 #define BN_zero(a) (BN_set_word((a),0))
292 /*#define BN_ascii2bn(a) BN_hex2bn(a) */
293 /*#define BN_bn2ascii(a) BN_bn2hex(a) */
295 #define bn_expand(n,b) ((((((b+BN_BITS2-1))/BN_BITS2)) <= (n)->max)?\
296 (n):bn_expand2((n),(b)/BN_BITS2+1))
297 #define bn_wexpand(n,b) (((b) <= (n)->max)?(n):bn_expand2((n),(b)))
299 #define bn_fix_top(a) \
304 for (ftl= &((a)->d[(a)->top-1]); (a)->top > 0; (a)->top--) \
305 if (*(ftl--)) break; \
309 BIGNUM *BN_value_one(void);
310 char * BN_options(void);
311 BN_CTX *BN_CTX_new(void);
312 void BN_CTX_init(BN_CTX *c);
313 void BN_CTX_free(BN_CTX *c);
314 int BN_rand(BIGNUM *rnd, int bits, int top,int bottom);
315 int BN_num_bits(BIGNUM *a);
316 int BN_num_bits_word(BN_ULONG);
317 BIGNUM *BN_new(void);
318 void BN_init(BIGNUM *);
319 void BN_clear_free(BIGNUM *a);
320 BIGNUM *BN_copy(BIGNUM *a, BIGNUM *b);
321 BIGNUM *BN_bin2bn(const unsigned char *s,int len,BIGNUM *ret);
322 int BN_bn2bin(BIGNUM *a, unsigned char *to);
323 BIGNUM *BN_mpi2bn(unsigned char *s,int len,BIGNUM *ret);
324 int BN_bn2mpi(BIGNUM *a, unsigned char *to);
325 int BN_sub(BIGNUM *r, BIGNUM *a, BIGNUM *b);
326 int BN_usub(BIGNUM *r, BIGNUM *a, BIGNUM *b);
327 int BN_uadd(BIGNUM *r, BIGNUM *a, BIGNUM *b);
328 int BN_add(BIGNUM *r, BIGNUM *a, BIGNUM *b);
329 int BN_mod(BIGNUM *rem, BIGNUM *m, BIGNUM *d, BN_CTX *ctx);
330 int BN_div(BIGNUM *dv, BIGNUM *rem, BIGNUM *m, BIGNUM *d, BN_CTX *ctx);
331 int BN_mul(BIGNUM *r, BIGNUM *a, BIGNUM *b,BN_CTX *ctx);
332 int BN_sqr(BIGNUM *r, BIGNUM *a,BN_CTX *ctx);
333 BN_ULONG BN_mod_word(BIGNUM *a, BN_ULONG w);
334 BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w);
335 int BN_mul_word(BIGNUM *a, BN_ULONG w);
336 int BN_add_word(BIGNUM *a, BN_ULONG w);
337 int BN_sub_word(BIGNUM *a, BN_ULONG w);
338 int BN_set_word(BIGNUM *a, BN_ULONG w);
339 BN_ULONG BN_get_word(BIGNUM *a);
340 int BN_cmp(BIGNUM *a, BIGNUM *b);
341 void BN_free(BIGNUM *a);
342 int BN_is_bit_set(BIGNUM *a, int n);
343 int BN_lshift(BIGNUM *r, BIGNUM *a, int n);
344 int BN_lshift1(BIGNUM *r, BIGNUM *a);
345 int BN_exp(BIGNUM *r, BIGNUM *a, BIGNUM *p,BN_CTX *ctx);
346 int BN_mod_exp(BIGNUM *r, BIGNUM *a, BIGNUM *p, BIGNUM *m,BN_CTX *ctx);
347 int BN_mod_exp_mont(BIGNUM *r, BIGNUM *a, BIGNUM *p, BIGNUM *m,BN_CTX *ctx,
349 int BN_mod_exp2_mont(BIGNUM *r, BIGNUM *a1, BIGNUM *p1,BIGNUM *a2,
350 BIGNUM *p2,BIGNUM *m,BN_CTX *ctx,BN_MONT_CTX *m_ctx);
351 int BN_mod_exp_simple(BIGNUM *r, BIGNUM *a, BIGNUM *p,
352 BIGNUM *m,BN_CTX *ctx);
353 int BN_mask_bits(BIGNUM *a,int n);
354 int BN_mod_mul(BIGNUM *ret, BIGNUM *a, BIGNUM *b, BIGNUM *m,
357 int BN_print_fp(FILE *fp, BIGNUM *a);
360 int BN_print(BIO *fp, BIGNUM *a);
362 int BN_print(char *fp, BIGNUM *a);
364 int BN_reciprocal(BIGNUM *r, BIGNUM *m, int len, BN_CTX *ctx);
365 int BN_rshift(BIGNUM *r, BIGNUM *a, int n);
366 int BN_rshift1(BIGNUM *r, BIGNUM *a);
367 void BN_clear(BIGNUM *a);
368 BIGNUM *bn_expand2(BIGNUM *b, int bits);
369 BIGNUM *BN_dup(BIGNUM *a);
370 int BN_ucmp(BIGNUM *a, BIGNUM *b);
371 int BN_set_bit(BIGNUM *a, int n);
372 int BN_clear_bit(BIGNUM *a, int n);
373 char * BN_bn2hex(BIGNUM *a);
374 char * BN_bn2dec(BIGNUM *a);
375 int BN_hex2bn(BIGNUM **a,char *str);
376 int BN_dec2bn(BIGNUM **a,char *str);
377 int BN_gcd(BIGNUM *r,BIGNUM *in_a,BIGNUM *in_b,BN_CTX *ctx);
378 BIGNUM *BN_mod_inverse(BIGNUM *ret,BIGNUM *a, BIGNUM *n,BN_CTX *ctx);
379 BIGNUM *BN_generate_prime(BIGNUM *ret,int bits,int strong,BIGNUM *add,
380 BIGNUM *rem,void (*callback)(int,int,char *),char *cb_arg);
381 int BN_is_prime(BIGNUM *p,int nchecks,void (*callback)(int,int,char *),
382 BN_CTX *ctx,char *cb_arg);
383 void ERR_load_BN_strings(void );
385 BN_ULONG bn_mul_add_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w);
386 BN_ULONG bn_mul_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w);
387 void bn_sqr_words(BN_ULONG *rp, BN_ULONG *ap, int num);
388 BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d);
389 BN_ULONG bn_add_words(BN_ULONG *rp, BN_ULONG *ap, BN_ULONG *bp,int num);
390 BN_ULONG bn_sub_words(BN_ULONG *rp, BN_ULONG *ap, BN_ULONG *bp,int num);
392 BN_MONT_CTX *BN_MONT_CTX_new(void );
393 void BN_MONT_CTX_init(BN_MONT_CTX *ctx);
394 int BN_mod_mul_montgomery(BIGNUM *r,BIGNUM *a,BIGNUM *b,BN_MONT_CTX *mont,
396 int BN_from_montgomery(BIGNUM *r,BIGNUM *a,BN_MONT_CTX *mont,BN_CTX *ctx);
397 void BN_MONT_CTX_free(BN_MONT_CTX *mont);
398 int BN_MONT_CTX_set(BN_MONT_CTX *mont,BIGNUM *modulus,BN_CTX *ctx);
399 BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to,BN_MONT_CTX *from);
401 BN_BLINDING *BN_BLINDING_new(BIGNUM *A,BIGNUM *Ai,BIGNUM *mod);
402 void BN_BLINDING_free(BN_BLINDING *b);
403 int BN_BLINDING_update(BN_BLINDING *b,BN_CTX *ctx);
404 int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *r, BN_CTX *ctx);
405 int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
407 void BN_set_params(int mul,int high,int low,int mont);
408 int BN_get_params(int which); /* 0, mul, 1 high, 2 low, 3 mont */
410 void bn_mul_normal(BN_ULONG *r,BN_ULONG *a,int na,BN_ULONG *b,int nb);
411 void bn_mul_comba8(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b);
412 void bn_mul_comba4(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b);
413 void bn_sqr_normal(BN_ULONG *r, BN_ULONG *a, int n, BN_ULONG *tmp);
414 void bn_sqr_comba8(BN_ULONG *r,BN_ULONG *a);
415 void bn_sqr_comba4(BN_ULONG *r,BN_ULONG *a);
416 int bn_cmp_words(BN_ULONG *a,BN_ULONG *b,int n);
417 void bn_mul_recursive(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b,int n2,BN_ULONG *t);
418 void bn_mul_part_recursive(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b,
419 int tn, int n,BN_ULONG *t);
420 void bn_sqr_recursive(BN_ULONG *r,BN_ULONG *a, int n2, BN_ULONG *t);
421 void bn_mul_low_normal(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b, int n);
423 void BN_RECP_CTX_init(BN_RECP_CTX *recp);
424 BN_RECP_CTX *BN_RECP_CTX_new(void);
425 void BN_RECP_CTX_free(BN_RECP_CTX *recp);
426 int BN_RECP_CTX_set(BN_RECP_CTX *recp,BIGNUM *rdiv,BN_CTX *ctx);
427 int BN_mod_mul_reciprocal(BIGNUM *r, BIGNUM *x, BIGNUM *y,
428 BN_RECP_CTX *recp,BN_CTX *ctx);
429 int BN_mod_exp_recp(BIGNUM *r, BIGNUM *a, BIGNUM *p, BIGNUM *m,BN_CTX *ctx);
430 int BN_div_recp(BIGNUM *dv, BIGNUM *rem, BIGNUM *m,
431 BN_RECP_CTX *recp, BN_CTX *ctx);
434 /* BEGIN ERROR CODES */
435 /* The following lines are auto generated by the script mkerr.pl. Any changes
436 * made after this point may be overwritten when the script is next run.
439 /* Error codes for the BN functions. */
441 /* Function codes. */
442 #define BN_F_BN_BLINDING_CONVERT 100
443 #define BN_F_BN_BLINDING_INVERT 101
444 #define BN_F_BN_BLINDING_NEW 102
445 #define BN_F_BN_BLINDING_UPDATE 103
446 #define BN_F_BN_BN2DEC 104
447 #define BN_F_BN_BN2HEX 105
448 #define BN_F_BN_CTX_NEW 106
449 #define BN_F_BN_DIV 107
450 #define BN_F_BN_EXPAND2 108
451 #define BN_F_BN_MOD_EXP_MONT 109
452 #define BN_F_BN_MOD_INVERSE 110
453 #define BN_F_BN_MOD_MUL_RECIPROCAL 111
454 #define BN_F_BN_MPI2BN 112
455 #define BN_F_BN_NEW 113
456 #define BN_F_BN_RAND 114
457 #define BN_F_BN_USUB 115
460 #define BN_R_ARG2_LT_ARG3 100
461 #define BN_R_BAD_RECIPROCAL 101
462 #define BN_R_CALLED_WITH_EVEN_MODULUS 102
463 #define BN_R_DIV_BY_ZERO 103
464 #define BN_R_ENCODING_ERROR 104
465 #define BN_R_EXPAND_ON_STATIC_BIGNUM_DATA 105
466 #define BN_R_INVALID_LENGTH 106
467 #define BN_R_NOT_INITIALIZED 107
468 #define BN_R_NO_INVERSE 108