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