[apple/security.git] / libsecurity_apple_csp / open_ssl / openssl / bn.h

/*
 * Copyright (c) 2000-2001 Apple Computer, Inc. All Rights Reserved.
 * 
 * The contents of this file constitute Original Code as defined in and are
 * subject to the Apple Public Source License Version 1.2 (the 'License').
 * You may not use this file except in compliance with the License. Please obtain
 * a copy of the License at http://www.apple.com/publicsource and read it before
 * using this file.
 * 
 * This Original Code and all software distributed under the License are
 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESS
 * OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, INCLUDING WITHOUT
 * LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
 * PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT. Please see the License for the
 * specific language governing rights and limitations under the License.
 */


/* 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 normal cc.  This would
 * be a common occurrence 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 assembler code. */
#if defined(MSDOS) || defined(WINDOWS) || defined(WIN32) || 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 relevant
 * assembler 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
#elif defined(__LP64__)
#define BN_ULLONG       unsigned
#else
#define BN_ULLONG	unsigned long long
#endif
#ifdef __LP64__
  /* still 32 bits here */
#define BN_ULONG        unsigned
#define BN_LONG         int
#else
#define BN_ULONG	unsigned long
#define BN_LONG		long
#endif
#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
#define BN_CTX_NUM_POS	12
typedef struct bignum_ctx
	{
	int tos;
	BIGNUM bn[BN_CTX_NUM];
	int flags;
	int depth;
	int pos[BN_CTX_NUM_POS];
	int too_many;
	} 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 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) */

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_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(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(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_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, 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 NO_FP_API
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(void *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_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_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);

#if		BN_PARAMS_ENABLE
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 */
#endif	/* BN_PARAMS_ENABLE */

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);

/* library internal functions */

#define bn_expand(a,bits) ((((((bits+BN_BITS2-1))/BN_BITS2)) <= (a)->max)?\
	(a):bn_expand2((a),(bits)/BN_BITS2+1))
#define bn_wexpand(a,words) (((words) <= (a)->max)?(a):bn_expand2((a),(words)))
BIGNUM *bn_expand2(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, 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);

#ifdef BN_DEBUG
  void bn_dump1(FILE *o, const char *a, 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)
#endif

/* 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_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_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_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_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_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_INVALID_RANGE				 115
#define BN_R_NOT_INITIALIZED				 107
#define BN_R_NO_INVERSE					 108
#define BN_R_TOO_MANY_TEMPORARY_VARIABLES		 109

#ifdef  __cplusplus
}
#endif
#endif
Commit	Line	Data
b1ab9ed8 A	1	/*
	2	* Copyright (c) 2000-2001 Apple Computer, Inc. All Rights Reserved.
	3	*
	4	* The contents of this file constitute Original Code as defined in and are
	5	* subject to the Apple Public Source License Version 1.2 (the 'License').
	6	* You may not use this file except in compliance with the License. Please obtain
	7	* a copy of the License at http://www.apple.com/publicsource and read it before
	8	* using this file.
	9	*
	10	* This Original Code and all software distributed under the License are
	11	* distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESS
	12	* OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, INCLUDING WITHOUT
	13	* LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
	14	* PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT. Please see the License for the
	15	* specific language governing rights and limitations under the License.
	16	*/
	17
	18
	19	/* crypto/bn/bn.h */
	20	/* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com)
	21	* All rights reserved.
	22	*
	23	* This package is an SSL implementation written
	24	* by Eric Young (eay@cryptsoft.com).
	25	* The implementation was written so as to conform with Netscapes SSL.
	26	*
	27	* This library is free for commercial and non-commercial use as long as
	28	* the following conditions are aheared to. The following conditions
	29	* apply to all code found in this distribution, be it the RC4, RSA,
	30	* lhash, DES, etc., code; not just the SSL code. The SSL documentation
	31	* included with this distribution is covered by the same copyright terms
	32	* except that the holder is Tim Hudson (tjh@cryptsoft.com).
	33	*
	34	* Copyright remains Eric Young's, and as such any Copyright notices in
	35	* the code are not to be removed.
	36	* If this package is used in a product, Eric Young should be given attribution
	37	* as the author of the parts of the library used.
	38	* This can be in the form of a textual message at program startup or
	39	* in documentation (online or textual) provided with the package.
	40	*
	41	* Redistribution and use in source and binary forms, with or without
	42	* modification, are permitted provided that the following conditions
	43	* are met:
	44	* 1. Redistributions of source code must retain the copyright
	45	* notice, this list of conditions and the following disclaimer.
	46	* 2. Redistributions in binary form must reproduce the above copyright
	47	* notice, this list of conditions and the following disclaimer in the
	48	* documentation and/or other materials provided with the distribution.
	49	* 3. All advertising materials mentioning features or use of this software
	50	* must display the following acknowledgement:
	51	* "This product includes cryptographic software written by
	52	* Eric Young (eay@cryptsoft.com)"
	53	* The word 'cryptographic' can be left out if the rouines from the library
	54	* being used are not cryptographic related :-).
	55	* 4. If you include any Windows specific code (or a derivative thereof) from
	56	* the apps directory (application code) you must include an acknowledgement:
	57	* "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
	58	*
	59	* THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
	60	* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
	61	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
	62	* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
	63	* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
	64	* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
65	* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
66	* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
67	* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
68	* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
69	* SUCH DAMAGE.
70	*
71	* The licence and distribution terms for any publically available version or
72	* derivative of this code cannot be changed. i.e. this code cannot simply be
73	* copied and put under another distribution licence
74	* [including the GNU Public Licence.]
75	*/
76
77	#ifndef HEADER_BN_H
78	#define HEADER_BN_H
79
80	#ifndef WIN16
81	#include <stdio.h> /* FILE */
82	#endif
83	#include <openssl/opensslconf.h>
84
85	#ifdef __cplusplus
86	extern "C" {
87	#endif
88
89	#ifdef VMS
90	#undef BN_LLONG /* experimental, so far... */
91	#endif
92
93	#define BN_MUL_COMBA
94	#define BN_SQR_COMBA
95	#define BN_RECURSION
96	#define RECP_MUL_MOD
97	#define MONT_MUL_MOD
98
99	/* This next option uses the C libraries (2 word)/(1 word) function.
100	* If it is not defined, I use my C version (which is slower).
101	* The reason for this flag is that when the particular C compiler
102	* library routine is used, and the library is linked with a different
103	* compiler, the library is missing. This mostly happens when the
104	* library is built with gcc and then linked using normal cc. This would
105	* be a common occurrence because gcc normally produces code that is
106	* 2 times faster than system compilers for the big number stuff.
107	* For machines with only one compiler (or shared libraries), this should
108	* be on. Again this in only really a problem on machines
109	* using "long long's", are 32bit, and are not using my assembler code. */
110	#if defined(MSDOS) \|\| defined(WINDOWS) \|\| defined(WIN32) \|\| defined(linux)
111	#define BN_DIV2W
112	#endif
113
114	/* assuming long is 64bit - this is the DEC Alpha
115	* unsigned long long is only 64 bits :-(, don't define
116	* BN_LLONG for the DEC Alpha */
117	#ifdef SIXTY_FOUR_BIT_LONG
118	#define BN_ULLONG unsigned long long
119	#define BN_ULONG unsigned long
120	#define BN_LONG long
121	#define BN_BITS 128
122	#define BN_BYTES 8
123	#define BN_BITS2 64
124	#define BN_BITS4 32
125	#define BN_MASK (0xffffffffffffffffffffffffffffffffLL)
126	#define BN_MASK2 (0xffffffffffffffffL)
127	#define BN_MASK2l (0xffffffffL)
128	#define BN_MASK2h (0xffffffff00000000L)
129	#define BN_MASK2h1 (0xffffffff80000000L)
130	#define BN_TBIT (0x8000000000000000L)
131	#define BN_DEC_CONV (10000000000000000000UL)
132	#define BN_DEC_FMT1 "%lu"
133	#define BN_DEC_FMT2 "%019lu"
134	#define BN_DEC_NUM 19
135	#endif
136
137	/* This is where the long long data type is 64 bits, but long is 32.
138	* For machines where there are 64bit registers, this is the mode to use.
139	* IRIX, on R4000 and above should use this mode, along with the relevant
140	* assembler code :-). Do NOT define BN_LLONG.
141	*/
142	#ifdef SIXTY_FOUR_BIT
143	#undef BN_LLONG
144	#undef BN_ULLONG
145	#define BN_ULONG unsigned long long
146	#define BN_LONG long long
147	#define BN_BITS 128
148	#define BN_BYTES 8
149	#define BN_BITS2 64
150	#define BN_BITS4 32
151	#define BN_MASK2 (0xffffffffffffffffLL)
152	#define BN_MASK2l (0xffffffffL)
153	#define BN_MASK2h (0xffffffff00000000LL)
154	#define BN_MASK2h1 (0xffffffff80000000LL)
155	#define BN_TBIT (0x8000000000000000LL)
156	#define BN_DEC_CONV (10000000000000000000LL)
157	#define BN_DEC_FMT1 "%llu"
158	#define BN_DEC_FMT2 "%019llu"
159	#define BN_DEC_NUM 19
160	#endif
161
162	#ifdef THIRTY_TWO_BIT
163	#if defined(WIN32) && !defined(__GNUC__)
164	#define BN_ULLONG unsigned _int64
165	#elif defined(__LP64__)
166	#define BN_ULLONG unsigned
167	#else
168	#define BN_ULLONG unsigned long long
169	#endif
170	#ifdef __LP64__
171	/* still 32 bits here */
172	#define BN_ULONG unsigned
173	#define BN_LONG int
174	#else
175	#define BN_ULONG unsigned long
176	#define BN_LONG long
177	#endif
178	#define BN_BITS 64
179	#define BN_BYTES 4
180	#define BN_BITS2 32
181	#define BN_BITS4 16
182	#ifdef WIN32
183	/* VC++ doesn't like the LL suffix */
184	#define BN_MASK (0xffffffffffffffffL)
185	#else
186	#define BN_MASK (0xffffffffffffffffLL)
187	#endif
188	#define BN_MASK2 (0xffffffffL)
189	#define BN_MASK2l (0xffff)
190	#define BN_MASK2h1 (0xffff8000L)
191	#define BN_MASK2h (0xffff0000L)
192	#define BN_TBIT (0x80000000L)
193	#define BN_DEC_CONV (1000000000L)
194	#define BN_DEC_FMT1 "%lu"
195	#define BN_DEC_FMT2 "%09lu"
196	#define BN_DEC_NUM 9
197	#endif
198
199	#ifdef SIXTEEN_BIT
200	#ifndef BN_DIV2W
201	#define BN_DIV2W
202	#endif
203	#define BN_ULLONG unsigned long
204	#define BN_ULONG unsigned short
205	#define BN_LONG short
206	#define BN_BITS 32
207	#define BN_BYTES 2
208	#define BN_BITS2 16
209	#define BN_BITS4 8
210	#define BN_MASK (0xffffffff)
211	#define BN_MASK2 (0xffff)
212	#define BN_MASK2l (0xff)
213	#define BN_MASK2h1 (0xff80)
214	#define BN_MASK2h (0xff00)
215	#define BN_TBIT (0x8000)
216	#define BN_DEC_CONV (100000)
217	#define BN_DEC_FMT1 "%u"
218	#define BN_DEC_FMT2 "%05u"
219	#define BN_DEC_NUM 5
220	#endif
221
222	#ifdef EIGHT_BIT
223	#ifndef BN_DIV2W
224	#define BN_DIV2W
225	#endif
226	#define BN_ULLONG unsigned short
227	#define BN_ULONG unsigned char
228	#define BN_LONG char
229	#define BN_BITS 16
230	#define BN_BYTES 1
231	#define BN_BITS2 8
232	#define BN_BITS4 4
233	#define BN_MASK (0xffff)
234	#define BN_MASK2 (0xff)
235	#define BN_MASK2l (0xf)
236	#define BN_MASK2h1 (0xf8)
237	#define BN_MASK2h (0xf0)
238	#define BN_TBIT (0x80)
239	#define BN_DEC_CONV (100)
240	#define BN_DEC_FMT1 "%u"
241	#define BN_DEC_FMT2 "%02u"
242	#define BN_DEC_NUM 2
243	#endif
244
245	#define BN_DEFAULT_BITS 1280
246
247	#ifdef BIGNUM
248	#undef BIGNUM
249	#endif
250
251	#define BN_FLG_MALLOCED 0x01
252	#define BN_FLG_STATIC_DATA 0x02
253	#define BN_FLG_FREE 0x8000 /* used for debuging */
254	#define BN_set_flags(b,n) ((b)->flags\|=(n))
255	#define BN_get_flags(b,n) ((b)->flags&(n))
256
257	typedef struct bignum_st
258	{
259	BN_ULONG d; / Pointer to an array of 'BN_BITS2' bit chunks. */
260	int top; /* Index of last used d +1. */
261	/* The next are internal book keeping for bn_expand. */
262	int max; /* Size of the d array. */
263	int neg; /* one if the number is negative */
264	int flags;
265	} BIGNUM;
266
267	/* Used for temp variables */
268	#define BN_CTX_NUM 12
269	#define BN_CTX_NUM_POS 12
270	typedef struct bignum_ctx
271	{
272	int tos;
273	BIGNUM bn[BN_CTX_NUM];
274	int flags;
275	int depth;
276	int pos[BN_CTX_NUM_POS];
277	int too_many;
278	} BN_CTX;
279
280	typedef struct bn_blinding_st
281	{
282	int init;
283	BIGNUM *A;
284	BIGNUM *Ai;
285	BIGNUM mod; / just a reference */
286	} BN_BLINDING;
287
288	/* Used for montgomery multiplication */
289	typedef struct bn_mont_ctx_st
290	{
291	int ri; /* number of bits in R */
292	BIGNUM RR; /* used to convert to montgomery form */
293	BIGNUM N; /* The modulus */
294	BIGNUM Ni; /* R(1/R mod N) - NNi = 1
295	* (Ni is only stored for bignum algorithm) */
296	BN_ULONG n0; /* least significant word of Ni */
297	int flags;
298	} BN_MONT_CTX;
299
300	/* Used for reciprocal division/mod functions
301	* It cannot be shared between threads
302	*/
303	typedef struct bn_recp_ctx_st
304	{
305	BIGNUM N; /* the divisor */
306	BIGNUM Nr; /* the reciprocal */
307	int num_bits;
308	int shift;
309	int flags;
310	} BN_RECP_CTX;
311
312	#define BN_to_montgomery(r,a,mont,ctx) BN_mod_mul_montgomery(\
313	r,a,&((mont)->RR),(mont),ctx)
314
315	#define BN_prime_checks 0 /* default: select number of iterations
316	based on the size of the number */
317
318	/* number of Miller-Rabin iterations for an error rate of less than 2^-80
319	* for random 'b'-bit input, b >= 100 (taken from table 4.4 in the Handbook
320	* of Applied Cryptography [Menezes, van Oorschot, Vanstone; CRC Press 1996];
321	* original paper: Damgaard, Landrock, Pomerance: Average case error estimates
322	* for the strong probable prime test. -- Math. Comp. 61 (1993) 177-194) */
323	#define BN_prime_checks_for_size(b) ((b) >= 1300 ? 2 : \
324	(b) >= 850 ? 3 : \
325	(b) >= 650 ? 4 : \
326	(b) >= 550 ? 5 : \
327	(b) >= 450 ? 6 : \
328	(b) >= 400 ? 7 : \
329	(b) >= 350 ? 8 : \
330	(b) >= 300 ? 9 : \
331	(b) >= 250 ? 12 : \
332	(b) >= 200 ? 15 : \
333	(b) >= 150 ? 18 : \
334	/* b >= 100 */ 27)
335
336	#define BN_num_bytes(a) ((BN_num_bits(a)+7)/8)
337	#define BN_is_word(a,w) (((a)->top == 1) && ((a)->d[0] == (BN_ULONG)(w)))
338	#define BN_is_zero(a) (((a)->top == 0) \|\| BN_is_word(a,0))
339	#define BN_is_one(a) (BN_is_word((a),1))
340	#define BN_is_odd(a) (((a)->top > 0) && ((a)->d[0] & 1))
341	#define BN_one(a) (BN_set_word((a),1))
342	#define BN_zero(a) (BN_set_word((a),0))
343
344	/#define BN_ascii2bn(a) BN_hex2bn(a) /
345	/#define BN_bn2ascii(a) BN_bn2hex(a) /
346
347	BIGNUM *BN_value_one(void);
348	char * BN_options(void);
349	BN_CTX *BN_CTX_new(void);
350	void BN_CTX_init(BN_CTX *c);
351	void BN_CTX_free(BN_CTX *c);
352	void BN_CTX_start(BN_CTX *ctx);
353	BIGNUM BN_CTX_get(BN_CTX ctx);
354	void BN_CTX_end(BN_CTX *ctx);
355	int BN_rand(BIGNUM *rnd, int bits, int top,int bottom);
356	int BN_pseudo_rand(BIGNUM *rnd, int bits, int top,int bottom);
357	int BN_rand_range(BIGNUM rnd, BIGNUM range);
358	int BN_num_bits(const BIGNUM *a);
359	int BN_num_bits_word(BN_ULONG);
360	BIGNUM *BN_new(void);
361	void BN_init(BIGNUM *);
362	void BN_clear_free(BIGNUM *a);
363	BIGNUM BN_copy(BIGNUM a, const BIGNUM *b);
364	BIGNUM BN_bin2bn(const unsigned char s,int len,BIGNUM *ret);
365	int BN_bn2bin(const BIGNUM a, unsigned char to);
366	BIGNUM BN_mpi2bn(unsigned char s,int len,BIGNUM *ret);
367	int BN_bn2mpi(const BIGNUM a, unsigned char to);
368	int BN_sub(BIGNUM r, const BIGNUM a, const BIGNUM *b);
369	int BN_usub(BIGNUM r, const BIGNUM a, const BIGNUM *b);
370	int BN_uadd(BIGNUM r, const BIGNUM a, const BIGNUM *b);
371	int BN_add(BIGNUM r, const BIGNUM a, const BIGNUM *b);
372	int BN_mod(BIGNUM rem, const BIGNUM m, const BIGNUM d, BN_CTX ctx);
373	int BN_div(BIGNUM dv, BIGNUM rem, const BIGNUM m, const BIGNUM d,
374	BN_CTX *ctx);
375	int BN_mul(BIGNUM r, BIGNUM a, BIGNUM b, BN_CTX ctx);
376	int BN_sqr(BIGNUM r, BIGNUM a,BN_CTX *ctx);
377	BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w);
378	BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w);
379	int BN_mul_word(BIGNUM *a, BN_ULONG w);
380	int BN_add_word(BIGNUM *a, BN_ULONG w);
381	int BN_sub_word(BIGNUM *a, BN_ULONG w);
382	int BN_set_word(BIGNUM *a, BN_ULONG w);
383	BN_ULONG BN_get_word(BIGNUM *a);
384	int BN_cmp(const BIGNUM a, const BIGNUM b);
385	void BN_free(BIGNUM *a);
386	int BN_is_bit_set(const BIGNUM *a, int n);
387	int BN_lshift(BIGNUM r, const BIGNUM a, int n);
388	int BN_lshift1(BIGNUM r, BIGNUM a);
389	int BN_exp(BIGNUM r, BIGNUM a, BIGNUM p,BN_CTX ctx);
390	int BN_mod_exp(BIGNUM r, BIGNUM a, const BIGNUM *p,
391	const BIGNUM m,BN_CTX ctx);
392	int BN_mod_exp_mont(BIGNUM r, BIGNUM a, const BIGNUM *p,
393	const BIGNUM m, BN_CTX ctx, BN_MONT_CTX *m_ctx);
394	int BN_mod_exp_mont_word(BIGNUM r, BN_ULONG a, const BIGNUM p,
395	const BIGNUM m, BN_CTX ctx, BN_MONT_CTX *m_ctx);
396	int BN_mod_exp2_mont(BIGNUM r, BIGNUM a1, BIGNUM p1,BIGNUM a2,
397	BIGNUM p2,BIGNUM m,BN_CTX ctx,BN_MONT_CTX m_ctx);
398	int BN_mod_exp_simple(BIGNUM r, BIGNUM a, BIGNUM *p,
399	BIGNUM m,BN_CTX ctx);
400	int BN_mask_bits(BIGNUM *a,int n);
401	int BN_mod_mul(BIGNUM ret, BIGNUM a, BIGNUM b, const BIGNUM m, BN_CTX *ctx);
402	#ifndef NO_FP_API
403	int BN_print_fp(FILE fp, const BIGNUM a);
404	#endif
405	#ifdef HEADER_BIO_H
406	int BN_print(BIO fp, const BIGNUM a);
407	#else
408	int BN_print(void fp, const BIGNUM a);
409	#endif
410	int BN_reciprocal(BIGNUM r, BIGNUM m, int len, BN_CTX *ctx);
411	int BN_rshift(BIGNUM r, BIGNUM a, int n);
412	int BN_rshift1(BIGNUM r, BIGNUM a);
413	void BN_clear(BIGNUM *a);
414	BIGNUM BN_dup(const BIGNUM a);
415	int BN_ucmp(const BIGNUM a, const BIGNUM b);
416	int BN_set_bit(BIGNUM *a, int n);
417	int BN_clear_bit(BIGNUM *a, int n);
418	char * BN_bn2hex(const BIGNUM *a);
419	char * BN_bn2dec(const BIGNUM *a);
420	int BN_hex2bn(BIGNUM *a, const char str);
421	int BN_dec2bn(BIGNUM *a, const char str);
422	int BN_gcd(BIGNUM r,BIGNUM in_a,BIGNUM in_b,BN_CTX ctx);
423	BIGNUM BN_mod_inverse(BIGNUM ret,BIGNUM a, const BIGNUM n,BN_CTX *ctx);
424	BIGNUM BN_generate_prime(BIGNUM ret,int bits,int safe,BIGNUM *add,
425	BIGNUM rem,void (callback)(int,int,void ),void cb_arg);
426	int BN_is_prime(const BIGNUM *p,int nchecks,
427	void (callback)(int,int,void ),
428	BN_CTX ctx,void cb_arg);
429	int BN_is_prime_fasttest(const BIGNUM *p,int nchecks,
430	void (callback)(int,int,void ),BN_CTX ctx,void cb_arg,
431	int do_trial_division);
432	void ERR_load_BN_strings(void );
433
434	BN_MONT_CTX *BN_MONT_CTX_new(void );
435	void BN_MONT_CTX_init(BN_MONT_CTX *ctx);
436	int BN_mod_mul_montgomery(BIGNUM r,BIGNUM a,BIGNUM b,BN_MONT_CTX mont,
437	BN_CTX *ctx);
438	int BN_from_montgomery(BIGNUM r,BIGNUM a,BN_MONT_CTX mont,BN_CTX ctx);
439	void BN_MONT_CTX_free(BN_MONT_CTX *mont);
440	int BN_MONT_CTX_set(BN_MONT_CTX mont,const BIGNUM modulus,BN_CTX *ctx);
441	BN_MONT_CTX BN_MONT_CTX_copy(BN_MONT_CTX to,BN_MONT_CTX *from);
442
443	BN_BLINDING BN_BLINDING_new(BIGNUM A,BIGNUM Ai,BIGNUM mod);
444	void BN_BLINDING_free(BN_BLINDING *b);
445	int BN_BLINDING_update(BN_BLINDING b,BN_CTX ctx);
446	int BN_BLINDING_convert(BIGNUM n, BN_BLINDING r, BN_CTX *ctx);
447	int BN_BLINDING_invert(BIGNUM n, BN_BLINDING b, BN_CTX *ctx);
448
449	#if BN_PARAMS_ENABLE
450	void BN_set_params(int mul,int high,int low,int mont);
451	int BN_get_params(int which); /* 0, mul, 1 high, 2 low, 3 mont */
452	#endif /* BN_PARAMS_ENABLE */
453
454	void BN_RECP_CTX_init(BN_RECP_CTX *recp);
455	BN_RECP_CTX *BN_RECP_CTX_new(void);
456	void BN_RECP_CTX_free(BN_RECP_CTX *recp);
457	int BN_RECP_CTX_set(BN_RECP_CTX recp,const BIGNUM rdiv,BN_CTX *ctx);
458	int BN_mod_mul_reciprocal(BIGNUM r, BIGNUM x, BIGNUM *y,
459	BN_RECP_CTX recp,BN_CTX ctx);
460	int BN_mod_exp_recp(BIGNUM r, const BIGNUM a, const BIGNUM *p,
461	const BIGNUM m, BN_CTX ctx);
462	int BN_div_recp(BIGNUM dv, BIGNUM rem, BIGNUM *m,
463	BN_RECP_CTX recp, BN_CTX ctx);
464
465	/* library internal functions */
466
467	#define bn_expand(a,bits) ((((((bits+BN_BITS2-1))/BN_BITS2)) <= (a)->max)?\
468	(a):bn_expand2((a),(bits)/BN_BITS2+1))
469	#define bn_wexpand(a,words) (((words) <= (a)->max)?(a):bn_expand2((a),(words)))
470	BIGNUM bn_expand2(BIGNUM a, int words);
471
472	#define bn_fix_top(a) \
473	{ \
474	BN_ULONG *ftl; \
475	if ((a)->top > 0) \
476	{ \
477	for (ftl= &((a)->d[(a)->top-1]); (a)->top > 0; (a)->top--) \
478	if (*(ftl--)) break; \
479	} \
480	}
481
482	BN_ULONG bn_mul_add_words(BN_ULONG rp, BN_ULONG ap, int num, BN_ULONG w);
483	BN_ULONG bn_mul_words(BN_ULONG rp, BN_ULONG ap, int num, BN_ULONG w);
484	void bn_sqr_words(BN_ULONG rp, BN_ULONG ap, int num);
485	BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d);
486	BN_ULONG bn_add_words(BN_ULONG rp, BN_ULONG ap, BN_ULONG *bp,int num);
487	BN_ULONG bn_sub_words(BN_ULONG rp, BN_ULONG ap, BN_ULONG *bp,int num);
488
489	#ifdef BN_DEBUG
490	void bn_dump1(FILE o, const char a, BN_ULONG *b,int n);
491	# define bn_print(a) {fprintf(stderr, #a "="); BN_print_fp(stderr,a); \
492	fprintf(stderr,"\n");}
493	# define bn_dump(a,n) bn_dump1(stderr,#a,a,n);
494	#else
495	# define bn_print(a)
496	# define bn_dump(a,b)
497	#endif
498
499	/* BEGIN ERROR CODES */
500	/* The following lines are auto generated by the script mkerr.pl. Any changes
501	* made after this point may be overwritten when the script is next run.
502	*/
503
504	/* Error codes for the BN functions. */
505
506	/* Function codes. */
507	#define BN_F_BN_BLINDING_CONVERT 100
508	#define BN_F_BN_BLINDING_INVERT 101
509	#define BN_F_BN_BLINDING_NEW 102
510	#define BN_F_BN_BLINDING_UPDATE 103
511	#define BN_F_BN_BN2DEC 104
512	#define BN_F_BN_BN2HEX 105
513	#define BN_F_BN_CTX_GET 116
514	#define BN_F_BN_CTX_NEW 106
515	#define BN_F_BN_DIV 107
516	#define BN_F_BN_EXPAND2 108
517	#define BN_F_BN_MOD_EXP_MONT 109
518	#define BN_F_BN_MOD_EXP_MONT_WORD 117
519	#define BN_F_BN_MOD_INVERSE 110
520	#define BN_F_BN_MOD_MUL_RECIPROCAL 111
521	#define BN_F_BN_MPI2BN 112
522	#define BN_F_BN_NEW 113
523	#define BN_F_BN_RAND 114
524	#define BN_F_BN_RAND_RANGE 122
525	#define BN_F_BN_USUB 115
526
527	/* Reason codes. */
528	#define BN_R_ARG2_LT_ARG3 100
529	#define BN_R_BAD_RECIPROCAL 101
530	#define BN_R_CALLED_WITH_EVEN_MODULUS 102
531	#define BN_R_DIV_BY_ZERO 103
532	#define BN_R_ENCODING_ERROR 104
533	#define BN_R_EXPAND_ON_STATIC_BIGNUM_DATA 105
534	#define BN_R_INVALID_LENGTH 106
535	#define BN_R_INVALID_RANGE 115
536	#define BN_R_NOT_INITIALIZED 107
537	#define BN_R_NO_INVERSE 108
538	#define BN_R_TOO_MANY_TEMPORARY_VARIABLES 109
539
540	#ifdef __cplusplus
541	}
542	#endif
543	#endif
544