} BN_RECP_CTX;#define BN_prime_checks 0 /* default: select number of iterations			     based on the size of the number *//* number of Miller-Rabin iterations for an error rate  of less than 2^-80 * for random 'b'-bit input, b >= 100 (taken from table 4.4 in the Handbook * of Applied Cryptography [Menezes, van Oorschot, Vanstone; CRC Press 1996]; * original paper: Damgaard, Landrock, Pomerance: Average case error estimates * for the strong probable prime test. -- Math. Comp. 61 (1993) 177-194) */#define BN_prime_checks_for_size(b) ((b) >= 1300 ?  2 : \                                (b) >=  850 ?  3 : \                                (b) >=  650 ?  4 : \                                (b) >=  550 ?  5 : \                                (b) >=  450 ?  6 : \                                (b) >=  400 ?  7 : \                                (b) >=  350 ?  8 : \                                (b) >=  300 ?  9 : \                                (b) >=  250 ? 12 : \                                (b) >=  200 ? 15 : \                                (b) >=  150 ? 18 : \                                /* b >= 100 */ 27)#define BN_num_bytes(a)	((BN_num_bits(a)+7)/8)/* Note that BN_abs_is_word does not work reliably for w == 0 */#define BN_abs_is_word(a,w) (((a)->top == 1) && ((a)->d[0] == (BN_ULONG)(w)))#define BN_is_zero(a)       (((a)->top == 0) || BN_abs_is_word(a,0))#define BN_is_one(a)        (BN_abs_is_word((a),1) && !(a)->neg)#define BN_is_word(a,w)     ((w) ? BN_abs_is_word((a),(w)) && !(a)->neg : \                                   BN_is_zero((a)))#define BN_is_odd(a)	    (((a)->top > 0) && ((a)->d[0] & 1))#define BN_one(a)	(BN_set_word((a),1))#define BN_zero(a)	(BN_set_word((a),0))/*#define BN_ascii2bn(a)	BN_hex2bn(a) *//*#define BN_bn2ascii(a)	BN_bn2hex(a) */const BIGNUM *BN_value_one(void);char *	BN_options(void);BN_CTX *BN_CTX_new(void);void	BN_CTX_init(BN_CTX *c);void	BN_CTX_free(BN_CTX *c);void	BN_CTX_start(BN_CTX *ctx);BIGNUM *BN_CTX_get(BN_CTX *ctx);void	BN_CTX_end(BN_CTX *ctx);int     BN_rand(BIGNUM *rnd, int bits, int top,int bottom);int     BN_pseudo_rand(BIGNUM *rnd, int bits, int top,int bottom);int	BN_rand_range(BIGNUM *rnd, BIGNUM *range);int	BN_pseudo_rand_range(BIGNUM *rnd, BIGNUM *range);int	BN_num_bits(const BIGNUM *a);int	BN_num_bits_word(BN_ULONG);BIGNUM *BN_new(void);void	BN_init(BIGNUM *);void	BN_clear_free(BIGNUM *a);BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b);void	BN_swap(BIGNUM *a, BIGNUM *b);BIGNUM *BN_bin2bn(const unsigned char *s,int len,BIGNUM *ret);int	BN_bn2bin(const BIGNUM *a, unsigned char *to);BIGNUM *BN_mpi2bn(const unsigned char *s,int len,BIGNUM *ret);int	BN_bn2mpi(const BIGNUM *a, unsigned char *to);int	BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);int	BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);int	BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);int	BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);int	BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);int	BN_sqr(BIGNUM *r, const BIGNUM *a,BN_CTX *ctx);int	BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, const BIGNUM *d,	BN_CTX *ctx);#define BN_mod(rem,m,d,ctx) BN_div(NULL,(rem),(m),(d),(ctx))int	BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx);int	BN_mod_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m, BN_CTX *ctx);int	BN_mod_add_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m);int	BN_mod_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m, BN_CTX *ctx);int	BN_mod_sub_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m);int	BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,	const BIGNUM *m, BN_CTX *ctx);int	BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);int	BN_mod_lshift1(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);int	BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *m);int	BN_mod_lshift(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m, BN_CTX *ctx);int	BN_mod_lshift_quick(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m);BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w);BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w);int	BN_mul_word(BIGNUM *a, BN_ULONG w);int	BN_add_word(BIGNUM *a, BN_ULONG w);int	BN_sub_word(BIGNUM *a, BN_ULONG w);int	BN_set_word(BIGNUM *a, BN_ULONG w);BN_ULONG BN_get_word(const BIGNUM *a);int	BN_cmp(const BIGNUM *a, const BIGNUM *b);void	BN_free(BIGNUM *a);int	BN_is_bit_set(const BIGNUM *a, int n);int	BN_lshift(BIGNUM *r, const BIGNUM *a, int n);int	BN_lshift1(BIGNUM *r, const BIGNUM *a);int	BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,BN_CTX *ctx);int	BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,	const BIGNUM *m,BN_CTX *ctx);int	BN_mod_exp_mont(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,	const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);int	BN_mod_exp_mont_word(BIGNUM *r, BN_ULONG a, const BIGNUM *p,	const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);int	BN_mod_exp2_mont(BIGNUM *r, const BIGNUM *a1, const BIGNUM *p1,	const BIGNUM *a2, const BIGNUM *p2,const BIGNUM *m,	BN_CTX *ctx,BN_MONT_CTX *m_ctx);int	BN_mod_exp_simple(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,	const BIGNUM *m,BN_CTX *ctx);int	BN_mask_bits(BIGNUM *a,int n);#ifndef OPENSSL_NO_FP_APIint	BN_print_fp(FILE *fp, const BIGNUM *a);#endif#ifdef HEADER_BIO_Hint	BN_print(BIO *fp, const BIGNUM *a);#elseint	BN_print(void *fp, const BIGNUM *a);#endifint	BN_reciprocal(BIGNUM *r, const BIGNUM *m, int len, BN_CTX *ctx);int	BN_rshift(BIGNUM *r, const BIGNUM *a, int n);int	BN_rshift1(BIGNUM *r, const BIGNUM *a);void	BN_clear(BIGNUM *a);BIGNUM *BN_dup(const BIGNUM *a);int	BN_ucmp(const BIGNUM *a, const BIGNUM *b);int	BN_set_bit(BIGNUM *a, int n);int	BN_clear_bit(BIGNUM *a, int n);char *	BN_bn2hex(const BIGNUM *a);char *	BN_bn2dec(const BIGNUM *a);int 	BN_hex2bn(BIGNUM **a, const char *str);int 	BN_dec2bn(BIGNUM **a, const char *str);int	BN_gcd(BIGNUM *r,const BIGNUM *a,const BIGNUM *b,BN_CTX *ctx);int	BN_kronecker(const BIGNUM *a,const BIGNUM *b,BN_CTX *ctx); /* returns -2 for error */BIGNUM *BN_mod_inverse(BIGNUM *ret,	const BIGNUM *a, const BIGNUM *n,BN_CTX *ctx);BIGNUM *BN_mod_sqrt(BIGNUM *ret,	const BIGNUM *a, const BIGNUM *n,BN_CTX *ctx);BIGNUM *BN_generate_prime(BIGNUM *ret,int bits,int safe,	const BIGNUM *add, const BIGNUM *rem,	void (*callback)(int,int,void *),void *cb_arg);int	BN_is_prime(const BIGNUM *p,int nchecks,	void (*callback)(int,int,void *),	BN_CTX *ctx,void *cb_arg);int	BN_is_prime_fasttest(const BIGNUM *p,int nchecks,	void (*callback)(int,int,void *),BN_CTX *ctx,void *cb_arg,	int do_trial_division);BN_MONT_CTX *BN_MONT_CTX_new(void );void BN_MONT_CTX_init(BN_MONT_CTX *ctx);int BN_mod_mul_montgomery(BIGNUM *r,const BIGNUM *a,const BIGNUM *b,	BN_MONT_CTX *mont, BN_CTX *ctx);#define BN_to_montgomery(r,a,mont,ctx)	BN_mod_mul_montgomery(\	(r),(a),&((mont)->RR),(mont),(ctx))int BN_from_montgomery(BIGNUM *r,const BIGNUM *a,	BN_MONT_CTX *mont, BN_CTX *ctx);void BN_MONT_CTX_free(BN_MONT_CTX *mont);int BN_MONT_CTX_set(BN_MONT_CTX *mont,const BIGNUM *mod,BN_CTX *ctx);BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to,BN_MONT_CTX *from);BN_BLINDING *BN_BLINDING_new(BIGNUM *A,BIGNUM *Ai,BIGNUM *mod);void BN_BLINDING_free(BN_BLINDING *b);int BN_BLINDING_update(BN_BLINDING *b,BN_CTX *ctx);int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *r, BN_CTX *ctx);int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);void BN_set_params(int mul,int high,int low,int mont);int BN_get_params(int which); /* 0, mul, 1 high, 2 low, 3 mont */void	BN_RECP_CTX_init(BN_RECP_CTX *recp);BN_RECP_CTX *BN_RECP_CTX_new(void);void	BN_RECP_CTX_free(BN_RECP_CTX *recp);int	BN_RECP_CTX_set(BN_RECP_CTX *recp,const BIGNUM *rdiv,BN_CTX *ctx);int	BN_mod_mul_reciprocal(BIGNUM *r, const BIGNUM *x, const BIGNUM *y,	BN_RECP_CTX *recp,BN_CTX *ctx);int	BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,	const BIGNUM *m, BN_CTX *ctx);int	BN_div_recp(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m,	BN_RECP_CTX *recp, BN_CTX *ctx);/* library internal functions */#define bn_expand(a,bits) ((((((bits+BN_BITS2-1))/BN_BITS2)) <= (a)->dmax)?\	(a):bn_expand2((a),(bits)/BN_BITS2+1))#define bn_wexpand(a,words) (((words) <= (a)->dmax)?(a):bn_expand2((a),(words)))BIGNUM *bn_expand2(BIGNUM *a, int words);BIGNUM *bn_dup_expand(const BIGNUM *a, int words);#define bn_fix_top(a) \        { \        BN_ULONG *ftl; \	if ((a)->top > 0) \		{ \		for (ftl= &((a)->d[(a)->top-1]); (a)->top > 0; (a)->top--) \		if (*(ftl--)) break; \		} \	}BN_ULONG bn_mul_add_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w);BN_ULONG bn_mul_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w);void     bn_sqr_words(BN_ULONG *rp, const BN_ULONG *ap, int num);BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d);BN_ULONG bn_add_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,int num);BN_ULONG bn_sub_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,int num);#ifdef BN_DEBUGvoid bn_dump1(FILE *o, const char *a, const BN_ULONG *b,int n);# define bn_print(a) {fprintf(stderr, #a "="); BN_print_fp(stderr,a); \   fprintf(stderr,"\n");}# define bn_dump(a,n) bn_dump1(stderr,#a,a,n);#else# define bn_print(a)# define bn_dump(a,b)#endifint BN_bntest_rand(BIGNUM *rnd, int bits, int top,int bottom);/* BEGIN ERROR CODES *//* The following lines are auto generated by the script mkerr.pl. Any changes * made after this point may be overwritten when the script is next run. */void ERR_load_BN_strings(void);/* Error codes for the BN functions. *//* Function codes. */#define BN_F_BN_BLINDING_CONVERT			 100#define BN_F_BN_BLINDING_INVERT				 101#define BN_F_BN_BLINDING_NEW				 102#define BN_F_BN_BLINDING_UPDATE				 103#define BN_F_BN_BN2DEC					 104#define BN_F_BN_BN2HEX					 105#define BN_F_BN_CTX_GET					 116#define BN_F_BN_CTX_NEW					 106#define BN_F_BN_DIV					 107#define BN_F_BN_EXPAND2					 108#define BN_F_BN_EXPAND_INTERNAL				 120#define BN_F_BN_MOD_EXP2_MONT				 118#define BN_F_BN_MOD_EXP_MONT				 109#define BN_F_BN_MOD_EXP_MONT_WORD			 117#define BN_F_BN_MOD_INVERSE				 110#define BN_F_BN_MOD_LSHIFT_QUICK			 119#define BN_F_BN_MOD_MUL_RECIPROCAL			 111#define BN_F_BN_MOD_SQRT				 121#define BN_F_BN_MPI2BN					 112#define BN_F_BN_NEW					 113#define BN_F_BN_RAND					 114#define BN_F_BN_RAND_RANGE				 122#define BN_F_BN_USUB					 115/* Reason codes. */#define BN_R_ARG2_LT_ARG3				 100#define BN_R_BAD_RECIPROCAL				 101#define BN_R_BIGNUM_TOO_LONG				 114#define BN_R_CALLED_WITH_EVEN_MODULUS			 102#define BN_R_DIV_BY_ZERO				 103#define BN_R_ENCODING_ERROR				 104#define BN_R_EXPAND_ON_STATIC_BIGNUM_DATA		 105#define BN_R_INPUT_NOT_REDUCED				 110#define BN_R_INVALID_LENGTH				 106#define BN_R_INVALID_RANGE				 115#define BN_R_NOT_A_SQUARE				 111#define BN_R_NOT_INITIALIZED				 107#define BN_R_NO_INVERSE					 108#define BN_R_P_IS_NOT_PRIME				 112#define BN_R_TOO_MANY_ITERATIONS			 113#define BN_R_TOO_MANY_TEMPORARY_VARIABLES		 109#ifdef  __cplusplus}#endif#endif