LTKCPP-- LLRP Toolkit C Plus Plus Library
|
00001 /* crypto/bn/bn.h */ 00002 /* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com) 00003 * All rights reserved. 00004 * 00005 * This package is an SSL implementation written 00006 * by Eric Young (eay@cryptsoft.com). 00007 * The implementation was written so as to conform with Netscapes SSL. 00008 * 00009 * This library is free for commercial and non-commercial use as long as 00010 * the following conditions are aheared to. The following conditions 00011 * apply to all code found in this distribution, be it the RC4, RSA, 00012 * lhash, DES, etc., code; not just the SSL code. The SSL documentation 00013 * included with this distribution is covered by the same copyright terms 00014 * except that the holder is Tim Hudson (tjh@cryptsoft.com). 00015 * 00016 * Copyright remains Eric Young's, and as such any Copyright notices in 00017 * the code are not to be removed. 00018 * If this package is used in a product, Eric Young should be given attribution 00019 * as the author of the parts of the library used. 00020 * This can be in the form of a textual message at program startup or 00021 * in documentation (online or textual) provided with the package. 00022 * 00023 * Redistribution and use in source and binary forms, with or without 00024 * modification, are permitted provided that the following conditions 00025 * are met: 00026 * 1. Redistributions of source code must retain the copyright 00027 * notice, this list of conditions and the following disclaimer. 00028 * 2. Redistributions in binary form must reproduce the above copyright 00029 * notice, this list of conditions and the following disclaimer in the 00030 * documentation and/or other materials provided with the distribution. 00031 * 3. All advertising materials mentioning features or use of this software 00032 * must display the following acknowledgement: 00033 * "This product includes cryptographic software written by 00034 * Eric Young (eay@cryptsoft.com)" 00035 * The word 'cryptographic' can be left out if the rouines from the library 00036 * being used are not cryptographic related :-). 00037 * 4. If you include any Windows specific code (or a derivative thereof) from 00038 * the apps directory (application code) you must include an acknowledgement: 00039 * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" 00040 * 00041 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND 00042 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00043 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 00044 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 00045 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 00046 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 00047 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 00048 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 00049 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 00050 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 00051 * SUCH DAMAGE. 00052 * 00053 * The licence and distribution terms for any publically available version or 00054 * derivative of this code cannot be changed. i.e. this code cannot simply be 00055 * copied and put under another distribution licence 00056 * [including the GNU Public Licence.] 00057 */ 00058 /* ==================================================================== 00059 * Copyright (c) 1998-2006 The OpenSSL Project. All rights reserved. 00060 * 00061 * Redistribution and use in source and binary forms, with or without 00062 * modification, are permitted provided that the following conditions 00063 * are met: 00064 * 00065 * 1. Redistributions of source code must retain the above copyright 00066 * notice, this list of conditions and the following disclaimer. 00067 * 00068 * 2. Redistributions in binary form must reproduce the above copyright 00069 * notice, this list of conditions and the following disclaimer in 00070 * the documentation and/or other materials provided with the 00071 * distribution. 00072 * 00073 * 3. All advertising materials mentioning features or use of this 00074 * software must display the following acknowledgment: 00075 * "This product includes software developed by the OpenSSL Project 00076 * for use in the OpenSSL Toolkit. (http://www.openssl.org/)" 00077 * 00078 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to 00079 * endorse or promote products derived from this software without 00080 * prior written permission. For written permission, please contact 00081 * openssl-core@openssl.org. 00082 * 00083 * 5. Products derived from this software may not be called "OpenSSL" 00084 * nor may "OpenSSL" appear in their names without prior written 00085 * permission of the OpenSSL Project. 00086 * 00087 * 6. Redistributions of any form whatsoever must retain the following 00088 * acknowledgment: 00089 * "This product includes software developed by the OpenSSL Project 00090 * for use in the OpenSSL Toolkit (http://www.openssl.org/)" 00091 * 00092 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY 00093 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00094 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 00095 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR 00096 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 00097 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 00098 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; 00099 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 00100 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, 00101 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 00102 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED 00103 * OF THE POSSIBILITY OF SUCH DAMAGE. 00104 * ==================================================================== 00105 * 00106 * This product includes cryptographic software written by Eric Young 00107 * (eay@cryptsoft.com). This product includes software written by Tim 00108 * Hudson (tjh@cryptsoft.com). 00109 * 00110 */ 00111 /* ==================================================================== 00112 * Copyright 2002 Sun Microsystems, Inc. ALL RIGHTS RESERVED. 00113 * 00114 * Portions of the attached software ("Contribution") are developed by 00115 * SUN MICROSYSTEMS, INC., and are contributed to the OpenSSL project. 00116 * 00117 * The Contribution is licensed pursuant to the Eric Young open source 00118 * license provided above. 00119 * 00120 * The binary polynomial arithmetic software is originally written by 00121 * Sheueling Chang Shantz and Douglas Stebila of Sun Microsystems Laboratories. 00122 * 00123 */ 00124 00125 #ifndef HEADER_BN_H 00126 # define HEADER_BN_H 00127 00128 # include <openssl/e_os2.h> 00129 # ifndef OPENSSL_NO_FP_API 00130 # include <stdio.h> /* FILE */ 00131 # endif 00132 # include <openssl/ossl_typ.h> 00133 # include <openssl/crypto.h> 00134 00135 #ifdef __cplusplus 00136 extern "C" { 00137 #endif 00138 00139 /* 00140 * These preprocessor symbols control various aspects of the bignum headers 00141 * and library code. They're not defined by any "normal" configuration, as 00142 * they are intended for development and testing purposes. NB: defining all 00143 * three can be useful for debugging application code as well as openssl 00144 * itself. BN_DEBUG - turn on various debugging alterations to the bignum 00145 * code BN_DEBUG_RAND - uses random poisoning of unused words to trip up 00146 * mismanagement of bignum internals. You must also define BN_DEBUG. 00147 */ 00148 /* #define BN_DEBUG */ 00149 /* #define BN_DEBUG_RAND */ 00150 00151 # ifndef OPENSSL_SMALL_FOOTPRINT 00152 # define BN_MUL_COMBA 00153 # define BN_SQR_COMBA 00154 # define BN_RECURSION 00155 # endif 00156 00157 /* 00158 * This next option uses the C libraries (2 word)/(1 word) function. If it is 00159 * not defined, I use my C version (which is slower). The reason for this 00160 * flag is that when the particular C compiler library routine is used, and 00161 * the library is linked with a different compiler, the library is missing. 00162 * This mostly happens when the library is built with gcc and then linked 00163 * using normal cc. This would be a common occurrence because gcc normally 00164 * produces code that is 2 times faster than system compilers for the big 00165 * number stuff. For machines with only one compiler (or shared libraries), 00166 * this should be on. Again this in only really a problem on machines using 00167 * "long long's", are 32bit, and are not using my assembler code. 00168 */ 00169 # if defined(OPENSSL_SYS_MSDOS) || defined(OPENSSL_SYS_WINDOWS) || \ 00170 defined(OPENSSL_SYS_WIN32) || defined(linux) 00171 # ifndef BN_DIV2W 00172 # define BN_DIV2W 00173 # endif 00174 # endif 00175 00176 /* 00177 * assuming long is 64bit - this is the DEC Alpha unsigned long long is only 00178 * 64 bits :-(, don't define BN_LLONG for the DEC Alpha 00179 */ 00180 # ifdef SIXTY_FOUR_BIT_LONG 00181 # define BN_ULLONG unsigned long long 00182 # define BN_ULONG unsigned long 00183 # define BN_LONG long 00184 # define BN_BITS 128 00185 # define BN_BYTES 8 00186 # define BN_BITS2 64 00187 # define BN_BITS4 32 00188 # define BN_MASK (0xffffffffffffffffffffffffffffffffLL) 00189 # define BN_MASK2 (0xffffffffffffffffL) 00190 # define BN_MASK2l (0xffffffffL) 00191 # define BN_MASK2h (0xffffffff00000000L) 00192 # define BN_MASK2h1 (0xffffffff80000000L) 00193 # define BN_TBIT (0x8000000000000000L) 00194 # define BN_DEC_CONV (10000000000000000000UL) 00195 # define BN_DEC_FMT1 "%lu" 00196 # define BN_DEC_FMT2 "%019lu" 00197 # define BN_DEC_NUM 19 00198 # define BN_HEX_FMT1 "%lX" 00199 # define BN_HEX_FMT2 "%016lX" 00200 # endif 00201 00202 /* 00203 * This is where the long long data type is 64 bits, but long is 32. For 00204 * machines where there are 64bit registers, this is the mode to use. IRIX, 00205 * on R4000 and above should use this mode, along with the relevant assembler 00206 * code :-). Do NOT define BN_LLONG. 00207 */ 00208 # ifdef SIXTY_FOUR_BIT 00209 # undef BN_LLONG 00210 # undef BN_ULLONG 00211 # define BN_ULONG unsigned long long 00212 # define BN_LONG long long 00213 # define BN_BITS 128 00214 # define BN_BYTES 8 00215 # define BN_BITS2 64 00216 # define BN_BITS4 32 00217 # define BN_MASK2 (0xffffffffffffffffLL) 00218 # define BN_MASK2l (0xffffffffL) 00219 # define BN_MASK2h (0xffffffff00000000LL) 00220 # define BN_MASK2h1 (0xffffffff80000000LL) 00221 # define BN_TBIT (0x8000000000000000LL) 00222 # define BN_DEC_CONV (10000000000000000000ULL) 00223 # define BN_DEC_FMT1 "%llu" 00224 # define BN_DEC_FMT2 "%019llu" 00225 # define BN_DEC_NUM 19 00226 # define BN_HEX_FMT1 "%llX" 00227 # define BN_HEX_FMT2 "%016llX" 00228 # endif 00229 00230 # ifdef THIRTY_TWO_BIT 00231 # ifdef BN_LLONG 00232 # if defined(_WIN32) && !defined(__GNUC__) 00233 # define BN_ULLONG unsigned __int64 00234 # define BN_MASK (0xffffffffffffffffI64) 00235 # else 00236 # define BN_ULLONG unsigned long long 00237 # define BN_MASK (0xffffffffffffffffLL) 00238 # endif 00239 # endif 00240 # define BN_ULONG unsigned int 00241 # define BN_LONG int 00242 # define BN_BITS 64 00243 # define BN_BYTES 4 00244 # define BN_BITS2 32 00245 # define BN_BITS4 16 00246 # define BN_MASK2 (0xffffffffL) 00247 # define BN_MASK2l (0xffff) 00248 # define BN_MASK2h1 (0xffff8000L) 00249 # define BN_MASK2h (0xffff0000L) 00250 # define BN_TBIT (0x80000000L) 00251 # define BN_DEC_CONV (1000000000L) 00252 # define BN_DEC_FMT1 "%u" 00253 # define BN_DEC_FMT2 "%09u" 00254 # define BN_DEC_NUM 9 00255 # define BN_HEX_FMT1 "%X" 00256 # define BN_HEX_FMT2 "%08X" 00257 # endif 00258 00259 # define BN_DEFAULT_BITS 1280 00260 00261 # define BN_FLG_MALLOCED 0x01 00262 # define BN_FLG_STATIC_DATA 0x02 00263 00264 /* 00265 * avoid leaking exponent information through timing, 00266 * BN_mod_exp_mont() will call BN_mod_exp_mont_consttime, 00267 * BN_div() will call BN_div_no_branch, 00268 * BN_mod_inverse() will call BN_mod_inverse_no_branch. 00269 */ 00270 # define BN_FLG_CONSTTIME 0x04 00271 00272 # ifdef OPENSSL_NO_DEPRECATED 00273 /* deprecated name for the flag */ 00274 # define BN_FLG_EXP_CONSTTIME BN_FLG_CONSTTIME 00275 /* 00276 * avoid leaking exponent information through timings 00277 * (BN_mod_exp_mont() will call BN_mod_exp_mont_consttime) 00278 */ 00279 # endif 00280 00281 # ifndef OPENSSL_NO_DEPRECATED 00282 # define BN_FLG_FREE 0x8000 00283 /* used for debuging */ 00284 # endif 00285 # define BN_set_flags(b,n) ((b)->flags|=(n)) 00286 # define BN_get_flags(b,n) ((b)->flags&(n)) 00287 00288 /* 00289 * get a clone of a BIGNUM with changed flags, for *temporary* use only (the 00290 * two BIGNUMs cannot not be used in parallel!) 00291 */ 00292 # define BN_with_flags(dest,b,n) ((dest)->d=(b)->d, \ 00293 (dest)->top=(b)->top, \ 00294 (dest)->dmax=(b)->dmax, \ 00295 (dest)->neg=(b)->neg, \ 00296 (dest)->flags=(((dest)->flags & BN_FLG_MALLOCED) \ 00297 | ((b)->flags & ~BN_FLG_MALLOCED) \ 00298 | BN_FLG_STATIC_DATA \ 00299 | (n))) 00300 00301 /* Already declared in ossl_typ.h */ 00302 # if 0 00303 typedef struct bignum_st BIGNUM; 00304 /* Used for temp variables (declaration hidden in bn_lcl.h) */ 00305 typedef struct bignum_ctx BN_CTX; 00306 typedef struct bn_blinding_st BN_BLINDING; 00307 typedef struct bn_mont_ctx_st BN_MONT_CTX; 00308 typedef struct bn_recp_ctx_st BN_RECP_CTX; 00309 typedef struct bn_gencb_st BN_GENCB; 00310 # endif 00311 00312 struct bignum_st { 00313 BN_ULONG *d; /* Pointer to an array of 'BN_BITS2' bit 00314 * chunks. */ 00315 int top; /* Index of last used d +1. */ 00316 /* The next are internal book keeping for bn_expand. */ 00317 int dmax; /* Size of the d array. */ 00318 int neg; /* one if the number is negative */ 00319 int flags; 00320 }; 00321 00322 /* Used for montgomery multiplication */ 00323 struct bn_mont_ctx_st { 00324 int ri; /* number of bits in R */ 00325 BIGNUM RR; /* used to convert to montgomery form */ 00326 BIGNUM N; /* The modulus */ 00327 BIGNUM Ni; /* R*(1/R mod N) - N*Ni = 1 (Ni is only 00328 * stored for bignum algorithm) */ 00329 BN_ULONG n0[2]; /* least significant word(s) of Ni; (type 00330 * changed with 0.9.9, was "BN_ULONG n0;" 00331 * before) */ 00332 int flags; 00333 }; 00334 00335 /* 00336 * Used for reciprocal division/mod functions It cannot be shared between 00337 * threads 00338 */ 00339 struct bn_recp_ctx_st { 00340 BIGNUM N; /* the divisor */ 00341 BIGNUM Nr; /* the reciprocal */ 00342 int num_bits; 00343 int shift; 00344 int flags; 00345 }; 00346 00347 /* Used for slow "generation" functions. */ 00348 struct bn_gencb_st { 00349 unsigned int ver; /* To handle binary (in)compatibility */ 00350 void *arg; /* callback-specific data */ 00351 union { 00352 /* if(ver==1) - handles old style callbacks */ 00353 void (*cb_1) (int, int, void *); 00354 /* if(ver==2) - new callback style */ 00355 int (*cb_2) (int, int, BN_GENCB *); 00356 } cb; 00357 }; 00358 /* Wrapper function to make using BN_GENCB easier, */ 00359 int BN_GENCB_call(BN_GENCB *cb, int a, int b); 00360 /* Macro to populate a BN_GENCB structure with an "old"-style callback */ 00361 # define BN_GENCB_set_old(gencb, callback, cb_arg) { \ 00362 BN_GENCB *tmp_gencb = (gencb); \ 00363 tmp_gencb->ver = 1; \ 00364 tmp_gencb->arg = (cb_arg); \ 00365 tmp_gencb->cb.cb_1 = (callback); } 00366 /* Macro to populate a BN_GENCB structure with a "new"-style callback */ 00367 # define BN_GENCB_set(gencb, callback, cb_arg) { \ 00368 BN_GENCB *tmp_gencb = (gencb); \ 00369 tmp_gencb->ver = 2; \ 00370 tmp_gencb->arg = (cb_arg); \ 00371 tmp_gencb->cb.cb_2 = (callback); } 00372 00373 # define BN_prime_checks 0 /* default: select number of iterations based 00374 * on the size of the number */ 00375 00376 /* 00377 * number of Miller-Rabin iterations for an error rate of less than 2^-80 for 00378 * random 'b'-bit input, b >= 100 (taken from table 4.4 in the Handbook of 00379 * Applied Cryptography [Menezes, van Oorschot, Vanstone; CRC Press 1996]; 00380 * original paper: Damgaard, Landrock, Pomerance: Average case error 00381 * estimates for the strong probable prime test. -- Math. Comp. 61 (1993) 00382 * 177-194) 00383 */ 00384 # define BN_prime_checks_for_size(b) ((b) >= 1300 ? 2 : \ 00385 (b) >= 850 ? 3 : \ 00386 (b) >= 650 ? 4 : \ 00387 (b) >= 550 ? 5 : \ 00388 (b) >= 450 ? 6 : \ 00389 (b) >= 400 ? 7 : \ 00390 (b) >= 350 ? 8 : \ 00391 (b) >= 300 ? 9 : \ 00392 (b) >= 250 ? 12 : \ 00393 (b) >= 200 ? 15 : \ 00394 (b) >= 150 ? 18 : \ 00395 /* b >= 100 */ 27) 00396 00397 # define BN_num_bytes(a) ((BN_num_bits(a)+7)/8) 00398 00399 /* Note that BN_abs_is_word didn't work reliably for w == 0 until 0.9.8 */ 00400 # define BN_abs_is_word(a,w) ((((a)->top == 1) && ((a)->d[0] == (BN_ULONG)(w))) || \ 00401 (((w) == 0) && ((a)->top == 0))) 00402 # define BN_is_zero(a) ((a)->top == 0) 00403 # define BN_is_one(a) (BN_abs_is_word((a),1) && !(a)->neg) 00404 # define BN_is_word(a,w) (BN_abs_is_word((a),(w)) && (!(w) || !(a)->neg)) 00405 # define BN_is_odd(a) (((a)->top > 0) && ((a)->d[0] & 1)) 00406 00407 # define BN_one(a) (BN_set_word((a),1)) 00408 # define BN_zero_ex(a) \ 00409 do { \ 00410 BIGNUM *_tmp_bn = (a); \ 00411 _tmp_bn->top = 0; \ 00412 _tmp_bn->neg = 0; \ 00413 } while(0) 00414 # ifdef OPENSSL_NO_DEPRECATED 00415 # define BN_zero(a) BN_zero_ex(a) 00416 # else 00417 # define BN_zero(a) (BN_set_word((a),0)) 00418 # endif 00419 00420 const BIGNUM *BN_value_one(void); 00421 char *BN_options(void); 00422 BN_CTX *BN_CTX_new(void); 00423 # ifndef OPENSSL_NO_DEPRECATED 00424 void BN_CTX_init(BN_CTX *c); 00425 # endif 00426 void BN_CTX_free(BN_CTX *c); 00427 void BN_CTX_start(BN_CTX *ctx); 00428 BIGNUM *BN_CTX_get(BN_CTX *ctx); 00429 void BN_CTX_end(BN_CTX *ctx); 00430 int BN_rand(BIGNUM *rnd, int bits, int top, int bottom); 00431 int BN_pseudo_rand(BIGNUM *rnd, int bits, int top, int bottom); 00432 int BN_rand_range(BIGNUM *rnd, const BIGNUM *range); 00433 int BN_pseudo_rand_range(BIGNUM *rnd, const BIGNUM *range); 00434 int BN_num_bits(const BIGNUM *a); 00435 int BN_num_bits_word(BN_ULONG); 00436 BIGNUM *BN_new(void); 00437 void BN_init(BIGNUM *); 00438 void BN_clear_free(BIGNUM *a); 00439 BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b); 00440 void BN_swap(BIGNUM *a, BIGNUM *b); 00441 BIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM *ret); 00442 int BN_bn2bin(const BIGNUM *a, unsigned char *to); 00443 BIGNUM *BN_mpi2bn(const unsigned char *s, int len, BIGNUM *ret); 00444 int BN_bn2mpi(const BIGNUM *a, unsigned char *to); 00445 int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); 00446 int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); 00447 int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); 00448 int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); 00449 int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx); 00450 int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx); 00455 void BN_set_negative(BIGNUM *b, int n); 00460 # define BN_is_negative(a) ((a)->neg != 0) 00461 00462 int BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, const BIGNUM *d, 00463 BN_CTX *ctx); 00464 # define BN_mod(rem,m,d,ctx) BN_div(NULL,(rem),(m),(d),(ctx)) 00465 int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx); 00466 int BN_mod_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m, 00467 BN_CTX *ctx); 00468 int BN_mod_add_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, 00469 const BIGNUM *m); 00470 int BN_mod_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m, 00471 BN_CTX *ctx); 00472 int BN_mod_sub_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, 00473 const BIGNUM *m); 00474 int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m, 00475 BN_CTX *ctx); 00476 int BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx); 00477 int BN_mod_lshift1(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx); 00478 int BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *m); 00479 int BN_mod_lshift(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m, 00480 BN_CTX *ctx); 00481 int BN_mod_lshift_quick(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m); 00482 00483 BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w); 00484 BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w); 00485 int BN_mul_word(BIGNUM *a, BN_ULONG w); 00486 int BN_add_word(BIGNUM *a, BN_ULONG w); 00487 int BN_sub_word(BIGNUM *a, BN_ULONG w); 00488 int BN_set_word(BIGNUM *a, BN_ULONG w); 00489 BN_ULONG BN_get_word(const BIGNUM *a); 00490 00491 int BN_cmp(const BIGNUM *a, const BIGNUM *b); 00492 void BN_free(BIGNUM *a); 00493 int BN_is_bit_set(const BIGNUM *a, int n); 00494 int BN_lshift(BIGNUM *r, const BIGNUM *a, int n); 00495 int BN_lshift1(BIGNUM *r, const BIGNUM *a); 00496 int BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx); 00497 00498 int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, 00499 const BIGNUM *m, BN_CTX *ctx); 00500 int BN_mod_exp_mont(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, 00501 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx); 00502 int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p, 00503 const BIGNUM *m, BN_CTX *ctx, 00504 BN_MONT_CTX *in_mont); 00505 int BN_mod_exp_mont_word(BIGNUM *r, BN_ULONG a, const BIGNUM *p, 00506 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx); 00507 int BN_mod_exp2_mont(BIGNUM *r, const BIGNUM *a1, const BIGNUM *p1, 00508 const BIGNUM *a2, const BIGNUM *p2, const BIGNUM *m, 00509 BN_CTX *ctx, BN_MONT_CTX *m_ctx); 00510 int BN_mod_exp_simple(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, 00511 const BIGNUM *m, BN_CTX *ctx); 00512 00513 int BN_mask_bits(BIGNUM *a, int n); 00514 # ifndef OPENSSL_NO_FP_API 00515 int BN_print_fp(FILE *fp, const BIGNUM *a); 00516 # endif 00517 # ifdef HEADER_BIO_H 00518 int BN_print(BIO *fp, const BIGNUM *a); 00519 # else 00520 int BN_print(void *fp, const BIGNUM *a); 00521 # endif 00522 int BN_reciprocal(BIGNUM *r, const BIGNUM *m, int len, BN_CTX *ctx); 00523 int BN_rshift(BIGNUM *r, const BIGNUM *a, int n); 00524 int BN_rshift1(BIGNUM *r, const BIGNUM *a); 00525 void BN_clear(BIGNUM *a); 00526 BIGNUM *BN_dup(const BIGNUM *a); 00527 int BN_ucmp(const BIGNUM *a, const BIGNUM *b); 00528 int BN_set_bit(BIGNUM *a, int n); 00529 int BN_clear_bit(BIGNUM *a, int n); 00530 char *BN_bn2hex(const BIGNUM *a); 00531 char *BN_bn2dec(const BIGNUM *a); 00532 int BN_hex2bn(BIGNUM **a, const char *str); 00533 int BN_dec2bn(BIGNUM **a, const char *str); 00534 int BN_asc2bn(BIGNUM **a, const char *str); 00535 int BN_gcd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx); 00536 int BN_kronecker(const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx); /* returns 00537 * -2 for 00538 * error */ 00539 BIGNUM *BN_mod_inverse(BIGNUM *ret, 00540 const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx); 00541 BIGNUM *BN_mod_sqrt(BIGNUM *ret, 00542 const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx); 00543 00544 void BN_consttime_swap(BN_ULONG swap, BIGNUM *a, BIGNUM *b, int nwords); 00545 00546 /* Deprecated versions */ 00547 # ifndef OPENSSL_NO_DEPRECATED 00548 BIGNUM *BN_generate_prime(BIGNUM *ret, int bits, int safe, 00549 const BIGNUM *add, const BIGNUM *rem, 00550 void (*callback) (int, int, void *), void *cb_arg); 00551 int BN_is_prime(const BIGNUM *p, int nchecks, 00552 void (*callback) (int, int, void *), 00553 BN_CTX *ctx, void *cb_arg); 00554 int BN_is_prime_fasttest(const BIGNUM *p, int nchecks, 00555 void (*callback) (int, int, void *), BN_CTX *ctx, 00556 void *cb_arg, int do_trial_division); 00557 # endif /* !defined(OPENSSL_NO_DEPRECATED) */ 00558 00559 /* Newer versions */ 00560 int BN_generate_prime_ex(BIGNUM *ret, int bits, int safe, const BIGNUM *add, 00561 const BIGNUM *rem, BN_GENCB *cb); 00562 int BN_is_prime_ex(const BIGNUM *p, int nchecks, BN_CTX *ctx, BN_GENCB *cb); 00563 int BN_is_prime_fasttest_ex(const BIGNUM *p, int nchecks, BN_CTX *ctx, 00564 int do_trial_division, BN_GENCB *cb); 00565 00566 int BN_X931_generate_Xpq(BIGNUM *Xp, BIGNUM *Xq, int nbits, BN_CTX *ctx); 00567 00568 int BN_X931_derive_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2, 00569 const BIGNUM *Xp, const BIGNUM *Xp1, 00570 const BIGNUM *Xp2, const BIGNUM *e, BN_CTX *ctx, 00571 BN_GENCB *cb); 00572 int BN_X931_generate_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2, BIGNUM *Xp1, 00573 BIGNUM *Xp2, const BIGNUM *Xp, const BIGNUM *e, 00574 BN_CTX *ctx, BN_GENCB *cb); 00575 00576 BN_MONT_CTX *BN_MONT_CTX_new(void); 00577 void BN_MONT_CTX_init(BN_MONT_CTX *ctx); 00578 int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, 00579 BN_MONT_CTX *mont, BN_CTX *ctx); 00580 # define BN_to_montgomery(r,a,mont,ctx) BN_mod_mul_montgomery(\ 00581 (r),(a),&((mont)->RR),(mont),(ctx)) 00582 int BN_from_montgomery(BIGNUM *r, const BIGNUM *a, 00583 BN_MONT_CTX *mont, BN_CTX *ctx); 00584 void BN_MONT_CTX_free(BN_MONT_CTX *mont); 00585 int BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *mod, BN_CTX *ctx); 00586 BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to, BN_MONT_CTX *from); 00587 BN_MONT_CTX *BN_MONT_CTX_set_locked(BN_MONT_CTX **pmont, int lock, 00588 const BIGNUM *mod, BN_CTX *ctx); 00589 00590 /* BN_BLINDING flags */ 00591 # define BN_BLINDING_NO_UPDATE 0x00000001 00592 # define BN_BLINDING_NO_RECREATE 0x00000002 00593 00594 BN_BLINDING *BN_BLINDING_new(const BIGNUM *A, const BIGNUM *Ai, BIGNUM *mod); 00595 void BN_BLINDING_free(BN_BLINDING *b); 00596 int BN_BLINDING_update(BN_BLINDING *b, BN_CTX *ctx); 00597 int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx); 00598 int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx); 00599 int BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b, BN_CTX *); 00600 int BN_BLINDING_invert_ex(BIGNUM *n, const BIGNUM *r, BN_BLINDING *b, 00601 BN_CTX *); 00602 # ifndef OPENSSL_NO_DEPRECATED 00603 unsigned long BN_BLINDING_get_thread_id(const BN_BLINDING *); 00604 void BN_BLINDING_set_thread_id(BN_BLINDING *, unsigned long); 00605 # endif 00606 CRYPTO_THREADID *BN_BLINDING_thread_id(BN_BLINDING *); 00607 unsigned long BN_BLINDING_get_flags(const BN_BLINDING *); 00608 void BN_BLINDING_set_flags(BN_BLINDING *, unsigned long); 00609 BN_BLINDING *BN_BLINDING_create_param(BN_BLINDING *b, 00610 const BIGNUM *e, BIGNUM *m, BN_CTX *ctx, 00611 int (*bn_mod_exp) (BIGNUM *r, 00612 const BIGNUM *a, 00613 const BIGNUM *p, 00614 const BIGNUM *m, 00615 BN_CTX *ctx, 00616 BN_MONT_CTX *m_ctx), 00617 BN_MONT_CTX *m_ctx); 00618 00619 # ifndef OPENSSL_NO_DEPRECATED 00620 void BN_set_params(int mul, int high, int low, int mont); 00621 int BN_get_params(int which); /* 0, mul, 1 high, 2 low, 3 mont */ 00622 # endif 00623 00624 void BN_RECP_CTX_init(BN_RECP_CTX *recp); 00625 BN_RECP_CTX *BN_RECP_CTX_new(void); 00626 void BN_RECP_CTX_free(BN_RECP_CTX *recp); 00627 int BN_RECP_CTX_set(BN_RECP_CTX *recp, const BIGNUM *rdiv, BN_CTX *ctx); 00628 int BN_mod_mul_reciprocal(BIGNUM *r, const BIGNUM *x, const BIGNUM *y, 00629 BN_RECP_CTX *recp, BN_CTX *ctx); 00630 int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, 00631 const BIGNUM *m, BN_CTX *ctx); 00632 int BN_div_recp(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, 00633 BN_RECP_CTX *recp, BN_CTX *ctx); 00634 00635 # ifndef OPENSSL_NO_EC2M 00636 00637 /* 00638 * Functions for arithmetic over binary polynomials represented by BIGNUMs. 00639 * The BIGNUM::neg property of BIGNUMs representing binary polynomials is 00640 * ignored. Note that input arguments are not const so that their bit arrays 00641 * can be expanded to the appropriate size if needed. 00642 */ 00643 00644 /* 00645 * r = a + b 00646 */ 00647 int BN_GF2m_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); 00648 # define BN_GF2m_sub(r, a, b) BN_GF2m_add(r, a, b) 00649 /* 00650 * r=a mod p 00651 */ 00652 int BN_GF2m_mod(BIGNUM *r, const BIGNUM *a, const BIGNUM *p); 00653 /* r = (a * b) mod p */ 00654 int BN_GF2m_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, 00655 const BIGNUM *p, BN_CTX *ctx); 00656 /* r = (a * a) mod p */ 00657 int BN_GF2m_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx); 00658 /* r = (1 / b) mod p */ 00659 int BN_GF2m_mod_inv(BIGNUM *r, const BIGNUM *b, const BIGNUM *p, BN_CTX *ctx); 00660 /* r = (a / b) mod p */ 00661 int BN_GF2m_mod_div(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, 00662 const BIGNUM *p, BN_CTX *ctx); 00663 /* r = (a ^ b) mod p */ 00664 int BN_GF2m_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, 00665 const BIGNUM *p, BN_CTX *ctx); 00666 /* r = sqrt(a) mod p */ 00667 int BN_GF2m_mod_sqrt(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, 00668 BN_CTX *ctx); 00669 /* r^2 + r = a mod p */ 00670 int BN_GF2m_mod_solve_quad(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, 00671 BN_CTX *ctx); 00672 # define BN_GF2m_cmp(a, b) BN_ucmp((a), (b)) 00673 /*- 00674 * Some functions allow for representation of the irreducible polynomials 00675 * as an unsigned int[], say p. The irreducible f(t) is then of the form: 00676 * t^p[0] + t^p[1] + ... + t^p[k] 00677 * where m = p[0] > p[1] > ... > p[k] = 0. 00678 */ 00679 /* r = a mod p */ 00680 int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const int p[]); 00681 /* r = (a * b) mod p */ 00682 int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, 00683 const int p[], BN_CTX *ctx); 00684 /* r = (a * a) mod p */ 00685 int BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const int p[], 00686 BN_CTX *ctx); 00687 /* r = (1 / b) mod p */ 00688 int BN_GF2m_mod_inv_arr(BIGNUM *r, const BIGNUM *b, const int p[], 00689 BN_CTX *ctx); 00690 /* r = (a / b) mod p */ 00691 int BN_GF2m_mod_div_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, 00692 const int p[], BN_CTX *ctx); 00693 /* r = (a ^ b) mod p */ 00694 int BN_GF2m_mod_exp_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, 00695 const int p[], BN_CTX *ctx); 00696 /* r = sqrt(a) mod p */ 00697 int BN_GF2m_mod_sqrt_arr(BIGNUM *r, const BIGNUM *a, 00698 const int p[], BN_CTX *ctx); 00699 /* r^2 + r = a mod p */ 00700 int BN_GF2m_mod_solve_quad_arr(BIGNUM *r, const BIGNUM *a, 00701 const int p[], BN_CTX *ctx); 00702 int BN_GF2m_poly2arr(const BIGNUM *a, int p[], int max); 00703 int BN_GF2m_arr2poly(const int p[], BIGNUM *a); 00704 00705 # endif 00706 00707 /* 00708 * faster mod functions for the 'NIST primes' 0 <= a < p^2 00709 */ 00710 int BN_nist_mod_192(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx); 00711 int BN_nist_mod_224(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx); 00712 int BN_nist_mod_256(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx); 00713 int BN_nist_mod_384(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx); 00714 int BN_nist_mod_521(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx); 00715 00716 const BIGNUM *BN_get0_nist_prime_192(void); 00717 const BIGNUM *BN_get0_nist_prime_224(void); 00718 const BIGNUM *BN_get0_nist_prime_256(void); 00719 const BIGNUM *BN_get0_nist_prime_384(void); 00720 const BIGNUM *BN_get0_nist_prime_521(void); 00721 00722 /* library internal functions */ 00723 00724 # define bn_expand(a,bits) ((((((bits+BN_BITS2-1))/BN_BITS2)) <= (a)->dmax)?\ 00725 (a):bn_expand2((a),(bits+BN_BITS2-1)/BN_BITS2)) 00726 # define bn_wexpand(a,words) (((words) <= (a)->dmax)?(a):bn_expand2((a),(words))) 00727 BIGNUM *bn_expand2(BIGNUM *a, int words); 00728 # ifndef OPENSSL_NO_DEPRECATED 00729 BIGNUM *bn_dup_expand(const BIGNUM *a, int words); /* unused */ 00730 # endif 00731 00732 /*- 00733 * Bignum consistency macros 00734 * There is one "API" macro, bn_fix_top(), for stripping leading zeroes from 00735 * bignum data after direct manipulations on the data. There is also an 00736 * "internal" macro, bn_check_top(), for verifying that there are no leading 00737 * zeroes. Unfortunately, some auditing is required due to the fact that 00738 * bn_fix_top() has become an overabused duct-tape because bignum data is 00739 * occasionally passed around in an inconsistent state. So the following 00740 * changes have been made to sort this out; 00741 * - bn_fix_top()s implementation has been moved to bn_correct_top() 00742 * - if BN_DEBUG isn't defined, bn_fix_top() maps to bn_correct_top(), and 00743 * bn_check_top() is as before. 00744 * - if BN_DEBUG *is* defined; 00745 * - bn_check_top() tries to pollute unused words even if the bignum 'top' is 00746 * consistent. (ed: only if BN_DEBUG_RAND is defined) 00747 * - bn_fix_top() maps to bn_check_top() rather than "fixing" anything. 00748 * The idea is to have debug builds flag up inconsistent bignums when they 00749 * occur. If that occurs in a bn_fix_top(), we examine the code in question; if 00750 * the use of bn_fix_top() was appropriate (ie. it follows directly after code 00751 * that manipulates the bignum) it is converted to bn_correct_top(), and if it 00752 * was not appropriate, we convert it permanently to bn_check_top() and track 00753 * down the cause of the bug. Eventually, no internal code should be using the 00754 * bn_fix_top() macro. External applications and libraries should try this with 00755 * their own code too, both in terms of building against the openssl headers 00756 * with BN_DEBUG defined *and* linking with a version of OpenSSL built with it 00757 * defined. This not only improves external code, it provides more test 00758 * coverage for openssl's own code. 00759 */ 00760 00761 # ifdef BN_DEBUG 00762 00763 /* We only need assert() when debugging */ 00764 # include <assert.h> 00765 00766 # ifdef BN_DEBUG_RAND 00767 /* To avoid "make update" cvs wars due to BN_DEBUG, use some tricks */ 00768 # ifndef RAND_pseudo_bytes 00769 int RAND_pseudo_bytes(unsigned char *buf, int num); 00770 # define BN_DEBUG_TRIX 00771 # endif 00772 # define bn_pollute(a) \ 00773 do { \ 00774 const BIGNUM *_bnum1 = (a); \ 00775 if(_bnum1->top < _bnum1->dmax) { \ 00776 unsigned char _tmp_char; \ 00777 /* We cast away const without the compiler knowing, any \ 00778 * *genuinely* constant variables that aren't mutable \ 00779 * wouldn't be constructed with top!=dmax. */ \ 00780 BN_ULONG *_not_const; \ 00781 memcpy(&_not_const, &_bnum1->d, sizeof(BN_ULONG*)); \ 00782 /* Debug only - safe to ignore error return */ \ 00783 RAND_pseudo_bytes(&_tmp_char, 1); \ 00784 memset((unsigned char *)(_not_const + _bnum1->top), _tmp_char, \ 00785 (_bnum1->dmax - _bnum1->top) * sizeof(BN_ULONG)); \ 00786 } \ 00787 } while(0) 00788 # ifdef BN_DEBUG_TRIX 00789 # undef RAND_pseudo_bytes 00790 # endif 00791 # else 00792 # define bn_pollute(a) 00793 # endif 00794 # define bn_check_top(a) \ 00795 do { \ 00796 const BIGNUM *_bnum2 = (a); \ 00797 if (_bnum2 != NULL) { \ 00798 assert((_bnum2->top == 0) || \ 00799 (_bnum2->d[_bnum2->top - 1] != 0)); \ 00800 bn_pollute(_bnum2); \ 00801 } \ 00802 } while(0) 00803 00804 # define bn_fix_top(a) bn_check_top(a) 00805 00806 # define bn_check_size(bn, bits) bn_wcheck_size(bn, ((bits+BN_BITS2-1))/BN_BITS2) 00807 # define bn_wcheck_size(bn, words) \ 00808 do { \ 00809 const BIGNUM *_bnum2 = (bn); \ 00810 assert((words) <= (_bnum2)->dmax && (words) >= (_bnum2)->top); \ 00811 /* avoid unused variable warning with NDEBUG */ \ 00812 (void)(_bnum2); \ 00813 } while(0) 00814 00815 # else /* !BN_DEBUG */ 00816 00817 # define bn_pollute(a) 00818 # define bn_check_top(a) 00819 # define bn_fix_top(a) bn_correct_top(a) 00820 # define bn_check_size(bn, bits) 00821 # define bn_wcheck_size(bn, words) 00822 00823 # endif 00824 00825 # define bn_correct_top(a) \ 00826 { \ 00827 BN_ULONG *ftl; \ 00828 int tmp_top = (a)->top; \ 00829 if (tmp_top > 0) \ 00830 { \ 00831 for (ftl= &((a)->d[tmp_top-1]); tmp_top > 0; tmp_top--) \ 00832 if (*(ftl--)) break; \ 00833 (a)->top = tmp_top; \ 00834 } \ 00835 bn_pollute(a); \ 00836 } 00837 00838 BN_ULONG bn_mul_add_words(BN_ULONG *rp, const BN_ULONG *ap, int num, 00839 BN_ULONG w); 00840 BN_ULONG bn_mul_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w); 00841 void bn_sqr_words(BN_ULONG *rp, const BN_ULONG *ap, int num); 00842 BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d); 00843 BN_ULONG bn_add_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp, 00844 int num); 00845 BN_ULONG bn_sub_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp, 00846 int num); 00847 00848 /* Primes from RFC 2409 */ 00849 BIGNUM *get_rfc2409_prime_768(BIGNUM *bn); 00850 BIGNUM *get_rfc2409_prime_1024(BIGNUM *bn); 00851 00852 /* Primes from RFC 3526 */ 00853 BIGNUM *get_rfc3526_prime_1536(BIGNUM *bn); 00854 BIGNUM *get_rfc3526_prime_2048(BIGNUM *bn); 00855 BIGNUM *get_rfc3526_prime_3072(BIGNUM *bn); 00856 BIGNUM *get_rfc3526_prime_4096(BIGNUM *bn); 00857 BIGNUM *get_rfc3526_prime_6144(BIGNUM *bn); 00858 BIGNUM *get_rfc3526_prime_8192(BIGNUM *bn); 00859 00860 int BN_bntest_rand(BIGNUM *rnd, int bits, int top, int bottom); 00861 00862 /* BEGIN ERROR CODES */ 00863 /* 00864 * The following lines are auto generated by the script mkerr.pl. Any changes 00865 * made after this point may be overwritten when the script is next run. 00866 */ 00867 void ERR_load_BN_strings(void); 00868 00869 /* Error codes for the BN functions. */ 00870 00871 /* Function codes. */ 00872 # define BN_F_BNRAND 127 00873 # define BN_F_BN_BLINDING_CONVERT_EX 100 00874 # define BN_F_BN_BLINDING_CREATE_PARAM 128 00875 # define BN_F_BN_BLINDING_INVERT_EX 101 00876 # define BN_F_BN_BLINDING_NEW 102 00877 # define BN_F_BN_BLINDING_UPDATE 103 00878 # define BN_F_BN_BN2DEC 104 00879 # define BN_F_BN_BN2HEX 105 00880 # define BN_F_BN_CTX_GET 116 00881 # define BN_F_BN_CTX_NEW 106 00882 # define BN_F_BN_CTX_START 129 00883 # define BN_F_BN_DIV 107 00884 # define BN_F_BN_DIV_NO_BRANCH 138 00885 # define BN_F_BN_DIV_RECP 130 00886 # define BN_F_BN_EXP 123 00887 # define BN_F_BN_EXPAND2 108 00888 # define BN_F_BN_EXPAND_INTERNAL 120 00889 # define BN_F_BN_GF2M_MOD 131 00890 # define BN_F_BN_GF2M_MOD_EXP 132 00891 # define BN_F_BN_GF2M_MOD_MUL 133 00892 # define BN_F_BN_GF2M_MOD_SOLVE_QUAD 134 00893 # define BN_F_BN_GF2M_MOD_SOLVE_QUAD_ARR 135 00894 # define BN_F_BN_GF2M_MOD_SQR 136 00895 # define BN_F_BN_GF2M_MOD_SQRT 137 00896 # define BN_F_BN_LSHIFT 145 00897 # define BN_F_BN_MOD_EXP2_MONT 118 00898 # define BN_F_BN_MOD_EXP_MONT 109 00899 # define BN_F_BN_MOD_EXP_MONT_CONSTTIME 124 00900 # define BN_F_BN_MOD_EXP_MONT_WORD 117 00901 # define BN_F_BN_MOD_EXP_RECP 125 00902 # define BN_F_BN_MOD_EXP_SIMPLE 126 00903 # define BN_F_BN_MOD_INVERSE 110 00904 # define BN_F_BN_MOD_INVERSE_NO_BRANCH 139 00905 # define BN_F_BN_MOD_LSHIFT_QUICK 119 00906 # define BN_F_BN_MOD_MUL_RECIPROCAL 111 00907 # define BN_F_BN_MOD_SQRT 121 00908 # define BN_F_BN_MPI2BN 112 00909 # define BN_F_BN_NEW 113 00910 # define BN_F_BN_RAND 114 00911 # define BN_F_BN_RAND_RANGE 122 00912 # define BN_F_BN_RSHIFT 146 00913 # define BN_F_BN_USUB 115 00914 00915 /* Reason codes. */ 00916 # define BN_R_ARG2_LT_ARG3 100 00917 # define BN_R_BAD_RECIPROCAL 101 00918 # define BN_R_BIGNUM_TOO_LONG 114 00919 # define BN_R_BITS_TOO_SMALL 118 00920 # define BN_R_CALLED_WITH_EVEN_MODULUS 102 00921 # define BN_R_DIV_BY_ZERO 103 00922 # define BN_R_ENCODING_ERROR 104 00923 # define BN_R_EXPAND_ON_STATIC_BIGNUM_DATA 105 00924 # define BN_R_INPUT_NOT_REDUCED 110 00925 # define BN_R_INVALID_LENGTH 106 00926 # define BN_R_INVALID_RANGE 115 00927 # define BN_R_INVALID_SHIFT 119 00928 # define BN_R_NOT_A_SQUARE 111 00929 # define BN_R_NOT_INITIALIZED 107 00930 # define BN_R_NO_INVERSE 108 00931 # define BN_R_NO_SOLUTION 116 00932 # define BN_R_P_IS_NOT_PRIME 112 00933 # define BN_R_TOO_MANY_ITERATIONS 113 00934 # define BN_R_TOO_MANY_TEMPORARY_VARIABLES 109 00935 00936 #ifdef __cplusplus 00937 } 00938 #endif 00939 #endif