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.]
59 /* WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING
61 * Always modify bn.org since bn.h is automatically generated from
62 * it during SSLeay configuration.
64 * WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING
77 #define BN_LLONG /* This comment stops Configure mutilating things */
86 /* This next option uses the C libraries (2 word)/(1 word) function.
87 * If it is not defined, I use my C version (which is slower).
88 * The reason for this flag is that when the particular C compiler
89 * library routine is used, and the library is linked with a different
90 * compiler, the library is missing. This mostly happens when the
91 * library is built with gcc and then linked using nornal cc. This would
92 * be a common occurance because gcc normally produces code that is
93 * 2 times faster than system compilers for the big number stuff.
94 * For machines with only one compiler (or shared libraries), this should
95 * be on. Again this in only really a problem on machines
96 * using "long long's", are 32bit, and are not using my assember code. */
97 #if defined(MSDOS) || defined(WINDOWS) || defined(linux)
101 /* Only one for the following should be defined */
102 /* The prime number generation stuff may not work when
103 * EIGHT_BIT but I don't care since I've only used this mode
104 * for debuging the bignum libraries */
105 #undef SIXTY_FOUR_BIT_LONG
106 #undef SIXTY_FOUR_BIT
107 #define THIRTY_TWO_BIT
112 /* assuming long is 64bit - this is the DEC Alpha
113 * unsigned long long is only 64 bits :-(, don't define
114 * BN_LLONG for the DEC Alpha */
115 #ifdef SIXTY_FOUR_BIT_LONG
116 #define BN_ULLONG unsigned long long
117 #define BN_ULONG unsigned long
123 #define BN_MASK (0xffffffffffffffffffffffffffffffffLL)
124 #define BN_MASK2 (0xffffffffffffffffL)
125 #define BN_MASK2l (0xffffffffL)
126 #define BN_MASK2h (0xffffffff00000000L)
127 #define BN_MASK2h1 (0xffffffff80000000L)
128 #define BN_TBIT (0x8000000000000000L)
129 #define BN_DEC_CONV (10000000000000000000UL)
130 #define BN_DEC_FMT1 "%lu"
131 #define BN_DEC_FMT2 "%019lu"
132 #define BN_DEC_NUM 19
135 /* This is where the long long data type is 64 bits, but long is 32.
136 * For machines where there are 64bit registers, this is the mode to use.
137 * IRIX, on R4000 and above should use this mode, along with the relevent
138 * assember code :-). Do NOT define BN_ULLONG.
140 #ifdef SIXTY_FOUR_BIT
142 /* #define BN_ULLONG unsigned long long */
143 #define BN_ULONG unsigned long long
144 #define BN_LONG long long
149 #define BN_MASK2 (0xffffffffffffffffLL)
150 #define BN_MASK2l (0xffffffffL)
151 #define BN_MASK2h (0xffffffff00000000LL)
152 #define BN_MASK2h1 (0xffffffff80000000LL)
153 #define BN_TBIT (0x8000000000000000LL)
154 #define BN_DEC_CONV (10000000000000000000LL)
155 #define BN_DEC_FMT1 "%llu"
156 #define BN_DEC_FMT2 "%019llu"
157 #define BN_DEC_NUM 19
160 #ifdef THIRTY_TWO_BIT
162 #define BN_ULLONG unsigned _int64
164 #define BN_ULLONG unsigned long long
166 #define BN_ULONG unsigned long
173 /* VC++ doesn't like the LL suffix */
174 #define BN_MASK (0xffffffffffffffffL)
176 #define BN_MASK (0xffffffffffffffffLL)
178 #define BN_MASK2 (0xffffffffL)
179 #define BN_MASK2l (0xffff)
180 #define BN_MASK2h1 (0xffff8000L)
181 #define BN_MASK2h (0xffff0000L)
182 #define BN_TBIT (0x80000000L)
183 #define BN_DEC_CONV (1000000000L)
184 #define BN_DEC_FMT1 "%lu"
185 #define BN_DEC_FMT2 "%09lu"
193 #define BN_ULLONG unsigned long
194 #define BN_ULONG unsigned short
195 #define BN_LONG short
200 #define BN_MASK (0xffffffff)
201 #define BN_MASK2 (0xffff)
202 #define BN_MASK2l (0xff)
203 #define BN_MASK2h1 (0xff80)
204 #define BN_MASK2h (0xff00)
205 #define BN_TBIT (0x8000)
206 #define BN_DEC_CONV (100000)
207 #define BN_DEC_FMT1 "%u"
208 #define BN_DEC_FMT2 "%05u"
216 #define BN_ULLONG unsigned short
217 #define BN_ULONG unsigned char
223 #define BN_MASK (0xffff)
224 #define BN_MASK2 (0xff)
225 #define BN_MASK2l (0xf)
226 #define BN_MASK2h1 (0xf8)
227 #define BN_MASK2h (0xf0)
228 #define BN_TBIT (0x80)
229 #define BN_DEC_CONV (100)
230 #define BN_DEC_FMT1 "%u"
231 #define BN_DEC_FMT2 "%02u"
235 #define BN_DEFAULT_BITS 1280
241 #define BN_FLG_MALLOCED 0x01
242 #define BN_FLG_STATIC_DATA 0x02
243 #define BN_FLG_FREE 0x8000 /* used for debuging */
244 #define BN_set_flags(b,n) ((b)->flags|=(n))
245 #define BN_get_flags(b,n) ((b)->flags&(n))
247 typedef struct bignum_st
249 BN_ULONG *d; /* Pointer to an array of 'BN_BITS2' bit chunks. */
250 int top; /* Index of last used d +1. */
251 /* The next are internal book keeping for bn_expand. */
252 int max; /* Size of the d array. */
253 int neg; /* one if the number is negative */
257 /* Used for temp variables */
258 #define BN_CTX_NUM 12
259 typedef struct bignum_ctx
262 BIGNUM bn[BN_CTX_NUM+1];
266 typedef struct bn_blinding_st
271 BIGNUM *mod; /* just a reference */
274 /* Used for montgomery multiplication */
275 typedef struct bn_mont_ctx_st
277 int use_word; /* 0 for word form, 1 for long form */
278 int ri; /* number of bits in R */
279 BIGNUM RR; /* used to convert to montgomery form */
280 BIGNUM N; /* The modulus */
281 BIGNUM Ni; /* The inverse of N */
282 BN_ULONG n0; /* word form of inverse, normally only one of
283 * Ni or n0 is defined */
287 /* Used for reciprocal division/mod functions
288 * It cannot be shared between threads
290 typedef struct bn_recp_ctx_st
292 BIGNUM N; /* the divisor */
293 BIGNUM Nr; /* the reciprocal */
299 #define BN_to_montgomery(r,a,mont,ctx) BN_mod_mul_montgomery(\
300 r,a,&((mont)->RR),(mont),ctx)
302 #define BN_prime_checks (5)
304 #define BN_num_bytes(a) ((BN_num_bits(a)+7)/8)
305 #define BN_is_word(a,w) (((a)->top == 1) && ((a)->d[0] == (BN_ULONG)(w)))
306 #define BN_is_zero(a) (((a)->top == 0) || BN_is_word(a,0))
307 #define BN_is_one(a) (BN_is_word((a),1))
308 #define BN_is_odd(a) (((a)->top > 0) && ((a)->d[0] & 1))
309 #define BN_one(a) (BN_set_word((a),1))
310 #define BN_zero(a) (BN_set_word((a),0))
312 /*#define BN_ascii2bn(a) BN_hex2bn(a) */
313 /*#define BN_bn2ascii(a) BN_bn2hex(a) */
315 #define bn_expand(n,b) ((((((b+BN_BITS2-1))/BN_BITS2)) <= (n)->max)?\
316 (n):bn_expand2((n),(b)/BN_BITS2+1))
317 #define bn_wexpand(n,b) (((b) <= (n)->max)?(n):bn_expand2((n),(b)))
319 #define bn_fix_top(a) \
324 for (ftl= &((a)->d[(a)->top-1]); (a)->top > 0; (a)->top--) \
325 if (*(ftl--)) break; \
330 BIGNUM *BN_value_one(void);
331 char * BN_options(void);
332 BN_CTX *BN_CTX_new(void);
333 void BN_CTX_init(BN_CTX *c);
334 void BN_CTX_free(BN_CTX *c);
335 int BN_rand(BIGNUM *rnd, int bits, int top,int bottom);
336 int BN_num_bits(BIGNUM *a);
337 int BN_num_bits_word(BN_ULONG);
338 BIGNUM *BN_new(void);
339 void BN_init(BIGNUM *);
340 void BN_clear_free(BIGNUM *a);
341 BIGNUM *BN_copy(BIGNUM *a, BIGNUM *b);
342 BIGNUM *BN_bin2bn(unsigned char *s,int len,BIGNUM *ret);
343 int BN_bn2bin(BIGNUM *a, unsigned char *to);
344 BIGNUM *BN_mpi2bn(unsigned char *s,int len,BIGNUM *ret);
345 int BN_bn2mpi(BIGNUM *a, unsigned char *to);
346 int BN_sub(BIGNUM *r, BIGNUM *a, BIGNUM *b);
347 int BN_usub(BIGNUM *r, BIGNUM *a, BIGNUM *b);
348 int BN_uadd(BIGNUM *r, BIGNUM *a, BIGNUM *b);
349 int BN_add(BIGNUM *r, BIGNUM *a, BIGNUM *b);
350 int BN_mod(BIGNUM *rem, BIGNUM *m, BIGNUM *d, BN_CTX *ctx);
351 int BN_div(BIGNUM *dv, BIGNUM *rem, BIGNUM *m, BIGNUM *d, BN_CTX *ctx);
352 int BN_mul(BIGNUM *r, BIGNUM *a, BIGNUM *b,BN_CTX *ctx);
353 int BN_sqr(BIGNUM *r, BIGNUM *a,BN_CTX *ctx);
354 BN_ULONG BN_mod_word(BIGNUM *a, BN_ULONG w);
355 BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w);
356 int BN_mul_word(BIGNUM *a, BN_ULONG w);
357 int BN_add_word(BIGNUM *a, BN_ULONG w);
358 int BN_sub_word(BIGNUM *a, BN_ULONG w);
359 int BN_set_word(BIGNUM *a, BN_ULONG w);
360 BN_ULONG BN_get_word(BIGNUM *a);
361 int BN_cmp(BIGNUM *a, BIGNUM *b);
362 void BN_free(BIGNUM *a);
363 int BN_is_bit_set(BIGNUM *a, int n);
364 int BN_lshift(BIGNUM *r, BIGNUM *a, int n);
365 int BN_lshift1(BIGNUM *r, BIGNUM *a);
366 int BN_exp(BIGNUM *r, BIGNUM *a, BIGNUM *p,BN_CTX *ctx);
367 int BN_mod_exp(BIGNUM *r, BIGNUM *a, BIGNUM *p, BIGNUM *m,BN_CTX *ctx);
368 int BN_mod_exp_mont(BIGNUM *r, BIGNUM *a, BIGNUM *p, BIGNUM *m,BN_CTX *ctx,
370 int BN_mod_exp2_mont(BIGNUM *r, BIGNUM *a1, BIGNUM *p1,BIGNUM *a2,
371 BIGNUM *p2,BIGNUM *m,BN_CTX *ctx,BN_MONT_CTX *m_ctx);
372 int BN_mod_exp_simple(BIGNUM *r, BIGNUM *a, BIGNUM *p,
373 BIGNUM *m,BN_CTX *ctx);
374 int BN_mask_bits(BIGNUM *a,int n);
375 int BN_mod_mul(BIGNUM *ret, BIGNUM *a, BIGNUM *b, BIGNUM *m,
378 int BN_print_fp(FILE *fp, BIGNUM *a);
381 int BN_print(BIO *fp, BIGNUM *a);
383 int BN_print(char *fp, BIGNUM *a);
385 int BN_reciprocal(BIGNUM *r, BIGNUM *m, int len, BN_CTX *ctx);
386 int BN_rshift(BIGNUM *r, BIGNUM *a, int n);
387 int BN_rshift1(BIGNUM *r, BIGNUM *a);
388 void BN_clear(BIGNUM *a);
389 BIGNUM *bn_expand2(BIGNUM *b, int bits);
390 BIGNUM *BN_dup(BIGNUM *a);
391 int BN_ucmp(BIGNUM *a, BIGNUM *b);
392 int BN_set_bit(BIGNUM *a, int n);
393 int BN_clear_bit(BIGNUM *a, int n);
394 char * BN_bn2hex(BIGNUM *a);
395 char * BN_bn2dec(BIGNUM *a);
396 int BN_hex2bn(BIGNUM **a,char *str);
397 int BN_dec2bn(BIGNUM **a,char *str);
398 int BN_gcd(BIGNUM *r,BIGNUM *in_a,BIGNUM *in_b,BN_CTX *ctx);
399 BIGNUM *BN_mod_inverse(BIGNUM *ret,BIGNUM *a, BIGNUM *n,BN_CTX *ctx);
400 BIGNUM *BN_generate_prime(BIGNUM *ret,int bits,int strong,BIGNUM *add,
401 BIGNUM *rem,void (*callback)(int,int,char *),char *cb_arg);
402 int BN_is_prime(BIGNUM *p,int nchecks,void (*callback)(int,int,char *),
403 BN_CTX *ctx,char *cb_arg);
404 void ERR_load_BN_strings(void );
406 BN_ULONG bn_mul_add_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w);
407 BN_ULONG bn_mul_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w);
408 void bn_sqr_words(BN_ULONG *rp, BN_ULONG *ap, int num);
409 BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d);
410 BN_ULONG bn_add_words(BN_ULONG *rp, BN_ULONG *ap, BN_ULONG *bp,int num);
411 BN_ULONG bn_sub_words(BN_ULONG *rp, BN_ULONG *ap, BN_ULONG *bp,int num);
413 BN_MONT_CTX *BN_MONT_CTX_new(void );
414 void BN_MONT_CTX_init(BN_MONT_CTX *ctx);
415 int BN_mod_mul_montgomery(BIGNUM *r,BIGNUM *a,BIGNUM *b,BN_MONT_CTX *mont,
417 int BN_from_montgomery(BIGNUM *r,BIGNUM *a,BN_MONT_CTX *mont,BN_CTX *ctx);
418 void BN_MONT_CTX_free(BN_MONT_CTX *mont);
419 int BN_MONT_CTX_set(BN_MONT_CTX *mont,BIGNUM *modulus,BN_CTX *ctx);
420 BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to,BN_MONT_CTX *from);
422 BN_BLINDING *BN_BLINDING_new(BIGNUM *A,BIGNUM *Ai,BIGNUM *mod);
423 void BN_BLINDING_free(BN_BLINDING *b);
424 int BN_BLINDING_update(BN_BLINDING *b,BN_CTX *ctx);
425 int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *r, BN_CTX *ctx);
426 int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
428 void BN_set_params(int mul,int high,int low,int mont);
429 int BN_get_params(int which); /* 0, mul, 1 high, 2 low, 3 mont */
431 void bn_mul_normal(BN_ULONG *r,BN_ULONG *a,int na,BN_ULONG *b,int nb);
432 void bn_mul_comba8(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b);
433 void bn_mul_comba4(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b);
434 void bn_sqr_normal(BN_ULONG *r, BN_ULONG *a, int n, BN_ULONG *tmp);
435 void bn_sqr_comba8(BN_ULONG *r,BN_ULONG *a);
436 void bn_sqr_comba4(BN_ULONG *r,BN_ULONG *a);
437 int bn_cmp_words(BN_ULONG *a,BN_ULONG *b,int n);
438 void bn_mul_recursive(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b,int n2,BN_ULONG *t);
439 void bn_mul_part_recursive(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b,
440 int tn, int n,BN_ULONG *t);
441 void bn_sqr_recursive(BN_ULONG *r,BN_ULONG *a, int n2, BN_ULONG *t);
442 void bn_mul_low_normal(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b, int n);
444 void BN_RECP_CTX_init(BN_RECP_CTX *recp);
445 BN_RECP_CTX *BN_RECP_CTX_new(void);
446 void BN_RECP_CTX_free(BN_RECP_CTX *recp);
447 int BN_RECP_CTX_set(BN_RECP_CTX *recp,BIGNUM *rdiv,BN_CTX *ctx);
448 int BN_mod_mul_reciprocal(BIGNUM *r, BIGNUM *x, BIGNUM *y,
449 BN_RECP_CTX *recp,BN_CTX *ctx);
450 int BN_mod_exp_recp(BIGNUM *r, BIGNUM *a, BIGNUM *p, BIGNUM *m,BN_CTX *ctx);
451 int BN_div_recp(BIGNUM *dv, BIGNUM *rem, BIGNUM *m,
452 BN_RECP_CTX *recp, BN_CTX *ctx);
457 BIGNUM *BN_value_one();
459 BN_CTX *BN_CTX_new();
464 int BN_num_bits_word();
467 void BN_clear_free();
481 BN_ULONG BN_mod_word();
482 BN_ULONG BN_div_word();
487 unsigned long BN_get_word();
495 int BN_mod_exp_mont();
496 int BN_mod_exp_recp();
497 int BN_mod_exp_simple();
499 int BN_mod_mul_reciprocal();
509 BIGNUM *bn_expand2();
519 BIGNUM *BN_mod_inverse();
520 BIGNUM *BN_generate_prime();
522 void ERR_load_BN_strings();
524 BN_ULONG bn_mul_add_words();
525 BN_ULONG bn_mul_words();
527 BN_ULONG bn_div_words();
528 BN_ULONG bn_add_words();
529 BN_ULONG bn_sub_words();
531 int BN_mod_mul_montgomery();
532 int BN_from_montgomery();
533 BN_MONT_CTX *BN_MONT_CTX_new();
534 void BN_MONT_CTX_init();
535 void BN_MONT_CTX_free();
536 int BN_MONT_CTX_set();
538 BN_BLINDING *BN_BLINDING_new();
539 void BN_BLINDING_free();
540 int BN_BLINDING_update();
541 int BN_BLINDING_convert();
542 int BN_BLINDING_invert();
544 void bn_mul_normal();
545 void bn_mul_comba8();
546 void bn_mul_comba4();
547 void bn_sqr_normal();
548 void bn_sqr_comba8();
549 void bn_sqr_comba4();
551 void bn_mul_recursive();
552 void bn_mul_part_recursive();
553 void bn_sqr_recursive();
554 void bn_mul_low_normal();
556 void BN_RECP_CTX_init();
557 BN_RECP_CTX *BN_RECP_CTX_new();
558 void BN_RECP_CTX_free();
559 int BN_RECP_CTX_set();
560 int BN_mod_mul_reciprocal();
561 int BN_mod_exp_recp();
566 /* BEGIN ERROR CODES */
567 /* Error codes for the BN functions. */
569 /* Function codes. */
570 #define BN_F_BN_BLINDING_CONVERT 100
571 #define BN_F_BN_BLINDING_INVERT 101
572 #define BN_F_BN_BLINDING_NEW 102
573 #define BN_F_BN_BLINDING_UPDATE 103
574 #define BN_F_BN_BN2DEC 104
575 #define BN_F_BN_BN2HEX 105
576 #define BN_F_BN_CTX_NEW 106
577 #define BN_F_BN_DIV 107
578 #define BN_F_BN_EXPAND2 108
579 #define BN_F_BN_MOD_EXP_MONT 109
580 #define BN_F_BN_MOD_INVERSE 110
581 #define BN_F_BN_MOD_MUL_RECIPROCAL 111
582 #define BN_F_BN_MPI2BN 112
583 #define BN_F_BN_NEW 113
584 #define BN_F_BN_RAND 114
585 #define BN_F_BN_USUB 115
588 #define BN_R_ARG2_LT_ARG3 100
589 #define BN_R_BAD_RECIPROCAL 101
590 #define BN_R_CALLED_WITH_EVEN_MODULUS 102
591 #define BN_R_DIV_BY_ZERO 103
592 #define BN_R_ENCODING_ERROR 104
593 #define BN_R_EXPAND_ON_STATIC_BIGNUM_DATA 105
594 #define BN_R_INVALID_LENGTH 106
595 #define BN_R_NOT_INITALISED 107
596 #define BN_R_NO_INVERSE 108