[thirdparty/openssl.git] / crypto / bn / bn.h

/* crypto/bn/bn.h */
/* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com)
 * All rights reserved.
 *
 * This package is an SSL implementation written
 * by Eric Young (eay@cryptsoft.com).
 * The implementation was written so as to conform with Netscapes SSL.
 * 
 * This library is free for commercial and non-commercial use as long as
 * the following conditions are aheared to.  The following conditions
 * apply to all code found in this distribution, be it the RC4, RSA,
 * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
 * included with this distribution is covered by the same copyright terms
 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
 * 
 * Copyright remains Eric Young's, and as such any Copyright notices in
 * the code are not to be removed.
 * If this package is used in a product, Eric Young should be given attribution
 * as the author of the parts of the library used.
 * This can be in the form of a textual message at program startup or
 * in documentation (online or textual) provided with the package.
 * 
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *    "This product includes cryptographic software written by
 *     Eric Young (eay@cryptsoft.com)"
 *    The word 'cryptographic' can be left out if the rouines from the library
 *    being used are not cryptographic related :-).
 * 4. If you include any Windows specific code (or a derivative thereof) from 
 *    the apps directory (application code) you must include an acknowledgement:
 *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
 * 
 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 * 
 * The licence and distribution terms for any publically available version or
 * derivative of this code cannot be changed.  i.e. this code cannot simply be
 * copied and put under another distribution licence
 * [including the GNU Public Licence.]
 */

#ifndef HEADER_BN_H
#define HEADER_BN_H

#ifndef WIN16
#include <stdio.h> /* FILE */
#endif
#include <openssl/opensslconf.h>

#ifdef  __cplusplus
extern "C" {
#endif

#ifdef VMS
#undef BN_LLONG /* experimental, so far... */
#endif

#define BN_MUL_COMBA
#define BN_SQR_COMBA
#define BN_RECURSION
#define RECP_MUL_MOD
#define MONT_MUL_MOD

/* This next option uses the C libraries (2 word)/(1 word) function.
 * If it is not defined, I use my C version (which is slower).
 * The reason for this flag is that when the particular C compiler
 * library routine is used, and the library is linked with a different
 * compiler, the library is missing.  This mostly happens when the
 * library is built with gcc and then linked using nornal cc.  This would
 * be a common occurance because gcc normally produces code that is
 * 2 times faster than system compilers for the big number stuff.
 * For machines with only one compiler (or shared libraries), this should
 * be on.  Again this in only really a problem on machines
 * using "long long's", are 32bit, and are not using my assember code. */
#if defined(MSDOS) || defined(WINDOWS) || defined(linux)
#define BN_DIV2W
#endif

/* assuming long is 64bit - this is the DEC Alpha
 * unsigned long long is only 64 bits :-(, don't define
 * BN_LLONG for the DEC Alpha */
#ifdef SIXTY_FOUR_BIT_LONG
#define BN_ULLONG	unsigned long long
#define BN_ULONG	unsigned long
#define BN_LONG		long
#define BN_BITS		128
#define BN_BYTES	8
#define BN_BITS2	64
#define BN_BITS4	32
#define BN_MASK		(0xffffffffffffffffffffffffffffffffLL)
#define BN_MASK2	(0xffffffffffffffffL)
#define BN_MASK2l	(0xffffffffL)
#define BN_MASK2h	(0xffffffff00000000L)
#define BN_MASK2h1	(0xffffffff80000000L)
#define BN_TBIT		(0x8000000000000000L)
#define BN_DEC_CONV	(10000000000000000000UL)
#define BN_DEC_FMT1	"%lu"
#define BN_DEC_FMT2	"%019lu"
#define BN_DEC_NUM	19
#endif

/* This is where the long long data type is 64 bits, but long is 32.
 * For machines where there are 64bit registers, this is the mode to use.
 * IRIX, on R4000 and above should use this mode, along with the relevent
 * assember code :-).  Do NOT define BN_LLONG.
 */
#ifdef SIXTY_FOUR_BIT
#undef BN_LLONG
#undef BN_ULLONG
#define BN_ULONG	unsigned long long
#define BN_LONG		long long
#define BN_BITS		128
#define BN_BYTES	8
#define BN_BITS2	64
#define BN_BITS4	32
#define BN_MASK2	(0xffffffffffffffffLL)
#define BN_MASK2l	(0xffffffffL)
#define BN_MASK2h	(0xffffffff00000000LL)
#define BN_MASK2h1	(0xffffffff80000000LL)
#define BN_TBIT		(0x8000000000000000LL)
#define BN_DEC_CONV	(10000000000000000000LL)
#define BN_DEC_FMT1	"%llu"
#define BN_DEC_FMT2	"%019llu"
#define BN_DEC_NUM	19
#endif

#ifdef THIRTY_TWO_BIT
#if defined(WIN32) && !defined(__GNUC__)
#define BN_ULLONG	unsigned _int64
#else
#define BN_ULLONG	unsigned long long
#endif
#define BN_ULONG	unsigned long
#define BN_LONG		long
#define BN_BITS		64
#define BN_BYTES	4
#define BN_BITS2	32
#define BN_BITS4	16
#ifdef WIN32
/* VC++ doesn't like the LL suffix */
#define BN_MASK		(0xffffffffffffffffL)
#else
#define BN_MASK		(0xffffffffffffffffLL)
#endif
#define BN_MASK2	(0xffffffffL)
#define BN_MASK2l	(0xffff)
#define BN_MASK2h1	(0xffff8000L)
#define BN_MASK2h	(0xffff0000L)
#define BN_TBIT		(0x80000000L)
#define BN_DEC_CONV	(1000000000L)
#define BN_DEC_FMT1	"%lu"
#define BN_DEC_FMT2	"%09lu"
#define BN_DEC_NUM	9
#endif

#ifdef SIXTEEN_BIT
#ifndef BN_DIV2W
#define BN_DIV2W
#endif
#define BN_ULLONG	unsigned long
#define BN_ULONG	unsigned short
#define BN_LONG		short
#define BN_BITS		32
#define BN_BYTES	2
#define BN_BITS2	16
#define BN_BITS4	8
#define BN_MASK		(0xffffffff)
#define BN_MASK2	(0xffff)
#define BN_MASK2l	(0xff)
#define BN_MASK2h1	(0xff80)
#define BN_MASK2h	(0xff00)
#define BN_TBIT		(0x8000)
#define BN_DEC_CONV	(100000)
#define BN_DEC_FMT1	"%u"
#define BN_DEC_FMT2	"%05u"
#define BN_DEC_NUM	5
#endif

#ifdef EIGHT_BIT
#ifndef BN_DIV2W
#define BN_DIV2W
#endif
#define BN_ULLONG	unsigned short
#define BN_ULONG	unsigned char
#define BN_LONG		char
#define BN_BITS		16
#define BN_BYTES	1
#define BN_BITS2	8
#define BN_BITS4	4
#define BN_MASK		(0xffff)
#define BN_MASK2	(0xff)
#define BN_MASK2l	(0xf)
#define BN_MASK2h1	(0xf8)
#define BN_MASK2h	(0xf0)
#define BN_TBIT		(0x80)
#define BN_DEC_CONV	(100)
#define BN_DEC_FMT1	"%u"
#define BN_DEC_FMT2	"%02u"
#define BN_DEC_NUM	2
#endif

#define BN_DEFAULT_BITS	1280

#ifdef BIGNUM
#undef BIGNUM
#endif

#define BN_FLG_MALLOCED		0x01
#define BN_FLG_STATIC_DATA	0x02
#define BN_FLG_FREE		0x8000	/* used for debuging */
#define BN_set_flags(b,n)	((b)->flags|=(n))
#define BN_get_flags(b,n)	((b)->flags&(n))

typedef struct bignum_st
	{
	BN_ULONG *d;	/* Pointer to an array of 'BN_BITS2' bit chunks. */
	int top;	/* Index of last used d +1. */
	/* The next are internal book keeping for bn_expand. */
	int max;	/* Size of the d array. */
	int neg;	/* one if the number is negative */
	int flags;
	} BIGNUM;

/* Used for temp variables */
#define BN_CTX_NUM	12
typedef struct bignum_ctx
	{
	int tos;
	BIGNUM bn[BN_CTX_NUM+1];
	int flags;
	} BN_CTX;

typedef struct bn_blinding_st
	{
	int init;
	BIGNUM *A;
	BIGNUM *Ai;
	BIGNUM *mod; /* just a reference */
	} BN_BLINDING;

/* Used for montgomery multiplication */
typedef struct bn_mont_ctx_st
	{
	int use_word;  /* 0 for word form, 1 for bignum form */
	int ri;        /* number of bits in R */
	BIGNUM RR;     /* used to convert to montgomery form */
	BIGNUM N;      /* The modulus */
	BIGNUM Ni;     /* R*(1/R mod N) - N*Ni = 1
	                * (Ni is only stored for bignum algorithm) */
	BN_ULONG n0;   /* least significant word of Ni */
	int flags;
	} BN_MONT_CTX;

/* Used for reciprocal division/mod functions
 * It cannot be shared between threads
 */
typedef struct bn_recp_ctx_st
	{
	BIGNUM N;	/* the divisor */
	BIGNUM Nr;	/* the reciprocal */
	int num_bits;
	int shift;
	int flags;
	} BN_RECP_CTX;

#define BN_to_montgomery(r,a,mont,ctx)	BN_mod_mul_montgomery(\
	r,a,&((mont)->RR),(mont),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)
#define BN_is_word(a,w)	(((a)->top == 1) && ((a)->d[0] == (BN_ULONG)(w)))
#define BN_is_zero(a)	(((a)->top == 0) || BN_is_word(a,0))
#define BN_is_one(a)	(BN_is_word((a),1))
#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) */

#define bn_expand(n,b) ((((((b+BN_BITS2-1))/BN_BITS2)) <= (n)->max)?\
	(n):bn_expand2((n),(b)/BN_BITS2+1))
#define bn_wexpand(n,b) (((b) <= (n)->max)?(n):bn_expand2((n),(b)))

#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; \
		} \
	}

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);
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_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);
BIGNUM *BN_bin2bn(const unsigned char *s,int len,BIGNUM *ret);
int	BN_bn2bin(const BIGNUM *a, unsigned char *to);
BIGNUM *BN_mpi2bn(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_mod(BIGNUM *rem, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx);
int	BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, const BIGNUM *d,
	       BN_CTX *ctx);
int	BN_mul(BIGNUM *r, BIGNUM *a, BIGNUM *b, BN_CTX *ctx);
int	BN_sqr(BIGNUM *r, BIGNUM *a,BN_CTX *ctx);
BN_ULONG BN_mod_word(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(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, BIGNUM *a);
int	BN_exp(BIGNUM *r, BIGNUM *a, BIGNUM *p,BN_CTX *ctx);
int	BN_mod_exp(BIGNUM *r, BIGNUM *a, const BIGNUM *p,
		   const BIGNUM *m,BN_CTX *ctx);
int	BN_mod_exp_mont(BIGNUM *r, BIGNUM *a, const BIGNUM *p,
			const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);
int	BN_mod_exp2_mont(BIGNUM *r, BIGNUM *a1, BIGNUM *p1,BIGNUM *a2,
		BIGNUM *p2,BIGNUM *m,BN_CTX *ctx,BN_MONT_CTX *m_ctx);
int	BN_mod_exp_simple(BIGNUM *r, BIGNUM *a, BIGNUM *p,
	BIGNUM *m,BN_CTX *ctx);
int	BN_mask_bits(BIGNUM *a,int n);
int	BN_mod_mul(BIGNUM *ret, BIGNUM *a, BIGNUM *b, const BIGNUM *m, BN_CTX *ctx);
#ifndef WIN16
int	BN_print_fp(FILE *fp, const BIGNUM *a);
#endif
#ifdef HEADER_BIO_H
int	BN_print(BIO *fp, const BIGNUM *a);
#else
int	BN_print(char *fp, const BIGNUM *a);
#endif
int	BN_reciprocal(BIGNUM *r, BIGNUM *m, int len, BN_CTX *ctx);
int	BN_rshift(BIGNUM *r, BIGNUM *a, int n);
int	BN_rshift1(BIGNUM *r, BIGNUM *a);
void	BN_clear(BIGNUM *a);
BIGNUM *bn_expand2(BIGNUM *b, int bits);
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,BIGNUM *in_a,BIGNUM *in_b,BN_CTX *ctx);
BIGNUM *BN_mod_inverse(BIGNUM *ret,BIGNUM *a, const BIGNUM *n,BN_CTX *ctx);
BIGNUM *BN_generate_prime(BIGNUM *ret,int bits,int safe,BIGNUM *add,
		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);
void	ERR_load_BN_strings(void );

BN_ULONG bn_mul_add_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w);
BN_ULONG bn_mul_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w);
void     bn_sqr_words(BN_ULONG *rp, 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, BN_ULONG *ap, BN_ULONG *bp,int num);
BN_ULONG bn_sub_words(BN_ULONG *rp, BN_ULONG *ap, BN_ULONG *bp,int num);

BN_MONT_CTX *BN_MONT_CTX_new(void );
void BN_MONT_CTX_init(BN_MONT_CTX *ctx);
int BN_mod_mul_montgomery(BIGNUM *r,BIGNUM *a,BIGNUM *b,BN_MONT_CTX *mont,
			  BN_CTX *ctx);
int BN_from_montgomery(BIGNUM *r,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 *modulus,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, BIGNUM *x, 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, BIGNUM *m,
		BN_RECP_CTX *recp, BN_CTX *ctx);


/* 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.
 */

/* 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_NEW					 106
#define BN_F_BN_DIV					 107
#define BN_F_BN_EXPAND2					 108
#define BN_F_BN_MOD_EXP_MONT				 109
#define BN_F_BN_MOD_INVERSE				 110
#define BN_F_BN_MOD_MUL_RECIPROCAL			 111
#define BN_F_BN_MPI2BN					 112
#define BN_F_BN_NEW					 113
#define BN_F_BN_RAND					 114
#define BN_F_BN_USUB					 115

/* Reason codes. */
#define BN_R_ARG2_LT_ARG3				 100
#define BN_R_BAD_RECIPROCAL				 101
#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_INVALID_LENGTH				 106
#define BN_R_NOT_INITIALIZED				 107
#define BN_R_NO_INVERSE					 108

#ifdef  __cplusplus
}
#endif
#endif
Commit	Line	Data
169cc7a1	1	/* crypto/bn/bn.h */
d02b48c6 RE	2	/* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com)
	3	* All rights reserved.
	4	*
	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.
	8	*
	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).
	15	*
	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.
	22	*
	23	* Redistribution and use in source and binary forms, with or without
	24	* modification, are permitted provided that the following conditions
	25	* are met:
	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)"
	40	*
	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
	51	* SUCH DAMAGE.
	52	*
	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.]
	57	*/
	58
d02b48c6 RE	59	#ifndef HEADER_BN_H
	60	#define HEADER_BN_H
	61
2b6405fa BM	62	#ifndef WIN16
	63	#include <stdio.h> /* FILE */
	64	#endif
ec577822	65	#include <openssl/opensslconf.h>
8e10f2b3	66
d02b48c6 RE	67	#ifdef __cplusplus
	68	extern "C" {
	69	#endif
	70
7d7d2cbc UM	71	#ifdef VMS
	72	#undef BN_LLONG /* experimental, so far... */
	73	#endif
	74
dfeab068 RE	75	#define BN_MUL_COMBA
	76	#define BN_SQR_COMBA
	77	#define BN_RECURSION
d02b48c6 RE	78	#define RECP_MUL_MOD
	79	#define MONT_MUL_MOD
	80
	81	/* This next option uses the C libraries (2 word)/(1 word) function.
	82	* If it is not defined, I use my C version (which is slower).
	83	* The reason for this flag is that when the particular C compiler
	84	* library routine is used, and the library is linked with a different
	85	* compiler, the library is missing. This mostly happens when the
	86	* library is built with gcc and then linked using nornal cc. This would
	87	* be a common occurance because gcc normally produces code that is
	88	* 2 times faster than system compilers for the big number stuff.
	89	* For machines with only one compiler (or shared libraries), this should
	90	* be on. Again this in only really a problem on machines
	91	* using "long long's", are 32bit, and are not using my assember code. */
	92	#if defined(MSDOS) \|\| defined(WINDOWS) \|\| defined(linux)
	93	#define BN_DIV2W
	94	#endif
	95
d02b48c6 RE	96	/* assuming long is 64bit - this is the DEC Alpha
	97	* unsigned long long is only 64 bits :-(, don't define
	98	* BN_LLONG for the DEC Alpha */
	99	#ifdef SIXTY_FOUR_BIT_LONG
	100	#define BN_ULLONG unsigned long long
	101	#define BN_ULONG unsigned long
	102	#define BN_LONG long
	103	#define BN_BITS 128
	104	#define BN_BYTES 8
	105	#define BN_BITS2 64
	106	#define BN_BITS4 32
dfeab068	107	#define BN_MASK (0xffffffffffffffffffffffffffffffffLL)
d02b48c6 RE	108	#define BN_MASK2 (0xffffffffffffffffL)
	109	#define BN_MASK2l (0xffffffffL)
	110	#define BN_MASK2h (0xffffffff00000000L)
	111	#define BN_MASK2h1 (0xffffffff80000000L)
	112	#define BN_TBIT (0x8000000000000000L)
dfeab068	113	#define BN_DEC_CONV (10000000000000000000UL)
58964a49 RE	114	#define BN_DEC_FMT1 "%lu"
	115	#define BN_DEC_FMT2 "%019lu"
	116	#define BN_DEC_NUM 19
d02b48c6 RE	117	#endif
d02b48c6 RE	118
dfeab068 RE	119	/* This is where the long long data type is 64 bits, but long is 32.
	120	* For machines where there are 64bit registers, this is the mode to use.
	121	* IRIX, on R4000 and above should use this mode, along with the relevent
e14d4443	122	* assember code :-). Do NOT define BN_LLONG.
dfeab068	123	*/
d02b48c6	124	#ifdef SIXTY_FOUR_BIT
e14d4443 UM	125	#undef BN_LLONG
e14d4443 UM	126	#undef BN_ULLONG
d02b48c6 RE	127	#define BN_ULONG unsigned long long
	128	#define BN_LONG long long
	129	#define BN_BITS 128
	130	#define BN_BYTES 8
	131	#define BN_BITS2 64
	132	#define BN_BITS4 32
	133	#define BN_MASK2 (0xffffffffffffffffLL)
	134	#define BN_MASK2l (0xffffffffL)
	135	#define BN_MASK2h (0xffffffff00000000LL)
	136	#define BN_MASK2h1 (0xffffffff80000000LL)
	137	#define BN_TBIT (0x8000000000000000LL)
dfeab068 RE	138	#define BN_DEC_CONV (10000000000000000000LL)
	139	#define BN_DEC_FMT1 "%llu"
	140	#define BN_DEC_FMT2 "%019llu"
58964a49	141	#define BN_DEC_NUM 19
d02b48c6 RE	142	#endif
	143
	144	#ifdef THIRTY_TWO_BIT
e3718280	145	#if defined(WIN32) && !defined(__GNUC__)
d02b48c6 RE	146	#define BN_ULLONG unsigned _int64
	147	#else
	148	#define BN_ULLONG unsigned long long
	149	#endif
	150	#define BN_ULONG unsigned long
	151	#define BN_LONG long
	152	#define BN_BITS 64
	153	#define BN_BYTES 4
	154	#define BN_BITS2 32
	155	#define BN_BITS4 16
9b3086fe DSH	156	#ifdef WIN32
	157	/* VC++ doesn't like the LL suffix */
	158	#define BN_MASK (0xffffffffffffffffL)
	159	#else
dfeab068	160	#define BN_MASK (0xffffffffffffffffLL)
9b3086fe	161	#endif
d02b48c6 RE	162	#define BN_MASK2 (0xffffffffL)
	163	#define BN_MASK2l (0xffff)
	164	#define BN_MASK2h1 (0xffff8000L)
	165	#define BN_MASK2h (0xffff0000L)
	166	#define BN_TBIT (0x80000000L)
58964a49 RE	167	#define BN_DEC_CONV (1000000000L)
	168	#define BN_DEC_FMT1 "%lu"
	169	#define BN_DEC_FMT2 "%09lu"
	170	#define BN_DEC_NUM 9
d02b48c6 RE	171	#endif
	172
	173	#ifdef SIXTEEN_BIT
	174	#ifndef BN_DIV2W
	175	#define BN_DIV2W
	176	#endif
	177	#define BN_ULLONG unsigned long
	178	#define BN_ULONG unsigned short
	179	#define BN_LONG short
	180	#define BN_BITS 32
	181	#define BN_BYTES 2
	182	#define BN_BITS2 16
	183	#define BN_BITS4 8
dfeab068	184	#define BN_MASK (0xffffffff)
d02b48c6 RE	185	#define BN_MASK2 (0xffff)
	186	#define BN_MASK2l (0xff)
	187	#define BN_MASK2h1 (0xff80)
	188	#define BN_MASK2h (0xff00)
	189	#define BN_TBIT (0x8000)
58964a49 RE	190	#define BN_DEC_CONV (100000)
	191	#define BN_DEC_FMT1 "%u"
	192	#define BN_DEC_FMT2 "%05u"
	193	#define BN_DEC_NUM 5
d02b48c6 RE	194	#endif
	195
	196	#ifdef EIGHT_BIT
	197	#ifndef BN_DIV2W
	198	#define BN_DIV2W
	199	#endif
	200	#define BN_ULLONG unsigned short
	201	#define BN_ULONG unsigned char
	202	#define BN_LONG char
	203	#define BN_BITS 16
	204	#define BN_BYTES 1
	205	#define BN_BITS2 8
	206	#define BN_BITS4 4
dfeab068	207	#define BN_MASK (0xffff)
d02b48c6 RE	208	#define BN_MASK2 (0xff)
	209	#define BN_MASK2l (0xf)
	210	#define BN_MASK2h1 (0xf8)
	211	#define BN_MASK2h (0xf0)
	212	#define BN_TBIT (0x80)
58964a49 RE	213	#define BN_DEC_CONV (100)
	214	#define BN_DEC_FMT1 "%u"
	215	#define BN_DEC_FMT2 "%02u"
	216	#define BN_DEC_NUM 2
d02b48c6 RE	217	#endif
	218
	219	#define BN_DEFAULT_BITS 1280
	220
	221	#ifdef BIGNUM
	222	#undef BIGNUM
	223	#endif
	224
dfeab068 RE	225	#define BN_FLG_MALLOCED 0x01
	226	#define BN_FLG_STATIC_DATA 0x02
	227	#define BN_FLG_FREE 0x8000 /* used for debuging */
	228	#define BN_set_flags(b,n) ((b)->flags\|=(n))
	229	#define BN_get_flags(b,n) ((b)->flags&(n))
	230
d02b48c6 RE	231	typedef struct bignum_st
	232	{
	233	BN_ULONG d; / Pointer to an array of 'BN_BITS2' bit chunks. */
	234	int top; /* Index of last used d +1. */
	235	/* The next are internal book keeping for bn_expand. */
	236	int max; /* Size of the d array. */
	237	int neg; /* one if the number is negative */
dfeab068	238	int flags;
d02b48c6 RE	239	} BIGNUM;
	240
	241	/* Used for temp variables */
	242	#define BN_CTX_NUM 12
	243	typedef struct bignum_ctx
	244	{
	245	int tos;
dfeab068 RE	246	BIGNUM bn[BN_CTX_NUM+1];
dfeab068 RE	247	int flags;
d02b48c6 RE	248	} BN_CTX;
d02b48c6 RE	249
58964a49 RE	250	typedef struct bn_blinding_st
	251	{
	252	int init;
	253	BIGNUM *A;
	254	BIGNUM *Ai;
	255	BIGNUM mod; / just a reference */
	256	} BN_BLINDING;
	257
d02b48c6 RE	258	/* Used for montgomery multiplication */
d02b48c6 RE	259	typedef struct bn_mont_ctx_st
e93f9a32 UM	260	{
	261	int use_word; /* 0 for word form, 1 for bignum form */
	262	int ri; /* number of bits in R */
	263	BIGNUM RR; /* used to convert to montgomery form */
	264	BIGNUM N; /* The modulus */
ec1258dd BM	265	BIGNUM Ni; /* R(1/R mod N) - NNi = 1
	266	* (Ni is only stored for bignum algorithm) */
	267	BN_ULONG n0; /* least significant word of Ni */
dfeab068	268	int flags;
e93f9a32	269	} BN_MONT_CTX;
d02b48c6	270
dfeab068 RE	271	/* Used for reciprocal division/mod functions
	272	* It cannot be shared between threads
	273	*/
	274	typedef struct bn_recp_ctx_st
	275	{
	276	BIGNUM N; /* the divisor */
	277	BIGNUM Nr; /* the reciprocal */
	278	int num_bits;
	279	int shift;
	280	int flags;
	281	} BN_RECP_CTX;
	282
d02b48c6	283	#define BN_to_montgomery(r,a,mont,ctx) BN_mod_mul_montgomery(\
dfeab068	284	r,a,&((mont)->RR),(mont),ctx)
d02b48c6	285
4486d0cd UM	286	#define BN_prime_checks 0 /* default: select number of iterations
4486d0cd UM	287	based on the size of the number */
d02b48c6	288
38e33cef UM	289
	290	/* number of Miller-Rabin iterations for an error rate of less than 2^-80
	291	* for random 'b'-bit input, b >= 100 (taken from table 4.4 in the Handbook
	292	* of Applied Cryptography [Menezes, van Oorschot, Vanstone; CRC Press 1996];
	293	* original paper: Damgaard, Landrock, Pomerance: Average case error estimates
	294	* for the strong probable prime test. -- Math. Comp. 61 (1993) 177-194) */
a87030a1	295	#define BN_prime_checks_for_size(b) ((b) >= 1300 ? 2 : \
38e33cef UM	296	(b) >= 850 ? 3 : \
	297	(b) >= 650 ? 4 : \
	298	(b) >= 550 ? 5 : \
	299	(b) >= 450 ? 6 : \
	300	(b) >= 400 ? 7 : \
	301	(b) >= 350 ? 8 : \
	302	(b) >= 300 ? 9 : \
	303	(b) >= 250 ? 12 : \
	304	(b) >= 200 ? 15 : \
	305	(b) >= 150 ? 18 : \
	306	/* b >= 100 */ 27)
	307
d02b48c6 RE	308	#define BN_num_bytes(a) ((BN_num_bits(a)+7)/8)
d02b48c6 RE	309	#define BN_is_word(a,w) (((a)->top == 1) && ((a)->d[0] == (BN_ULONG)(w)))
dfeab068	310	#define BN_is_zero(a) (((a)->top == 0) \|\| BN_is_word(a,0))
d02b48c6	311	#define BN_is_one(a) (BN_is_word((a),1))
dfeab068	312	#define BN_is_odd(a) (((a)->top > 0) && ((a)->d[0] & 1))
d02b48c6 RE	313	#define BN_one(a) (BN_set_word((a),1))
	314	#define BN_zero(a) (BN_set_word((a),0))
	315
dfeab068 RE	316	/#define BN_ascii2bn(a) BN_hex2bn(a) /
dfeab068 RE	317	/#define BN_bn2ascii(a) BN_bn2hex(a) /
d02b48c6	318
dfeab068 RE	319	#define bn_expand(n,b) ((((((b+BN_BITS2-1))/BN_BITS2)) <= (n)->max)?\
dfeab068 RE	320	(n):bn_expand2((n),(b)/BN_BITS2+1))
58964a49	321	#define bn_wexpand(n,b) (((b) <= (n)->max)?(n):bn_expand2((n),(b)))
d02b48c6	322
dfeab068 RE	323	#define bn_fix_top(a) \
	324	{ \
	325	BN_ULONG *ftl; \
	326	if ((a)->top > 0) \
	327	{ \
	328	for (ftl= &((a)->d[(a)->top-1]); (a)->top > 0; (a)->top--) \
	329	if (*(ftl--)) break; \
	330	} \
	331	}
d02b48c6	332
d02b48c6 RE	333	BIGNUM *BN_value_one(void);
	334	char * BN_options(void);
	335	BN_CTX *BN_CTX_new(void);
dfeab068	336	void BN_CTX_init(BN_CTX *c);
d02b48c6 RE	337	void BN_CTX_free(BN_CTX *c);
d02b48c6 RE	338	int BN_rand(BIGNUM *rnd, int bits, int top,int bottom);
f95a9f67	339	int BN_pseudo_rand(BIGNUM *rnd, int bits, int top,int bottom);
84c15db5	340	int BN_num_bits(const BIGNUM *a);
d02b48c6 RE	341	int BN_num_bits_word(BN_ULONG);
d02b48c6 RE	342	BIGNUM *BN_new(void);
dfeab068	343	void BN_init(BIGNUM *);
d02b48c6	344	void BN_clear_free(BIGNUM *a);
84c15db5	345	BIGNUM BN_copy(BIGNUM a, const BIGNUM *b);
61f5b6f3	346	BIGNUM BN_bin2bn(const unsigned char s,int len,BIGNUM *ret);
8623f693	347	int BN_bn2bin(const BIGNUM a, unsigned char to);
58964a49	348	BIGNUM BN_mpi2bn(unsigned char s,int len,BIGNUM *ret);
8623f693	349	int BN_bn2mpi(const BIGNUM a, unsigned char to);
84c15db5 BL	350	int BN_sub(BIGNUM r, const BIGNUM a, const BIGNUM *b);
	351	int BN_usub(BIGNUM r, const BIGNUM a, const BIGNUM *b);
	352	int BN_uadd(BIGNUM r, const BIGNUM a, const BIGNUM *b);
dd8dec69	353	int BN_add(BIGNUM r, const BIGNUM a, const BIGNUM *b);
84c15db5 BL	354	int BN_mod(BIGNUM rem, const BIGNUM m, const BIGNUM d, BN_CTX ctx);
	355	int BN_div(BIGNUM dv, BIGNUM rem, const BIGNUM m, const BIGNUM d,
	356	BN_CTX *ctx);
dd8dec69	357	int BN_mul(BIGNUM r, BIGNUM a, BIGNUM b, BN_CTX ctx);
d02b48c6	358	int BN_sqr(BIGNUM r, BIGNUM a,BN_CTX *ctx);
dfeab068 RE	359	BN_ULONG BN_mod_word(BIGNUM *a, BN_ULONG w);
	360	BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w);
	361	int BN_mul_word(BIGNUM *a, BN_ULONG w);
	362	int BN_add_word(BIGNUM *a, BN_ULONG w);
	363	int BN_sub_word(BIGNUM *a, BN_ULONG w);
	364	int BN_set_word(BIGNUM *a, BN_ULONG w);
	365	BN_ULONG BN_get_word(BIGNUM *a);
84c15db5	366	int BN_cmp(const BIGNUM a, const BIGNUM b);
d02b48c6	367	void BN_free(BIGNUM *a);
84c15db5 BL	368	int BN_is_bit_set(const BIGNUM *a, int n);
84c15db5 BL	369	int BN_lshift(BIGNUM r, const BIGNUM a, int n);
d02b48c6	370	int BN_lshift1(BIGNUM r, BIGNUM a);
58964a49	371	int BN_exp(BIGNUM r, BIGNUM a, BIGNUM p,BN_CTX ctx);
84c15db5 BL	372	int BN_mod_exp(BIGNUM r, BIGNUM a, const BIGNUM *p,
	373	const BIGNUM m,BN_CTX ctx);
	374	int BN_mod_exp_mont(BIGNUM r, BIGNUM a, const BIGNUM *p,
	375	const BIGNUM m, BN_CTX ctx, BN_MONT_CTX *m_ctx);
dfeab068 RE	376	int BN_mod_exp2_mont(BIGNUM r, BIGNUM a1, BIGNUM p1,BIGNUM a2,
dfeab068 RE	377	BIGNUM p2,BIGNUM m,BN_CTX ctx,BN_MONT_CTX m_ctx);
d02b48c6 RE	378	int BN_mod_exp_simple(BIGNUM r, BIGNUM a, BIGNUM *p,
	379	BIGNUM m,BN_CTX ctx);
	380	int BN_mask_bits(BIGNUM *a,int n);
84c15db5	381	int BN_mod_mul(BIGNUM ret, BIGNUM a, BIGNUM b, const BIGNUM m, BN_CTX *ctx);
d02b48c6	382	#ifndef WIN16
e93f9a32	383	int BN_print_fp(FILE fp, const BIGNUM a);
d02b48c6 RE	384	#endif
d02b48c6 RE	385	#ifdef HEADER_BIO_H
8d8a8041	386	int BN_print(BIO fp, const BIGNUM a);
d02b48c6	387	#else
8d8a8041	388	int BN_print(char fp, const BIGNUM a);
d02b48c6	389	#endif
dfeab068	390	int BN_reciprocal(BIGNUM r, BIGNUM m, int len, BN_CTX *ctx);
d02b48c6 RE	391	int BN_rshift(BIGNUM r, BIGNUM a, int n);
	392	int BN_rshift1(BIGNUM r, BIGNUM a);
	393	void BN_clear(BIGNUM *a);
	394	BIGNUM bn_expand2(BIGNUM b, int bits);
84c15db5 BL	395	BIGNUM BN_dup(const BIGNUM a);
84c15db5 BL	396	int BN_ucmp(const BIGNUM a, const BIGNUM b);
d02b48c6 RE	397	int BN_set_bit(BIGNUM *a, int n);
d02b48c6 RE	398	int BN_clear_bit(BIGNUM *a, int n);
8623f693 DSH	399	char * BN_bn2hex(const BIGNUM *a);
	400	char * BN_bn2dec(const BIGNUM *a);
	401	int BN_hex2bn(BIGNUM *a, const char str);
	402	int BN_dec2bn(BIGNUM *a, const char str);
d02b48c6	403	int BN_gcd(BIGNUM r,BIGNUM in_a,BIGNUM in_b,BN_CTX ctx);
84c15db5	404	BIGNUM BN_mod_inverse(BIGNUM ret,BIGNUM a, const BIGNUM n,BN_CTX *ctx);
76aa0ddc	405	BIGNUM BN_generate_prime(BIGNUM ret,int bits,int safe,BIGNUM *add,
b4f76582	406	BIGNUM rem,void (callback)(int,int,void ),void cb_arg);
aff0825c BM	407	int BN_is_prime(const BIGNUM *p,int nchecks,
aff0825c BM	408	void (callback)(int,int,void ),
b4f76582	409	BN_CTX ctx,void cb_arg);
aff0825c	410	int BN_is_prime_fasttest(const BIGNUM *p,int nchecks,
e74231ed	411	void (callback)(int,int,void ),BN_CTX ctx,void cb_arg,
a87030a1	412	int do_trial_division);
d02b48c6 RE	413	void ERR_load_BN_strings(void );
d02b48c6 RE	414
58964a49 RE	415	BN_ULONG bn_mul_add_words(BN_ULONG rp, BN_ULONG ap, int num, BN_ULONG w);
58964a49 RE	416	BN_ULONG bn_mul_words(BN_ULONG rp, BN_ULONG ap, int num, BN_ULONG w);
d02b48c6	417	void bn_sqr_words(BN_ULONG rp, BN_ULONG ap, int num);
dfeab068	418	BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d);
58964a49	419	BN_ULONG bn_add_words(BN_ULONG rp, BN_ULONG ap, BN_ULONG *bp,int num);
dfeab068	420	BN_ULONG bn_sub_words(BN_ULONG rp, BN_ULONG ap, BN_ULONG *bp,int num);
d02b48c6 RE	421
d02b48c6 RE	422	BN_MONT_CTX *BN_MONT_CTX_new(void );
dfeab068	423	void BN_MONT_CTX_init(BN_MONT_CTX *ctx);
d02b48c6	424	int BN_mod_mul_montgomery(BIGNUM r,BIGNUM a,BIGNUM b,BN_MONT_CTX mont,
84c15db5	425	BN_CTX *ctx);
d02b48c6 RE	426	int BN_from_montgomery(BIGNUM r,BIGNUM a,BN_MONT_CTX mont,BN_CTX ctx);
d02b48c6 RE	427	void BN_MONT_CTX_free(BN_MONT_CTX *mont);
84c15db5	428	int BN_MONT_CTX_set(BN_MONT_CTX mont,const BIGNUM modulus,BN_CTX *ctx);
dfeab068	429	BN_MONT_CTX BN_MONT_CTX_copy(BN_MONT_CTX to,BN_MONT_CTX *from);
d02b48c6	430
58964a49 RE	431	BN_BLINDING BN_BLINDING_new(BIGNUM A,BIGNUM Ai,BIGNUM mod);
	432	void BN_BLINDING_free(BN_BLINDING *b);
	433	int BN_BLINDING_update(BN_BLINDING b,BN_CTX ctx);
	434	int BN_BLINDING_convert(BIGNUM n, BN_BLINDING r, BN_CTX *ctx);
	435	int BN_BLINDING_invert(BIGNUM n, BN_BLINDING b, BN_CTX *ctx);
	436
dfeab068 RE	437	void BN_set_params(int mul,int high,int low,int mont);
	438	int BN_get_params(int which); /* 0, mul, 1 high, 2 low, 3 mont */
	439
dfeab068 RE	440	void BN_RECP_CTX_init(BN_RECP_CTX *recp);
	441	BN_RECP_CTX *BN_RECP_CTX_new(void);
	442	void BN_RECP_CTX_free(BN_RECP_CTX *recp);
84c15db5	443	int BN_RECP_CTX_set(BN_RECP_CTX recp,const BIGNUM rdiv,BN_CTX *ctx);
dfeab068 RE	444	int BN_mod_mul_reciprocal(BIGNUM r, BIGNUM x, BIGNUM *y,
dfeab068 RE	445	BN_RECP_CTX recp,BN_CTX ctx);
84c15db5 BL	446	int BN_mod_exp_recp(BIGNUM r, const BIGNUM a, const BIGNUM *p,
84c15db5 BL	447	const BIGNUM m, BN_CTX ctx);
dfeab068 RE	448	int BN_div_recp(BIGNUM dv, BIGNUM rem, BIGNUM *m,
	449	BN_RECP_CTX recp, BN_CTX ctx);
	450
	451
d02b48c6	452	/* BEGIN ERROR CODES */
6d311938 DSH	453	/* The following lines are auto generated by the script mkerr.pl. Any changes
	454	* made after this point may be overwritten when the script is next run.
	455	*/
	456
d02b48c6 RE	457	/* Error codes for the BN functions. */
	458
	459	/* Function codes. */
58964a49 RE	460	#define BN_F_BN_BLINDING_CONVERT 100
	461	#define BN_F_BN_BLINDING_INVERT 101
	462	#define BN_F_BN_BLINDING_NEW 102
	463	#define BN_F_BN_BLINDING_UPDATE 103
a0a54079 MC	464	#define BN_F_BN_BN2DEC 104
	465	#define BN_F_BN_BN2HEX 105
	466	#define BN_F_BN_CTX_NEW 106
	467	#define BN_F_BN_DIV 107
	468	#define BN_F_BN_EXPAND2 108
	469	#define BN_F_BN_MOD_EXP_MONT 109
	470	#define BN_F_BN_MOD_INVERSE 110
	471	#define BN_F_BN_MOD_MUL_RECIPROCAL 111
	472	#define BN_F_BN_MPI2BN 112
	473	#define BN_F_BN_NEW 113
	474	#define BN_F_BN_RAND 114
	475	#define BN_F_BN_USUB 115
d02b48c6 RE	476
d02b48c6 RE	477	/* Reason codes. */
dfeab068 RE	478	#define BN_R_ARG2_LT_ARG3 100
	479	#define BN_R_BAD_RECIPROCAL 101
	480	#define BN_R_CALLED_WITH_EVEN_MODULUS 102
	481	#define BN_R_DIV_BY_ZERO 103
	482	#define BN_R_ENCODING_ERROR 104
	483	#define BN_R_EXPAND_ON_STATIC_BIGNUM_DATA 105
	484	#define BN_R_INVALID_LENGTH 106
df82f5c8	485	#define BN_R_NOT_INITIALIZED 107
dfeab068	486	#define BN_R_NO_INVERSE 108
6d311938	487
d02b48c6 RE	488	#ifdef __cplusplus
	489	}
	490	#endif
	491	#endif
	492