2 /* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com)
5 * This package is an SSL implementation written
6 * by Eric Young (eay@cryptsoft.com).
7 * The implementation was written so as to conform with Netscapes SSL.
9 * This library is free for commercial and non-commercial use as long as
10 * the following conditions are aheared to. The following conditions
11 * apply to all code found in this distribution, be it the RC4, RSA,
12 * lhash, DES, etc., code; not just the SSL code. The SSL documentation
13 * included with this distribution is covered by the same copyright terms
14 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
16 * Copyright remains Eric Young's, and as such any Copyright notices in
17 * the code are not to be removed.
18 * If this package is used in a product, Eric Young should be given attribution
19 * as the author of the parts of the library used.
20 * This can be in the form of a textual message at program startup or
21 * in documentation (online or textual) provided with the package.
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
26 * 1. Redistributions of source code must retain the copyright
27 * notice, this list of conditions and the following disclaimer.
28 * 2. Redistributions in binary form must reproduce the above copyright
29 * notice, this list of conditions and the following disclaimer in the
30 * documentation and/or other materials provided with the distribution.
31 * 3. All advertising materials mentioning features or use of this software
32 * must display the following acknowledgement:
33 * "This product includes cryptographic software written by
34 * Eric Young (eay@cryptsoft.com)"
35 * The word 'cryptographic' can be left out if the rouines from the library
36 * being used are not cryptographic related :-).
37 * 4. If you include any Windows specific code (or a derivative thereof) from
38 * the apps directory (application code) you must include an acknowledgement:
39 * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
41 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
42 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
43 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
44 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
45 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
46 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
47 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
48 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
49 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
50 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
53 * The licence and distribution terms for any publically available version or
54 * derivative of this code cannot be changed. i.e. this code cannot simply be
55 * copied and put under another distribution licence
56 * [including the GNU Public Licence.]
58 /* ====================================================================
59 * Copyright (c) 1998-2006 The OpenSSL Project. All rights reserved.
61 * Redistribution and use in source and binary forms, with or without
62 * modification, are permitted provided that the following conditions
65 * 1. Redistributions of source code must retain the above copyright
66 * notice, this list of conditions and the following disclaimer.
68 * 2. Redistributions in binary form must reproduce the above copyright
69 * notice, this list of conditions and the following disclaimer in
70 * the documentation and/or other materials provided with the
73 * 3. All advertising materials mentioning features or use of this
74 * software must display the following acknowledgment:
75 * "This product includes software developed by the OpenSSL Project
76 * for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
78 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
79 * endorse or promote products derived from this software without
80 * prior written permission. For written permission, please contact
81 * openssl-core@openssl.org.
83 * 5. Products derived from this software may not be called "OpenSSL"
84 * nor may "OpenSSL" appear in their names without prior written
85 * permission of the OpenSSL Project.
87 * 6. Redistributions of any form whatsoever must retain the following
89 * "This product includes software developed by the OpenSSL Project
90 * for use in the OpenSSL Toolkit (http://www.openssl.org/)"
92 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
93 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
94 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
95 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
96 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
97 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
98 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
99 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
100 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
101 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
102 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
103 * OF THE POSSIBILITY OF SUCH DAMAGE.
104 * ====================================================================
106 * This product includes cryptographic software written by Eric Young
107 * (eay@cryptsoft.com). This product includes software written by Tim
108 * Hudson (tjh@cryptsoft.com).
111 /* ====================================================================
112 * Copyright 2002 Sun Microsystems, Inc. ALL RIGHTS RESERVED.
114 * Portions of the attached software ("Contribution") are developed by
115 * SUN MICROSYSTEMS, INC., and are contributed to the OpenSSL project.
117 * The Contribution is licensed pursuant to the Eric Young open source
118 * license provided above.
120 * The binary polynomial arithmetic software is originally written by
121 * Sheueling Chang Shantz and Douglas Stebila of Sun Microsystems Laboratories.
129 # include <openssl/e_os2.h>
130 # ifndef OPENSSL_NO_FP_API
131 # include <stdio.h> /* FILE */
133 # include <openssl/ossl_typ.h>
134 # include <openssl/crypto.h>
141 * These preprocessor symbols control various aspects of the bignum headers
142 * and library code. They're not defined by any "normal" configuration, as
143 * they are intended for development and testing purposes. NB: defining all
144 * three can be useful for debugging application code as well as openssl
145 * itself. BN_DEBUG - turn on various debugging alterations to the bignum
146 * code BN_DEBUG_RAND - uses random poisoning of unused words to trip up
147 * mismanagement of bignum internals. You must also define BN_DEBUG.
149 /* #define BN_DEBUG */
150 /* #define BN_DEBUG_RAND */
152 # ifndef OPENSSL_SMALL_FOOTPRINT
153 # define BN_MUL_COMBA
154 # define BN_SQR_COMBA
155 # define BN_RECURSION
159 * This next option uses the C libraries (2 word)/(1 word) function. If it is
160 * not defined, I use my C version (which is slower). The reason for this
161 * flag is that when the particular C compiler library routine is used, and
162 * the library is linked with a different compiler, the library is missing.
163 * This mostly happens when the library is built with gcc and then linked
164 * using normal cc. This would be a common occurrence because gcc normally
165 * produces code that is 2 times faster than system compilers for the big
166 * number stuff. For machines with only one compiler (or shared libraries),
167 * this should be on. Again this in only really a problem on machines using
168 * "long long's", are 32bit, and are not using my assembler code.
170 # if defined(OPENSSL_SYS_MSDOS) || defined(OPENSSL_SYS_WINDOWS) || \
171 defined(OPENSSL_SYS_WIN32) || defined(linux)
178 * assuming long is 64bit - this is the DEC Alpha unsigned long long is only
179 * 64 bits :-(, don't define BN_LLONG for the DEC Alpha
181 # ifdef SIXTY_FOUR_BIT_LONG
182 # define BN_ULLONG unsigned long long
183 # define BN_ULONG unsigned long
184 # define BN_LONG long
189 # define BN_MASK (0xffffffffffffffffffffffffffffffffLL)
190 # define BN_MASK2 (0xffffffffffffffffL)
191 # define BN_MASK2l (0xffffffffL)
192 # define BN_MASK2h (0xffffffff00000000L)
193 # define BN_MASK2h1 (0xffffffff80000000L)
194 # define BN_TBIT (0x8000000000000000L)
195 # define BN_DEC_CONV (10000000000000000000UL)
196 # define BN_DEC_FMT1 "%lu"
197 # define BN_DEC_FMT2 "%019lu"
198 # define BN_DEC_NUM 19
199 # define BN_HEX_FMT1 "%lX"
200 # define BN_HEX_FMT2 "%016lX"
204 * This is where the long long data type is 64 bits, but long is 32. For
205 * machines where there are 64bit registers, this is the mode to use. IRIX,
206 * on R4000 and above should use this mode, along with the relevant assembler
207 * code :-). Do NOT define BN_LLONG.
209 # ifdef SIXTY_FOUR_BIT
212 # define BN_ULONG unsigned long long
213 # define BN_LONG long long
218 # define BN_MASK2 (0xffffffffffffffffLL)
219 # define BN_MASK2l (0xffffffffL)
220 # define BN_MASK2h (0xffffffff00000000LL)
221 # define BN_MASK2h1 (0xffffffff80000000LL)
222 # define BN_TBIT (0x8000000000000000LL)
223 # define BN_DEC_CONV (10000000000000000000ULL)
224 # define BN_DEC_FMT1 "%llu"
225 # define BN_DEC_FMT2 "%019llu"
226 # define BN_DEC_NUM 19
227 # define BN_HEX_FMT1 "%llX"
228 # define BN_HEX_FMT2 "%016llX"
231 # ifdef THIRTY_TWO_BIT
233 # if defined(_WIN32) && !defined(__GNUC__)
234 # define BN_ULLONG unsigned __int64
235 # define BN_MASK (0xffffffffffffffffI64)
237 # define BN_ULLONG unsigned long long
238 # define BN_MASK (0xffffffffffffffffLL)
241 # define BN_ULONG unsigned int
247 # define BN_MASK2 (0xffffffffL)
248 # define BN_MASK2l (0xffff)
249 # define BN_MASK2h1 (0xffff8000L)
250 # define BN_MASK2h (0xffff0000L)
251 # define BN_TBIT (0x80000000L)
252 # define BN_DEC_CONV (1000000000L)
253 # define BN_DEC_FMT1 "%u"
254 # define BN_DEC_FMT2 "%09u"
255 # define BN_DEC_NUM 9
256 # define BN_HEX_FMT1 "%X"
257 # define BN_HEX_FMT2 "%08X"
261 * 2011-02-22 SMS. In various places, a size_t variable or a type cast to
262 * size_t was used to perform integer-only operations on pointers. This
263 * failed on VMS with 64-bit pointers (CC /POINTER_SIZE = 64) because size_t
264 * is still only 32 bits. What's needed in these cases is an integer type
265 * with the same size as a pointer, which size_t is not certain to be. The
266 * only fix here is VMS-specific.
268 # if defined(OPENSSL_SYS_VMS)
269 # if __INITIAL_POINTER_SIZE == 64
270 # define PTR_SIZE_INT long long
271 # else /* __INITIAL_POINTER_SIZE == 64 */
272 # define PTR_SIZE_INT int
273 # endif /* __INITIAL_POINTER_SIZE == 64 [else] */
274 # else /* defined(OPENSSL_SYS_VMS) */
275 # define PTR_SIZE_INT size_t
276 # endif /* defined(OPENSSL_SYS_VMS) [else] */
278 # define BN_DEFAULT_BITS 1280
280 # define BN_FLG_MALLOCED 0x01
281 # define BN_FLG_STATIC_DATA 0x02
284 * avoid leaking exponent information through timing,
285 * BN_mod_exp_mont() will call BN_mod_exp_mont_consttime,
286 * BN_div() will call BN_div_no_branch,
287 * BN_mod_inverse() will call BN_mod_inverse_no_branch.
289 # define BN_FLG_CONSTTIME 0x04
291 # ifdef OPENSSL_NO_DEPRECATED
292 /* deprecated name for the flag */
293 # define BN_FLG_EXP_CONSTTIME BN_FLG_CONSTTIME
295 * avoid leaking exponent information through timings
296 * (BN_mod_exp_mont() will call BN_mod_exp_mont_consttime)
300 # ifndef OPENSSL_NO_DEPRECATED
301 # define BN_FLG_FREE 0x8000
302 /* used for debuging */
304 # define BN_set_flags(b,n) ((b)->flags|=(n))
305 # define BN_get_flags(b,n) ((b)->flags&(n))
308 * get a clone of a BIGNUM with changed flags, for *temporary* use only (the
309 * two BIGNUMs cannot not be used in parallel!)
311 # define BN_with_flags(dest,b,n) ((dest)->d=(b)->d, \
312 (dest)->top=(b)->top, \
313 (dest)->dmax=(b)->dmax, \
314 (dest)->neg=(b)->neg, \
315 (dest)->flags=(((dest)->flags & BN_FLG_MALLOCED) \
316 | ((b)->flags & ~BN_FLG_MALLOCED) \
317 | BN_FLG_STATIC_DATA \
320 /* Already declared in ossl_typ.h */
322 typedef struct bignum_st BIGNUM;
323 /* Used for temp variables (declaration hidden in bn_lcl.h) */
324 typedef struct bignum_ctx BN_CTX;
325 typedef struct bn_blinding_st BN_BLINDING;
326 typedef struct bn_mont_ctx_st BN_MONT_CTX;
327 typedef struct bn_recp_ctx_st BN_RECP_CTX;
328 typedef struct bn_gencb_st BN_GENCB;
332 BN_ULONG *d; /* Pointer to an array of 'BN_BITS2' bit
334 int top; /* Index of last used d +1. */
335 /* The next are internal book keeping for bn_expand. */
336 int dmax; /* Size of the d array. */
337 int neg; /* one if the number is negative */
341 /* Used for montgomery multiplication */
342 struct bn_mont_ctx_st {
343 int ri; /* number of bits in R */
344 BIGNUM RR; /* used to convert to montgomery form */
345 BIGNUM N; /* The modulus */
346 BIGNUM Ni; /* R*(1/R mod N) - N*Ni = 1 (Ni is only
347 * stored for bignum algorithm) */
348 BN_ULONG n0[2]; /* least significant word(s) of Ni; (type
349 * changed with 0.9.9, was "BN_ULONG n0;"
355 * Used for reciprocal division/mod functions It cannot be shared between
358 struct bn_recp_ctx_st {
359 BIGNUM N; /* the divisor */
360 BIGNUM Nr; /* the reciprocal */
366 /* Used for slow "generation" functions. */
368 unsigned int ver; /* To handle binary (in)compatibility */
369 void *arg; /* callback-specific data */
371 /* if(ver==1) - handles old style callbacks */
372 void (*cb_1) (int, int, void *);
373 /* if(ver==2) - new callback style */
374 int (*cb_2) (int, int, BN_GENCB *);
377 /* Wrapper function to make using BN_GENCB easier, */
378 int BN_GENCB_call(BN_GENCB *cb, int a, int b);
379 /* Macro to populate a BN_GENCB structure with an "old"-style callback */
380 # define BN_GENCB_set_old(gencb, callback, cb_arg) { \
381 BN_GENCB *tmp_gencb = (gencb); \
382 tmp_gencb->ver = 1; \
383 tmp_gencb->arg = (cb_arg); \
384 tmp_gencb->cb.cb_1 = (callback); }
385 /* Macro to populate a BN_GENCB structure with a "new"-style callback */
386 # define BN_GENCB_set(gencb, callback, cb_arg) { \
387 BN_GENCB *tmp_gencb = (gencb); \
388 tmp_gencb->ver = 2; \
389 tmp_gencb->arg = (cb_arg); \
390 tmp_gencb->cb.cb_2 = (callback); }
392 # define BN_prime_checks 0 /* default: select number of iterations based
393 * on the size of the number */
396 * number of Miller-Rabin iterations for an error rate of less than 2^-80 for
397 * random 'b'-bit input, b >= 100 (taken from table 4.4 in the Handbook of
398 * Applied Cryptography [Menezes, van Oorschot, Vanstone; CRC Press 1996];
399 * original paper: Damgaard, Landrock, Pomerance: Average case error
400 * estimates for the strong probable prime test. -- Math. Comp. 61 (1993)
403 # define BN_prime_checks_for_size(b) ((b) >= 1300 ? 2 : \
416 # define BN_num_bytes(a) ((BN_num_bits(a)+7)/8)
418 /* Note that BN_abs_is_word didn't work reliably for w == 0 until 0.9.8 */
419 # define BN_abs_is_word(a,w) ((((a)->top == 1) && ((a)->d[0] == (BN_ULONG)(w))) || \
420 (((w) == 0) && ((a)->top == 0)))
421 # define BN_is_zero(a) ((a)->top == 0)
422 # define BN_is_one(a) (BN_abs_is_word((a),1) && !(a)->neg)
423 # define BN_is_word(a,w) (BN_abs_is_word((a),(w)) && (!(w) || !(a)->neg))
424 # define BN_is_odd(a) (((a)->top > 0) && ((a)->d[0] & 1))
426 # define BN_one(a) (BN_set_word((a),1))
427 # define BN_zero_ex(a) \
429 BIGNUM *_tmp_bn = (a); \
433 # ifdef OPENSSL_NO_DEPRECATED
434 # define BN_zero(a) BN_zero_ex(a)
436 # define BN_zero(a) (BN_set_word((a),0))
439 const BIGNUM *BN_value_one(void);
440 char *BN_options(void);
441 BN_CTX *BN_CTX_new(void);
442 # ifndef OPENSSL_NO_DEPRECATED
443 void BN_CTX_init(BN_CTX *c);
445 void BN_CTX_free(BN_CTX *c);
446 void BN_CTX_start(BN_CTX *ctx);
447 BIGNUM *BN_CTX_get(BN_CTX *ctx);
448 void BN_CTX_end(BN_CTX *ctx);
449 int BN_rand(BIGNUM *rnd, int bits, int top, int bottom);
450 int BN_pseudo_rand(BIGNUM *rnd, int bits, int top, int bottom);
451 int BN_rand_range(BIGNUM *rnd, const BIGNUM *range);
452 int BN_pseudo_rand_range(BIGNUM *rnd, const BIGNUM *range);
453 int BN_num_bits(const BIGNUM *a);
454 int BN_num_bits_word(BN_ULONG);
455 BIGNUM *BN_new(void);
456 void BN_init(BIGNUM *);
457 void BN_clear_free(BIGNUM *a);
458 BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b);
459 void BN_swap(BIGNUM *a, BIGNUM *b);
460 BIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM *ret);
461 int BN_bn2bin(const BIGNUM *a, unsigned char *to);
462 BIGNUM *BN_mpi2bn(const unsigned char *s, int len, BIGNUM *ret);
463 int BN_bn2mpi(const BIGNUM *a, unsigned char *to);
464 int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
465 int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
466 int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
467 int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
468 int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);
469 int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx);
470 /** BN_set_negative sets sign of a BIGNUM
471 * \param b pointer to the BIGNUM object
472 * \param n 0 if the BIGNUM b should be positive and a value != 0 otherwise
474 void BN_set_negative(BIGNUM *b, int n);
475 /** BN_is_negative returns 1 if the BIGNUM is negative
476 * \param a pointer to the BIGNUM object
477 * \return 1 if a < 0 and 0 otherwise
479 # define BN_is_negative(a) ((a)->neg != 0)
481 int BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, const BIGNUM *d,
483 # define BN_mod(rem,m,d,ctx) BN_div(NULL,(rem),(m),(d),(ctx))
484 int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx);
485 int BN_mod_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
487 int BN_mod_add_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
489 int BN_mod_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
491 int BN_mod_sub_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
493 int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
495 int BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);
496 int BN_mod_lshift1(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);
497 int BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *m);
498 int BN_mod_lshift(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m,
500 int BN_mod_lshift_quick(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m);
502 BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w);
503 BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w);
504 int BN_mul_word(BIGNUM *a, BN_ULONG w);
505 int BN_add_word(BIGNUM *a, BN_ULONG w);
506 int BN_sub_word(BIGNUM *a, BN_ULONG w);
507 int BN_set_word(BIGNUM *a, BN_ULONG w);
508 BN_ULONG BN_get_word(const BIGNUM *a);
510 int BN_cmp(const BIGNUM *a, const BIGNUM *b);
511 void BN_free(BIGNUM *a);
512 int BN_is_bit_set(const BIGNUM *a, int n);
513 int BN_lshift(BIGNUM *r, const BIGNUM *a, int n);
514 int BN_lshift1(BIGNUM *r, const BIGNUM *a);
515 int BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
517 int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
518 const BIGNUM *m, BN_CTX *ctx);
519 int BN_mod_exp_mont(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
520 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);
521 int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
522 const BIGNUM *m, BN_CTX *ctx,
523 BN_MONT_CTX *in_mont);
524 int BN_mod_exp_mont_word(BIGNUM *r, BN_ULONG a, const BIGNUM *p,
525 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);
526 int BN_mod_exp2_mont(BIGNUM *r, const BIGNUM *a1, const BIGNUM *p1,
527 const BIGNUM *a2, const BIGNUM *p2, const BIGNUM *m,
528 BN_CTX *ctx, BN_MONT_CTX *m_ctx);
529 int BN_mod_exp_simple(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
530 const BIGNUM *m, BN_CTX *ctx);
532 int BN_mask_bits(BIGNUM *a, int n);
533 # ifndef OPENSSL_NO_FP_API
534 int BN_print_fp(FILE *fp, const BIGNUM *a);
537 int BN_print(BIO *fp, const BIGNUM *a);
539 int BN_print(void *fp, const BIGNUM *a);
541 int BN_reciprocal(BIGNUM *r, const BIGNUM *m, int len, BN_CTX *ctx);
542 int BN_rshift(BIGNUM *r, const BIGNUM *a, int n);
543 int BN_rshift1(BIGNUM *r, const BIGNUM *a);
544 void BN_clear(BIGNUM *a);
545 BIGNUM *BN_dup(const BIGNUM *a);
546 int BN_ucmp(const BIGNUM *a, const BIGNUM *b);
547 int BN_set_bit(BIGNUM *a, int n);
548 int BN_clear_bit(BIGNUM *a, int n);
549 char *BN_bn2hex(const BIGNUM *a);
550 char *BN_bn2dec(const BIGNUM *a);
551 int BN_hex2bn(BIGNUM **a, const char *str);
552 int BN_dec2bn(BIGNUM **a, const char *str);
553 int BN_asc2bn(BIGNUM **a, const char *str);
554 int BN_gcd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);
555 int BN_kronecker(const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx); /* returns
558 BIGNUM *BN_mod_inverse(BIGNUM *ret,
559 const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx);
560 BIGNUM *BN_mod_sqrt(BIGNUM *ret,
561 const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx);
563 void BN_consttime_swap(BN_ULONG swap, BIGNUM *a, BIGNUM *b, int nwords);
565 /* Deprecated versions */
566 # ifndef OPENSSL_NO_DEPRECATED
567 BIGNUM *BN_generate_prime(BIGNUM *ret, int bits, int safe,
568 const BIGNUM *add, const BIGNUM *rem,
569 void (*callback) (int, int, void *), void *cb_arg);
570 int BN_is_prime(const BIGNUM *p, int nchecks,
571 void (*callback) (int, int, void *),
572 BN_CTX *ctx, void *cb_arg);
573 int BN_is_prime_fasttest(const BIGNUM *p, int nchecks,
574 void (*callback) (int, int, void *), BN_CTX *ctx,
575 void *cb_arg, int do_trial_division);
576 # endif /* !defined(OPENSSL_NO_DEPRECATED) */
579 int BN_generate_prime_ex(BIGNUM *ret, int bits, int safe, const BIGNUM *add,
580 const BIGNUM *rem, BN_GENCB *cb);
581 int BN_is_prime_ex(const BIGNUM *p, int nchecks, BN_CTX *ctx, BN_GENCB *cb);
582 int BN_is_prime_fasttest_ex(const BIGNUM *p, int nchecks, BN_CTX *ctx,
583 int do_trial_division, BN_GENCB *cb);
585 int BN_X931_generate_Xpq(BIGNUM *Xp, BIGNUM *Xq, int nbits, BN_CTX *ctx);
587 int BN_X931_derive_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2,
588 const BIGNUM *Xp, const BIGNUM *Xp1,
589 const BIGNUM *Xp2, const BIGNUM *e, BN_CTX *ctx,
591 int BN_X931_generate_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2, BIGNUM *Xp1,
592 BIGNUM *Xp2, const BIGNUM *Xp, const BIGNUM *e,
593 BN_CTX *ctx, BN_GENCB *cb);
595 BN_MONT_CTX *BN_MONT_CTX_new(void);
596 void BN_MONT_CTX_init(BN_MONT_CTX *ctx);
597 int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
598 BN_MONT_CTX *mont, BN_CTX *ctx);
599 # define BN_to_montgomery(r,a,mont,ctx) BN_mod_mul_montgomery(\
600 (r),(a),&((mont)->RR),(mont),(ctx))
601 int BN_from_montgomery(BIGNUM *r, const BIGNUM *a,
602 BN_MONT_CTX *mont, BN_CTX *ctx);
603 void BN_MONT_CTX_free(BN_MONT_CTX *mont);
604 int BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *mod, BN_CTX *ctx);
605 BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to, BN_MONT_CTX *from);
606 BN_MONT_CTX *BN_MONT_CTX_set_locked(BN_MONT_CTX **pmont, int lock,
607 const BIGNUM *mod, BN_CTX *ctx);
609 /* BN_BLINDING flags */
610 # define BN_BLINDING_NO_UPDATE 0x00000001
611 # define BN_BLINDING_NO_RECREATE 0x00000002
613 BN_BLINDING *BN_BLINDING_new(const BIGNUM *A, const BIGNUM *Ai, BIGNUM *mod);
614 void BN_BLINDING_free(BN_BLINDING *b);
615 int BN_BLINDING_update(BN_BLINDING *b, BN_CTX *ctx);
616 int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
617 int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
618 int BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b, BN_CTX *);
619 int BN_BLINDING_invert_ex(BIGNUM *n, const BIGNUM *r, BN_BLINDING *b,
621 # ifndef OPENSSL_NO_DEPRECATED
622 unsigned long BN_BLINDING_get_thread_id(const BN_BLINDING *);
623 void BN_BLINDING_set_thread_id(BN_BLINDING *, unsigned long);
625 CRYPTO_THREADID *BN_BLINDING_thread_id(BN_BLINDING *);
626 unsigned long BN_BLINDING_get_flags(const BN_BLINDING *);
627 void BN_BLINDING_set_flags(BN_BLINDING *, unsigned long);
628 BN_BLINDING *BN_BLINDING_create_param(BN_BLINDING *b,
629 const BIGNUM *e, BIGNUM *m, BN_CTX *ctx,
630 int (*bn_mod_exp) (BIGNUM *r,
638 # ifndef OPENSSL_NO_DEPRECATED
639 void BN_set_params(int mul, int high, int low, int mont);
640 int BN_get_params(int which); /* 0, mul, 1 high, 2 low, 3 mont */
643 void BN_RECP_CTX_init(BN_RECP_CTX *recp);
644 BN_RECP_CTX *BN_RECP_CTX_new(void);
645 void BN_RECP_CTX_free(BN_RECP_CTX *recp);
646 int BN_RECP_CTX_set(BN_RECP_CTX *recp, const BIGNUM *rdiv, BN_CTX *ctx);
647 int BN_mod_mul_reciprocal(BIGNUM *r, const BIGNUM *x, const BIGNUM *y,
648 BN_RECP_CTX *recp, BN_CTX *ctx);
649 int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
650 const BIGNUM *m, BN_CTX *ctx);
651 int BN_div_recp(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m,
652 BN_RECP_CTX *recp, BN_CTX *ctx);
654 # ifndef OPENSSL_NO_EC2M
657 * Functions for arithmetic over binary polynomials represented by BIGNUMs.
658 * The BIGNUM::neg property of BIGNUMs representing binary polynomials is
659 * ignored. Note that input arguments are not const so that their bit arrays
660 * can be expanded to the appropriate size if needed.
666 int BN_GF2m_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
667 # define BN_GF2m_sub(r, a, b) BN_GF2m_add(r, a, b)
671 int BN_GF2m_mod(BIGNUM *r, const BIGNUM *a, const BIGNUM *p);
672 /* r = (a * b) mod p */
673 int BN_GF2m_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
674 const BIGNUM *p, BN_CTX *ctx);
675 /* r = (a * a) mod p */
676 int BN_GF2m_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
677 /* r = (1 / b) mod p */
678 int BN_GF2m_mod_inv(BIGNUM *r, const BIGNUM *b, const BIGNUM *p, BN_CTX *ctx);
679 /* r = (a / b) mod p */
680 int BN_GF2m_mod_div(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
681 const BIGNUM *p, BN_CTX *ctx);
682 /* r = (a ^ b) mod p */
683 int BN_GF2m_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
684 const BIGNUM *p, BN_CTX *ctx);
685 /* r = sqrt(a) mod p */
686 int BN_GF2m_mod_sqrt(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
688 /* r^2 + r = a mod p */
689 int BN_GF2m_mod_solve_quad(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
691 # define BN_GF2m_cmp(a, b) BN_ucmp((a), (b))
693 * Some functions allow for representation of the irreducible polynomials
694 * as an unsigned int[], say p. The irreducible f(t) is then of the form:
695 * t^p[0] + t^p[1] + ... + t^p[k]
696 * where m = p[0] > p[1] > ... > p[k] = 0.
699 int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const int p[]);
700 /* r = (a * b) mod p */
701 int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
702 const int p[], BN_CTX *ctx);
703 /* r = (a * a) mod p */
704 int BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const int p[],
706 /* r = (1 / b) mod p */
707 int BN_GF2m_mod_inv_arr(BIGNUM *r, const BIGNUM *b, const int p[],
709 /* r = (a / b) mod p */
710 int BN_GF2m_mod_div_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
711 const int p[], BN_CTX *ctx);
712 /* r = (a ^ b) mod p */
713 int BN_GF2m_mod_exp_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
714 const int p[], BN_CTX *ctx);
715 /* r = sqrt(a) mod p */
716 int BN_GF2m_mod_sqrt_arr(BIGNUM *r, const BIGNUM *a,
717 const int p[], BN_CTX *ctx);
718 /* r^2 + r = a mod p */
719 int BN_GF2m_mod_solve_quad_arr(BIGNUM *r, const BIGNUM *a,
720 const int p[], BN_CTX *ctx);
721 int BN_GF2m_poly2arr(const BIGNUM *a, int p[], int max);
722 int BN_GF2m_arr2poly(const int p[], BIGNUM *a);
727 * faster mod functions for the 'NIST primes' 0 <= a < p^2
729 int BN_nist_mod_192(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
730 int BN_nist_mod_224(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
731 int BN_nist_mod_256(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
732 int BN_nist_mod_384(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
733 int BN_nist_mod_521(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
735 const BIGNUM *BN_get0_nist_prime_192(void);
736 const BIGNUM *BN_get0_nist_prime_224(void);
737 const BIGNUM *BN_get0_nist_prime_256(void);
738 const BIGNUM *BN_get0_nist_prime_384(void);
739 const BIGNUM *BN_get0_nist_prime_521(void);
741 /* library internal functions */
743 # define bn_expand(a,bits) \
745 bits > (INT_MAX - BN_BITS2 + 1) ? \
748 (((bits+BN_BITS2-1)/BN_BITS2) <= (a)->dmax) ? \
751 bn_expand2((a),(bits+BN_BITS2-1)/BN_BITS2) \
754 # define bn_wexpand(a,words) (((words) <= (a)->dmax)?(a):bn_expand2((a),(words)))
755 BIGNUM *bn_expand2(BIGNUM *a, int words);
756 # ifndef OPENSSL_NO_DEPRECATED
757 BIGNUM *bn_dup_expand(const BIGNUM *a, int words); /* unused */
761 * Bignum consistency macros
762 * There is one "API" macro, bn_fix_top(), for stripping leading zeroes from
763 * bignum data after direct manipulations on the data. There is also an
764 * "internal" macro, bn_check_top(), for verifying that there are no leading
765 * zeroes. Unfortunately, some auditing is required due to the fact that
766 * bn_fix_top() has become an overabused duct-tape because bignum data is
767 * occasionally passed around in an inconsistent state. So the following
768 * changes have been made to sort this out;
769 * - bn_fix_top()s implementation has been moved to bn_correct_top()
770 * - if BN_DEBUG isn't defined, bn_fix_top() maps to bn_correct_top(), and
771 * bn_check_top() is as before.
772 * - if BN_DEBUG *is* defined;
773 * - bn_check_top() tries to pollute unused words even if the bignum 'top' is
774 * consistent. (ed: only if BN_DEBUG_RAND is defined)
775 * - bn_fix_top() maps to bn_check_top() rather than "fixing" anything.
776 * The idea is to have debug builds flag up inconsistent bignums when they
777 * occur. If that occurs in a bn_fix_top(), we examine the code in question; if
778 * the use of bn_fix_top() was appropriate (ie. it follows directly after code
779 * that manipulates the bignum) it is converted to bn_correct_top(), and if it
780 * was not appropriate, we convert it permanently to bn_check_top() and track
781 * down the cause of the bug. Eventually, no internal code should be using the
782 * bn_fix_top() macro. External applications and libraries should try this with
783 * their own code too, both in terms of building against the openssl headers
784 * with BN_DEBUG defined *and* linking with a version of OpenSSL built with it
785 * defined. This not only improves external code, it provides more test
786 * coverage for openssl's own code.
791 /* We only need assert() when debugging */
794 # ifdef BN_DEBUG_RAND
795 /* To avoid "make update" cvs wars due to BN_DEBUG, use some tricks */
796 # ifndef RAND_pseudo_bytes
797 int RAND_pseudo_bytes(unsigned char *buf, int num);
798 # define BN_DEBUG_TRIX
800 # define bn_pollute(a) \
802 const BIGNUM *_bnum1 = (a); \
803 if(_bnum1->top < _bnum1->dmax) { \
804 unsigned char _tmp_char; \
805 /* We cast away const without the compiler knowing, any \
806 * *genuinely* constant variables that aren't mutable \
807 * wouldn't be constructed with top!=dmax. */ \
808 BN_ULONG *_not_const; \
809 memcpy(&_not_const, &_bnum1->d, sizeof(BN_ULONG*)); \
810 /* Debug only - safe to ignore error return */ \
811 RAND_pseudo_bytes(&_tmp_char, 1); \
812 memset((unsigned char *)(_not_const + _bnum1->top), _tmp_char, \
813 (_bnum1->dmax - _bnum1->top) * sizeof(BN_ULONG)); \
816 # ifdef BN_DEBUG_TRIX
817 # undef RAND_pseudo_bytes
820 # define bn_pollute(a)
822 # define bn_check_top(a) \
824 const BIGNUM *_bnum2 = (a); \
825 if (_bnum2 != NULL) { \
826 assert((_bnum2->top == 0) || \
827 (_bnum2->d[_bnum2->top - 1] != 0)); \
828 bn_pollute(_bnum2); \
832 # define bn_fix_top(a) bn_check_top(a)
834 # define bn_check_size(bn, bits) bn_wcheck_size(bn, ((bits+BN_BITS2-1))/BN_BITS2)
835 # define bn_wcheck_size(bn, words) \
837 const BIGNUM *_bnum2 = (bn); \
838 assert((words) <= (_bnum2)->dmax && (words) >= (_bnum2)->top); \
839 /* avoid unused variable warning with NDEBUG */ \
843 # else /* !BN_DEBUG */
845 # define bn_pollute(a)
846 # define bn_check_top(a)
847 # define bn_fix_top(a) bn_correct_top(a)
848 # define bn_check_size(bn, bits)
849 # define bn_wcheck_size(bn, words)
853 # define bn_correct_top(a) \
856 int tmp_top = (a)->top; \
859 for (ftl= &((a)->d[tmp_top-1]); tmp_top > 0; tmp_top--) \
860 if (*(ftl--)) break; \
861 (a)->top = tmp_top; \
866 BN_ULONG bn_mul_add_words(BN_ULONG *rp, const BN_ULONG *ap, int num,
868 BN_ULONG bn_mul_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w);
869 void bn_sqr_words(BN_ULONG *rp, const BN_ULONG *ap, int num);
870 BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d);
871 BN_ULONG bn_add_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,
873 BN_ULONG bn_sub_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,
876 /* Primes from RFC 2409 */
877 BIGNUM *get_rfc2409_prime_768(BIGNUM *bn);
878 BIGNUM *get_rfc2409_prime_1024(BIGNUM *bn);
880 /* Primes from RFC 3526 */
881 BIGNUM *get_rfc3526_prime_1536(BIGNUM *bn);
882 BIGNUM *get_rfc3526_prime_2048(BIGNUM *bn);
883 BIGNUM *get_rfc3526_prime_3072(BIGNUM *bn);
884 BIGNUM *get_rfc3526_prime_4096(BIGNUM *bn);
885 BIGNUM *get_rfc3526_prime_6144(BIGNUM *bn);
886 BIGNUM *get_rfc3526_prime_8192(BIGNUM *bn);
888 int BN_bntest_rand(BIGNUM *rnd, int bits, int top, int bottom);
890 /* BEGIN ERROR CODES */
892 * The following lines are auto generated by the script mkerr.pl. Any changes
893 * made after this point may be overwritten when the script is next run.
895 void ERR_load_BN_strings(void);
897 /* Error codes for the BN functions. */
899 /* Function codes. */
900 # define BN_F_BNRAND 127
901 # define BN_F_BN_BLINDING_CONVERT_EX 100
902 # define BN_F_BN_BLINDING_CREATE_PARAM 128
903 # define BN_F_BN_BLINDING_INVERT_EX 101
904 # define BN_F_BN_BLINDING_NEW 102
905 # define BN_F_BN_BLINDING_UPDATE 103
906 # define BN_F_BN_BN2DEC 104
907 # define BN_F_BN_BN2HEX 105
908 # define BN_F_BN_CTX_GET 116
909 # define BN_F_BN_CTX_NEW 106
910 # define BN_F_BN_CTX_START 129
911 # define BN_F_BN_DIV 107
912 # define BN_F_BN_DIV_NO_BRANCH 138
913 # define BN_F_BN_DIV_RECP 130
914 # define BN_F_BN_EXP 123
915 # define BN_F_BN_EXPAND2 108
916 # define BN_F_BN_EXPAND_INTERNAL 120
917 # define BN_F_BN_GF2M_MOD 131
918 # define BN_F_BN_GF2M_MOD_EXP 132
919 # define BN_F_BN_GF2M_MOD_MUL 133
920 # define BN_F_BN_GF2M_MOD_SOLVE_QUAD 134
921 # define BN_F_BN_GF2M_MOD_SOLVE_QUAD_ARR 135
922 # define BN_F_BN_GF2M_MOD_SQR 136
923 # define BN_F_BN_GF2M_MOD_SQRT 137
924 # define BN_F_BN_LSHIFT 145
925 # define BN_F_BN_MOD_EXP2_MONT 118
926 # define BN_F_BN_MOD_EXP_MONT 109
927 # define BN_F_BN_MOD_EXP_MONT_CONSTTIME 124
928 # define BN_F_BN_MOD_EXP_MONT_WORD 117
929 # define BN_F_BN_MOD_EXP_RECP 125
930 # define BN_F_BN_MOD_EXP_SIMPLE 126
931 # define BN_F_BN_MOD_INVERSE 110
932 # define BN_F_BN_MOD_INVERSE_NO_BRANCH 139
933 # define BN_F_BN_MOD_LSHIFT_QUICK 119
934 # define BN_F_BN_MOD_MUL_RECIPROCAL 111
935 # define BN_F_BN_MOD_SQRT 121
936 # define BN_F_BN_MPI2BN 112
937 # define BN_F_BN_NEW 113
938 # define BN_F_BN_RAND 114
939 # define BN_F_BN_RAND_RANGE 122
940 # define BN_F_BN_RSHIFT 146
941 # define BN_F_BN_USUB 115
944 # define BN_R_ARG2_LT_ARG3 100
945 # define BN_R_BAD_RECIPROCAL 101
946 # define BN_R_BIGNUM_TOO_LONG 114
947 # define BN_R_BITS_TOO_SMALL 118
948 # define BN_R_CALLED_WITH_EVEN_MODULUS 102
949 # define BN_R_DIV_BY_ZERO 103
950 # define BN_R_ENCODING_ERROR 104
951 # define BN_R_EXPAND_ON_STATIC_BIGNUM_DATA 105
952 # define BN_R_INPUT_NOT_REDUCED 110
953 # define BN_R_INVALID_LENGTH 106
954 # define BN_R_INVALID_RANGE 115
955 # define BN_R_INVALID_SHIFT 119
956 # define BN_R_NOT_A_SQUARE 111
957 # define BN_R_NOT_INITIALIZED 107
958 # define BN_R_NO_INVERSE 108
959 # define BN_R_NO_SOLUTION 116
960 # define BN_R_P_IS_NOT_PRIME 112
961 # define BN_R_TOO_MANY_ITERATIONS 113
962 # define BN_R_TOO_MANY_TEMPORARY_VARIABLES 109