1 /* DO NOT EDIT THIS FILE. 2 3 It has been auto-edited by fixincludes from: 4 5 "/usr/include/openssl/bn.h" 6 7 This had to be done to correct non-standard usages in the 8 original, manufacturer supplied header file. */ 9 10 /* crypto/bn/bn.h */ 11 /* Copyright (C) 1995-1997 Eric Young (eay (at) cryptsoft.com) 12 * All rights reserved. 13 * 14 * This package is an SSL implementation written 15 * by Eric Young (eay (at) cryptsoft.com). 16 * The implementation was written so as to conform with Netscapes SSL. 17 * 18 * This library is free for commercial and non-commercial use as long as 19 * the following conditions are aheared to. The following conditions 20 * apply to all code found in this distribution, be it the RC4, RSA, 21 * lhash, DES, etc., code; not just the SSL code. The SSL documentation 22 * included with this distribution is covered by the same copyright terms 23 * except that the holder is Tim Hudson (tjh (at) cryptsoft.com). 24 * 25 * Copyright remains Eric Young's, and as such any Copyright notices in 26 * the code are not to be removed. 27 * If this package is used in a product, Eric Young should be given attribution 28 * as the author of the parts of the library used. 29 * This can be in the form of a textual message at program startup or 30 * in documentation (online or textual) provided with the package. 31 * 32 * Redistribution and use in source and binary forms, with or without 33 * modification, are permitted provided that the following conditions 34 * are met: 35 * 1. Redistributions of source code must retain the copyright 36 * notice, this list of conditions and the following disclaimer. 37 * 2. Redistributions in binary form must reproduce the above copyright 38 * notice, this list of conditions and the following disclaimer in the 39 * documentation and/or other materials provided with the distribution. 40 * 3. All advertising materials mentioning features or use of this software 41 * must display the following acknowledgement: 42 * "This product includes cryptographic software written by 43 * Eric Young (eay (at) cryptsoft.com)" 44 * The word 'cryptographic' can be left out if the rouines from the library 45 * being used are not cryptographic related :-). 46 * 4. If you include any Windows specific code (or a derivative thereof) from 47 * the apps directory (application code) you must include an acknowledgement: 48 * "This product includes software written by Tim Hudson (tjh (at) cryptsoft.com)" 49 * 50 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND 51 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 52 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 53 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 54 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 55 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 56 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 57 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 58 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 59 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 60 * SUCH DAMAGE. 61 * 62 * The licence and distribution terms for any publically available version or 63 * derivative of this code cannot be changed. i.e. this code cannot simply be 64 * copied and put under another distribution licence 65 * [including the GNU Public Licence.] 66 */ 67 /* ==================================================================== 68 * Copyright 2002 Sun Microsystems, Inc. ALL RIGHTS RESERVED. 69 * 70 * Portions of the attached software ("Contribution") are developed by 71 * SUN MICROSYSTEMS, INC., and are contributed to the OpenSSL project. 72 * 73 * The Contribution is licensed pursuant to the Eric Young open source 74 * license provided above. 75 * 76 * The binary polynomial arithmetic software is originally written by 77 * Sheueling Chang Shantz and Douglas Stebila of Sun Microsystems Laboratories. 78 * 79 */ 80 81 #ifndef HEADER_BN_H 82 #define HEADER_BN_H 83 84 #include <openssl/e_os2.h> 85 #ifndef OPENSSL_NO_FP_API 86 #include <stdio.h> /* FILE */ 87 #endif 88 #include <openssl/ossl_typ.h> 89 90 #ifdef __cplusplus 91 extern "C" { 92 #endif 93 94 /* These preprocessor symbols control various aspects of the bignum headers and 95 * library code. They're not defined by any "normal" configuration, as they are 96 * intended for development and testing purposes. NB: defining all three can be 97 * useful for debugging application code as well as openssl itself. 98 * 99 * BN_DEBUG - turn on various debugging alterations to the bignum code 100 * BN_DEBUG_RAND - uses random poisoning of unused words to trip up 101 * mismanagement of bignum internals. You must also define BN_DEBUG. 102 */ 103 /* #define BN_DEBUG */ 104 /* #define BN_DEBUG_RAND */ 105 106 #define BN_MUL_COMBA 107 #define BN_SQR_COMBA 108 #define BN_RECURSION 109 110 /* This next option uses the C libraries (2 word)/(1 word) function. 111 * If it is not defined, I use my C version (which is slower). 112 * The reason for this flag is that when the particular C compiler 113 * library routine is used, and the library is linked with a different 114 * compiler, the library is missing. This mostly happens when the 115 * library is built with gcc and then linked using normal cc. This would 116 * be a common occurrence because gcc normally produces code that is 117 * 2 times faster than system compilers for the big number stuff. 118 * For machines with only one compiler (or shared libraries), this should 119 * be on. Again this in only really a problem on machines 120 * using "long long's", are 32bit, and are not using my assembler code. */ 121 #if defined(OPENSSL_SYS_MSDOS) || defined(OPENSSL_SYS_WINDOWS) || \ 122 defined(OPENSSL_SYS_WIN32) || defined(__linux__) 123 # ifndef BN_DIV2W 124 # define BN_DIV2W 125 # endif 126 #endif 127 128 /* assuming long is 64bit - this is the DEC Alpha 129 * unsigned long long is only 64 bits :-(, don't define 130 * BN_LLONG for the DEC Alpha */ 131 #ifdef SIXTY_FOUR_BIT_LONG 132 #define BN_ULLONG unsigned long long 133 #define BN_ULONG unsigned long 134 #define BN_LONG long 135 #define BN_BITS 128 136 #define BN_BYTES 8 137 #define BN_BITS2 64 138 #define BN_BITS4 32 139 #define BN_MASK (0xffffffffffffffffffffffffffffffffLL) 140 #define BN_MASK2 (0xffffffffffffffffL) 141 #define BN_MASK2l (0xffffffffL) 142 #define BN_MASK2h (0xffffffff00000000L) 143 #define BN_MASK2h1 (0xffffffff80000000L) 144 #define BN_TBIT (0x8000000000000000L) 145 #define BN_DEC_CONV (10000000000000000000UL) 146 #define BN_DEC_FMT1 "%lu" 147 #define BN_DEC_FMT2 "%019lu" 148 #define BN_DEC_NUM 19 149 #endif 150 151 /* This is where the long long data type is 64 bits, but long is 32. 152 * For machines where there are 64bit registers, this is the mode to use. 153 * IRIX, on R4000 and above should use this mode, along with the relevant 154 * assembler code :-). Do NOT define BN_LLONG. 155 */ 156 #ifdef SIXTY_FOUR_BIT 157 #undef BN_LLONG 158 #undef BN_ULLONG 159 #define BN_ULONG unsigned long long 160 #define BN_LONG long long 161 #define BN_BITS 128 162 #define BN_BYTES 8 163 #define BN_BITS2 64 164 #define BN_BITS4 32 165 #define BN_MASK2 (0xffffffffffffffffLL) 166 #define BN_MASK2l (0xffffffffL) 167 #define BN_MASK2h (0xffffffff00000000LL) 168 #define BN_MASK2h1 (0xffffffff80000000LL) 169 #define BN_TBIT (0x8000000000000000LL) 170 #define BN_DEC_CONV (10000000000000000000ULL) 171 #define BN_DEC_FMT1 "%llu" 172 #define BN_DEC_FMT2 "%019llu" 173 #define BN_DEC_NUM 19 174 #endif 175 176 #ifdef THIRTY_TWO_BIT 177 #ifdef BN_LLONG 178 # if defined(OPENSSL_SYS_WIN32) && !defined(__GNUC__) 179 # define BN_ULLONG unsigned __int64 180 # else 181 # define BN_ULLONG unsigned long long 182 # endif 183 #endif 184 #define BN_ULONG unsigned long 185 #define BN_LONG long 186 #define BN_BITS 64 187 #define BN_BYTES 4 188 #define BN_BITS2 32 189 #define BN_BITS4 16 190 #ifdef OPENSSL_SYS_WIN32 191 /* VC++ doesn't like the LL suffix */ 192 #define BN_MASK (0xffffffffffffffffL) 193 #else 194 #define BN_MASK (0xffffffffffffffffLL) 195 #endif 196 #define BN_MASK2 (0xffffffffL) 197 #define BN_MASK2l (0xffff) 198 #define BN_MASK2h1 (0xffff8000L) 199 #define BN_MASK2h (0xffff0000L) 200 #define BN_TBIT (0x80000000L) 201 #define BN_DEC_CONV (1000000000L) 202 #define BN_DEC_FMT1 "%lu" 203 #define BN_DEC_FMT2 "%09lu" 204 #define BN_DEC_NUM 9 205 #endif 206 207 #ifdef SIXTEEN_BIT 208 #ifndef BN_DIV2W 209 #define BN_DIV2W 210 #endif 211 #define BN_ULLONG unsigned long 212 #define BN_ULONG unsigned short 213 #define BN_LONG short 214 #define BN_BITS 32 215 #define BN_BYTES 2 216 #define BN_BITS2 16 217 #define BN_BITS4 8 218 #define BN_MASK (0xffffffff) 219 #define BN_MASK2 (0xffff) 220 #define BN_MASK2l (0xff) 221 #define BN_MASK2h1 (0xff80) 222 #define BN_MASK2h (0xff00) 223 #define BN_TBIT (0x8000) 224 #define BN_DEC_CONV (100000) 225 #define BN_DEC_FMT1 "%u" 226 #define BN_DEC_FMT2 "%05u" 227 #define BN_DEC_NUM 5 228 #endif 229 230 #ifdef EIGHT_BIT 231 #ifndef BN_DIV2W 232 #define BN_DIV2W 233 #endif 234 #define BN_ULLONG unsigned short 235 #define BN_ULONG unsigned char 236 #define BN_LONG char 237 #define BN_BITS 16 238 #define BN_BYTES 1 239 #define BN_BITS2 8 240 #define BN_BITS4 4 241 #define BN_MASK (0xffff) 242 #define BN_MASK2 (0xff) 243 #define BN_MASK2l (0xf) 244 #define BN_MASK2h1 (0xf8) 245 #define BN_MASK2h (0xf0) 246 #define BN_TBIT (0x80) 247 #define BN_DEC_CONV (100) 248 #define BN_DEC_FMT1 "%u" 249 #define BN_DEC_FMT2 "%02u" 250 #define BN_DEC_NUM 2 251 #endif 252 253 #define BN_DEFAULT_BITS 1280 254 255 #define BN_FLG_MALLOCED 0x01 256 #define BN_FLG_STATIC_DATA 0x02 257 #define BN_FLG_EXP_CONSTTIME 0x04 /* avoid leaking exponent information through timings 258 * (BN_mod_exp_mont() will call BN_mod_exp_mont_consttime) */ 259 #ifndef OPENSSL_NO_DEPRECATED 260 #define BN_FLG_FREE 0x8000 /* used for debuging */ 261 #endif 262 #define BN_set_flags(b,n) ((b)->flags|=(n)) 263 #define BN_get_flags(b,n) ((b)->flags&(n)) 264 265 /* get a clone of a BIGNUM with changed flags, for *temporary* use only 266 * (the two BIGNUMs cannot not be used in parallel!) */ 267 #define BN_with_flags(dest,b,n) ((dest)->d=(b)->d, \ 268 (dest)->top=(b)->top, \ 269 (dest)->dmax=(b)->dmax, \ 270 (dest)->neg=(b)->neg, \ 271 (dest)->flags=(((dest)->flags & BN_FLG_MALLOCED) \ 272 | ((b)->flags & ~BN_FLG_MALLOCED) \ 273 | BN_FLG_STATIC_DATA \ 274 | (n))) 275 276 /* Already declared in ossl_typ.h */ 277 #if 0 278 typedef struct bignum_st BIGNUM; 279 /* Used for temp variables (declaration hidden in bn_lcl.h) */ 280 typedef struct bignum_ctx BN_CTX; 281 typedef struct bn_blinding_st BN_BLINDING; 282 typedef struct bn_mont_ctx_st BN_MONT_CTX; 283 typedef struct bn_recp_ctx_st BN_RECP_CTX; 284 typedef struct bn_gencb_st BN_GENCB; 285 #endif 286 287 struct bignum_st 288 { 289 BN_ULONG *d; /* Pointer to an array of 'BN_BITS2' bit chunks. */ 290 int top; /* Index of last used d +1. */ 291 /* The next are internal book keeping for bn_expand. */ 292 int dmax; /* Size of the d array. */ 293 int neg; /* one if the number is negative */ 294 int flags; 295 }; 296 297 /* Used for montgomery multiplication */ 298 struct bn_mont_ctx_st 299 { 300 int ri; /* number of bits in R */ 301 BIGNUM RR; /* used to convert to montgomery form */ 302 BIGNUM N; /* The modulus */ 303 BIGNUM Ni; /* R*(1/R mod N) - N*Ni = 1 304 * (Ni is only stored for bignum algorithm) */ 305 BN_ULONG n0; /* least significant word of Ni */ 306 int flags; 307 }; 308 309 /* Used for reciprocal division/mod functions 310 * It cannot be shared between threads 311 */ 312 struct bn_recp_ctx_st 313 { 314 BIGNUM N; /* the divisor */ 315 BIGNUM Nr; /* the reciprocal */ 316 int num_bits; 317 int shift; 318 int flags; 319 }; 320 321 /* Used for slow "generation" functions. */ 322 struct bn_gencb_st 323 { 324 unsigned int ver; /* To handle binary (in)compatibility */ 325 void *arg; /* callback-specific data */ 326 union 327 { 328 /* if(ver==1) - handles old style callbacks */ 329 void (*cb_1)(int, int, void *); 330 /* if(ver==2) - new callback style */ 331 int (*cb_2)(int, int, BN_GENCB *); 332 } cb; 333 }; 334 /* Wrapper function to make using BN_GENCB easier, */ 335 int BN_GENCB_call(BN_GENCB *cb, int a, int b); 336 /* Macro to populate a BN_GENCB structure with an "old"-style callback */ 337 #define BN_GENCB_set_old(gencb, callback, cb_arg) { \ 338 BN_GENCB *tmp_gencb = (gencb); \ 339 tmp_gencb->ver = 1; \ 340 tmp_gencb->arg = (cb_arg); \ 341 tmp_gencb->cb.cb_1 = (callback); } 342 /* Macro to populate a BN_GENCB structure with a "new"-style callback */ 343 #define BN_GENCB_set(gencb, callback, cb_arg) { \ 344 BN_GENCB *tmp_gencb = (gencb); \ 345 tmp_gencb->ver = 2; \ 346 tmp_gencb->arg = (cb_arg); \ 347 tmp_gencb->cb.cb_2 = (callback); } 348 349 #define BN_prime_checks 0 /* default: select number of iterations 350 based on the size of the number */ 351 352 /* number of Miller-Rabin iterations for an error rate of less than 2^-80 353 * for random 'b'-bit input, b >= 100 (taken from table 4.4 in the Handbook 354 * of Applied Cryptography [Menezes, van Oorschot, Vanstone; CRC Press 1996]; 355 * original paper: Damgaard, Landrock, Pomerance: Average case error estimates 356 * for the strong probable prime test. -- Math. Comp. 61 (1993) 177-194) */ 357 #define BN_prime_checks_for_size(b) ((b) >= 1300 ? 2 : \ 358 (b) >= 850 ? 3 : \ 359 (b) >= 650 ? 4 : \ 360 (b) >= 550 ? 5 : \ 361 (b) >= 450 ? 6 : \ 362 (b) >= 400 ? 7 : \ 363 (b) >= 350 ? 8 : \ 364 (b) >= 300 ? 9 : \ 365 (b) >= 250 ? 12 : \ 366 (b) >= 200 ? 15 : \ 367 (b) >= 150 ? 18 : \ 368 /* b >= 100 */ 27) 369 370 #define BN_num_bytes(a) ((BN_num_bits(a)+7)/8) 371 372 /* Note that BN_abs_is_word didn't work reliably for w == 0 until 0.9.8 */ 373 #define BN_abs_is_word(a,w) ((((a)->top == 1) && ((a)->d[0] == (BN_ULONG)(w))) || \ 374 (((w) == 0) && ((a)->top == 0))) 375 #define BN_is_zero(a) ((a)->top == 0) 376 #define BN_is_one(a) (BN_abs_is_word((a),1) && !(a)->neg) 377 #define BN_is_word(a,w) (BN_abs_is_word((a),(w)) && (!(w) || !(a)->neg)) 378 #define BN_is_odd(a) (((a)->top > 0) && ((a)->d[0] & 1)) 379 380 #define BN_one(a) (BN_set_word((a),1)) 381 #define BN_zero_ex(a) \ 382 do { \ 383 BIGNUM *_tmp_bn = (a); \ 384 _tmp_bn->top = 0; \ 385 _tmp_bn->neg = 0; \ 386 } while(0) 387 #ifdef OPENSSL_NO_DEPRECATED 388 #define BN_zero(a) BN_zero_ex(a) 389 #else 390 #define BN_zero(a) (BN_set_word((a),0)) 391 #endif 392 393 const BIGNUM *BN_value_one(void); 394 char * BN_options(void); 395 BN_CTX *BN_CTX_new(void); 396 #ifndef OPENSSL_NO_DEPRECATED 397 void BN_CTX_init(BN_CTX *c); 398 #endif 399 void BN_CTX_free(BN_CTX *c); 400 void BN_CTX_start(BN_CTX *ctx); 401 BIGNUM *BN_CTX_get(BN_CTX *ctx); 402 void BN_CTX_end(BN_CTX *ctx); 403 int BN_rand(BIGNUM *rnd, int bits, int top,int bottom); 404 int BN_pseudo_rand(BIGNUM *rnd, int bits, int top,int bottom); 405 int BN_rand_range(BIGNUM *rnd, BIGNUM *range); 406 int BN_pseudo_rand_range(BIGNUM *rnd, BIGNUM *range); 407 int BN_num_bits(const BIGNUM *a); 408 int BN_num_bits_word(BN_ULONG); 409 BIGNUM *BN_new(void); 410 void BN_init(BIGNUM *); 411 void BN_clear_free(BIGNUM *a); 412 BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b); 413 void BN_swap(BIGNUM *a, BIGNUM *b); 414 BIGNUM *BN_bin2bn(const unsigned char *s,int len,BIGNUM *ret); 415 int BN_bn2bin(const BIGNUM *a, unsigned char *to); 416 BIGNUM *BN_mpi2bn(const unsigned char *s,int len,BIGNUM *ret); 417 int BN_bn2mpi(const BIGNUM *a, unsigned char *to); 418 int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); 419 int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); 420 int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); 421 int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); 422 int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx); 423 int BN_sqr(BIGNUM *r, const BIGNUM *a,BN_CTX *ctx); 424 /* BN_set_negative(): sets sign of a bignum */ 425 void BN_set_negative(BIGNUM *b, int n); 426 /* BN_get_negative(): returns 1 if the bignum is < 0 and 0 otherwise */ 427 #define BN_is_negative(a) ((a)->neg != 0) 428 429 int BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, const BIGNUM *d, 430 BN_CTX *ctx); 431 #define BN_mod(rem,m,d,ctx) BN_div(NULL,(rem),(m),(d),(ctx)) 432 int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx); 433 int BN_mod_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m, BN_CTX *ctx); 434 int BN_mod_add_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m); 435 int BN_mod_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m, BN_CTX *ctx); 436 int BN_mod_sub_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m); 437 int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, 438 const BIGNUM *m, BN_CTX *ctx); 439 int BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx); 440 int BN_mod_lshift1(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx); 441 int BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *m); 442 int BN_mod_lshift(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m, BN_CTX *ctx); 443 int BN_mod_lshift_quick(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m); 444 445 BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w); 446 BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w); 447 int BN_mul_word(BIGNUM *a, BN_ULONG w); 448 int BN_add_word(BIGNUM *a, BN_ULONG w); 449 int BN_sub_word(BIGNUM *a, BN_ULONG w); 450 int BN_set_word(BIGNUM *a, BN_ULONG w); 451 BN_ULONG BN_get_word(const BIGNUM *a); 452 453 int BN_cmp(const BIGNUM *a, const BIGNUM *b); 454 void BN_free(BIGNUM *a); 455 int BN_is_bit_set(const BIGNUM *a, int n); 456 int BN_lshift(BIGNUM *r, const BIGNUM *a, int n); 457 int BN_lshift1(BIGNUM *r, const BIGNUM *a); 458 int BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,BN_CTX *ctx); 459 460 int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, 461 const BIGNUM *m,BN_CTX *ctx); 462 int BN_mod_exp_mont(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, 463 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx); 464 int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p, 465 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont); 466 int BN_mod_exp_mont_word(BIGNUM *r, BN_ULONG a, const BIGNUM *p, 467 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx); 468 int BN_mod_exp2_mont(BIGNUM *r, const BIGNUM *a1, const BIGNUM *p1, 469 const BIGNUM *a2, const BIGNUM *p2,const BIGNUM *m, 470 BN_CTX *ctx,BN_MONT_CTX *m_ctx); 471 int BN_mod_exp_simple(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, 472 const BIGNUM *m,BN_CTX *ctx); 473 474 int BN_mask_bits(BIGNUM *a,int n); 475 #ifndef OPENSSL_NO_FP_API 476 int BN_print_fp(FILE *fp, const BIGNUM *a); 477 #endif 478 #ifdef HEADER_BIO_H 479 int BN_print(BIO *fp, const BIGNUM *a); 480 #else 481 int BN_print(void *fp, const BIGNUM *a); 482 #endif 483 int BN_reciprocal(BIGNUM *r, const BIGNUM *m, int len, BN_CTX *ctx); 484 int BN_rshift(BIGNUM *r, const BIGNUM *a, int n); 485 int BN_rshift1(BIGNUM *r, const BIGNUM *a); 486 void BN_clear(BIGNUM *a); 487 BIGNUM *BN_dup(const BIGNUM *a); 488 int BN_ucmp(const BIGNUM *a, const BIGNUM *b); 489 int BN_set_bit(BIGNUM *a, int n); 490 int BN_clear_bit(BIGNUM *a, int n); 491 char * BN_bn2hex(const BIGNUM *a); 492 char * BN_bn2dec(const BIGNUM *a); 493 int BN_hex2bn(BIGNUM **a, const char *str); 494 int BN_dec2bn(BIGNUM **a, const char *str); 495 int BN_gcd(BIGNUM *r,const BIGNUM *a,const BIGNUM *b,BN_CTX *ctx); 496 int BN_kronecker(const BIGNUM *a,const BIGNUM *b,BN_CTX *ctx); /* returns -2 for error */ 497 BIGNUM *BN_mod_inverse(BIGNUM *ret, 498 const BIGNUM *a, const BIGNUM *n,BN_CTX *ctx); 499 BIGNUM *BN_mod_sqrt(BIGNUM *ret, 500 const BIGNUM *a, const BIGNUM *n,BN_CTX *ctx); 501 502 /* Deprecated versions */ 503 #ifndef OPENSSL_NO_DEPRECATED 504 BIGNUM *BN_generate_prime(BIGNUM *ret,int bits,int safe, 505 const BIGNUM *add, const BIGNUM *rem, 506 void (*callback)(int,int,void *),void *cb_arg); 507 int BN_is_prime(const BIGNUM *p,int nchecks, 508 void (*callback)(int,int,void *), 509 BN_CTX *ctx,void *cb_arg); 510 int BN_is_prime_fasttest(const BIGNUM *p,int nchecks, 511 void (*callback)(int,int,void *),BN_CTX *ctx,void *cb_arg, 512 int do_trial_division); 513 #endif /* !defined(OPENSSL_NO_DEPRECATED) */ 514 515 /* Newer versions */ 516 int BN_generate_prime_ex(BIGNUM *ret,int bits,int safe, const BIGNUM *add, 517 const BIGNUM *rem, BN_GENCB *cb); 518 int BN_is_prime_ex(const BIGNUM *p,int nchecks, BN_CTX *ctx, BN_GENCB *cb); 519 int BN_is_prime_fasttest_ex(const BIGNUM *p,int nchecks, BN_CTX *ctx, 520 int do_trial_division, BN_GENCB *cb); 521 522 BN_MONT_CTX *BN_MONT_CTX_new(void ); 523 void BN_MONT_CTX_init(BN_MONT_CTX *ctx); 524 int BN_mod_mul_montgomery(BIGNUM *r,const BIGNUM *a,const BIGNUM *b, 525 BN_MONT_CTX *mont, BN_CTX *ctx); 526 #define BN_to_montgomery(r,a,mont,ctx) BN_mod_mul_montgomery(\ 527 (r),(a),&((mont)->RR),(mont),(ctx)) 528 int BN_from_montgomery(BIGNUM *r,const BIGNUM *a, 529 BN_MONT_CTX *mont, BN_CTX *ctx); 530 void BN_MONT_CTX_free(BN_MONT_CTX *mont); 531 int BN_MONT_CTX_set(BN_MONT_CTX *mont,const BIGNUM *mod,BN_CTX *ctx); 532 BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to,BN_MONT_CTX *from); 533 BN_MONT_CTX *BN_MONT_CTX_set_locked(BN_MONT_CTX **pmont, int lock, 534 const BIGNUM *mod, BN_CTX *ctx); 535 536 /* BN_BLINDING flags */ 537 #define BN_BLINDING_NO_UPDATE 0x00000001 538 #define BN_BLINDING_NO_RECREATE 0x00000002 539 540 BN_BLINDING *BN_BLINDING_new(const BIGNUM *A, const BIGNUM *Ai, BIGNUM *mod); 541 void BN_BLINDING_free(BN_BLINDING *b); 542 int BN_BLINDING_update(BN_BLINDING *b,BN_CTX *ctx); 543 int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx); 544 int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx); 545 int BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b, BN_CTX *); 546 int BN_BLINDING_invert_ex(BIGNUM *n, const BIGNUM *r, BN_BLINDING *b, BN_CTX *); 547 unsigned long BN_BLINDING_get_thread_id(const BN_BLINDING *); 548 void BN_BLINDING_set_thread_id(BN_BLINDING *, unsigned long); 549 unsigned long BN_BLINDING_get_flags(const BN_BLINDING *); 550 void BN_BLINDING_set_flags(BN_BLINDING *, unsigned long); 551 BN_BLINDING *BN_BLINDING_create_param(BN_BLINDING *b, 552 const BIGNUM *e, BIGNUM *m, BN_CTX *ctx, 553 int (*bn_mod_exp)(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, 554 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx), 555 BN_MONT_CTX *m_ctx); 556 557 #ifndef OPENSSL_NO_DEPRECATED 558 void BN_set_params(int mul,int high,int low,int mont); 559 int BN_get_params(int which); /* 0, mul, 1 high, 2 low, 3 mont */ 560 #endif 561 562 void BN_RECP_CTX_init(BN_RECP_CTX *recp); 563 BN_RECP_CTX *BN_RECP_CTX_new(void); 564 void BN_RECP_CTX_free(BN_RECP_CTX *recp); 565 int BN_RECP_CTX_set(BN_RECP_CTX *recp,const BIGNUM *rdiv,BN_CTX *ctx); 566 int BN_mod_mul_reciprocal(BIGNUM *r, const BIGNUM *x, const BIGNUM *y, 567 BN_RECP_CTX *recp,BN_CTX *ctx); 568 int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, 569 const BIGNUM *m, BN_CTX *ctx); 570 int BN_div_recp(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, 571 BN_RECP_CTX *recp, BN_CTX *ctx); 572 573 /* Functions for arithmetic over binary polynomials represented by BIGNUMs. 574 * 575 * The BIGNUM::neg property of BIGNUMs representing binary polynomials is 576 * ignored. 577 * 578 * Note that input arguments are not const so that their bit arrays can 579 * be expanded to the appropriate size if needed. 580 */ 581 582 int BN_GF2m_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); /*r = a + b*/ 583 #define BN_GF2m_sub(r, a, b) BN_GF2m_add(r, a, b) 584 int BN_GF2m_mod(BIGNUM *r, const BIGNUM *a, const BIGNUM *p); /*r=a mod p*/ 585 int BN_GF2m_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, 586 const BIGNUM *p, BN_CTX *ctx); /* r = (a * b) mod p */ 587 int BN_GF2m_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, 588 BN_CTX *ctx); /* r = (a * a) mod p */ 589 int BN_GF2m_mod_inv(BIGNUM *r, const BIGNUM *b, const BIGNUM *p, 590 BN_CTX *ctx); /* r = (1 / b) mod p */ 591 int BN_GF2m_mod_div(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, 592 const BIGNUM *p, BN_CTX *ctx); /* r = (a / b) mod p */ 593 int BN_GF2m_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, 594 const BIGNUM *p, BN_CTX *ctx); /* r = (a ^ b) mod p */ 595 int BN_GF2m_mod_sqrt(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, 596 BN_CTX *ctx); /* r = sqrt(a) mod p */ 597 int BN_GF2m_mod_solve_quad(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, 598 BN_CTX *ctx); /* r^2 + r = a mod p */ 599 #define BN_GF2m_cmp(a, b) BN_ucmp((a), (b)) 600 /* Some functions allow for representation of the irreducible polynomials 601 * as an unsigned int[], say p. The irreducible f(t) is then of the form: 602 * t^p[0] + t^p[1] + ... + t^p[k] 603 * where m = p[0] > p[1] > ... > p[k] = 0. 604 */ 605 int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const unsigned int p[]); 606 /* r = a mod p */ 607 int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, 608 const unsigned int p[], BN_CTX *ctx); /* r = (a * b) mod p */ 609 int BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const unsigned int p[], 610 BN_CTX *ctx); /* r = (a * a) mod p */ 611 int BN_GF2m_mod_inv_arr(BIGNUM *r, const BIGNUM *b, const unsigned int p[], 612 BN_CTX *ctx); /* r = (1 / b) mod p */ 613 int BN_GF2m_mod_div_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, 614 const unsigned int p[], BN_CTX *ctx); /* r = (a / b) mod p */ 615 int BN_GF2m_mod_exp_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, 616 const unsigned int p[], BN_CTX *ctx); /* r = (a ^ b) mod p */ 617 int BN_GF2m_mod_sqrt_arr(BIGNUM *r, const BIGNUM *a, 618 const unsigned int p[], BN_CTX *ctx); /* r = sqrt(a) mod p */ 619 int BN_GF2m_mod_solve_quad_arr(BIGNUM *r, const BIGNUM *a, 620 const unsigned int p[], BN_CTX *ctx); /* r^2 + r = a mod p */ 621 int BN_GF2m_poly2arr(const BIGNUM *a, unsigned int p[], int max); 622 int BN_GF2m_arr2poly(const unsigned int p[], BIGNUM *a); 623 624 /* faster mod functions for the 'NIST primes' 625 * 0 <= a < p^2 */ 626 int BN_nist_mod_192(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx); 627 int BN_nist_mod_224(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx); 628 int BN_nist_mod_256(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx); 629 int BN_nist_mod_384(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx); 630 int BN_nist_mod_521(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx); 631 632 const BIGNUM *BN_get0_nist_prime_192(void); 633 const BIGNUM *BN_get0_nist_prime_224(void); 634 const BIGNUM *BN_get0_nist_prime_256(void); 635 const BIGNUM *BN_get0_nist_prime_384(void); 636 const BIGNUM *BN_get0_nist_prime_521(void); 637 638 /* library internal functions */ 639 640 #define bn_expand(a,bits) ((((((bits+BN_BITS2-1))/BN_BITS2)) <= (a)->dmax)?\ 641 (a):bn_expand2((a),(bits+BN_BITS2-1)/BN_BITS2)) 642 #define bn_wexpand(a,words) (((words) <= (a)->dmax)?(a):bn_expand2((a),(words))) 643 BIGNUM *bn_expand2(BIGNUM *a, int words); 644 #ifndef OPENSSL_NO_DEPRECATED 645 BIGNUM *bn_dup_expand(const BIGNUM *a, int words); /* unused */ 646 #endif 647 648 /* Bignum consistency macros 649 * There is one "API" macro, bn_fix_top(), for stripping leading zeroes from 650 * bignum data after direct manipulations on the data. There is also an 651 * "internal" macro, bn_check_top(), for verifying that there are no leading 652 * zeroes. Unfortunately, some auditing is required due to the fact that 653 * bn_fix_top() has become an overabused duct-tape because bignum data is 654 * occasionally passed around in an inconsistent state. So the following 655 * changes have been made to sort this out; 656 * - bn_fix_top()s implementation has been moved to bn_correct_top() 657 * - if BN_DEBUG isn't defined, bn_fix_top() maps to bn_correct_top(), and 658 * bn_check_top() is as before. 659 * - if BN_DEBUG *is* defined; 660 * - bn_check_top() tries to pollute unused words even if the bignum 'top' is 661 * consistent. (ed: only if BN_DEBUG_RAND is defined) 662 * - bn_fix_top() maps to bn_check_top() rather than "fixing" anything. 663 * The idea is to have debug builds flag up inconsistent bignums when they 664 * occur. If that occurs in a bn_fix_top(), we examine the code in question; if 665 * the use of bn_fix_top() was appropriate (ie. it follows directly after code 666 * that manipulates the bignum) it is converted to bn_correct_top(), and if it 667 * was not appropriate, we convert it permanently to bn_check_top() and track 668 * down the cause of the bug. Eventually, no internal code should be using the 669 * bn_fix_top() macro. External applications and libraries should try this with 670 * their own code too, both in terms of building against the openssl headers 671 * with BN_DEBUG defined *and* linking with a version of OpenSSL built with it 672 * defined. This not only improves external code, it provides more test 673 * coverage for openssl's own code. 674 */ 675 676 #ifdef BN_DEBUG 677 678 /* We only need assert() when debugging */ 679 #include <assert.h> 680 681 #ifdef BN_DEBUG_RAND 682 /* To avoid "make update" cvs wars due to BN_DEBUG, use some tricks */ 683 #ifndef RAND_pseudo_bytes 684 int RAND_pseudo_bytes(unsigned char *buf,int num); 685 #define BN_DEBUG_TRIX 686 #endif 687 #define bn_pollute(a) \ 688 do { \ 689 const BIGNUM *_bnum1 = (a); \ 690 if(_bnum1->top < _bnum1->dmax) { \ 691 unsigned char _tmp_char; \ 692 /* We cast away const without the compiler knowing, any \ 693 * *genuinely* constant variables that aren't mutable \ 694 * wouldn't be constructed with top!=dmax. */ \ 695 BN_ULONG *_not_const; \ 696 memcpy(&_not_const, &_bnum1->d, sizeof(BN_ULONG*)); \ 697 RAND_pseudo_bytes(&_tmp_char, 1); \ 698 memset((unsigned char *)(_not_const + _bnum1->top), _tmp_char, \ 699 (_bnum1->dmax - _bnum1->top) * sizeof(BN_ULONG)); \ 700 } \ 701 } while(0) 702 #ifdef BN_DEBUG_TRIX 703 #undef RAND_pseudo_bytes 704 #endif 705 #else 706 #define bn_pollute(a) 707 #endif 708 #define bn_check_top(a) \ 709 do { \ 710 const BIGNUM *_bnum2 = (a); \ 711 if (_bnum2 != NULL) { \ 712 assert((_bnum2->top == 0) || \ 713 (_bnum2->d[_bnum2->top - 1] != 0)); \ 714 bn_pollute(_bnum2); \ 715 } \ 716 } while(0) 717 718 #define bn_fix_top(a) bn_check_top(a) 719 720 #else /* !BN_DEBUG */ 721 722 #define bn_pollute(a) 723 #define bn_check_top(a) 724 #define bn_fix_top(a) bn_correct_top(a) 725 726 #endif 727 728 #define bn_correct_top(a) \ 729 { \ 730 BN_ULONG *ftl; \ 731 if ((a)->top > 0) \ 732 { \ 733 for (ftl= &((a)->d[(a)->top-1]); (a)->top > 0; (a)->top--) \ 734 if (*(ftl--)) break; \ 735 } \ 736 bn_pollute(a); \ 737 } 738 739 BN_ULONG bn_mul_add_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w); 740 BN_ULONG bn_mul_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w); 741 void bn_sqr_words(BN_ULONG *rp, const BN_ULONG *ap, int num); 742 BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d); 743 BN_ULONG bn_add_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,int num); 744 BN_ULONG bn_sub_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,int num); 745 746 /* Primes from RFC 2409 */ 747 BIGNUM *get_rfc2409_prime_768(BIGNUM *bn); 748 BIGNUM *get_rfc2409_prime_1024(BIGNUM *bn); 749 750 /* Primes from RFC 3526 */ 751 BIGNUM *get_rfc3526_prime_1536(BIGNUM *bn); 752 BIGNUM *get_rfc3526_prime_2048(BIGNUM *bn); 753 BIGNUM *get_rfc3526_prime_3072(BIGNUM *bn); 754 BIGNUM *get_rfc3526_prime_4096(BIGNUM *bn); 755 BIGNUM *get_rfc3526_prime_6144(BIGNUM *bn); 756 BIGNUM *get_rfc3526_prime_8192(BIGNUM *bn); 757 758 int BN_bntest_rand(BIGNUM *rnd, int bits, int top,int bottom); 759 760 /* BEGIN ERROR CODES */ 761 /* The following lines are auto generated by the script mkerr.pl. Any changes 762 * made after this point may be overwritten when the script is next run. 763 */ 764 void ERR_load_BN_strings(void); 765 766 /* Error codes for the BN functions. */ 767 768 /* Function codes. */ 769 #define BN_F_BNRAND 127 770 #define BN_F_BN_BLINDING_CONVERT_EX 100 771 #define BN_F_BN_BLINDING_CREATE_PARAM 128 772 #define BN_F_BN_BLINDING_INVERT_EX 101 773 #define BN_F_BN_BLINDING_NEW 102 774 #define BN_F_BN_BLINDING_UPDATE 103 775 #define BN_F_BN_BN2DEC 104 776 #define BN_F_BN_BN2HEX 105 777 #define BN_F_BN_CTX_GET 116 778 #define BN_F_BN_CTX_NEW 106 779 #define BN_F_BN_CTX_START 129 780 #define BN_F_BN_DIV 107 781 #define BN_F_BN_DIV_RECP 130 782 #define BN_F_BN_EXP 123 783 #define BN_F_BN_EXPAND2 108 784 #define BN_F_BN_EXPAND_INTERNAL 120 785 #define BN_F_BN_GF2M_MOD 131 786 #define BN_F_BN_GF2M_MOD_EXP 132 787 #define BN_F_BN_GF2M_MOD_MUL 133 788 #define BN_F_BN_GF2M_MOD_SOLVE_QUAD 134 789 #define BN_F_BN_GF2M_MOD_SOLVE_QUAD_ARR 135 790 #define BN_F_BN_GF2M_MOD_SQR 136 791 #define BN_F_BN_GF2M_MOD_SQRT 137 792 #define BN_F_BN_MOD_EXP2_MONT 118 793 #define BN_F_BN_MOD_EXP_MONT 109 794 #define BN_F_BN_MOD_EXP_MONT_CONSTTIME 124 795 #define BN_F_BN_MOD_EXP_MONT_WORD 117 796 #define BN_F_BN_MOD_EXP_RECP 125 797 #define BN_F_BN_MOD_EXP_SIMPLE 126 798 #define BN_F_BN_MOD_INVERSE 110 799 #define BN_F_BN_MOD_LSHIFT_QUICK 119 800 #define BN_F_BN_MOD_MUL_RECIPROCAL 111 801 #define BN_F_BN_MOD_SQRT 121 802 #define BN_F_BN_MPI2BN 112 803 #define BN_F_BN_NEW 113 804 #define BN_F_BN_RAND 114 805 #define BN_F_BN_RAND_RANGE 122 806 #define BN_F_BN_USUB 115 807 808 /* Reason codes. */ 809 #define BN_R_ARG2_LT_ARG3 100 810 #define BN_R_BAD_RECIPROCAL 101 811 #define BN_R_BIGNUM_TOO_LONG 114 812 #define BN_R_CALLED_WITH_EVEN_MODULUS 102 813 #define BN_R_DIV_BY_ZERO 103 814 #define BN_R_ENCODING_ERROR 104 815 #define BN_R_EXPAND_ON_STATIC_BIGNUM_DATA 105 816 #define BN_R_INPUT_NOT_REDUCED 110 817 #define BN_R_INVALID_LENGTH 106 818 #define BN_R_INVALID_RANGE 115 819 #define BN_R_NOT_A_SQUARE 111 820 #define BN_R_NOT_INITIALIZED 107 821 #define BN_R_NO_INVERSE 108 822 #define BN_R_NO_SOLUTION 116 823 #define BN_R_P_IS_NOT_PRIME 112 824 #define BN_R_TOO_MANY_ITERATIONS 113 825 #define BN_R_TOO_MANY_TEMPORARY_VARIABLES 109 826 827 #ifdef __cplusplus 828 } 829 #endif 830 #endif 831
