bn.h revision 72613
1/* crypto/bn/bn.h */ 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 59#ifndef HEADER_BN_H 60#define HEADER_BN_H 61 62#ifndef NO_FP_API 63#include <stdio.h> /* FILE */ 64#endif 65#include <openssl/opensslconf.h> 66 67#ifdef __cplusplus 68extern "C" { 69#endif 70 71#ifdef VMS 72#undef BN_LLONG /* experimental, so far... */ 73#endif 74 75#define BN_MUL_COMBA 76#define BN_SQR_COMBA 77#define BN_RECURSION 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 normal cc. This would 87 * be a common occurrence 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 assembler code. */ 92#if defined(MSDOS) || defined(WINDOWS) || defined(WIN32) || defined(linux) 93#define BN_DIV2W 94#endif 95 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 107#define BN_MASK (0xffffffffffffffffffffffffffffffffLL) 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) 113#define BN_DEC_CONV (10000000000000000000UL) 114#define BN_DEC_FMT1 "%lu" 115#define BN_DEC_FMT2 "%019lu" 116#define BN_DEC_NUM 19 117#endif 118 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 relevant 122 * assembler code :-). Do NOT define BN_LLONG. 123 */ 124#ifdef SIXTY_FOUR_BIT 125#undef BN_LLONG 126#undef BN_ULLONG 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) 138#define BN_DEC_CONV (10000000000000000000LL) 139#define BN_DEC_FMT1 "%llu" 140#define BN_DEC_FMT2 "%019llu" 141#define BN_DEC_NUM 19 142#endif 143 144#ifdef THIRTY_TWO_BIT 145#if defined(WIN32) && !defined(__GNUC__) 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 156#ifdef WIN32 157/* VC++ doesn't like the LL suffix */ 158#define BN_MASK (0xffffffffffffffffL) 159#else 160#define BN_MASK (0xffffffffffffffffLL) 161#endif 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) 167#define BN_DEC_CONV (1000000000L) 168#define BN_DEC_FMT1 "%lu" 169#define BN_DEC_FMT2 "%09lu" 170#define BN_DEC_NUM 9 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 184#define BN_MASK (0xffffffff) 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) 190#define BN_DEC_CONV (100000) 191#define BN_DEC_FMT1 "%u" 192#define BN_DEC_FMT2 "%05u" 193#define BN_DEC_NUM 5 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 207#define BN_MASK (0xffff) 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) 213#define BN_DEC_CONV (100) 214#define BN_DEC_FMT1 "%u" 215#define BN_DEC_FMT2 "%02u" 216#define BN_DEC_NUM 2 217#endif 218 219#define BN_DEFAULT_BITS 1280 220 221#ifdef BIGNUM 222#undef BIGNUM 223#endif 224 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 231typedef 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 dmax; /* Size of the d array. */ 237 int neg; /* one if the number is negative */ 238 int flags; 239 } BIGNUM; 240 241/* Used for temp variables */ 242#define BN_CTX_NUM 16 243#define BN_CTX_NUM_POS 12 244typedef struct bignum_ctx 245 { 246 int tos; 247 BIGNUM bn[BN_CTX_NUM]; 248 int flags; 249 int depth; 250 int pos[BN_CTX_NUM_POS]; 251 int too_many; 252 } BN_CTX; 253 254typedef struct bn_blinding_st 255 { 256 int init; 257 BIGNUM *A; 258 BIGNUM *Ai; 259 BIGNUM *mod; /* just a reference */ 260 } BN_BLINDING; 261 262/* Used for montgomery multiplication */ 263typedef struct bn_mont_ctx_st 264 { 265 int ri; /* number of bits in R */ 266 BIGNUM RR; /* used to convert to montgomery form */ 267 BIGNUM N; /* The modulus */ 268 BIGNUM Ni; /* R*(1/R mod N) - N*Ni = 1 269 * (Ni is only stored for bignum algorithm) */ 270 BN_ULONG n0; /* least significant word of Ni */ 271 int flags; 272 } BN_MONT_CTX; 273 274/* Used for reciprocal division/mod functions 275 * It cannot be shared between threads 276 */ 277typedef struct bn_recp_ctx_st 278 { 279 BIGNUM N; /* the divisor */ 280 BIGNUM Nr; /* the reciprocal */ 281 int num_bits; 282 int shift; 283 int flags; 284 } BN_RECP_CTX; 285 286#define BN_to_montgomery(r,a,mont,ctx) BN_mod_mul_montgomery(\ 287 r,a,&((mont)->RR),(mont),ctx) 288 289#define BN_prime_checks 0 /* default: select number of iterations 290 based on the size of the number */ 291 292/* number of Miller-Rabin iterations for an error rate of less than 2^-80 293 * for random 'b'-bit input, b >= 100 (taken from table 4.4 in the Handbook 294 * of Applied Cryptography [Menezes, van Oorschot, Vanstone; CRC Press 1996]; 295 * original paper: Damgaard, Landrock, Pomerance: Average case error estimates 296 * for the strong probable prime test. -- Math. Comp. 61 (1993) 177-194) */ 297#define BN_prime_checks_for_size(b) ((b) >= 1300 ? 2 : \ 298 (b) >= 850 ? 3 : \ 299 (b) >= 650 ? 4 : \ 300 (b) >= 550 ? 5 : \ 301 (b) >= 450 ? 6 : \ 302 (b) >= 400 ? 7 : \ 303 (b) >= 350 ? 8 : \ 304 (b) >= 300 ? 9 : \ 305 (b) >= 250 ? 12 : \ 306 (b) >= 200 ? 15 : \ 307 (b) >= 150 ? 18 : \ 308 /* b >= 100 */ 27) 309 310#define BN_num_bytes(a) ((BN_num_bits(a)+7)/8) 311#define BN_is_word(a,w) (((a)->top == 1) && ((a)->d[0] == (BN_ULONG)(w))) 312#define BN_is_zero(a) (((a)->top == 0) || BN_is_word(a,0)) 313#define BN_is_one(a) (BN_is_word((a),1)) 314#define BN_is_odd(a) (((a)->top > 0) && ((a)->d[0] & 1)) 315#define BN_one(a) (BN_set_word((a),1)) 316#define BN_zero(a) (BN_set_word((a),0)) 317 318/*#define BN_ascii2bn(a) BN_hex2bn(a) */ 319/*#define BN_bn2ascii(a) BN_bn2hex(a) */ 320 321BIGNUM *BN_value_one(void); 322char * BN_options(void); 323BN_CTX *BN_CTX_new(void); 324void BN_CTX_init(BN_CTX *c); 325void BN_CTX_free(BN_CTX *c); 326void BN_CTX_start(BN_CTX *ctx); 327BIGNUM *BN_CTX_get(BN_CTX *ctx); 328void BN_CTX_end(BN_CTX *ctx); 329int BN_rand(BIGNUM *rnd, int bits, int top,int bottom); 330int BN_pseudo_rand(BIGNUM *rnd, int bits, int top,int bottom); 331int BN_rand_range(BIGNUM *rnd, BIGNUM *range); 332int BN_num_bits(const BIGNUM *a); 333int BN_num_bits_word(BN_ULONG); 334BIGNUM *BN_new(void); 335void BN_init(BIGNUM *); 336void BN_clear_free(BIGNUM *a); 337BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b); 338BIGNUM *BN_bin2bn(const unsigned char *s,int len,BIGNUM *ret); 339int BN_bn2bin(const BIGNUM *a, unsigned char *to); 340BIGNUM *BN_mpi2bn(unsigned char *s,int len,BIGNUM *ret); 341int BN_bn2mpi(const BIGNUM *a, unsigned char *to); 342int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); 343int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); 344int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); 345int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); 346int BN_mod(BIGNUM *rem, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx); 347int BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, const BIGNUM *d, 348 BN_CTX *ctx); 349int BN_mul(BIGNUM *r, BIGNUM *a, BIGNUM *b, BN_CTX *ctx); 350int BN_sqr(BIGNUM *r, BIGNUM *a,BN_CTX *ctx); 351BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w); 352BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w); 353int BN_mul_word(BIGNUM *a, BN_ULONG w); 354int BN_add_word(BIGNUM *a, BN_ULONG w); 355int BN_sub_word(BIGNUM *a, BN_ULONG w); 356int BN_set_word(BIGNUM *a, BN_ULONG w); 357BN_ULONG BN_get_word(BIGNUM *a); 358int BN_cmp(const BIGNUM *a, const BIGNUM *b); 359void BN_free(BIGNUM *a); 360int BN_is_bit_set(const BIGNUM *a, int n); 361int BN_lshift(BIGNUM *r, const BIGNUM *a, int n); 362int BN_lshift1(BIGNUM *r, BIGNUM *a); 363int BN_exp(BIGNUM *r, BIGNUM *a, BIGNUM *p,BN_CTX *ctx); 364int BN_mod_exp(BIGNUM *r, BIGNUM *a, const BIGNUM *p, 365 const BIGNUM *m,BN_CTX *ctx); 366int BN_mod_exp_mont(BIGNUM *r, BIGNUM *a, const BIGNUM *p, 367 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx); 368int BN_mod_exp_mont_word(BIGNUM *r, BN_ULONG a, const BIGNUM *p, 369 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx); 370int BN_mod_exp2_mont(BIGNUM *r, BIGNUM *a1, BIGNUM *p1,BIGNUM *a2, 371 BIGNUM *p2,BIGNUM *m,BN_CTX *ctx,BN_MONT_CTX *m_ctx); 372int BN_mod_exp_simple(BIGNUM *r, BIGNUM *a, BIGNUM *p, 373 BIGNUM *m,BN_CTX *ctx); 374int BN_mask_bits(BIGNUM *a,int n); 375int BN_mod_mul(BIGNUM *ret, BIGNUM *a, BIGNUM *b, const BIGNUM *m, BN_CTX *ctx); 376#ifndef NO_FP_API 377int BN_print_fp(FILE *fp, const BIGNUM *a); 378#endif 379#ifdef HEADER_BIO_H 380int BN_print(BIO *fp, const BIGNUM *a); 381#else 382int BN_print(void *fp, const BIGNUM *a); 383#endif 384int BN_reciprocal(BIGNUM *r, BIGNUM *m, int len, BN_CTX *ctx); 385int BN_rshift(BIGNUM *r, BIGNUM *a, int n); 386int BN_rshift1(BIGNUM *r, BIGNUM *a); 387void BN_clear(BIGNUM *a); 388BIGNUM *BN_dup(const BIGNUM *a); 389int BN_ucmp(const BIGNUM *a, const BIGNUM *b); 390int BN_set_bit(BIGNUM *a, int n); 391int BN_clear_bit(BIGNUM *a, int n); 392char * BN_bn2hex(const BIGNUM *a); 393char * BN_bn2dec(const BIGNUM *a); 394int BN_hex2bn(BIGNUM **a, const char *str); 395int BN_dec2bn(BIGNUM **a, const char *str); 396int BN_gcd(BIGNUM *r,BIGNUM *in_a,BIGNUM *in_b,BN_CTX *ctx); 397BIGNUM *BN_mod_inverse(BIGNUM *ret,BIGNUM *a, const BIGNUM *n,BN_CTX *ctx); 398BIGNUM *BN_generate_prime(BIGNUM *ret,int bits,int safe,BIGNUM *add, 399 BIGNUM *rem,void (*callback)(int,int,void *),void *cb_arg); 400int BN_is_prime(const BIGNUM *p,int nchecks, 401 void (*callback)(int,int,void *), 402 BN_CTX *ctx,void *cb_arg); 403int BN_is_prime_fasttest(const BIGNUM *p,int nchecks, 404 void (*callback)(int,int,void *),BN_CTX *ctx,void *cb_arg, 405 int do_trial_division); 406void ERR_load_BN_strings(void ); 407 408BN_MONT_CTX *BN_MONT_CTX_new(void ); 409void BN_MONT_CTX_init(BN_MONT_CTX *ctx); 410int BN_mod_mul_montgomery(BIGNUM *r,BIGNUM *a,BIGNUM *b,BN_MONT_CTX *mont, 411 BN_CTX *ctx); 412int BN_from_montgomery(BIGNUM *r,BIGNUM *a,BN_MONT_CTX *mont,BN_CTX *ctx); 413void BN_MONT_CTX_free(BN_MONT_CTX *mont); 414int BN_MONT_CTX_set(BN_MONT_CTX *mont,const BIGNUM *modulus,BN_CTX *ctx); 415BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to,BN_MONT_CTX *from); 416 417BN_BLINDING *BN_BLINDING_new(BIGNUM *A,BIGNUM *Ai,BIGNUM *mod); 418void BN_BLINDING_free(BN_BLINDING *b); 419int BN_BLINDING_update(BN_BLINDING *b,BN_CTX *ctx); 420int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *r, BN_CTX *ctx); 421int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx); 422 423void BN_set_params(int mul,int high,int low,int mont); 424int BN_get_params(int which); /* 0, mul, 1 high, 2 low, 3 mont */ 425 426void BN_RECP_CTX_init(BN_RECP_CTX *recp); 427BN_RECP_CTX *BN_RECP_CTX_new(void); 428void BN_RECP_CTX_free(BN_RECP_CTX *recp); 429int BN_RECP_CTX_set(BN_RECP_CTX *recp,const BIGNUM *rdiv,BN_CTX *ctx); 430int BN_mod_mul_reciprocal(BIGNUM *r, BIGNUM *x, BIGNUM *y, 431 BN_RECP_CTX *recp,BN_CTX *ctx); 432int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, 433 const BIGNUM *m, BN_CTX *ctx); 434int BN_div_recp(BIGNUM *dv, BIGNUM *rem, BIGNUM *m, 435 BN_RECP_CTX *recp, BN_CTX *ctx); 436 437/* library internal functions */ 438 439#define bn_expand(a,bits) ((((((bits+BN_BITS2-1))/BN_BITS2)) <= (a)->dmax)?\ 440 (a):bn_expand2((a),(bits)/BN_BITS2+1)) 441#define bn_wexpand(a,words) (((words) <= (a)->dmax)?(a):bn_expand2((a),(words))) 442BIGNUM *bn_expand2(BIGNUM *a, int words); 443 444#define bn_fix_top(a) \ 445 { \ 446 BN_ULONG *ftl; \ 447 if ((a)->top > 0) \ 448 { \ 449 for (ftl= &((a)->d[(a)->top-1]); (a)->top > 0; (a)->top--) \ 450 if (*(ftl--)) break; \ 451 } \ 452 } 453 454BN_ULONG bn_mul_add_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w); 455BN_ULONG bn_mul_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w); 456void bn_sqr_words(BN_ULONG *rp, BN_ULONG *ap, int num); 457BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d); 458BN_ULONG bn_add_words(BN_ULONG *rp, BN_ULONG *ap, BN_ULONG *bp,int num); 459BN_ULONG bn_sub_words(BN_ULONG *rp, BN_ULONG *ap, BN_ULONG *bp,int num); 460 461#ifdef BN_DEBUG 462 void bn_dump1(FILE *o, const char *a, BN_ULONG *b,int n); 463# define bn_print(a) {fprintf(stderr, #a "="); BN_print_fp(stderr,a); \ 464 fprintf(stderr,"\n");} 465# define bn_dump(a,n) bn_dump1(stderr,#a,a,n); 466#else 467# define bn_print(a) 468# define bn_dump(a,b) 469#endif 470 471/* BEGIN ERROR CODES */ 472/* The following lines are auto generated by the script mkerr.pl. Any changes 473 * made after this point may be overwritten when the script is next run. 474 */ 475 476/* Error codes for the BN functions. */ 477 478/* Function codes. */ 479#define BN_F_BN_BLINDING_CONVERT 100 480#define BN_F_BN_BLINDING_INVERT 101 481#define BN_F_BN_BLINDING_NEW 102 482#define BN_F_BN_BLINDING_UPDATE 103 483#define BN_F_BN_BN2DEC 104 484#define BN_F_BN_BN2HEX 105 485#define BN_F_BN_CTX_GET 116 486#define BN_F_BN_CTX_NEW 106 487#define BN_F_BN_DIV 107 488#define BN_F_BN_EXPAND2 108 489#define BN_F_BN_MOD_EXP2_MONT 118 490#define BN_F_BN_MOD_EXP_MONT 109 491#define BN_F_BN_MOD_EXP_MONT_WORD 117 492#define BN_F_BN_MOD_INVERSE 110 493#define BN_F_BN_MOD_MUL_RECIPROCAL 111 494#define BN_F_BN_MPI2BN 112 495#define BN_F_BN_NEW 113 496#define BN_F_BN_RAND 114 497#define BN_F_BN_RAND_RANGE 122 498#define BN_F_BN_USUB 115 499 500/* Reason codes. */ 501#define BN_R_ARG2_LT_ARG3 100 502#define BN_R_BAD_RECIPROCAL 101 503#define BN_R_BIGNUM_TOO_LONG 114 504#define BN_R_CALLED_WITH_EVEN_MODULUS 102 505#define BN_R_DIV_BY_ZERO 103 506#define BN_R_ENCODING_ERROR 104 507#define BN_R_EXPAND_ON_STATIC_BIGNUM_DATA 105 508#define BN_R_INVALID_LENGTH 106 509#define BN_R_INVALID_RANGE 115 510#define BN_R_NOT_INITIALIZED 107 511#define BN_R_NO_INVERSE 108 512#define BN_R_TOO_MANY_TEMPORARY_VARIABLES 109 513 514#ifdef __cplusplus 515} 516#endif 517#endif 518 519