]> git.ipfire.org Git - thirdparty/openssl.git/blame - crypto/bn/bn.h
Pass the $PROCESSOR variable through.
[thirdparty/openssl.git] / crypto / bn / bn.h
CommitLineData
d02b48c6
RE
1/* crypto/bn/bn.org */
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 */
58
d02b48c6
RE
59#ifndef HEADER_BN_H
60#define HEADER_BN_H
61
8e10f2b3
UM
62#include "opensslconf.h"
63
d02b48c6
RE
64#ifdef __cplusplus
65extern "C" {
66#endif
67
dfeab068
RE
68#define BN_MUL_COMBA
69#define BN_SQR_COMBA
70#define BN_RECURSION
d02b48c6
RE
71#define RECP_MUL_MOD
72#define MONT_MUL_MOD
73
74/* This next option uses the C libraries (2 word)/(1 word) function.
75 * If it is not defined, I use my C version (which is slower).
76 * The reason for this flag is that when the particular C compiler
77 * library routine is used, and the library is linked with a different
78 * compiler, the library is missing. This mostly happens when the
79 * library is built with gcc and then linked using nornal cc. This would
80 * be a common occurance because gcc normally produces code that is
81 * 2 times faster than system compilers for the big number stuff.
82 * For machines with only one compiler (or shared libraries), this should
83 * be on. Again this in only really a problem on machines
84 * using "long long's", are 32bit, and are not using my assember code. */
85#if defined(MSDOS) || defined(WINDOWS) || defined(linux)
86#define BN_DIV2W
87#endif
88
d02b48c6
RE
89/* assuming long is 64bit - this is the DEC Alpha
90 * unsigned long long is only 64 bits :-(, don't define
91 * BN_LLONG for the DEC Alpha */
92#ifdef SIXTY_FOUR_BIT_LONG
93#define BN_ULLONG unsigned long long
94#define BN_ULONG unsigned long
95#define BN_LONG long
96#define BN_BITS 128
97#define BN_BYTES 8
98#define BN_BITS2 64
99#define BN_BITS4 32
dfeab068 100#define BN_MASK (0xffffffffffffffffffffffffffffffffLL)
d02b48c6
RE
101#define BN_MASK2 (0xffffffffffffffffL)
102#define BN_MASK2l (0xffffffffL)
103#define BN_MASK2h (0xffffffff00000000L)
104#define BN_MASK2h1 (0xffffffff80000000L)
105#define BN_TBIT (0x8000000000000000L)
dfeab068 106#define BN_DEC_CONV (10000000000000000000UL)
58964a49
RE
107#define BN_DEC_FMT1 "%lu"
108#define BN_DEC_FMT2 "%019lu"
109#define BN_DEC_NUM 19
d02b48c6
RE
110#endif
111
dfeab068
RE
112/* This is where the long long data type is 64 bits, but long is 32.
113 * For machines where there are 64bit registers, this is the mode to use.
114 * IRIX, on R4000 and above should use this mode, along with the relevent
115 * assember code :-). Do NOT define BN_ULLONG.
116 */
d02b48c6 117#ifdef SIXTY_FOUR_BIT
8e10f2b3 118#define BN_LLONG
d02b48c6
RE
119/* #define BN_ULLONG unsigned long long */
120#define BN_ULONG unsigned long long
121#define BN_LONG long long
122#define BN_BITS 128
123#define BN_BYTES 8
124#define BN_BITS2 64
125#define BN_BITS4 32
126#define BN_MASK2 (0xffffffffffffffffLL)
127#define BN_MASK2l (0xffffffffL)
128#define BN_MASK2h (0xffffffff00000000LL)
129#define BN_MASK2h1 (0xffffffff80000000LL)
130#define BN_TBIT (0x8000000000000000LL)
dfeab068
RE
131#define BN_DEC_CONV (10000000000000000000LL)
132#define BN_DEC_FMT1 "%llu"
133#define BN_DEC_FMT2 "%019llu"
58964a49 134#define BN_DEC_NUM 19
d02b48c6
RE
135#endif
136
137#ifdef THIRTY_TWO_BIT
138#ifdef WIN32
139#define BN_ULLONG unsigned _int64
140#else
141#define BN_ULLONG unsigned long long
142#endif
143#define BN_ULONG unsigned long
144#define BN_LONG long
145#define BN_BITS 64
146#define BN_BYTES 4
147#define BN_BITS2 32
148#define BN_BITS4 16
9b3086fe
DSH
149#ifdef WIN32
150/* VC++ doesn't like the LL suffix */
151#define BN_MASK (0xffffffffffffffffL)
152#else
dfeab068 153#define BN_MASK (0xffffffffffffffffLL)
9b3086fe 154#endif
d02b48c6
RE
155#define BN_MASK2 (0xffffffffL)
156#define BN_MASK2l (0xffff)
157#define BN_MASK2h1 (0xffff8000L)
158#define BN_MASK2h (0xffff0000L)
159#define BN_TBIT (0x80000000L)
58964a49
RE
160#define BN_DEC_CONV (1000000000L)
161#define BN_DEC_FMT1 "%lu"
162#define BN_DEC_FMT2 "%09lu"
163#define BN_DEC_NUM 9
d02b48c6
RE
164#endif
165
166#ifdef SIXTEEN_BIT
167#ifndef BN_DIV2W
168#define BN_DIV2W
169#endif
170#define BN_ULLONG unsigned long
171#define BN_ULONG unsigned short
172#define BN_LONG short
173#define BN_BITS 32
174#define BN_BYTES 2
175#define BN_BITS2 16
176#define BN_BITS4 8
dfeab068 177#define BN_MASK (0xffffffff)
d02b48c6
RE
178#define BN_MASK2 (0xffff)
179#define BN_MASK2l (0xff)
180#define BN_MASK2h1 (0xff80)
181#define BN_MASK2h (0xff00)
182#define BN_TBIT (0x8000)
58964a49
RE
183#define BN_DEC_CONV (100000)
184#define BN_DEC_FMT1 "%u"
185#define BN_DEC_FMT2 "%05u"
186#define BN_DEC_NUM 5
d02b48c6
RE
187#endif
188
189#ifdef EIGHT_BIT
190#ifndef BN_DIV2W
191#define BN_DIV2W
192#endif
193#define BN_ULLONG unsigned short
194#define BN_ULONG unsigned char
195#define BN_LONG char
196#define BN_BITS 16
197#define BN_BYTES 1
198#define BN_BITS2 8
199#define BN_BITS4 4
dfeab068 200#define BN_MASK (0xffff)
d02b48c6
RE
201#define BN_MASK2 (0xff)
202#define BN_MASK2l (0xf)
203#define BN_MASK2h1 (0xf8)
204#define BN_MASK2h (0xf0)
205#define BN_TBIT (0x80)
58964a49
RE
206#define BN_DEC_CONV (100)
207#define BN_DEC_FMT1 "%u"
208#define BN_DEC_FMT2 "%02u"
209#define BN_DEC_NUM 2
d02b48c6
RE
210#endif
211
212#define BN_DEFAULT_BITS 1280
213
214#ifdef BIGNUM
215#undef BIGNUM
216#endif
217
dfeab068
RE
218#define BN_FLG_MALLOCED 0x01
219#define BN_FLG_STATIC_DATA 0x02
220#define BN_FLG_FREE 0x8000 /* used for debuging */
221#define BN_set_flags(b,n) ((b)->flags|=(n))
222#define BN_get_flags(b,n) ((b)->flags&(n))
223
d02b48c6
RE
224typedef struct bignum_st
225 {
226 BN_ULONG *d; /* Pointer to an array of 'BN_BITS2' bit chunks. */
227 int top; /* Index of last used d +1. */
228 /* The next are internal book keeping for bn_expand. */
229 int max; /* Size of the d array. */
230 int neg; /* one if the number is negative */
dfeab068 231 int flags;
d02b48c6
RE
232 } BIGNUM;
233
234/* Used for temp variables */
235#define BN_CTX_NUM 12
236typedef struct bignum_ctx
237 {
238 int tos;
dfeab068
RE
239 BIGNUM bn[BN_CTX_NUM+1];
240 int flags;
d02b48c6
RE
241 } BN_CTX;
242
58964a49
RE
243typedef struct bn_blinding_st
244 {
245 int init;
246 BIGNUM *A;
247 BIGNUM *Ai;
248 BIGNUM *mod; /* just a reference */
249 } BN_BLINDING;
250
d02b48c6
RE
251/* Used for montgomery multiplication */
252typedef struct bn_mont_ctx_st
253 {
dfeab068 254 int use_word; /* 0 for word form, 1 for long form */
d02b48c6 255 int ri; /* number of bits in R */
dfeab068
RE
256 BIGNUM RR; /* used to convert to montgomery form */
257 BIGNUM N; /* The modulus */
258 BIGNUM Ni; /* The inverse of N */
d02b48c6
RE
259 BN_ULONG n0; /* word form of inverse, normally only one of
260 * Ni or n0 is defined */
dfeab068 261 int flags;
d02b48c6
RE
262 } BN_MONT_CTX;
263
dfeab068
RE
264/* Used for reciprocal division/mod functions
265 * It cannot be shared between threads
266 */
267typedef struct bn_recp_ctx_st
268 {
269 BIGNUM N; /* the divisor */
270 BIGNUM Nr; /* the reciprocal */
271 int num_bits;
272 int shift;
273 int flags;
274 } BN_RECP_CTX;
275
d02b48c6 276#define BN_to_montgomery(r,a,mont,ctx) BN_mod_mul_montgomery(\
dfeab068 277 r,a,&((mont)->RR),(mont),ctx)
d02b48c6
RE
278
279#define BN_prime_checks (5)
280
281#define BN_num_bytes(a) ((BN_num_bits(a)+7)/8)
282#define BN_is_word(a,w) (((a)->top == 1) && ((a)->d[0] == (BN_ULONG)(w)))
dfeab068 283#define BN_is_zero(a) (((a)->top == 0) || BN_is_word(a,0))
d02b48c6 284#define BN_is_one(a) (BN_is_word((a),1))
dfeab068 285#define BN_is_odd(a) (((a)->top > 0) && ((a)->d[0] & 1))
d02b48c6
RE
286#define BN_one(a) (BN_set_word((a),1))
287#define BN_zero(a) (BN_set_word((a),0))
288
dfeab068
RE
289/*#define BN_ascii2bn(a) BN_hex2bn(a) */
290/*#define BN_bn2ascii(a) BN_bn2hex(a) */
d02b48c6 291
dfeab068
RE
292#define bn_expand(n,b) ((((((b+BN_BITS2-1))/BN_BITS2)) <= (n)->max)?\
293 (n):bn_expand2((n),(b)/BN_BITS2+1))
58964a49 294#define bn_wexpand(n,b) (((b) <= (n)->max)?(n):bn_expand2((n),(b)))
d02b48c6 295
dfeab068
RE
296#define bn_fix_top(a) \
297 { \
298 BN_ULONG *ftl; \
299 if ((a)->top > 0) \
300 { \
301 for (ftl= &((a)->d[(a)->top-1]); (a)->top > 0; (a)->top--) \
302 if (*(ftl--)) break; \
303 } \
304 }
d02b48c6
RE
305
306#ifndef NOPROTO
307BIGNUM *BN_value_one(void);
308char * BN_options(void);
309BN_CTX *BN_CTX_new(void);
dfeab068 310void BN_CTX_init(BN_CTX *c);
d02b48c6
RE
311void BN_CTX_free(BN_CTX *c);
312int BN_rand(BIGNUM *rnd, int bits, int top,int bottom);
313int BN_num_bits(BIGNUM *a);
314int BN_num_bits_word(BN_ULONG);
315BIGNUM *BN_new(void);
dfeab068 316void BN_init(BIGNUM *);
d02b48c6
RE
317void BN_clear_free(BIGNUM *a);
318BIGNUM *BN_copy(BIGNUM *a, BIGNUM *b);
319BIGNUM *BN_bin2bn(unsigned char *s,int len,BIGNUM *ret);
320int BN_bn2bin(BIGNUM *a, unsigned char *to);
58964a49
RE
321BIGNUM *BN_mpi2bn(unsigned char *s,int len,BIGNUM *ret);
322int BN_bn2mpi(BIGNUM *a, unsigned char *to);
d02b48c6 323int BN_sub(BIGNUM *r, BIGNUM *a, BIGNUM *b);
dfeab068
RE
324int BN_usub(BIGNUM *r, BIGNUM *a, BIGNUM *b);
325int BN_uadd(BIGNUM *r, BIGNUM *a, BIGNUM *b);
d02b48c6
RE
326int BN_add(BIGNUM *r, BIGNUM *a, BIGNUM *b);
327int BN_mod(BIGNUM *rem, BIGNUM *m, BIGNUM *d, BN_CTX *ctx);
328int BN_div(BIGNUM *dv, BIGNUM *rem, BIGNUM *m, BIGNUM *d, BN_CTX *ctx);
dfeab068 329int BN_mul(BIGNUM *r, BIGNUM *a, BIGNUM *b,BN_CTX *ctx);
d02b48c6 330int BN_sqr(BIGNUM *r, BIGNUM *a,BN_CTX *ctx);
dfeab068
RE
331BN_ULONG BN_mod_word(BIGNUM *a, BN_ULONG w);
332BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w);
333int BN_mul_word(BIGNUM *a, BN_ULONG w);
334int BN_add_word(BIGNUM *a, BN_ULONG w);
335int BN_sub_word(BIGNUM *a, BN_ULONG w);
336int BN_set_word(BIGNUM *a, BN_ULONG w);
337BN_ULONG BN_get_word(BIGNUM *a);
d02b48c6
RE
338int BN_cmp(BIGNUM *a, BIGNUM *b);
339void BN_free(BIGNUM *a);
340int BN_is_bit_set(BIGNUM *a, int n);
341int BN_lshift(BIGNUM *r, BIGNUM *a, int n);
342int BN_lshift1(BIGNUM *r, BIGNUM *a);
58964a49 343int BN_exp(BIGNUM *r, BIGNUM *a, BIGNUM *p,BN_CTX *ctx);
d02b48c6 344int BN_mod_exp(BIGNUM *r, BIGNUM *a, BIGNUM *p, BIGNUM *m,BN_CTX *ctx);
58964a49
RE
345int BN_mod_exp_mont(BIGNUM *r, BIGNUM *a, BIGNUM *p, BIGNUM *m,BN_CTX *ctx,
346 BN_MONT_CTX *m_ctx);
dfeab068
RE
347int BN_mod_exp2_mont(BIGNUM *r, BIGNUM *a1, BIGNUM *p1,BIGNUM *a2,
348 BIGNUM *p2,BIGNUM *m,BN_CTX *ctx,BN_MONT_CTX *m_ctx);
d02b48c6
RE
349int BN_mod_exp_simple(BIGNUM *r, BIGNUM *a, BIGNUM *p,
350 BIGNUM *m,BN_CTX *ctx);
351int BN_mask_bits(BIGNUM *a,int n);
d02b48c6
RE
352int BN_mod_mul(BIGNUM *ret, BIGNUM *a, BIGNUM *b, BIGNUM *m,
353 BN_CTX *ctx);
354#ifndef WIN16
355int BN_print_fp(FILE *fp, BIGNUM *a);
356#endif
357#ifdef HEADER_BIO_H
358int BN_print(BIO *fp, BIGNUM *a);
359#else
360int BN_print(char *fp, BIGNUM *a);
361#endif
dfeab068 362int BN_reciprocal(BIGNUM *r, BIGNUM *m, int len, BN_CTX *ctx);
d02b48c6
RE
363int BN_rshift(BIGNUM *r, BIGNUM *a, int n);
364int BN_rshift1(BIGNUM *r, BIGNUM *a);
365void BN_clear(BIGNUM *a);
366BIGNUM *bn_expand2(BIGNUM *b, int bits);
367BIGNUM *BN_dup(BIGNUM *a);
368int BN_ucmp(BIGNUM *a, BIGNUM *b);
369int BN_set_bit(BIGNUM *a, int n);
370int BN_clear_bit(BIGNUM *a, int n);
58964a49
RE
371char * BN_bn2hex(BIGNUM *a);
372char * BN_bn2dec(BIGNUM *a);
373int BN_hex2bn(BIGNUM **a,char *str);
374int BN_dec2bn(BIGNUM **a,char *str);
d02b48c6 375int BN_gcd(BIGNUM *r,BIGNUM *in_a,BIGNUM *in_b,BN_CTX *ctx);
dfeab068
RE
376BIGNUM *BN_mod_inverse(BIGNUM *ret,BIGNUM *a, BIGNUM *n,BN_CTX *ctx);
377BIGNUM *BN_generate_prime(BIGNUM *ret,int bits,int strong,BIGNUM *add,
58964a49
RE
378 BIGNUM *rem,void (*callback)(int,int,char *),char *cb_arg);
379int BN_is_prime(BIGNUM *p,int nchecks,void (*callback)(int,int,char *),
380 BN_CTX *ctx,char *cb_arg);
d02b48c6
RE
381void ERR_load_BN_strings(void );
382
58964a49
RE
383BN_ULONG bn_mul_add_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w);
384BN_ULONG bn_mul_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w);
d02b48c6 385void bn_sqr_words(BN_ULONG *rp, BN_ULONG *ap, int num);
dfeab068 386BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d);
58964a49 387BN_ULONG bn_add_words(BN_ULONG *rp, BN_ULONG *ap, BN_ULONG *bp,int num);
dfeab068 388BN_ULONG bn_sub_words(BN_ULONG *rp, BN_ULONG *ap, BN_ULONG *bp,int num);
d02b48c6
RE
389
390BN_MONT_CTX *BN_MONT_CTX_new(void );
dfeab068 391void BN_MONT_CTX_init(BN_MONT_CTX *ctx);
d02b48c6
RE
392int BN_mod_mul_montgomery(BIGNUM *r,BIGNUM *a,BIGNUM *b,BN_MONT_CTX *mont,
393 BN_CTX *ctx);
394int BN_from_montgomery(BIGNUM *r,BIGNUM *a,BN_MONT_CTX *mont,BN_CTX *ctx);
395void BN_MONT_CTX_free(BN_MONT_CTX *mont);
396int BN_MONT_CTX_set(BN_MONT_CTX *mont,BIGNUM *modulus,BN_CTX *ctx);
dfeab068 397BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to,BN_MONT_CTX *from);
d02b48c6 398
58964a49
RE
399BN_BLINDING *BN_BLINDING_new(BIGNUM *A,BIGNUM *Ai,BIGNUM *mod);
400void BN_BLINDING_free(BN_BLINDING *b);
401int BN_BLINDING_update(BN_BLINDING *b,BN_CTX *ctx);
402int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *r, BN_CTX *ctx);
403int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
404
dfeab068
RE
405void BN_set_params(int mul,int high,int low,int mont);
406int BN_get_params(int which); /* 0, mul, 1 high, 2 low, 3 mont */
407
408void bn_mul_normal(BN_ULONG *r,BN_ULONG *a,int na,BN_ULONG *b,int nb);
409void bn_mul_comba8(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b);
410void bn_mul_comba4(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b);
411void bn_sqr_normal(BN_ULONG *r, BN_ULONG *a, int n, BN_ULONG *tmp);
412void bn_sqr_comba8(BN_ULONG *r,BN_ULONG *a);
413void bn_sqr_comba4(BN_ULONG *r,BN_ULONG *a);
414int bn_cmp_words(BN_ULONG *a,BN_ULONG *b,int n);
415void bn_mul_recursive(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b,int n2,BN_ULONG *t);
416void bn_mul_part_recursive(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b,
417 int tn, int n,BN_ULONG *t);
418void bn_sqr_recursive(BN_ULONG *r,BN_ULONG *a, int n2, BN_ULONG *t);
419void bn_mul_low_normal(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b, int n);
420
421void BN_RECP_CTX_init(BN_RECP_CTX *recp);
422BN_RECP_CTX *BN_RECP_CTX_new(void);
423void BN_RECP_CTX_free(BN_RECP_CTX *recp);
424int BN_RECP_CTX_set(BN_RECP_CTX *recp,BIGNUM *rdiv,BN_CTX *ctx);
425int BN_mod_mul_reciprocal(BIGNUM *r, BIGNUM *x, BIGNUM *y,
426 BN_RECP_CTX *recp,BN_CTX *ctx);
427int BN_mod_exp_recp(BIGNUM *r, BIGNUM *a, BIGNUM *p, BIGNUM *m,BN_CTX *ctx);
428int BN_div_recp(BIGNUM *dv, BIGNUM *rem, BIGNUM *m,
429 BN_RECP_CTX *recp, BN_CTX *ctx);
430
431
d02b48c6
RE
432#else
433
434BIGNUM *BN_value_one();
435char * BN_options();
436BN_CTX *BN_CTX_new();
dfeab068 437void BN_CTX_init();
d02b48c6
RE
438void BN_CTX_free();
439int BN_rand();
440int BN_num_bits();
441int BN_num_bits_word();
442BIGNUM *BN_new();
dfeab068 443void BN_init();
d02b48c6
RE
444void BN_clear_free();
445BIGNUM *BN_copy();
446BIGNUM *BN_bin2bn();
447int BN_bn2bin();
58964a49
RE
448BIGNUM *BN_mpi2bn();
449int BN_bn2mpi();
d02b48c6 450int BN_sub();
dfeab068
RE
451int BN_usub();
452int BN_uadd();
d02b48c6
RE
453int BN_add();
454int BN_mod();
455int BN_div();
456int BN_mul();
457int BN_sqr();
458BN_ULONG BN_mod_word();
459BN_ULONG BN_div_word();
460int BN_add_word();
58964a49
RE
461int BN_sub_word();
462int BN_mul_word();
d02b48c6
RE
463int BN_set_word();
464unsigned long BN_get_word();
465int BN_cmp();
466void BN_free();
467int BN_is_bit_set();
468int BN_lshift();
469int BN_lshift1();
58964a49 470int BN_exp();
d02b48c6
RE
471int BN_mod_exp();
472int BN_mod_exp_mont();
473int BN_mod_exp_recp();
474int BN_mod_exp_simple();
475int BN_mask_bits();
476int BN_mod_mul_reciprocal();
477int BN_mod_mul();
478#ifndef WIN16
479int BN_print_fp();
480#endif
481int BN_print();
482int BN_reciprocal();
483int BN_rshift();
484int BN_rshift1();
485void BN_clear();
486BIGNUM *bn_expand2();
487BIGNUM *BN_dup();
488int BN_ucmp();
489int BN_set_bit();
490int BN_clear_bit();
58964a49
RE
491char * BN_bn2hex();
492char * BN_bn2dec();
493int BN_hex2bn();
494int BN_dec2bn();
d02b48c6
RE
495int BN_gcd();
496BIGNUM *BN_mod_inverse();
497BIGNUM *BN_generate_prime();
498int BN_is_prime();
499void ERR_load_BN_strings();
500
58964a49
RE
501BN_ULONG bn_mul_add_words();
502BN_ULONG bn_mul_words();
d02b48c6 503void bn_sqr_words();
dfeab068 504BN_ULONG bn_div_words();
58964a49 505BN_ULONG bn_add_words();
dfeab068 506BN_ULONG bn_sub_words();
d02b48c6
RE
507
508int BN_mod_mul_montgomery();
509int BN_from_montgomery();
510BN_MONT_CTX *BN_MONT_CTX_new();
dfeab068 511void BN_MONT_CTX_init();
d02b48c6
RE
512void BN_MONT_CTX_free();
513int BN_MONT_CTX_set();
0cc39579 514BN_MONT_CTX *BN_MONT_CTX_copy();
d02b48c6 515
58964a49
RE
516BN_BLINDING *BN_BLINDING_new();
517void BN_BLINDING_free();
518int BN_BLINDING_update();
519int BN_BLINDING_convert();
520int BN_BLINDING_invert();
521
0cc39579
DSH
522void BN_set_params();
523int BN_get_params();
524
dfeab068
RE
525void bn_mul_normal();
526void bn_mul_comba8();
527void bn_mul_comba4();
528void bn_sqr_normal();
529void bn_sqr_comba8();
530void bn_sqr_comba4();
531int bn_cmp_words();
532void bn_mul_recursive();
533void bn_mul_part_recursive();
534void bn_sqr_recursive();
535void bn_mul_low_normal();
536
537void BN_RECP_CTX_init();
538BN_RECP_CTX *BN_RECP_CTX_new();
539void BN_RECP_CTX_free();
540int BN_RECP_CTX_set();
541int BN_mod_mul_reciprocal();
542int BN_mod_exp_recp();
543int BN_div_recp();
544
d02b48c6
RE
545#endif
546
547/* BEGIN ERROR CODES */
548/* Error codes for the BN functions. */
549
550/* Function codes. */
58964a49
RE
551#define BN_F_BN_BLINDING_CONVERT 100
552#define BN_F_BN_BLINDING_INVERT 101
553#define BN_F_BN_BLINDING_NEW 102
554#define BN_F_BN_BLINDING_UPDATE 103
a0a54079
MC
555#define BN_F_BN_BN2DEC 104
556#define BN_F_BN_BN2HEX 105
557#define BN_F_BN_CTX_NEW 106
558#define BN_F_BN_DIV 107
559#define BN_F_BN_EXPAND2 108
560#define BN_F_BN_MOD_EXP_MONT 109
561#define BN_F_BN_MOD_INVERSE 110
562#define BN_F_BN_MOD_MUL_RECIPROCAL 111
563#define BN_F_BN_MPI2BN 112
564#define BN_F_BN_NEW 113
565#define BN_F_BN_RAND 114
566#define BN_F_BN_USUB 115
d02b48c6
RE
567
568/* Reason codes. */
dfeab068
RE
569#define BN_R_ARG2_LT_ARG3 100
570#define BN_R_BAD_RECIPROCAL 101
571#define BN_R_CALLED_WITH_EVEN_MODULUS 102
572#define BN_R_DIV_BY_ZERO 103
573#define BN_R_ENCODING_ERROR 104
574#define BN_R_EXPAND_ON_STATIC_BIGNUM_DATA 105
575#define BN_R_INVALID_LENGTH 106
df82f5c8 576#define BN_R_NOT_INITIALIZED 107
dfeab068 577#define BN_R_NO_INVERSE 108
d02b48c6
RE
578
579#ifdef __cplusplus
580}
581#endif
582#endif
583