]> 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
Implement BN_kronecker test.
[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 */
58
d02b48c6
RE		 59#ifndef HEADER_BN_H
60#define HEADER_BN_H
61
de42b6a7 62#ifndef NO_FP_API
2b6405fa
BM		 63#include <stdio.h> /* FILE */
64#endif
ec577822 65#include <openssl/opensslconf.h>
8e10f2b3 66
d02b48c6
RE		 67#ifdef __cplusplus
68extern "C" {
69#endif
70
7d7d2cbc
UM		 71#ifdef VMS
72#undef BN_LLONG /* experimental, so far... */
73#endif
74
dfeab068
RE		 75#define BN_MUL_COMBA
76#define BN_SQR_COMBA
77#define BN_RECURSION
d02b48c6
RE		 78
79/* This next option uses the C libraries (2 word)/(1 word) function.
80 * If it is not defined, I use my C version (which is slower).
81 * The reason for this flag is that when the particular C compiler
82 * library routine is used, and the library is linked with a different
83 * compiler, the library is missing. This mostly happens when the
657e60fa
UM		 84 * library is built with gcc and then linked using normal cc. This would
85 * be a common occurrence because gcc normally produces code that is
d02b48c6
RE		 86 * 2 times faster than system compilers for the big number stuff.
87 * For machines with only one compiler (or shared libraries), this should
88 * be on. Again this in only really a problem on machines
657e60fa 89 * using "long long's", are 32bit, and are not using my assembler code. */
f1a617ed 90#if defined(MSDOS) || defined(WINDOWS) || defined(WIN32) || defined(linux)
227385b7 91#undef BN_DIV2W
d02b48c6
RE		 92#define BN_DIV2W
93#endif
94
d02b48c6
RE		 95/* assuming long is 64bit - this is the DEC Alpha
96 * unsigned long long is only 64 bits :-(, don't define
97 * BN_LLONG for the DEC Alpha */
98#ifdef SIXTY_FOUR_BIT_LONG
99#define BN_ULLONG unsigned long long
100#define BN_ULONG unsigned long
101#define BN_LONG long
102#define BN_BITS 128
103#define BN_BYTES 8
104#define BN_BITS2 64
105#define BN_BITS4 32
dfeab068 106#define BN_MASK (0xffffffffffffffffffffffffffffffffLL)
d02b48c6
RE		 107#define BN_MASK2 (0xffffffffffffffffL)
108#define BN_MASK2l (0xffffffffL)
109#define BN_MASK2h (0xffffffff00000000L)
110#define BN_MASK2h1 (0xffffffff80000000L)
111#define BN_TBIT (0x8000000000000000L)
dfeab068 112#define BN_DEC_CONV (10000000000000000000UL)
58964a49
RE		 113#define BN_DEC_FMT1 "%lu"
114#define BN_DEC_FMT2 "%019lu"
115#define BN_DEC_NUM 19
d02b48c6
RE		 116#endif
117
dfeab068
RE		 118/* This is where the long long data type is 64 bits, but long is 32.
119 * For machines where there are 64bit registers, this is the mode to use.
657e60fa
UM		 120 * IRIX, on R4000 and above should use this mode, along with the relevant
121 * assembler code :-). Do NOT define BN_LLONG.
dfeab068 122 */
d02b48c6 123#ifdef SIXTY_FOUR_BIT
e14d4443
UM		 124#undef BN_LLONG
125#undef BN_ULLONG
d02b48c6
RE		 126#define BN_ULONG unsigned long long
127#define BN_LONG long long
128#define BN_BITS 128
129#define BN_BYTES 8
130#define BN_BITS2 64
131#define BN_BITS4 32
132#define BN_MASK2 (0xffffffffffffffffLL)
133#define BN_MASK2l (0xffffffffL)
134#define BN_MASK2h (0xffffffff00000000LL)
135#define BN_MASK2h1 (0xffffffff80000000LL)
136#define BN_TBIT (0x8000000000000000LL)
dfeab068
RE		 137#define BN_DEC_CONV (10000000000000000000LL)
138#define BN_DEC_FMT1 "%llu"
139#define BN_DEC_FMT2 "%019llu"
58964a49 140#define BN_DEC_NUM 19
d02b48c6
RE		 141#endif
142
143#ifdef THIRTY_TWO_BIT
e3718280 144#if defined(WIN32) && !defined(__GNUC__)
d02b48c6
RE		 145#define BN_ULLONG unsigned _int64
146#else
147#define BN_ULLONG unsigned long long
148#endif
149#define BN_ULONG unsigned long
150#define BN_LONG long
151#define BN_BITS 64
152#define BN_BYTES 4
153#define BN_BITS2 32
154#define BN_BITS4 16
9b3086fe
DSH		 155#ifdef WIN32
156/* VC++ doesn't like the LL suffix */
157#define BN_MASK (0xffffffffffffffffL)
158#else
dfeab068 159#define BN_MASK (0xffffffffffffffffLL)
9b3086fe 160#endif
d02b48c6
RE		 161#define BN_MASK2 (0xffffffffL)
162#define BN_MASK2l (0xffff)
163#define BN_MASK2h1 (0xffff8000L)
164#define BN_MASK2h (0xffff0000L)
165#define BN_TBIT (0x80000000L)
58964a49
RE		 166#define BN_DEC_CONV (1000000000L)
167#define BN_DEC_FMT1 "%lu"
168#define BN_DEC_FMT2 "%09lu"
169#define BN_DEC_NUM 9
d02b48c6
RE		 170#endif
171
172#ifdef SIXTEEN_BIT
173#ifndef BN_DIV2W
174#define BN_DIV2W
175#endif
176#define BN_ULLONG unsigned long
177#define BN_ULONG unsigned short
178#define BN_LONG short
179#define BN_BITS 32
180#define BN_BYTES 2
181#define BN_BITS2 16
182#define BN_BITS4 8
dfeab068 183#define BN_MASK (0xffffffff)
d02b48c6
RE		 184#define BN_MASK2 (0xffff)
185#define BN_MASK2l (0xff)
186#define BN_MASK2h1 (0xff80)
187#define BN_MASK2h (0xff00)
188#define BN_TBIT (0x8000)
58964a49
RE		 189#define BN_DEC_CONV (100000)
190#define BN_DEC_FMT1 "%u"
191#define BN_DEC_FMT2 "%05u"
192#define BN_DEC_NUM 5
d02b48c6
RE		 193#endif
194
195#ifdef EIGHT_BIT
196#ifndef BN_DIV2W
197#define BN_DIV2W
198#endif
199#define BN_ULLONG unsigned short
200#define BN_ULONG unsigned char
201#define BN_LONG char
202#define BN_BITS 16
203#define BN_BYTES 1
204#define BN_BITS2 8
205#define BN_BITS4 4
dfeab068 206#define BN_MASK (0xffff)
d02b48c6
RE		 207#define BN_MASK2 (0xff)
208#define BN_MASK2l (0xf)
209#define BN_MASK2h1 (0xf8)
210#define BN_MASK2h (0xf0)
211#define BN_TBIT (0x80)
58964a49
RE		 212#define BN_DEC_CONV (100)
213#define BN_DEC_FMT1 "%u"
214#define BN_DEC_FMT2 "%02u"
215#define BN_DEC_NUM 2
d02b48c6
RE		 216#endif
217
218#define BN_DEFAULT_BITS 1280
219
220#ifdef BIGNUM
221#undef BIGNUM
222#endif
223
dfeab068
RE		 224#define BN_FLG_MALLOCED 0x01
225#define BN_FLG_STATIC_DATA 0x02
226#define BN_FLG_FREE 0x8000 /* used for debuging */
227#define BN_set_flags(b,n) ((b)->flags|=(n))
228#define BN_get_flags(b,n) ((b)->flags&(n))
229
d02b48c6
RE		 230typedef struct bignum_st
231 {
232 BN_ULONG *d; /* Pointer to an array of 'BN_BITS2' bit chunks. */
233 int top; /* Index of last used d +1. */
234 /* The next are internal book keeping for bn_expand. */
2d978cbd 235 int dmax; /* Size of the d array. */
d02b48c6 236 int neg; /* one if the number is negative */
dfeab068 237 int flags;
d02b48c6
RE		 238 } BIGNUM;
239
240/* Used for temp variables */
7f7b8d68 241#define BN_CTX_NUM 16
eb5a6a55 242#define BN_CTX_NUM_POS 12
d02b48c6
RE		 243typedef struct bignum_ctx
244 {
245 int tos;
eb5a6a55 246 BIGNUM bn[BN_CTX_NUM];
dfeab068 247 int flags;
9b141126 248 int depth;
eb5a6a55
BM		 249 int pos[BN_CTX_NUM_POS];
250 int too_many;
d02b48c6
RE		 251 } BN_CTX;
252
58964a49
RE		 253typedef struct bn_blinding_st
254 {
255 int init;
256 BIGNUM *A;
257 BIGNUM *Ai;
258 BIGNUM *mod; /* just a reference */
259 } BN_BLINDING;
260
d02b48c6
RE		 261/* Used for montgomery multiplication */
262typedef struct bn_mont_ctx_st
e93f9a32 263 {
e93f9a32
UM		 264 int ri; /* number of bits in R */
265 BIGNUM RR; /* used to convert to montgomery form */
266 BIGNUM N; /* The modulus */
ec1258dd
BM		 267 BIGNUM Ni; /* R*(1/R mod N) - N*Ni = 1
268 * (Ni is only stored for bignum algorithm) */
269 BN_ULONG n0; /* least significant word of Ni */
dfeab068 270 int flags;
e93f9a32 271 } BN_MONT_CTX;
d02b48c6 272
dfeab068
RE		 273/* Used for reciprocal division/mod functions
274 * It cannot be shared between threads
275 */
276typedef struct bn_recp_ctx_st
277 {
278 BIGNUM N; /* the divisor */
279 BIGNUM Nr; /* the reciprocal */
280 int num_bits;
281 int shift;
282 int flags;
283 } BN_RECP_CTX;
284
4486d0cd
UM		 285#define BN_prime_checks 0 /* default: select number of iterations
286 based on the size of the number */
d02b48c6 287
38e33cef
UM		 288/* number of Miller-Rabin iterations for an error rate of less than 2^-80
289 * for random 'b'-bit input, b >= 100 (taken from table 4.4 in the Handbook
290 * of Applied Cryptography [Menezes, van Oorschot, Vanstone; CRC Press 1996];
291 * original paper: Damgaard, Landrock, Pomerance: Average case error estimates
292 * for the strong probable prime test. -- Math. Comp. 61 (1993) 177-194) */
a87030a1 293#define BN_prime_checks_for_size(b) ((b) >= 1300 ? 2 : \
38e33cef
UM		 294 (b) >= 850 ? 3 : \
295 (b) >= 650 ? 4 : \
296 (b) >= 550 ? 5 : \
297 (b) >= 450 ? 6 : \
298 (b) >= 400 ? 7 : \
299 (b) >= 350 ? 8 : \
300 (b) >= 300 ? 9 : \
301 (b) >= 250 ? 12 : \
302 (b) >= 200 ? 15 : \
303 (b) >= 150 ? 18 : \
304 /* b >= 100 */ 27)
305
d02b48c6 306#define BN_num_bytes(a) ((BN_num_bits(a)+7)/8)
dcbd0d74
BM		 307
308/* Note that BN_abs_is_word does not work reliably for w == 0 */
309#define BN_abs_is_word(a,w) (((a)->top == 1) && ((a)->d[0] == (BN_ULONG)(w)))
310#define BN_is_zero(a) (((a)->top == 0) || BN_abs_is_word(a,0))
311#define BN_is_one(a) (BN_abs_is_word((a),1) && !(a)->neg)
312#define BN_is_word(a,w) ((w) ? BN_abs_is_word((a),(w)) && !(a)->neg : \
313 BN_is_zero((a)))
314#define BN_is_odd(a) (((a)->top > 0) && ((a)->d[0] & 1))
315
d02b48c6
RE		 316#define BN_one(a) (BN_set_word((a),1))
317#define BN_zero(a) (BN_set_word((a),0))
318
dfeab068
RE		 319/*#define BN_ascii2bn(a) BN_hex2bn(a) */
320/*#define BN_bn2ascii(a) BN_bn2hex(a) */
d02b48c6 321
d02b48c6
RE		 322BIGNUM *BN_value_one(void);
323char * BN_options(void);
324BN_CTX *BN_CTX_new(void);
dfeab068 325void BN_CTX_init(BN_CTX *c);
d02b48c6 326void BN_CTX_free(BN_CTX *c);
9b141126
UM		 327void BN_CTX_start(BN_CTX *ctx);
328BIGNUM *BN_CTX_get(BN_CTX *ctx);
329void BN_CTX_end(BN_CTX *ctx);
d02b48c6 330int BN_rand(BIGNUM *rnd, int bits, int top,int bottom);
f95a9f67 331int BN_pseudo_rand(BIGNUM *rnd, int bits, int top,int bottom);
84c15db5 332int BN_num_bits(const BIGNUM *a);
d02b48c6
RE		 333int BN_num_bits_word(BN_ULONG);
334BIGNUM *BN_new(void);
dfeab068 335void BN_init(BIGNUM *);
d02b48c6 336void BN_clear_free(BIGNUM *a);
84c15db5 337BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b);
78a0c1f1 338void BN_swap(BIGNUM *a, BIGNUM *b);
61f5b6f3 339BIGNUM *BN_bin2bn(const unsigned char *s,int len,BIGNUM *ret);
8623f693 340int BN_bn2bin(const BIGNUM *a, unsigned char *to);
cbd48ba6 341BIGNUM *BN_mpi2bn(const unsigned char *s,int len,BIGNUM *ret);
8623f693 342int BN_bn2mpi(const BIGNUM *a, unsigned char *to);
84c15db5
BL		 343int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
344int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
345int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
dd8dec69 346int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
020fc820
RL		 347int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);
348int BN_sqr(BIGNUM *r, const BIGNUM *a,BN_CTX *ctx);
5acaa495 349
78a0c1f1
BM		 350int BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, const BIGNUM *d,
351 BN_CTX *ctx);
352#define BN_mod(rem,m,d,ctx) BN_div(NULL,(rem),(m),(d),(ctx))
5acaa495
BM		 353int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx);
354int BN_mod_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m, BN_CTX *ctx);
355int BN_mod_add_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m);
356int BN_mod_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m, BN_CTX *ctx);
357int BN_mod_sub_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m);
358int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
78a0c1f1 359 const BIGNUM *m, BN_CTX *ctx);
5acaa495
BM		 360int BN_mod_lshift1(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);
361int BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *m);
362int BN_mod_lshift(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m, BN_CTX *ctx);
363int BN_mod_lshift_quick(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m);
364
7999c65c 365BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w);
dfeab068
RE		 366BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w);
367int BN_mul_word(BIGNUM *a, BN_ULONG w);
368int BN_add_word(BIGNUM *a, BN_ULONG w);
369int BN_sub_word(BIGNUM *a, BN_ULONG w);
370int BN_set_word(BIGNUM *a, BN_ULONG w);
020fc820 371BN_ULONG BN_get_word(const BIGNUM *a);
5acaa495 372
84c15db5 373int BN_cmp(const BIGNUM *a, const BIGNUM *b);
d02b48c6 374void BN_free(BIGNUM *a);
84c15db5
BL		 375int BN_is_bit_set(const BIGNUM *a, int n);
376int BN_lshift(BIGNUM *r, const BIGNUM *a, int n);
020fc820
RL		 377int BN_lshift1(BIGNUM *r, const BIGNUM *a);
378int BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,BN_CTX *ctx);
5acaa495 379
020fc820
RL		 380int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
381 const BIGNUM *m,BN_CTX *ctx);
382int BN_mod_exp_mont(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
383 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);
6dad7bd6 384int BN_mod_exp_mont_word(BIGNUM *r, BN_ULONG a, const BIGNUM *p,
020fc820
RL		 385 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);
386int BN_mod_exp2_mont(BIGNUM *r, const BIGNUM *a1, const BIGNUM *p1,
387 const BIGNUM *a2, const BIGNUM *p2,const BIGNUM *m,
388 BN_CTX *ctx,BN_MONT_CTX *m_ctx);
389int BN_mod_exp_simple(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
390 const BIGNUM *m,BN_CTX *ctx);
5acaa495 391
d02b48c6 392int BN_mask_bits(BIGNUM *a,int n);
775c63fc 393#ifndef NO_FP_API
e93f9a32 394int BN_print_fp(FILE *fp, const BIGNUM *a);
d02b48c6
RE		 395#endif
396#ifdef HEADER_BIO_H
8d8a8041 397int BN_print(BIO *fp, const BIGNUM *a);
d02b48c6 398#else
775c63fc 399int BN_print(void *fp, const BIGNUM *a);
d02b48c6 400#endif
020fc820
RL		 401int BN_reciprocal(BIGNUM *r, const BIGNUM *m, int len, BN_CTX *ctx);
402int BN_rshift(BIGNUM *r, const BIGNUM *a, int n);
403int BN_rshift1(BIGNUM *r, const BIGNUM *a);
d02b48c6 404void BN_clear(BIGNUM *a);
84c15db5
BL		 405BIGNUM *BN_dup(const BIGNUM *a);
406int BN_ucmp(const BIGNUM *a, const BIGNUM *b);
d02b48c6
RE		 407int BN_set_bit(BIGNUM *a, int n);
408int BN_clear_bit(BIGNUM *a, int n);
8623f693
DSH		 409char * BN_bn2hex(const BIGNUM *a);
410char * BN_bn2dec(const BIGNUM *a);
411int BN_hex2bn(BIGNUM **a, const char *str);
412int BN_dec2bn(BIGNUM **a, const char *str);
dcbd0d74
BM		 413int BN_gcd(BIGNUM *r,const BIGNUM *a,const BIGNUM *b,BN_CTX *ctx);
414int BN_kronecker(const BIGNUM *a,const BIGNUM *b,BN_CTX *ctx); /* returns -2 for error */
020fc820
RL		 415BIGNUM *BN_mod_inverse(BIGNUM *ret,
416 const BIGNUM *a, const BIGNUM *n,BN_CTX *ctx);
417BIGNUM *BN_generate_prime(BIGNUM *ret,int bits,int safe,
418 const BIGNUM *add, const BIGNUM *rem,
419 void (*callback)(int,int,void *),void *cb_arg);
aff0825c 420int BN_is_prime(const BIGNUM *p,int nchecks,
227385b7
RL		 421 void (*callback)(int,int,void *),
422 BN_CTX *ctx,void *cb_arg);
aff0825c 423int BN_is_prime_fasttest(const BIGNUM *p,int nchecks,
227385b7
RL		 424 void (*callback)(int,int,void *),BN_CTX *ctx,void *cb_arg,
425 int do_trial_division);
d02b48c6
RE		 426void ERR_load_BN_strings(void );
427
d02b48c6 428BN_MONT_CTX *BN_MONT_CTX_new(void );
dfeab068 429void BN_MONT_CTX_init(BN_MONT_CTX *ctx);
020fc820
RL		 430int BN_mod_mul_montgomery(BIGNUM *r,const BIGNUM *a,const BIGNUM *b,
431 BN_MONT_CTX *mont, BN_CTX *ctx);
78a0c1f1
BM		 432#define BN_to_montgomery(r,a,mont,ctx) BN_mod_mul_montgomery(\
433 (r),(a),&((mont)->RR),(mont),(ctx))
cbd48ba6
RL		 434int BN_from_montgomery(BIGNUM *r,const BIGNUM *a,
435 BN_MONT_CTX *mont, BN_CTX *ctx);
d02b48c6 436void BN_MONT_CTX_free(BN_MONT_CTX *mont);
84c15db5 437int BN_MONT_CTX_set(BN_MONT_CTX *mont,const BIGNUM *modulus,BN_CTX *ctx);
dfeab068 438BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to,BN_MONT_CTX *from);
d02b48c6 439
58964a49
RE		 440BN_BLINDING *BN_BLINDING_new(BIGNUM *A,BIGNUM *Ai,BIGNUM *mod);
441void BN_BLINDING_free(BN_BLINDING *b);
442int BN_BLINDING_update(BN_BLINDING *b,BN_CTX *ctx);
443int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *r, BN_CTX *ctx);
444int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
445
dfeab068
RE		 446void BN_set_params(int mul,int high,int low,int mont);
447int BN_get_params(int which); /* 0, mul, 1 high, 2 low, 3 mont */
448
dfeab068
RE		 449void BN_RECP_CTX_init(BN_RECP_CTX *recp);
450BN_RECP_CTX *BN_RECP_CTX_new(void);
451void BN_RECP_CTX_free(BN_RECP_CTX *recp);
84c15db5 452int BN_RECP_CTX_set(BN_RECP_CTX *recp,const BIGNUM *rdiv,BN_CTX *ctx);
020fc820 453int BN_mod_mul_reciprocal(BIGNUM *r, const BIGNUM *x, const BIGNUM *y,
227385b7 454 BN_RECP_CTX *recp,BN_CTX *ctx);
84c15db5 455int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
227385b7 456 const BIGNUM *m, BN_CTX *ctx);
020fc820 457int BN_div_recp(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m,
227385b7 458 BN_RECP_CTX *recp, BN_CTX *ctx);
dfeab068 459
775c63fc
UM		 460/* library internal functions */
461
2d978cbd 462#define bn_expand(a,bits) ((((((bits+BN_BITS2-1))/BN_BITS2)) <= (a)->dmax)?\
775c63fc 463 (a):bn_expand2((a),(bits)/BN_BITS2+1))
2d978cbd 464#define bn_wexpand(a,words) (((words) <= (a)->dmax)?(a):bn_expand2((a),(words)))
775c63fc 465BIGNUM *bn_expand2(BIGNUM *a, int words);
020fc820 466BIGNUM *bn_dup_expand(const BIGNUM *a, int words);
775c63fc
UM		 467
468#define bn_fix_top(a) \
469 { \
470 BN_ULONG *ftl; \
471 if ((a)->top > 0) \
472 { \
473 for (ftl= &((a)->d[(a)->top-1]); (a)->top > 0; (a)->top--) \
474 if (*(ftl--)) break; \
475 } \
476 }
477
cbd48ba6
RL		 478BN_ULONG bn_mul_add_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w);
479BN_ULONG bn_mul_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w);
480void bn_sqr_words(BN_ULONG *rp, const BN_ULONG *ap, int num);
775c63fc 481BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d);
cbd48ba6
RL		 482BN_ULONG bn_add_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,int num);
483BN_ULONG bn_sub_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,int num);
775c63fc
UM		 484
485#ifdef BN_DEBUG
227385b7 486void bn_dump1(FILE *o, const char *a, const BN_ULONG *b,int n);
775c63fc
UM		 487# define bn_print(a) {fprintf(stderr, #a "="); BN_print_fp(stderr,a); \
488 fprintf(stderr,"\n");}
489# define bn_dump(a,n) bn_dump1(stderr,#a,a,n);
490#else
491# define bn_print(a)
492# define bn_dump(a,b)
493#endif
dfeab068 494
d02b48c6 495/* BEGIN ERROR CODES */
6d311938
DSH		 496/* The following lines are auto generated by the script mkerr.pl. Any changes
497 * made after this point may be overwritten when the script is next run.
498 */
499
d02b48c6
RE		 500/* Error codes for the BN functions. */
501
502/* Function codes. */
58964a49
RE		 503#define BN_F_BN_BLINDING_CONVERT 100
504#define BN_F_BN_BLINDING_INVERT 101
505#define BN_F_BN_BLINDING_NEW 102
506#define BN_F_BN_BLINDING_UPDATE 103
a0a54079
MC		 507#define BN_F_BN_BN2DEC 104
508#define BN_F_BN_BN2HEX 105
9b141126 509#define BN_F_BN_CTX_GET 116
a0a54079
MC		 510#define BN_F_BN_CTX_NEW 106
511#define BN_F_BN_DIV 107
512#define BN_F_BN_EXPAND2 108
dc434bbc 513#define BN_F_BN_MOD_EXP2_MONT 118
a0a54079 514#define BN_F_BN_MOD_EXP_MONT 109
6dad7bd6 515#define BN_F_BN_MOD_EXP_MONT_WORD 117
a0a54079 516#define BN_F_BN_MOD_INVERSE 110
5acaa495 517#define BN_F_BN_MOD_LSHIFT_QUICK 119
a0a54079
MC		 518#define BN_F_BN_MOD_MUL_RECIPROCAL 111
519#define BN_F_BN_MPI2BN 112
520#define BN_F_BN_NEW 113
521#define BN_F_BN_RAND 114
522#define BN_F_BN_USUB 115
d02b48c6
RE		 523
524/* Reason codes. */
dfeab068
RE		 525#define BN_R_ARG2_LT_ARG3 100
526#define BN_R_BAD_RECIPROCAL 101
527#define BN_R_CALLED_WITH_EVEN_MODULUS 102
528#define BN_R_DIV_BY_ZERO 103
529#define BN_R_ENCODING_ERROR 104
530#define BN_R_EXPAND_ON_STATIC_BIGNUM_DATA 105
5acaa495 531#define BN_R_INPUT_NOT_REDUCED 110
dfeab068 532#define BN_R_INVALID_LENGTH 106
df82f5c8 533#define BN_R_NOT_INITIALIZED 107
dfeab068 534#define BN_R_NO_INVERSE 108
9b141126 535#define BN_R_TOO_MANY_TEMPORARY_VARIABLES 109
6d311938 536
d02b48c6
RE		 537#ifdef __cplusplus
538}
539#endif
540#endif
5acaa495 541
A mirror of the official openssl repository