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