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