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