williamr@2: /* crypto/bn/bn.h */ williamr@2: /* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com) williamr@2: * All rights reserved. williamr@2: * williamr@2: * This package is an SSL implementation written williamr@2: * by Eric Young (eay@cryptsoft.com). williamr@2: * The implementation was written so as to conform with Netscapes SSL. williamr@2: * williamr@2: * This library is free for commercial and non-commercial use as long as williamr@2: * the following conditions are aheared to. The following conditions williamr@2: * apply to all code found in this distribution, be it the RC4, RSA, williamr@2: * lhash, DES, etc., code; not just the SSL code. The SSL documentation williamr@2: * included with this distribution is covered by the same copyright terms williamr@2: * except that the holder is Tim Hudson (tjh@cryptsoft.com). williamr@2: * williamr@2: * Copyright remains Eric Young's, and as such any Copyright notices in williamr@2: * the code are not to be removed. williamr@2: * If this package is used in a product, Eric Young should be given attribution williamr@2: * as the author of the parts of the library used. williamr@2: * This can be in the form of a textual message at program startup or williamr@2: * in documentation (online or textual) provided with the package. williamr@2: * williamr@2: * Redistribution and use in source and binary forms, with or without williamr@2: * modification, are permitted provided that the following conditions williamr@2: * are met: williamr@2: * 1. Redistributions of source code must retain the copyright williamr@2: * notice, this list of conditions and the following disclaimer. williamr@2: * 2. Redistributions in binary form must reproduce the above copyright williamr@2: * notice, this list of conditions and the following disclaimer in the williamr@2: * documentation and/or other materials provided with the distribution. williamr@2: * 3. All advertising materials mentioning features or use of this software williamr@2: * must display the following acknowledgement: williamr@2: * "This product includes cryptographic software written by williamr@2: * Eric Young (eay@cryptsoft.com)" williamr@2: * The word 'cryptographic' can be left out if the rouines from the library williamr@2: * being used are not cryptographic related :-). williamr@2: * 4. If you include any Windows specific code (or a derivative thereof) from williamr@2: * the apps directory (application code) you must include an acknowledgement: williamr@2: * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" williamr@2: * williamr@2: * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND williamr@2: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE williamr@2: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE williamr@2: * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE williamr@2: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL williamr@2: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS williamr@2: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) williamr@2: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT williamr@2: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY williamr@2: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF williamr@2: * SUCH DAMAGE. williamr@2: * williamr@2: * The licence and distribution terms for any publically available version or williamr@2: * derivative of this code cannot be changed. i.e. this code cannot simply be williamr@2: * copied and put under another distribution licence williamr@2: * [including the GNU Public Licence.] williamr@2: */ williamr@2: /* ==================================================================== williamr@2: * Copyright 2002 Sun Microsystems, Inc. ALL RIGHTS RESERVED. williamr@2: * williamr@2: * Portions of the attached software ("Contribution") are developed by williamr@2: * SUN MICROSYSTEMS, INC., and are contributed to the OpenSSL project. williamr@2: * williamr@2: * The Contribution is licensed pursuant to the Eric Young open source williamr@2: * license provided above. williamr@2: * williamr@2: * The binary polynomial arithmetic software is originally written by williamr@2: * Sheueling Chang Shantz and Douglas Stebila of Sun Microsystems Laboratories. williamr@2: * williamr@2: */ williamr@2: /* williamr@2: © Portions copyright (c) 2006 Nokia Corporation. All rights reserved. williamr@2: */ williamr@2: williamr@2: #ifndef HEADER_BN_H williamr@2: #define HEADER_BN_H williamr@2: williamr@2: #if (defined(__SYMBIAN32__) && !defined(SYMBIAN)) williamr@2: #define SYMBIAN williamr@2: #endif williamr@2: williamr@2: #ifdef SYMBIAN williamr@2: #include williamr@2: #endif williamr@2: #include williamr@2: #ifndef OPENSSL_NO_FP_API williamr@2: #include /* FILE */ williamr@2: #endif williamr@2: #include williamr@2: williamr@2: #ifdef __cplusplus williamr@2: extern "C" { williamr@2: #endif williamr@2: williamr@2: /* These preprocessor symbols control various aspects of the bignum headers and williamr@2: * library code. They're not defined by any "normal" configuration, as they are williamr@2: * intended for development and testing purposes. NB: defining all three can be williamr@2: * useful for debugging application code as well as openssl itself. williamr@2: * williamr@2: * BN_DEBUG - turn on various debugging alterations to the bignum code williamr@2: * BN_DEBUG_RAND - uses random poisoning of unused words to trip up williamr@2: * mismanagement of bignum internals. You must also define BN_DEBUG. williamr@2: */ williamr@2: /* #define BN_DEBUG */ williamr@2: /* #define BN_DEBUG_RAND */ williamr@2: williamr@2: #define BN_MUL_COMBA williamr@2: #define BN_SQR_COMBA williamr@2: #define BN_RECURSION williamr@2: williamr@2: /* This next option uses the C libraries (2 word)/(1 word) function. williamr@2: * If it is not defined, I use my C version (which is slower). williamr@2: * The reason for this flag is that when the particular C compiler williamr@2: * library routine is used, and the library is linked with a different williamr@2: * compiler, the library is missing. This mostly happens when the williamr@2: * library is built with gcc and then linked using normal cc. This would williamr@2: * be a common occurrence because gcc normally produces code that is williamr@2: * 2 times faster than system compilers for the big number stuff. williamr@2: * For machines with only one compiler (or shared libraries), this should williamr@2: * be on. Again this in only really a problem on machines williamr@2: * using "long long's", are 32bit, and are not using my assembler code. */ williamr@2: #if defined(OPENSSL_SYS_MSDOS) || defined(OPENSSL_SYS_WINDOWS) || \ williamr@2: defined(OPENSSL_SYS_WIN32) || defined(linux) williamr@2: # ifndef BN_DIV2W williamr@2: # define BN_DIV2W williamr@2: # endif williamr@2: #endif williamr@2: williamr@2: /* assuming long is 64bit - this is the DEC Alpha williamr@2: * unsigned long long is only 64 bits :-(, don't define williamr@2: * BN_LLONG for the DEC Alpha */ williamr@2: #ifdef SIXTY_FOUR_BIT_LONG williamr@2: #define BN_ULLONG unsigned long long williamr@2: #define BN_ULONG unsigned long williamr@2: #define BN_LONG long williamr@2: #define BN_BITS 128 williamr@2: #define BN_BYTES 8 williamr@2: #define BN_BITS2 64 williamr@2: #define BN_BITS4 32 williamr@2: #define BN_MASK (0xffffffffffffffffffffffffffffffffLL) williamr@2: #define BN_MASK2 (0xffffffffffffffffL) williamr@2: #define BN_MASK2l (0xffffffffL) williamr@2: #define BN_MASK2h (0xffffffff00000000L) williamr@2: #define BN_MASK2h1 (0xffffffff80000000L) williamr@2: #define BN_TBIT (0x8000000000000000L) williamr@2: #define BN_DEC_CONV (10000000000000000000UL) williamr@2: #define BN_DEC_FMT1 "%lu" williamr@2: #define BN_DEC_FMT2 "%019lu" williamr@2: #define BN_DEC_NUM 19 williamr@2: #endif williamr@2: williamr@2: /* This is where the long long data type is 64 bits, but long is 32. williamr@2: * For machines where there are 64bit registers, this is the mode to use. williamr@2: * IRIX, on R4000 and above should use this mode, along with the relevant williamr@2: * assembler code :-). Do NOT define BN_LLONG. williamr@2: */ williamr@2: #ifdef SIXTY_FOUR_BIT williamr@2: #undef BN_LLONG williamr@2: #undef BN_ULLONG williamr@2: #define BN_ULONG unsigned long long williamr@2: #define BN_LONG long long williamr@2: #define BN_BITS 128 williamr@2: #define BN_BYTES 8 williamr@2: #define BN_BITS2 64 williamr@2: #define BN_BITS4 32 williamr@2: #define BN_MASK2 (0xffffffffffffffffLL) williamr@2: #define BN_MASK2l (0xffffffffL) williamr@2: #define BN_MASK2h (0xffffffff00000000LL) williamr@2: #define BN_MASK2h1 (0xffffffff80000000LL) williamr@2: #define BN_TBIT (0x8000000000000000LL) williamr@2: #define BN_DEC_CONV (10000000000000000000ULL) williamr@2: #define BN_DEC_FMT1 "%llu" williamr@2: #define BN_DEC_FMT2 "%019llu" williamr@2: #define BN_DEC_NUM 19 williamr@2: #endif williamr@2: williamr@2: #ifdef THIRTY_TWO_BIT williamr@2: #ifdef BN_LLONG williamr@2: # if defined(OPENSSL_SYS_WIN32) && !defined(__GNUC__) williamr@2: # define BN_ULLONG unsigned __int64 williamr@2: # else williamr@2: # define BN_ULLONG unsigned long long williamr@2: # endif williamr@2: #endif williamr@2: #define BN_ULONG unsigned long williamr@2: #define BN_LONG long williamr@2: #define BN_BITS 64 williamr@2: #define BN_BYTES 4 williamr@2: #define BN_BITS2 32 williamr@2: #define BN_BITS4 16 williamr@2: #ifdef OPENSSL_SYS_WIN32 williamr@2: /* VC++ doesn't like the LL suffix */ williamr@2: #define BN_MASK (0xffffffffffffffffL) williamr@2: #else williamr@2: #define BN_MASK (0xffffffffffffffffLL) williamr@2: #endif williamr@2: #define BN_MASK2 (0xffffffffL) williamr@2: #define BN_MASK2l (0xffff) williamr@2: #define BN_MASK2h1 (0xffff8000L) williamr@2: #define BN_MASK2h (0xffff0000L) williamr@2: #define BN_TBIT (0x80000000L) williamr@2: #define BN_DEC_CONV (1000000000L) williamr@2: #define BN_DEC_FMT1 "%lu" williamr@2: #define BN_DEC_FMT2 "%09lu" williamr@2: #define BN_DEC_NUM 9 williamr@2: #endif williamr@2: williamr@2: #ifdef SIXTEEN_BIT williamr@2: #ifndef BN_DIV2W williamr@2: #define BN_DIV2W williamr@2: #endif williamr@2: #define BN_ULLONG unsigned long williamr@2: #define BN_ULONG unsigned short williamr@2: #define BN_LONG short williamr@2: #define BN_BITS 32 williamr@2: #define BN_BYTES 2 williamr@2: #define BN_BITS2 16 williamr@2: #define BN_BITS4 8 williamr@2: #define BN_MASK (0xffffffff) williamr@2: #define BN_MASK2 (0xffff) williamr@2: #define BN_MASK2l (0xff) williamr@2: #define BN_MASK2h1 (0xff80) williamr@2: #define BN_MASK2h (0xff00) williamr@2: #define BN_TBIT (0x8000) williamr@2: #define BN_DEC_CONV (100000) williamr@2: #define BN_DEC_FMT1 "%u" williamr@2: #define BN_DEC_FMT2 "%05u" williamr@2: #define BN_DEC_NUM 5 williamr@2: #endif williamr@2: williamr@2: #ifdef EIGHT_BIT williamr@2: #ifndef BN_DIV2W williamr@2: #define BN_DIV2W williamr@2: #endif williamr@2: #define BN_ULLONG unsigned short williamr@2: #define BN_ULONG unsigned char williamr@2: #define BN_LONG char williamr@2: #define BN_BITS 16 williamr@2: #define BN_BYTES 1 williamr@2: #define BN_BITS2 8 williamr@2: #define BN_BITS4 4 williamr@2: #define BN_MASK (0xffff) williamr@2: #define BN_MASK2 (0xff) williamr@2: #define BN_MASK2l (0xf) williamr@2: #define BN_MASK2h1 (0xf8) williamr@2: #define BN_MASK2h (0xf0) williamr@2: #define BN_TBIT (0x80) williamr@2: #define BN_DEC_CONV (100) williamr@2: #define BN_DEC_FMT1 "%u" williamr@2: #define BN_DEC_FMT2 "%02u" williamr@2: #define BN_DEC_NUM 2 williamr@2: #endif williamr@2: williamr@2: #define BN_DEFAULT_BITS 1280 williamr@2: williamr@2: #define BN_FLG_MALLOCED 0x01 williamr@2: #define BN_FLG_STATIC_DATA 0x02 williamr@2: #define BN_FLG_CONSTTIME 0x04 /* avoid leaking exponent information through timing, williamr@2: * BN_mod_exp_mont() will call BN_mod_exp_mont_consttime, williamr@2: * BN_div() will call BN_div_no_branch, williamr@2: * BN_mod_inverse() will call BN_mod_inverse_no_branch. williamr@2: */ williamr@2: williamr@2: #ifndef OPENSSL_NO_DEPRECATED williamr@2: #define BN_FLG_EXP_CONSTTIME BN_FLG_CONSTTIME /* deprecated name for the flag */ williamr@2: /* avoid leaking exponent information through timings williamr@2: * (BN_mod_exp_mont() will call BN_mod_exp_mont_consttime) */ williamr@2: #endif williamr@2: #ifndef OPENSSL_NO_DEPRECATED williamr@2: #define BN_FLG_FREE 0x8000 /* used for debuging */ williamr@2: #endif williamr@2: #define BN_set_flags(b,n) ((b)->flags|=(n)) williamr@2: #define BN_get_flags(b,n) ((b)->flags&(n)) williamr@2: williamr@2: /* get a clone of a BIGNUM with changed flags, for *temporary* use only williamr@2: * (the two BIGNUMs cannot not be used in parallel!) */ williamr@2: #define BN_with_flags(dest,b,n) ((dest)->d=(b)->d, \ williamr@2: (dest)->top=(b)->top, \ williamr@2: (dest)->dmax=(b)->dmax, \ williamr@2: (dest)->neg=(b)->neg, \ williamr@2: (dest)->flags=(((dest)->flags & BN_FLG_MALLOCED) \ williamr@2: | ((b)->flags & ~BN_FLG_MALLOCED) \ williamr@2: | BN_FLG_STATIC_DATA \ williamr@2: | (n))) williamr@2: williamr@2: /* Already declared in ossl_typ.h */ williamr@2: #if 0 williamr@2: typedef struct bignum_st BIGNUM; williamr@2: /* Used for temp variables (declaration hidden in bn_lcl.h) */ williamr@2: typedef struct bignum_ctx BN_CTX; williamr@2: typedef struct bn_blinding_st BN_BLINDING; williamr@2: typedef struct bn_mont_ctx_st BN_MONT_CTX; williamr@2: typedef struct bn_recp_ctx_st BN_RECP_CTX; williamr@2: typedef struct bn_gencb_st BN_GENCB; williamr@2: #endif williamr@2: williamr@2: struct bignum_st williamr@2: { williamr@2: BN_ULONG *d; /* Pointer to an array of 'BN_BITS2' bit chunks. */ williamr@2: int top; /* Index of last used d +1. */ williamr@2: /* The next are internal book keeping for bn_expand. */ williamr@2: int dmax; /* Size of the d array. */ williamr@2: int neg; /* one if the number is negative */ williamr@2: int flags; williamr@2: }; williamr@2: williamr@2: /* Used for montgomery multiplication */ williamr@2: struct bn_mont_ctx_st williamr@2: { williamr@2: int ri; /* number of bits in R */ williamr@2: BIGNUM RR; /* used to convert to montgomery form */ williamr@2: BIGNUM N; /* The modulus */ williamr@2: BIGNUM Ni; /* R*(1/R mod N) - N*Ni = 1 williamr@2: * (Ni is only stored for bignum algorithm) */ williamr@2: BN_ULONG n0; /* least significant word of Ni */ williamr@2: int flags; williamr@2: }; williamr@2: williamr@2: /* Used for reciprocal division/mod functions williamr@2: * It cannot be shared between threads williamr@2: */ williamr@2: struct bn_recp_ctx_st williamr@2: { williamr@2: BIGNUM N; /* the divisor */ williamr@2: BIGNUM Nr; /* the reciprocal */ williamr@2: int num_bits; williamr@2: int shift; williamr@2: int flags; williamr@2: }; williamr@2: williamr@2: /* Used for slow "generation" functions. */ williamr@2: struct bn_gencb_st williamr@2: { williamr@2: unsigned int ver; /* To handle binary (in)compatibility */ williamr@2: void *arg; /* callback-specific data */ williamr@2: union williamr@2: { williamr@2: /* if(ver==1) - handles old style callbacks */ williamr@2: void (*cb_1)(int, int, void *); williamr@2: /* if(ver==2) - new callback style */ williamr@2: int (*cb_2)(int, int, BN_GENCB *); williamr@2: } cb; williamr@2: }; williamr@2: /* Wrapper function to make using BN_GENCB easier, */ williamr@2: IMPORT_C int BN_GENCB_call(BN_GENCB *cb, int a, int b); williamr@2: /* Macro to populate a BN_GENCB structure with an "old"-style callback */ williamr@2: #define BN_GENCB_set_old(gencb, callback, cb_arg) { \ williamr@2: BN_GENCB *tmp_gencb = (gencb); \ williamr@2: tmp_gencb->ver = 1; \ williamr@2: tmp_gencb->arg = (cb_arg); \ williamr@2: tmp_gencb->cb.cb_1 = (callback); } williamr@2: /* Macro to populate a BN_GENCB structure with a "new"-style callback */ williamr@2: #define BN_GENCB_set(gencb, callback, cb_arg) { \ williamr@2: BN_GENCB *tmp_gencb = (gencb); \ williamr@2: tmp_gencb->ver = 2; \ williamr@2: tmp_gencb->arg = (cb_arg); \ williamr@2: tmp_gencb->cb.cb_2 = (callback); } williamr@2: williamr@2: #define BN_prime_checks 0 /* default: select number of iterations williamr@2: based on the size of the number */ williamr@2: williamr@2: /* number of Miller-Rabin iterations for an error rate of less than 2^-80 williamr@2: * for random 'b'-bit input, b >= 100 (taken from table 4.4 in the Handbook williamr@2: * of Applied Cryptography [Menezes, van Oorschot, Vanstone; CRC Press 1996]; williamr@2: * original paper: Damgaard, Landrock, Pomerance: Average case error estimates williamr@2: * for the strong probable prime test. -- Math. Comp. 61 (1993) 177-194) */ williamr@2: #define BN_prime_checks_for_size(b) ((b) >= 1300 ? 2 : \ williamr@2: (b) >= 850 ? 3 : \ williamr@2: (b) >= 650 ? 4 : \ williamr@2: (b) >= 550 ? 5 : \ williamr@2: (b) >= 450 ? 6 : \ williamr@2: (b) >= 400 ? 7 : \ williamr@2: (b) >= 350 ? 8 : \ williamr@2: (b) >= 300 ? 9 : \ williamr@2: (b) >= 250 ? 12 : \ williamr@2: (b) >= 200 ? 15 : \ williamr@2: (b) >= 150 ? 18 : \ williamr@2: /* b >= 100 */ 27) williamr@2: williamr@2: #define BN_num_bytes(a) ((BN_num_bits(a)+7)/8) williamr@2: williamr@2: /* Note that BN_abs_is_word didn't work reliably for w == 0 until 0.9.8 */ williamr@2: #define BN_abs_is_word(a,w) ((((a)->top == 1) && ((a)->d[0] == (BN_ULONG)(w))) || \ williamr@2: (((w) == 0) && ((a)->top == 0))) williamr@2: #define BN_is_zero(a) ((a)->top == 0) williamr@2: #define BN_is_one(a) (BN_abs_is_word((a),1) && !(a)->neg) williamr@2: #define BN_is_word(a,w) (BN_abs_is_word((a),(w)) && (!(w) || !(a)->neg)) williamr@2: #define BN_is_odd(a) (((a)->top > 0) && ((a)->d[0] & 1)) williamr@2: williamr@2: #define BN_one(a) (BN_set_word((a),1)) williamr@2: #define BN_zero_ex(a) \ williamr@2: do { \ williamr@2: BIGNUM *_tmp_bn = (a); \ williamr@2: _tmp_bn->top = 0; \ williamr@2: _tmp_bn->neg = 0; \ williamr@2: } while(0) williamr@2: #ifdef OPENSSL_NO_DEPRECATED williamr@2: #define BN_zero(a) BN_zero_ex(a) williamr@2: #else williamr@2: #define BN_zero(a) (BN_set_word((a),0)) williamr@2: #endif williamr@2: williamr@2: IMPORT_C const BIGNUM *BN_value_one(void); williamr@2: IMPORT_C char * BN_options(void); williamr@2: IMPORT_C BN_CTX *BN_CTX_new(void); williamr@2: #ifndef OPENSSL_NO_DEPRECATED williamr@2: IMPORT_C void BN_CTX_init(BN_CTX *c); williamr@2: #endif williamr@2: IMPORT_C void BN_CTX_free(BN_CTX *c); williamr@2: IMPORT_C void BN_CTX_start(BN_CTX *ctx); williamr@2: IMPORT_C BIGNUM *BN_CTX_get(BN_CTX *ctx); williamr@2: IMPORT_C void BN_CTX_end(BN_CTX *ctx); williamr@2: IMPORT_C int BN_rand(BIGNUM *rnd, int bits, int top,int bottom); williamr@2: IMPORT_C int BN_pseudo_rand(BIGNUM *rnd, int bits, int top,int bottom); williamr@2: IMPORT_C int BN_rand_range(BIGNUM *rnd, BIGNUM *range); williamr@2: IMPORT_C int BN_pseudo_rand_range(BIGNUM *rnd, BIGNUM *range); williamr@2: IMPORT_C int BN_num_bits(const BIGNUM *a); williamr@2: IMPORT_C int BN_num_bits_word(BN_ULONG); williamr@2: IMPORT_C BIGNUM *BN_new(void); williamr@2: IMPORT_C void BN_init(BIGNUM *); williamr@2: IMPORT_C void BN_clear_free(BIGNUM *a); williamr@2: IMPORT_C BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b); williamr@2: IMPORT_C void BN_swap(BIGNUM *a, BIGNUM *b); williamr@2: IMPORT_C BIGNUM *BN_bin2bn(const unsigned char *s,int len,BIGNUM *ret); williamr@2: IMPORT_C int BN_bn2bin(const BIGNUM *a, unsigned char *to); williamr@2: IMPORT_C BIGNUM *BN_mpi2bn(const unsigned char *s,int len,BIGNUM *ret); williamr@2: IMPORT_C int BN_bn2mpi(const BIGNUM *a, unsigned char *to); williamr@2: IMPORT_C int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); williamr@2: IMPORT_C int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); williamr@2: IMPORT_C int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); williamr@2: IMPORT_C int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); williamr@2: IMPORT_C int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx); williamr@2: IMPORT_C int BN_sqr(BIGNUM *r, const BIGNUM *a,BN_CTX *ctx); williamr@2: /* BN_set_negative(): sets sign of a bignum */ williamr@2: IMPORT_C void BN_set_negative(BIGNUM *b, int n); williamr@2: /* BN_get_negative(): returns 1 if the bignum is < 0 and 0 otherwise */ williamr@2: #define BN_is_negative(a) ((a)->neg != 0) williamr@2: williamr@2: IMPORT_C int BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, const BIGNUM *d, williamr@2: BN_CTX *ctx); williamr@2: #define BN_mod(rem,m,d,ctx) BN_div(NULL,(rem),(m),(d),(ctx)) williamr@2: IMPORT_C int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx); williamr@2: IMPORT_C int BN_mod_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m, BN_CTX *ctx); williamr@2: IMPORT_C int BN_mod_add_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m); williamr@2: IMPORT_C int BN_mod_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m, BN_CTX *ctx); williamr@2: IMPORT_C int BN_mod_sub_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m); williamr@2: IMPORT_C int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, williamr@2: const BIGNUM *m, BN_CTX *ctx); williamr@2: IMPORT_C int BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx); williamr@2: IMPORT_C int BN_mod_lshift1(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx); williamr@2: IMPORT_C int BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *m); williamr@2: IMPORT_C int BN_mod_lshift(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m, BN_CTX *ctx); williamr@2: IMPORT_C int BN_mod_lshift_quick(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m); williamr@2: williamr@2: IMPORT_C BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w); williamr@2: IMPORT_C BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w); williamr@2: IMPORT_C int BN_mul_word(BIGNUM *a, BN_ULONG w); williamr@2: IMPORT_C int BN_add_word(BIGNUM *a, BN_ULONG w); williamr@2: IMPORT_C int BN_sub_word(BIGNUM *a, BN_ULONG w); williamr@2: IMPORT_C int BN_set_word(BIGNUM *a, BN_ULONG w); williamr@2: IMPORT_C BN_ULONG BN_get_word(const BIGNUM *a); williamr@2: williamr@2: IMPORT_C int BN_cmp(const BIGNUM *a, const BIGNUM *b); williamr@2: IMPORT_C void BN_free(BIGNUM *a); williamr@2: IMPORT_C int BN_is_bit_set(const BIGNUM *a, int n); williamr@2: IMPORT_C int BN_lshift(BIGNUM *r, const BIGNUM *a, int n); williamr@2: IMPORT_C int BN_lshift1(BIGNUM *r, const BIGNUM *a); williamr@2: IMPORT_C int BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,BN_CTX *ctx); williamr@2: williamr@2: IMPORT_C int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, williamr@2: const BIGNUM *m,BN_CTX *ctx); williamr@2: IMPORT_C int BN_mod_exp_mont(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, williamr@2: const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx); williamr@2: IMPORT_C int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p, williamr@2: const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont); williamr@2: IMPORT_C int BN_mod_exp_mont_word(BIGNUM *r, BN_ULONG a, const BIGNUM *p, williamr@2: const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx); williamr@2: IMPORT_C int BN_mod_exp2_mont(BIGNUM *r, const BIGNUM *a1, const BIGNUM *p1, williamr@2: const BIGNUM *a2, const BIGNUM *p2,const BIGNUM *m, williamr@2: BN_CTX *ctx,BN_MONT_CTX *m_ctx); williamr@2: IMPORT_C int BN_mod_exp_simple(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, williamr@2: const BIGNUM *m,BN_CTX *ctx); williamr@2: williamr@2: IMPORT_C int BN_mask_bits(BIGNUM *a,int n); williamr@2: #ifndef OPENSSL_NO_FP_API williamr@2: IMPORT_C int BN_print_fp(FILE *fp, const BIGNUM *a); williamr@2: #endif williamr@2: #ifdef HEADER_BIO_H williamr@2: IMPORT_C int BN_print(BIO *fp, const BIGNUM *a); williamr@2: #else williamr@2: IMPORT_C int BN_print(void *fp, const BIGNUM *a); williamr@2: #endif williamr@2: IMPORT_C int BN_reciprocal(BIGNUM *r, const BIGNUM *m, int len, BN_CTX *ctx); williamr@2: IMPORT_C int BN_rshift(BIGNUM *r, const BIGNUM *a, int n); williamr@2: IMPORT_C int BN_rshift1(BIGNUM *r, const BIGNUM *a); williamr@2: IMPORT_C void BN_clear(BIGNUM *a); williamr@2: IMPORT_C BIGNUM *BN_dup(const BIGNUM *a); williamr@2: IMPORT_C int BN_ucmp(const BIGNUM *a, const BIGNUM *b); williamr@2: IMPORT_C int BN_set_bit(BIGNUM *a, int n); williamr@2: IMPORT_C int BN_clear_bit(BIGNUM *a, int n); williamr@2: IMPORT_C char * BN_bn2hex(const BIGNUM *a); williamr@2: IMPORT_C char * BN_bn2dec(const BIGNUM *a); williamr@2: IMPORT_C int BN_hex2bn(BIGNUM **a, const char *str); williamr@2: IMPORT_C int BN_dec2bn(BIGNUM **a, const char *str); williamr@2: IMPORT_C int BN_gcd(BIGNUM *r,const BIGNUM *a,const BIGNUM *b,BN_CTX *ctx); williamr@2: IMPORT_C int BN_kronecker(const BIGNUM *a,const BIGNUM *b,BN_CTX *ctx); /* returns -2 for error */ williamr@2: IMPORT_C BIGNUM *BN_mod_inverse(BIGNUM *ret, williamr@2: const BIGNUM *a, const BIGNUM *n,BN_CTX *ctx); williamr@2: IMPORT_C BIGNUM *BN_mod_sqrt(BIGNUM *ret, williamr@2: const BIGNUM *a, const BIGNUM *n,BN_CTX *ctx); williamr@2: williamr@2: /* Deprecated versions */ williamr@2: #ifndef OPENSSL_NO_DEPRECATED williamr@2: IMPORT_C BIGNUM *BN_generate_prime(BIGNUM *ret,int bits,int safe, williamr@2: const BIGNUM *add, const BIGNUM *rem, williamr@2: void (*callback)(int,int,void *),void *cb_arg); williamr@2: IMPORT_C int BN_is_prime(const BIGNUM *p,int nchecks, williamr@2: void (*callback)(int,int,void *), williamr@2: BN_CTX *ctx,void *cb_arg); williamr@2: IMPORT_C int BN_is_prime_fasttest(const BIGNUM *p,int nchecks, williamr@2: void (*callback)(int,int,void *),BN_CTX *ctx,void *cb_arg, williamr@2: int do_trial_division); williamr@2: #endif /* !defined(OPENSSL_NO_DEPRECATED) */ williamr@2: williamr@2: /* Newer versions */ williamr@2: IMPORT_C int BN_generate_prime_ex(BIGNUM *ret,int bits,int safe, const BIGNUM *add, williamr@2: const BIGNUM *rem, BN_GENCB *cb); williamr@2: IMPORT_C int BN_is_prime_ex(const BIGNUM *p,int nchecks, BN_CTX *ctx, BN_GENCB *cb); williamr@2: IMPORT_C int BN_is_prime_fasttest_ex(const BIGNUM *p,int nchecks, BN_CTX *ctx, williamr@2: int do_trial_division, BN_GENCB *cb); williamr@2: williamr@2: IMPORT_C BN_MONT_CTX *BN_MONT_CTX_new(void ); williamr@2: IMPORT_C void BN_MONT_CTX_init(BN_MONT_CTX *ctx); williamr@2: IMPORT_C int BN_mod_mul_montgomery(BIGNUM *r,const BIGNUM *a,const BIGNUM *b, williamr@2: BN_MONT_CTX *mont, BN_CTX *ctx); williamr@2: #define BN_to_montgomery(r,a,mont,ctx) BN_mod_mul_montgomery(\ williamr@2: (r),(a),&((mont)->RR),(mont),(ctx)) williamr@2: IMPORT_C int BN_from_montgomery(BIGNUM *r,const BIGNUM *a, williamr@2: BN_MONT_CTX *mont, BN_CTX *ctx); williamr@2: IMPORT_C void BN_MONT_CTX_free(BN_MONT_CTX *mont); williamr@2: IMPORT_C int BN_MONT_CTX_set(BN_MONT_CTX *mont,const BIGNUM *mod,BN_CTX *ctx); williamr@2: IMPORT_C BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to,BN_MONT_CTX *from); williamr@2: IMPORT_C BN_MONT_CTX *BN_MONT_CTX_set_locked(BN_MONT_CTX **pmont, int lock, williamr@2: const BIGNUM *mod, BN_CTX *ctx); williamr@2: williamr@2: /* BN_BLINDING flags */ williamr@2: #define BN_BLINDING_NO_UPDATE 0x00000001 williamr@2: #define BN_BLINDING_NO_RECREATE 0x00000002 williamr@2: williamr@2: IMPORT_C BN_BLINDING *BN_BLINDING_new(const BIGNUM *A, const BIGNUM *Ai, BIGNUM *mod); williamr@2: IMPORT_C void BN_BLINDING_free(BN_BLINDING *b); williamr@2: IMPORT_C int BN_BLINDING_update(BN_BLINDING *b,BN_CTX *ctx); williamr@2: IMPORT_C int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx); williamr@2: IMPORT_C int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx); williamr@2: IMPORT_C int BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b, BN_CTX *); williamr@2: IMPORT_C int BN_BLINDING_invert_ex(BIGNUM *n, const BIGNUM *r, BN_BLINDING *b, BN_CTX *); williamr@2: IMPORT_C unsigned long BN_BLINDING_get_thread_id(const BN_BLINDING *); williamr@2: IMPORT_C void BN_BLINDING_set_thread_id(BN_BLINDING *, unsigned long); williamr@2: IMPORT_C unsigned long BN_BLINDING_get_flags(const BN_BLINDING *); williamr@2: IMPORT_C void BN_BLINDING_set_flags(BN_BLINDING *, unsigned long); williamr@2: IMPORT_C BN_BLINDING *BN_BLINDING_create_param(BN_BLINDING *b, williamr@2: const BIGNUM *e, BIGNUM *m, BN_CTX *ctx, williamr@2: int (*bn_mod_exp)(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, williamr@2: const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx), williamr@2: BN_MONT_CTX *m_ctx); williamr@2: williamr@2: #ifndef OPENSSL_NO_DEPRECATED williamr@2: IMPORT_C void BN_set_params(int mul,int high,int low,int mont); williamr@2: IMPORT_C int BN_get_params(int which); /* 0, mul, 1 high, 2 low, 3 mont */ williamr@2: #endif williamr@2: williamr@2: IMPORT_C void BN_RECP_CTX_init(BN_RECP_CTX *recp); williamr@2: IMPORT_C BN_RECP_CTX *BN_RECP_CTX_new(void); williamr@2: IMPORT_C void BN_RECP_CTX_free(BN_RECP_CTX *recp); williamr@2: IMPORT_C int BN_RECP_CTX_set(BN_RECP_CTX *recp,const BIGNUM *rdiv,BN_CTX *ctx); williamr@2: IMPORT_C int BN_mod_mul_reciprocal(BIGNUM *r, const BIGNUM *x, const BIGNUM *y, williamr@2: BN_RECP_CTX *recp,BN_CTX *ctx); williamr@2: IMPORT_C int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, williamr@2: const BIGNUM *m, BN_CTX *ctx); williamr@2: IMPORT_C int BN_div_recp(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, williamr@2: BN_RECP_CTX *recp, BN_CTX *ctx); williamr@2: williamr@2: /* Functions for arithmetic over binary polynomials represented by BIGNUMs. williamr@2: * williamr@2: * The BIGNUM::neg property of BIGNUMs representing binary polynomials is williamr@2: * ignored. williamr@2: * williamr@2: * Note that input arguments are not const so that their bit arrays can williamr@2: * be expanded to the appropriate size if needed. williamr@2: */ williamr@2: williamr@2: IMPORT_C int BN_GF2m_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); /*r = a + b*/ williamr@2: #define BN_GF2m_sub(r, a, b) BN_GF2m_add(r, a, b) williamr@2: IMPORT_C int BN_GF2m_mod(BIGNUM *r, const BIGNUM *a, const BIGNUM *p); /*r=a mod p*/ williamr@2: IMPORT_C int BN_GF2m_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, williamr@2: const BIGNUM *p, BN_CTX *ctx); /* r = (a * b) mod p */ williamr@2: IMPORT_C int BN_GF2m_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, williamr@2: BN_CTX *ctx); /* r = (a * a) mod p */ williamr@2: IMPORT_C int BN_GF2m_mod_inv(BIGNUM *r, const BIGNUM *b, const BIGNUM *p, williamr@2: BN_CTX *ctx); /* r = (1 / b) mod p */ williamr@2: IMPORT_C int BN_GF2m_mod_div(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, williamr@2: const BIGNUM *p, BN_CTX *ctx); /* r = (a / b) mod p */ williamr@2: IMPORT_C int BN_GF2m_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, williamr@2: const BIGNUM *p, BN_CTX *ctx); /* r = (a ^ b) mod p */ williamr@2: IMPORT_C int BN_GF2m_mod_sqrt(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, williamr@2: BN_CTX *ctx); /* r = sqrt(a) mod p */ williamr@2: IMPORT_C int BN_GF2m_mod_solve_quad(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, williamr@2: BN_CTX *ctx); /* r^2 + r = a mod p */ williamr@2: #define BN_GF2m_cmp(a, b) BN_ucmp((a), (b)) williamr@2: /* Some functions allow for representation of the irreducible polynomials williamr@2: * as an unsigned int[], say p. The irreducible f(t) is then of the form: williamr@2: * t^p[0] + t^p[1] + ... + t^p[k] williamr@2: * where m = p[0] > p[1] > ... > p[k] = 0. williamr@2: */ williamr@2: IMPORT_C int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const unsigned int p[]); williamr@2: /* r = a mod p */ williamr@2: IMPORT_C int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, williamr@2: const unsigned int p[], BN_CTX *ctx); /* r = (a * b) mod p */ williamr@2: IMPORT_C int BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const unsigned int p[], williamr@2: BN_CTX *ctx); /* r = (a * a) mod p */ williamr@2: IMPORT_C int BN_GF2m_mod_inv_arr(BIGNUM *r, const BIGNUM *b, const unsigned int p[], williamr@2: BN_CTX *ctx); /* r = (1 / b) mod p */ williamr@2: IMPORT_C int BN_GF2m_mod_div_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, williamr@2: const unsigned int p[], BN_CTX *ctx); /* r = (a / b) mod p */ williamr@2: IMPORT_C int BN_GF2m_mod_exp_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, williamr@2: const unsigned int p[], BN_CTX *ctx); /* r = (a ^ b) mod p */ williamr@2: IMPORT_C int BN_GF2m_mod_sqrt_arr(BIGNUM *r, const BIGNUM *a, williamr@2: const unsigned int p[], BN_CTX *ctx); /* r = sqrt(a) mod p */ williamr@2: IMPORT_C int BN_GF2m_mod_solve_quad_arr(BIGNUM *r, const BIGNUM *a, williamr@2: const unsigned int p[], BN_CTX *ctx); /* r^2 + r = a mod p */ williamr@2: IMPORT_C int BN_GF2m_poly2arr(const BIGNUM *a, unsigned int p[], int max); williamr@2: IMPORT_C int BN_GF2m_arr2poly(const unsigned int p[], BIGNUM *a); williamr@2: williamr@2: /* faster mod functions for the 'NIST primes' williamr@2: * 0 <= a < p^2 */ williamr@2: IMPORT_C int BN_nist_mod_192(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx); williamr@2: IMPORT_C int BN_nist_mod_224(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx); williamr@2: IMPORT_C int BN_nist_mod_256(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx); williamr@2: IMPORT_C int BN_nist_mod_384(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx); williamr@2: IMPORT_C int BN_nist_mod_521(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx); williamr@2: williamr@2: IMPORT_C const BIGNUM *BN_get0_nist_prime_192(void); williamr@2: IMPORT_C const BIGNUM *BN_get0_nist_prime_224(void); williamr@2: IMPORT_C const BIGNUM *BN_get0_nist_prime_256(void); williamr@2: IMPORT_C const BIGNUM *BN_get0_nist_prime_384(void); williamr@2: IMPORT_C const BIGNUM *BN_get0_nist_prime_521(void); williamr@2: williamr@2: /* library internal functions */ williamr@2: williamr@2: #define bn_expand(a,bits) ((((((bits+BN_BITS2-1))/BN_BITS2)) <= (a)->dmax)?\ williamr@2: (a):bn_expand2((a),(bits+BN_BITS2-1)/BN_BITS2)) williamr@2: #define bn_wexpand(a,words) (((words) <= (a)->dmax)?(a):bn_expand2((a),(words))) williamr@2: IMPORT_C BIGNUM *bn_expand2(BIGNUM *a, int words); williamr@2: #ifndef OPENSSL_NO_DEPRECATED williamr@2: BIGNUM *bn_dup_expand(const BIGNUM *a, int words); /* unused */ williamr@2: #endif williamr@2: williamr@2: /* Bignum consistency macros williamr@2: * There is one "API" macro, bn_fix_top(), for stripping leading zeroes from williamr@2: * bignum data after direct manipulations on the data. There is also an williamr@2: * "internal" macro, bn_check_top(), for verifying that there are no leading williamr@2: * zeroes. Unfortunately, some auditing is required due to the fact that williamr@2: * bn_fix_top() has become an overabused duct-tape because bignum data is williamr@2: * occasionally passed around in an inconsistent state. So the following williamr@2: * changes have been made to sort this out; williamr@2: * - bn_fix_top()s implementation has been moved to bn_correct_top() williamr@2: * - if BN_DEBUG isn't defined, bn_fix_top() maps to bn_correct_top(), and williamr@2: * bn_check_top() is as before. williamr@2: * - if BN_DEBUG *is* defined; williamr@2: * - bn_check_top() tries to pollute unused words even if the bignum 'top' is williamr@2: * consistent. (ed: only if BN_DEBUG_RAND is defined) williamr@2: * - bn_fix_top() maps to bn_check_top() rather than "fixing" anything. williamr@2: * The idea is to have debug builds flag up inconsistent bignums when they williamr@2: * occur. If that occurs in a bn_fix_top(), we examine the code in question; if williamr@2: * the use of bn_fix_top() was appropriate (ie. it follows directly after code williamr@2: * that manipulates the bignum) it is converted to bn_correct_top(), and if it williamr@2: * was not appropriate, we convert it permanently to bn_check_top() and track williamr@2: * down the cause of the bug. Eventually, no internal code should be using the williamr@2: * bn_fix_top() macro. External applications and libraries should try this with williamr@2: * their own code too, both in terms of building against the openssl headers williamr@2: * with BN_DEBUG defined *and* linking with a version of OpenSSL built with it williamr@2: * defined. This not only improves external code, it provides more test williamr@2: * coverage for openssl's own code. williamr@2: */ williamr@2: williamr@2: #ifdef BN_DEBUG williamr@2: williamr@2: /* We only need assert() when debugging */ williamr@2: #include williamr@2: williamr@2: #ifdef BN_DEBUG_RAND williamr@2: /* To avoid "make update" cvs wars due to BN_DEBUG, use some tricks */ williamr@2: #ifndef RAND_pseudo_bytes williamr@2: int RAND_pseudo_bytes(unsigned char *buf,int num); williamr@2: #define BN_DEBUG_TRIX williamr@2: #endif williamr@2: #define bn_pollute(a) \ williamr@2: do { \ williamr@2: const BIGNUM *_bnum1 = (a); \ williamr@2: if(_bnum1->top < _bnum1->dmax) { \ williamr@2: unsigned char _tmp_char; \ williamr@2: /* We cast away const without the compiler knowing, any \ williamr@2: * *genuinely* constant variables that aren't mutable \ williamr@2: * wouldn't be constructed with top!=dmax. */ \ williamr@2: BN_ULONG *_not_const; \ williamr@2: memcpy(&_not_const, &_bnum1->d, sizeof(BN_ULONG*)); \ williamr@2: RAND_pseudo_bytes(&_tmp_char, 1); \ williamr@2: memset((unsigned char *)(_not_const + _bnum1->top), _tmp_char, \ williamr@2: (_bnum1->dmax - _bnum1->top) * sizeof(BN_ULONG)); \ williamr@2: } \ williamr@2: } while(0) williamr@2: #ifdef BN_DEBUG_TRIX williamr@2: #undef RAND_pseudo_bytes williamr@2: #endif williamr@2: #else williamr@2: #define bn_pollute(a) williamr@2: #endif williamr@2: #define bn_check_top(a) \ williamr@2: do { \ williamr@2: const BIGNUM *_bnum2 = (a); \ williamr@2: if (_bnum2 != NULL) { \ williamr@2: assert((_bnum2->top == 0) || \ williamr@2: (_bnum2->d[_bnum2->top - 1] != 0)); \ williamr@2: bn_pollute(_bnum2); \ williamr@2: } \ williamr@2: } while(0) williamr@2: williamr@2: #define bn_fix_top(a) bn_check_top(a) williamr@2: williamr@2: #else /* !BN_DEBUG */ williamr@2: williamr@2: #define bn_pollute(a) williamr@2: #define bn_check_top(a) williamr@2: #define bn_fix_top(a) bn_correct_top(a) williamr@2: williamr@2: #endif williamr@2: williamr@2: #define bn_correct_top(a) \ williamr@2: { \ williamr@2: BN_ULONG *ftl; \ williamr@2: if ((a)->top > 0) \ williamr@2: { \ williamr@2: for (ftl= &((a)->d[(a)->top-1]); (a)->top > 0; (a)->top--) \ williamr@2: if (*(ftl--)) break; \ williamr@2: } \ williamr@2: bn_pollute(a); \ williamr@2: } williamr@2: williamr@2: IMPORT_C BN_ULONG bn_mul_add_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w); williamr@2: IMPORT_C BN_ULONG bn_mul_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w); williamr@2: IMPORT_C void bn_sqr_words(BN_ULONG *rp, const BN_ULONG *ap, int num); williamr@2: IMPORT_C BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d); williamr@2: IMPORT_C BN_ULONG bn_add_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,int num); williamr@2: IMPORT_C BN_ULONG bn_sub_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,int num); williamr@2: williamr@2: /* Primes from RFC 2409 */ williamr@2: IMPORT_C BIGNUM *get_rfc2409_prime_768(BIGNUM *bn); williamr@2: IMPORT_C BIGNUM *get_rfc2409_prime_1024(BIGNUM *bn); williamr@2: williamr@2: /* Primes from RFC 3526 */ williamr@2: IMPORT_C BIGNUM *get_rfc3526_prime_1536(BIGNUM *bn); williamr@2: IMPORT_C BIGNUM *get_rfc3526_prime_2048(BIGNUM *bn); williamr@2: IMPORT_C BIGNUM *get_rfc3526_prime_3072(BIGNUM *bn); williamr@2: IMPORT_C BIGNUM *get_rfc3526_prime_4096(BIGNUM *bn); williamr@2: IMPORT_C BIGNUM *get_rfc3526_prime_6144(BIGNUM *bn); williamr@2: IMPORT_C BIGNUM *get_rfc3526_prime_8192(BIGNUM *bn); williamr@2: williamr@2: IMPORT_C int BN_bntest_rand(BIGNUM *rnd, int bits, int top,int bottom); williamr@2: williamr@2: /* BEGIN ERROR CODES */ williamr@2: /* The following lines are auto generated by the script mkerr.pl. Any changes williamr@2: * made after this point may be overwritten when the script is next run. williamr@2: */ williamr@2: IMPORT_C void ERR_load_BN_strings(void); williamr@2: williamr@2: /* Error codes for the BN functions. */ williamr@2: williamr@2: /* Function codes. */ williamr@2: #define BN_F_BNRAND 127 williamr@2: #define BN_F_BN_BLINDING_CONVERT_EX 100 williamr@2: #define BN_F_BN_BLINDING_CREATE_PARAM 128 williamr@2: #define BN_F_BN_BLINDING_INVERT_EX 101 williamr@2: #define BN_F_BN_BLINDING_NEW 102 williamr@2: #define BN_F_BN_BLINDING_UPDATE 103 williamr@2: #define BN_F_BN_BN2DEC 104 williamr@2: #define BN_F_BN_BN2HEX 105 williamr@2: #define BN_F_BN_CTX_GET 116 williamr@2: #define BN_F_BN_CTX_NEW 106 williamr@2: #define BN_F_BN_CTX_START 129 williamr@2: #define BN_F_BN_DIV 107 williamr@2: #define BN_F_BN_DIV_NO_BRANCH 138 williamr@2: #define BN_F_BN_DIV_RECP 130 williamr@2: #define BN_F_BN_EXP 123 williamr@2: #define BN_F_BN_EXPAND2 108 williamr@2: #define BN_F_BN_EXPAND_INTERNAL 120 williamr@2: #define BN_F_BN_GF2M_MOD 131 williamr@2: #define BN_F_BN_GF2M_MOD_EXP 132 williamr@2: #define BN_F_BN_GF2M_MOD_MUL 133 williamr@2: #define BN_F_BN_GF2M_MOD_SOLVE_QUAD 134 williamr@2: #define BN_F_BN_GF2M_MOD_SOLVE_QUAD_ARR 135 williamr@2: #define BN_F_BN_GF2M_MOD_SQR 136 williamr@2: #define BN_F_BN_GF2M_MOD_SQRT 137 williamr@2: #define BN_F_BN_MOD_EXP2_MONT 118 williamr@2: #define BN_F_BN_MOD_EXP_MONT 109 williamr@2: #define BN_F_BN_MOD_EXP_MONT_CONSTTIME 124 williamr@2: #define BN_F_BN_MOD_EXP_MONT_WORD 117 williamr@2: #define BN_F_BN_MOD_EXP_RECP 125 williamr@2: #define BN_F_BN_MOD_EXP_SIMPLE 126 williamr@2: #define BN_F_BN_MOD_INVERSE 110 williamr@2: #define BN_F_BN_MOD_INVERSE_NO_BRANCH 139 williamr@2: #define BN_F_BN_MOD_LSHIFT_QUICK 119 williamr@2: #define BN_F_BN_MOD_MUL_RECIPROCAL 111 williamr@2: #define BN_F_BN_MOD_SQRT 121 williamr@2: #define BN_F_BN_MPI2BN 112 williamr@2: #define BN_F_BN_NEW 113 williamr@2: #define BN_F_BN_RAND 114 williamr@2: #define BN_F_BN_RAND_RANGE 122 williamr@2: #define BN_F_BN_USUB 115 williamr@2: williamr@2: /* Reason codes. */ williamr@2: #define BN_R_ARG2_LT_ARG3 100 williamr@2: #define BN_R_BAD_RECIPROCAL 101 williamr@2: #define BN_R_BIGNUM_TOO_LONG 114 williamr@2: #define BN_R_CALLED_WITH_EVEN_MODULUS 102 williamr@2: #define BN_R_DIV_BY_ZERO 103 williamr@2: #define BN_R_ENCODING_ERROR 104 williamr@2: #define BN_R_EXPAND_ON_STATIC_BIGNUM_DATA 105 williamr@2: #define BN_R_INPUT_NOT_REDUCED 110 williamr@2: #define BN_R_INVALID_LENGTH 106 williamr@2: #define BN_R_INVALID_RANGE 115 williamr@2: #define BN_R_NOT_A_SQUARE 111 williamr@2: #define BN_R_NOT_INITIALIZED 107 williamr@2: #define BN_R_NO_INVERSE 108 williamr@2: #define BN_R_NO_SOLUTION 116 williamr@2: #define BN_R_P_IS_NOT_PRIME 112 williamr@2: #define BN_R_TOO_MANY_ITERATIONS 113 williamr@2: #define BN_R_TOO_MANY_TEMPORARY_VARIABLES 109 williamr@2: williamr@2: #ifdef __cplusplus williamr@2: } williamr@2: #endif williamr@2: #endif