bn.h revision 100936
1181643Skmacy/* crypto/bn/bn.h */ 2181643Skmacy/* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com) 3181643Skmacy * All rights reserved. 4181643Skmacy * 5181643Skmacy * This package is an SSL implementation written 6181643Skmacy * by Eric Young (eay@cryptsoft.com). 7181643Skmacy * The implementation was written so as to conform with Netscapes SSL. 8192003Skmacy * 9192003Skmacy * This library is free for commercial and non-commercial use as long as 10192003Skmacy * the following conditions are aheared to. The following conditions 11192003Skmacy * apply to all code found in this distribution, be it the RC4, RSA, 12192003Skmacy * lhash, DES, etc., code; not just the SSL code. The SSL documentation 13192003Skmacy * included with this distribution is covered by the same copyright terms 14192003Skmacy * except that the holder is Tim Hudson (tjh@cryptsoft.com). 15192003Skmacy * 16192003Skmacy * Copyright remains Eric Young's, and as such any Copyright notices in 17192003Skmacy * the code are not to be removed. 18192003Skmacy * If this package is used in a product, Eric Young should be given attribution 19181643Skmacy * as the author of the parts of the library used. 20181643Skmacy * This can be in the form of a textual message at program startup or 21181643Skmacy * in documentation (online or textual) provided with the package. 22181643Skmacy * 23181643Skmacy * Redistribution and use in source and binary forms, with or without 24181643Skmacy * modification, are permitted provided that the following conditions 25181643Skmacy * are met: 26181643Skmacy * 1. Redistributions of source code must retain the copyright 27181643Skmacy * notice, this list of conditions and the following disclaimer. 28181643Skmacy * 2. Redistributions in binary form must reproduce the above copyright 29181643Skmacy * notice, this list of conditions and the following disclaimer in the 30181643Skmacy * documentation and/or other materials provided with the distribution. 31181643Skmacy * 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# ifndef BN_DIV2W 94# define BN_DIV2W 95# endif 96#endif 97 98/* assuming long is 64bit - this is the DEC Alpha 99 * unsigned long long is only 64 bits :-(, don't define 100 * BN_LLONG for the DEC Alpha */ 101#ifdef SIXTY_FOUR_BIT_LONG 102#define BN_ULLONG unsigned long long 103#define BN_ULONG unsigned long 104#define BN_LONG long 105#define BN_BITS 128 106#define BN_BYTES 8 107#define BN_BITS2 64 108#define BN_BITS4 32 109#define BN_MASK (0xffffffffffffffffffffffffffffffffLL) 110#define BN_MASK2 (0xffffffffffffffffL) 111#define BN_MASK2l (0xffffffffL) 112#define BN_MASK2h (0xffffffff00000000L) 113#define BN_MASK2h1 (0xffffffff80000000L) 114#define BN_TBIT (0x8000000000000000L) 115#define BN_DEC_CONV (10000000000000000000UL) 116#define BN_DEC_FMT1 "%lu" 117#define BN_DEC_FMT2 "%019lu" 118#define BN_DEC_NUM 19 119#endif 120 121/* This is where the long long data type is 64 bits, but long is 32. 122 * For machines where there are 64bit registers, this is the mode to use. 123 * IRIX, on R4000 and above should use this mode, along with the relevant 124 * assembler code :-). Do NOT define BN_LLONG. 125 */ 126#ifdef SIXTY_FOUR_BIT 127#undef BN_LLONG 128#undef BN_ULLONG 129#define BN_ULONG unsigned long long 130#define BN_LONG long long 131#define BN_BITS 128 132#define BN_BYTES 8 133#define BN_BITS2 64 134#define BN_BITS4 32 135#define BN_MASK2 (0xffffffffffffffffLL) 136#define BN_MASK2l (0xffffffffL) 137#define BN_MASK2h (0xffffffff00000000LL) 138#define BN_MASK2h1 (0xffffffff80000000LL) 139#define BN_TBIT (0x8000000000000000LL) 140#define BN_DEC_CONV (10000000000000000000LL) 141#define BN_DEC_FMT1 "%llu" 142#define BN_DEC_FMT2 "%019llu" 143#define BN_DEC_NUM 19 144#endif 145 146#ifdef THIRTY_TWO_BIT 147#if defined(WIN32) && !defined(__GNUC__) 148#define BN_ULLONG unsigned _int64 149#else 150#define BN_ULLONG unsigned long long 151#endif 152#define BN_ULONG unsigned long 153#define BN_LONG long 154#define BN_BITS 64 155#define BN_BYTES 4 156#define BN_BITS2 32 157#define BN_BITS4 16 158#ifdef _MSC_VER 159/* VC++ doesn't like the LL suffix */ 160#define BN_MASK (0xffffffffffffffffL) 161#else 162#define BN_MASK (0xffffffffffffffffLL) 163#endif 164#define BN_MASK2 (0xffffffffL) 165#define BN_MASK2l (0xffff) 166#define BN_MASK2h1 (0xffff8000L) 167#define BN_MASK2h (0xffff0000L) 168#define BN_TBIT (0x80000000L) 169#define BN_DEC_CONV (1000000000L) 170#define BN_DEC_FMT1 "%lu" 171#define BN_DEC_FMT2 "%09lu" 172#define BN_DEC_NUM 9 173#endif 174 175#ifdef SIXTEEN_BIT 176#ifndef BN_DIV2W 177#define BN_DIV2W 178#endif 179#define BN_ULLONG unsigned long 180#define BN_ULONG unsigned short 181#define BN_LONG short 182#define BN_BITS 32 183#define BN_BYTES 2 184#define BN_BITS2 16 185#define BN_BITS4 8 186#define BN_MASK (0xffffffff) 187#define BN_MASK2 (0xffff) 188#define BN_MASK2l (0xff) 189#define BN_MASK2h1 (0xff80) 190#define BN_MASK2h (0xff00) 191#define BN_TBIT (0x8000) 192#define BN_DEC_CONV (100000) 193#define BN_DEC_FMT1 "%u" 194#define BN_DEC_FMT2 "%05u" 195#define BN_DEC_NUM 5 196#endif 197 198#ifdef EIGHT_BIT 199#ifndef BN_DIV2W 200#define BN_DIV2W 201#endif 202#define BN_ULLONG unsigned short 203#define BN_ULONG unsigned char 204#define BN_LONG char 205#define BN_BITS 16 206#define BN_BYTES 1 207#define BN_BITS2 8 208#define BN_BITS4 4 209#define BN_MASK (0xffff) 210#define BN_MASK2 (0xff) 211#define BN_MASK2l (0xf) 212#define BN_MASK2h1 (0xf8) 213#define BN_MASK2h (0xf0) 214#define BN_TBIT (0x80) 215#define BN_DEC_CONV (100) 216#define BN_DEC_FMT1 "%u" 217#define BN_DEC_FMT2 "%02u" 218#define BN_DEC_NUM 2 219#endif 220 221#define BN_DEFAULT_BITS 1280 222 223#ifdef BIGNUM 224#undef BIGNUM 225#endif 226 227#define BN_FLG_MALLOCED 0x01 228#define BN_FLG_STATIC_DATA 0x02 229#define BN_FLG_FREE 0x8000 /* used for debuging */ 230#define BN_set_flags(b,n) ((b)->flags|=(n)) 231#define BN_get_flags(b,n) ((b)->flags&(n)) 232 233typedef struct bignum_st 234 { 235 BN_ULONG *d; /* Pointer to an array of 'BN_BITS2' bit chunks. */ 236 int top; /* Index of last used d +1. */ 237 /* The next are internal book keeping for bn_expand. */ 238 int dmax; /* Size of the d array. */ 239 int neg; /* one if the number is negative */ 240 int flags; 241 } BIGNUM; 242 243/* Used for temp variables */ 244#define BN_CTX_NUM 16 245#define BN_CTX_NUM_POS 12 246typedef struct bignum_ctx 247 { 248 int tos; 249 BIGNUM bn[BN_CTX_NUM]; 250 int flags; 251 int depth; 252 int pos[BN_CTX_NUM_POS]; 253 int too_many; 254 } BN_CTX; 255 256typedef struct bn_blinding_st 257 { 258 int init; 259 BIGNUM *A; 260 BIGNUM *Ai; 261 BIGNUM *mod; /* just a reference */ 262 } BN_BLINDING; 263 264/* Used for montgomery multiplication */ 265typedef struct bn_mont_ctx_st 266 { 267 int ri; /* number of bits in R */ 268 BIGNUM RR; /* used to convert to montgomery form */ 269 BIGNUM N; /* The modulus */ 270 BIGNUM Ni; /* R*(1/R mod N) - N*Ni = 1 271 * (Ni is only stored for bignum algorithm) */ 272 BN_ULONG n0; /* least significant word of Ni */ 273 int flags; 274 } BN_MONT_CTX; 275 276/* Used for reciprocal division/mod functions 277 * It cannot be shared between threads 278 */ 279typedef struct bn_recp_ctx_st 280 { 281 BIGNUM N; /* the divisor */ 282 BIGNUM Nr; /* the reciprocal */ 283 int num_bits; 284 int shift; 285 int flags; 286 } BN_RECP_CTX; 287 288#define BN_to_montgomery(r,a,mont,ctx) BN_mod_mul_montgomery(\ 289 r,a,&((mont)->RR),(mont),ctx) 290 291#define BN_prime_checks 0 /* default: select number of iterations 292 based on the size of the number */ 293 294/* number of Miller-Rabin iterations for an error rate of less than 2^-80 295 * for random 'b'-bit input, b >= 100 (taken from table 4.4 in the Handbook 296 * of Applied Cryptography [Menezes, van Oorschot, Vanstone; CRC Press 1996]; 297 * original paper: Damgaard, Landrock, Pomerance: Average case error estimates 298 * for the strong probable prime test. -- Math. Comp. 61 (1993) 177-194) */ 299#define BN_prime_checks_for_size(b) ((b) >= 1300 ? 2 : \ 300 (b) >= 850 ? 3 : \ 301 (b) >= 650 ? 4 : \ 302 (b) >= 550 ? 5 : \ 303 (b) >= 450 ? 6 : \ 304 (b) >= 400 ? 7 : \ 305 (b) >= 350 ? 8 : \ 306 (b) >= 300 ? 9 : \ 307 (b) >= 250 ? 12 : \ 308 (b) >= 200 ? 15 : \ 309 (b) >= 150 ? 18 : \ 310 /* b >= 100 */ 27) 311 312#define BN_num_bytes(a) ((BN_num_bits(a)+7)/8) 313#define BN_is_word(a,w) (((a)->top == 1) && ((a)->d[0] == (BN_ULONG)(w))) 314#define BN_is_zero(a) (((a)->top == 0) || BN_is_word(a,0)) 315#define BN_is_one(a) (BN_is_word((a),1)) 316#define BN_is_odd(a) (((a)->top > 0) && ((a)->d[0] & 1)) 317#define BN_one(a) (BN_set_word((a),1)) 318#define BN_zero(a) (BN_set_word((a),0)) 319 320/*#define BN_ascii2bn(a) BN_hex2bn(a) */ 321/*#define BN_bn2ascii(a) BN_bn2hex(a) */ 322 323BIGNUM *BN_value_one(void); 324char * BN_options(void); 325BN_CTX *BN_CTX_new(void); 326void BN_CTX_init(BN_CTX *c); 327void BN_CTX_free(BN_CTX *c); 328void BN_CTX_start(BN_CTX *ctx); 329BIGNUM *BN_CTX_get(BN_CTX *ctx); 330void BN_CTX_end(BN_CTX *ctx); 331int BN_rand(BIGNUM *rnd, int bits, int top,int bottom); 332int BN_pseudo_rand(BIGNUM *rnd, int bits, int top,int bottom); 333int BN_rand_range(BIGNUM *rnd, BIGNUM *range); 334int BN_pseudo_rand_range(BIGNUM *rnd, BIGNUM *range); 335int BN_num_bits(const BIGNUM *a); 336int BN_num_bits_word(BN_ULONG); 337BIGNUM *BN_new(void); 338void BN_init(BIGNUM *); 339void BN_clear_free(BIGNUM *a); 340BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b); 341BIGNUM *BN_bin2bn(const unsigned char *s,int len,BIGNUM *ret); 342int BN_bn2bin(const BIGNUM *a, unsigned char *to); 343BIGNUM *BN_mpi2bn(unsigned char *s,int len,BIGNUM *ret); 344int BN_bn2mpi(const BIGNUM *a, unsigned char *to); 345int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); 346int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); 347int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); 348int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); 349int BN_mod(BIGNUM *rem, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx); 350int BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, const BIGNUM *d, 351 BN_CTX *ctx); 352int BN_mul(BIGNUM *r, BIGNUM *a, BIGNUM *b, BN_CTX *ctx); 353int BN_sqr(BIGNUM *r, BIGNUM *a,BN_CTX *ctx); 354BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w); 355BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w); 356int BN_mul_word(BIGNUM *a, BN_ULONG w); 357int BN_add_word(BIGNUM *a, BN_ULONG w); 358int BN_sub_word(BIGNUM *a, BN_ULONG w); 359int BN_set_word(BIGNUM *a, BN_ULONG w); 360BN_ULONG BN_get_word(BIGNUM *a); 361int BN_cmp(const BIGNUM *a, const BIGNUM *b); 362void BN_free(BIGNUM *a); 363int BN_is_bit_set(const BIGNUM *a, int n); 364int BN_lshift(BIGNUM *r, const BIGNUM *a, int n); 365int BN_lshift1(BIGNUM *r, BIGNUM *a); 366int BN_exp(BIGNUM *r, BIGNUM *a, BIGNUM *p,BN_CTX *ctx); 367int BN_mod_exp(BIGNUM *r, BIGNUM *a, const BIGNUM *p, 368 const BIGNUM *m,BN_CTX *ctx); 369int BN_mod_exp_mont(BIGNUM *r, BIGNUM *a, const BIGNUM *p, 370 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx); 371int BN_mod_exp_mont_word(BIGNUM *r, BN_ULONG a, const BIGNUM *p, 372 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx); 373int BN_mod_exp2_mont(BIGNUM *r, BIGNUM *a1, BIGNUM *p1,BIGNUM *a2, 374 BIGNUM *p2,BIGNUM *m,BN_CTX *ctx,BN_MONT_CTX *m_ctx); 375int BN_mod_exp_simple(BIGNUM *r, BIGNUM *a, BIGNUM *p, 376 BIGNUM *m,BN_CTX *ctx); 377int BN_mask_bits(BIGNUM *a,int n); 378int BN_mod_mul(BIGNUM *ret, BIGNUM *a, BIGNUM *b, const BIGNUM *m, BN_CTX *ctx); 379#ifndef NO_FP_API 380int BN_print_fp(FILE *fp, const BIGNUM *a); 381#endif 382#ifdef HEADER_BIO_H 383int BN_print(BIO *fp, const BIGNUM *a); 384#else 385int BN_print(void *fp, const BIGNUM *a); 386#endif 387int BN_reciprocal(BIGNUM *r, BIGNUM *m, int len, BN_CTX *ctx); 388int BN_rshift(BIGNUM *r, BIGNUM *a, int n); 389int BN_rshift1(BIGNUM *r, BIGNUM *a); 390void BN_clear(BIGNUM *a); 391BIGNUM *BN_dup(const BIGNUM *a); 392int BN_ucmp(const BIGNUM *a, const BIGNUM *b); 393int BN_set_bit(BIGNUM *a, int n); 394int BN_clear_bit(BIGNUM *a, int n); 395char * BN_bn2hex(const BIGNUM *a); 396char * BN_bn2dec(const BIGNUM *a); 397int BN_hex2bn(BIGNUM **a, const char *str); 398int BN_dec2bn(BIGNUM **a, const char *str); 399int BN_gcd(BIGNUM *r,BIGNUM *in_a,BIGNUM *in_b,BN_CTX *ctx); 400BIGNUM *BN_mod_inverse(BIGNUM *ret,BIGNUM *a, const BIGNUM *n,BN_CTX *ctx); 401BIGNUM *BN_generate_prime(BIGNUM *ret,int bits,int safe,BIGNUM *add, 402 BIGNUM *rem,void (*callback)(int,int,void *),void *cb_arg); 403int BN_is_prime(const BIGNUM *p,int nchecks, 404 void (*callback)(int,int,void *), 405 BN_CTX *ctx,void *cb_arg); 406int BN_is_prime_fasttest(const BIGNUM *p,int nchecks, 407 void (*callback)(int,int,void *),BN_CTX *ctx,void *cb_arg, 408 int do_trial_division); 409 410BN_MONT_CTX *BN_MONT_CTX_new(void ); 411void BN_MONT_CTX_init(BN_MONT_CTX *ctx); 412int BN_mod_mul_montgomery(BIGNUM *r,BIGNUM *a,BIGNUM *b,BN_MONT_CTX *mont, 413 BN_CTX *ctx); 414int BN_from_montgomery(BIGNUM *r,BIGNUM *a,BN_MONT_CTX *mont,BN_CTX *ctx); 415void BN_MONT_CTX_free(BN_MONT_CTX *mont); 416int BN_MONT_CTX_set(BN_MONT_CTX *mont,const BIGNUM *modulus,BN_CTX *ctx); 417BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to,BN_MONT_CTX *from); 418 419BN_BLINDING *BN_BLINDING_new(BIGNUM *A,BIGNUM *Ai,BIGNUM *mod); 420void BN_BLINDING_free(BN_BLINDING *b); 421int BN_BLINDING_update(BN_BLINDING *b,BN_CTX *ctx); 422int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *r, BN_CTX *ctx); 423int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx); 424 425void BN_set_params(int mul,int high,int low,int mont); 426int BN_get_params(int which); /* 0, mul, 1 high, 2 low, 3 mont */ 427 428void BN_RECP_CTX_init(BN_RECP_CTX *recp); 429BN_RECP_CTX *BN_RECP_CTX_new(void); 430void BN_RECP_CTX_free(BN_RECP_CTX *recp); 431int BN_RECP_CTX_set(BN_RECP_CTX *recp,const BIGNUM *rdiv,BN_CTX *ctx); 432int BN_mod_mul_reciprocal(BIGNUM *r, BIGNUM *x, BIGNUM *y, 433 BN_RECP_CTX *recp,BN_CTX *ctx); 434int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, 435 const BIGNUM *m, BN_CTX *ctx); 436int BN_div_recp(BIGNUM *dv, BIGNUM *rem, BIGNUM *m, 437 BN_RECP_CTX *recp, BN_CTX *ctx); 438 439/* library internal functions */ 440 441#define bn_expand(a,bits) ((((((bits+BN_BITS2-1))/BN_BITS2)) <= (a)->dmax)?\ 442 (a):bn_expand2((a),(bits)/BN_BITS2+1)) 443#define bn_wexpand(a,words) (((words) <= (a)->dmax)?(a):bn_expand2((a),(words))) 444BIGNUM *bn_expand2(BIGNUM *a, int words); 445 446#define bn_fix_top(a) \ 447 { \ 448 BN_ULONG *ftl; \ 449 if ((a)->top > 0) \ 450 { \ 451 for (ftl= &((a)->d[(a)->top-1]); (a)->top > 0; (a)->top--) \ 452 if (*(ftl--)) break; \ 453 } \ 454 } 455 456BN_ULONG bn_mul_add_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w); 457BN_ULONG bn_mul_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w); 458void bn_sqr_words(BN_ULONG *rp, BN_ULONG *ap, int num); 459BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d); 460BN_ULONG bn_add_words(BN_ULONG *rp, BN_ULONG *ap, BN_ULONG *bp,int num); 461BN_ULONG bn_sub_words(BN_ULONG *rp, BN_ULONG *ap, BN_ULONG *bp,int num); 462 463#ifdef BN_DEBUG 464 void bn_dump1(FILE *o, const char *a, BN_ULONG *b,int n); 465# define bn_print(a) {fprintf(stderr, #a "="); BN_print_fp(stderr,a); \ 466 fprintf(stderr,"\n");} 467# define bn_dump(a,n) bn_dump1(stderr,#a,a,n); 468#else 469# define bn_print(a) 470# define bn_dump(a,b) 471#endif 472 473int BN_bntest_rand(BIGNUM *rnd, int bits, int top,int bottom); 474 475/* BEGIN ERROR CODES */ 476/* The following lines are auto generated by the script mkerr.pl. Any changes 477 * made after this point may be overwritten when the script is next run. 478 */ 479void ERR_load_BN_strings(void); 480 481/* Error codes for the BN functions. */ 482 483/* Function codes. */ 484#define BN_F_BN_BLINDING_CONVERT 100 485#define BN_F_BN_BLINDING_INVERT 101 486#define BN_F_BN_BLINDING_NEW 102 487#define BN_F_BN_BLINDING_UPDATE 103 488#define BN_F_BN_BN2DEC 104 489#define BN_F_BN_BN2HEX 105 490#define BN_F_BN_CTX_GET 116 491#define BN_F_BN_CTX_NEW 106 492#define BN_F_BN_DIV 107 493#define BN_F_BN_EXPAND2 108 494#define BN_F_BN_MOD_EXP2_MONT 118 495#define BN_F_BN_MOD_EXP_MONT 109 496#define BN_F_BN_MOD_EXP_MONT_WORD 117 497#define BN_F_BN_MOD_INVERSE 110 498#define BN_F_BN_MOD_MUL_RECIPROCAL 111 499#define BN_F_BN_MPI2BN 112 500#define BN_F_BN_NEW 113 501#define BN_F_BN_RAND 114 502#define BN_F_BN_RAND_RANGE 122 503#define BN_F_BN_USUB 115 504 505/* Reason codes. */ 506#define BN_R_ARG2_LT_ARG3 100 507#define BN_R_BAD_RECIPROCAL 101 508#define BN_R_BIGNUM_TOO_LONG 114 509#define BN_R_CALLED_WITH_EVEN_MODULUS 102 510#define BN_R_DIV_BY_ZERO 103 511#define BN_R_ENCODING_ERROR 104 512#define BN_R_EXPAND_ON_STATIC_BIGNUM_DATA 105 513#define BN_R_INVALID_LENGTH 106 514#define BN_R_INVALID_RANGE 115 515#define BN_R_NOT_INITIALIZED 107 516#define BN_R_NO_INVERSE 108 517#define BN_R_TOO_MANY_TEMPORARY_VARIABLES 109 518 519#ifdef __cplusplus 520} 521#endif 522#endif 523