1 |
|
---|
2 | /* crypto/bn/bn.h */
|
---|
3 |
|
---|
4 | /* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com)
|
---|
5 | * All rights reserved.
|
---|
6 | *
|
---|
7 | * This package is an SSL implementation written
|
---|
8 | * by Eric Young (eay@cryptsoft.com).
|
---|
9 | * The implementation was written so as to conform with Netscapes SSL.
|
---|
10 | *
|
---|
11 | * This library is free for commercial and non-commercial use as long as
|
---|
12 | * the following conditions are aheared to. The following conditions
|
---|
13 | * apply to all code found in this distribution, be it the RC4, RSA,
|
---|
14 | * lhash, DES, etc., code; not just the SSL code. The SSL documentation
|
---|
15 | * included with this distribution is covered by the same copyright terms
|
---|
16 | * except that the holder is Tim Hudson (tjh@cryptsoft.com).
|
---|
17 | *
|
---|
18 | * Copyright remains Eric Young's, and as such any Copyright notices in
|
---|
19 | * the code are not to be removed.
|
---|
20 | * If this package is used in a product, Eric Young should be given attribution
|
---|
21 | * as the author of the parts of the library used.
|
---|
22 | * This can be in the form of a textual message at program startup or
|
---|
23 | * in documentation (online or textual) provided with the package.
|
---|
24 | *
|
---|
25 | * Redistribution and use in source and binary forms, with or without
|
---|
26 | * modification, are permitted provided that the following conditions
|
---|
27 | * are met:
|
---|
28 | * 1. Redistributions of source code must retain the copyright
|
---|
29 | * notice, this list of conditions and the following disclaimer.
|
---|
30 | * 2. Redistributions in binary form must reproduce the above copyright
|
---|
31 | * notice, this list of conditions and the following disclaimer in the
|
---|
32 | * documentation and/or other materials provided with the distribution.
|
---|
33 | * 3. All advertising materials mentioning features or use of this software
|
---|
34 | * must display the following acknowledgement:
|
---|
35 | * "This product includes cryptographic software written by
|
---|
36 | * Eric Young (eay@cryptsoft.com)"
|
---|
37 | * The word 'cryptographic' can be left out if the rouines from the library
|
---|
38 | * being used are not cryptographic related :-).
|
---|
39 | * 4. If you include any Windows specific code (or a derivative thereof) from
|
---|
40 | * the apps directory (application code) you must include an acknowledgement:
|
---|
41 | * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
|
---|
42 | *
|
---|
43 | * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
|
---|
44 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
---|
45 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
---|
46 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
---|
47 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
---|
48 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
---|
49 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
---|
50 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
---|
51 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
---|
52 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
---|
53 | * SUCH DAMAGE.
|
---|
54 | *
|
---|
55 | * The licence and distribution terms for any publically available version or
|
---|
56 | * derivative of this code cannot be changed. i.e. this code cannot simply be
|
---|
57 | * copied and put under another distribution licence
|
---|
58 | * [including the GNU Public Licence.]
|
---|
59 | */
|
---|
60 |
|
---|
61 | #define I386_ONLY
|
---|
62 | #define THIRTY_TWO_BIT
|
---|
63 |
|
---|
64 |
|
---|
65 | #ifndef HEADER_BN_H
|
---|
66 | # define HEADER_BN_H
|
---|
67 |
|
---|
68 | # ifndef NO_FP_API
|
---|
69 | # include <stdio.h> /* FILE */
|
---|
70 | # endif
|
---|
71 |
|
---|
72 | # ifdef __cplusplus
|
---|
73 | extern "C" {
|
---|
74 | # endif
|
---|
75 |
|
---|
76 | # ifdef VMS
|
---|
77 | # undef BN_LLONG /* experimental, so far... */
|
---|
78 | # endif
|
---|
79 |
|
---|
80 | # define BN_MUL_COMBA
|
---|
81 | # define BN_SQR_COMBA
|
---|
82 | # define BN_RECURSION
|
---|
83 | # define RECP_MUL_MOD
|
---|
84 | # define MONT_MUL_MOD
|
---|
85 |
|
---|
86 | /* This next option uses the C libraries (2 word)/(1 word) function.
|
---|
87 | * If it is not defined, I use my C version (which is slower).
|
---|
88 | * The reason for this flag is that when the particular C compiler
|
---|
89 | * library routine is used, and the library is linked with a different
|
---|
90 | * compiler, the library is missing. This mostly happens when the
|
---|
91 | * library is built with gcc and then linked using normal cc. This would
|
---|
92 | * be a common occurrence because gcc normally produces code that is
|
---|
93 | * 2 times faster than system compilers for the big number stuff.
|
---|
94 | * For machines with only one compiler (or shared libraries), this should
|
---|
95 | * be on. Again this in only really a problem on machines
|
---|
96 | * using "long long's", are 32bit, and are not using my assembler code. */
|
---|
97 | # if defined(MSDOS) || defined(WINDOWS) || defined(WIN32) || defined(linux)
|
---|
98 | # ifndef BN_DIV2W
|
---|
99 | # define BN_DIV2W
|
---|
100 | # endif
|
---|
101 | # endif
|
---|
102 |
|
---|
103 | /* assuming long is 64bit - this is the DEC Alpha
|
---|
104 | * unsigned long long is only 64 bits :-(, don't define
|
---|
105 | * BN_LLONG for the DEC Alpha */
|
---|
106 | # ifdef SIXTY_FOUR_BIT_LONG
|
---|
107 | # define BN_ULLONG unsigned long long
|
---|
108 | # define BN_ULONG unsigned long
|
---|
109 | # define BN_LONG long
|
---|
110 | # define BN_BITS 128
|
---|
111 | # define BN_BYTES 8
|
---|
112 | # define BN_BITS2 64
|
---|
113 | # define BN_BITS4 32
|
---|
114 | # define BN_MASK (0xffffffffffffffffffffffffffffffffLL)
|
---|
115 | # define BN_MASK2 (0xffffffffffffffffL)
|
---|
116 | # define BN_MASK2l (0xffffffffL)
|
---|
117 | # define BN_MASK2h (0xffffffff00000000L)
|
---|
118 | # define BN_MASK2h1 (0xffffffff80000000L)
|
---|
119 | # define BN_TBIT (0x8000000000000000L)
|
---|
120 | # define BN_DEC_CONV (10000000000000000000UL)
|
---|
121 | # define BN_DEC_FMT1 "%lu"
|
---|
122 | # define BN_DEC_FMT2 "%019lu"
|
---|
123 | # define BN_DEC_NUM 19
|
---|
124 | # endif
|
---|
125 |
|
---|
126 | /* This is where the long long data type is 64 bits, but long is 32.
|
---|
127 | * For machines where there are 64bit registers, this is the mode to use.
|
---|
128 | * IRIX, on R4000 and above should use this mode, along with the relevant
|
---|
129 | * assembler code :-). Do NOT define BN_LLONG.
|
---|
130 | */
|
---|
131 | # ifdef SIXTY_FOUR_BIT
|
---|
132 | # undef BN_LLONG
|
---|
133 | # undef BN_ULLONG
|
---|
134 | # define BN_ULONG unsigned long long
|
---|
135 | # define BN_LONG long long
|
---|
136 | # define BN_BITS 128
|
---|
137 | # define BN_BYTES 8
|
---|
138 | # define BN_BITS2 64
|
---|
139 | # define BN_BITS4 32
|
---|
140 | # define BN_MASK2 (0xffffffffffffffffLL)
|
---|
141 | # define BN_MASK2l (0xffffffffL)
|
---|
142 | # define BN_MASK2h (0xffffffff00000000LL)
|
---|
143 | # define BN_MASK2h1 (0xffffffff80000000LL)
|
---|
144 | # define BN_TBIT (0x8000000000000000LL)
|
---|
145 | # define BN_DEC_CONV (10000000000000000000LL)
|
---|
146 | # define BN_DEC_FMT1 "%llu"
|
---|
147 | # define BN_DEC_FMT2 "%019llu"
|
---|
148 | # define BN_DEC_NUM 19
|
---|
149 | # endif
|
---|
150 |
|
---|
151 | # ifdef THIRTY_TWO_BIT
|
---|
152 | # if defined(WIN32) && !defined(__GNUC__)
|
---|
153 | # define BN_ULLONG unsigned _int64
|
---|
154 | # else
|
---|
155 | # define BN_ULLONG unsigned long long
|
---|
156 | # endif
|
---|
157 | # define BN_ULONG unsigned long
|
---|
158 | # define BN_LONG long
|
---|
159 | # define BN_BITS 64
|
---|
160 | # define BN_BYTES 4
|
---|
161 | # define BN_BITS2 32
|
---|
162 | # define BN_BITS4 16
|
---|
163 | # ifdef WIN32
|
---|
164 |
|
---|
165 | /* VC++ doesn't like the LL suffix */
|
---|
166 | # define BN_MASK (0xffffffffffffffffL)
|
---|
167 | # else
|
---|
168 | # define BN_MASK (0xffffffffffffffffLL)
|
---|
169 | # endif
|
---|
170 | # define BN_MASK2 (0xffffffffL)
|
---|
171 | # define BN_MASK2l (0xffff)
|
---|
172 | # define BN_MASK2h1 (0xffff8000L)
|
---|
173 | # define BN_MASK2h (0xffff0000L)
|
---|
174 | # define BN_TBIT (0x80000000L)
|
---|
175 | # define BN_DEC_CONV (1000000000L)
|
---|
176 | # define BN_DEC_FMT1 "%lu"
|
---|
177 | # define BN_DEC_FMT2 "%09lu"
|
---|
178 | # define BN_DEC_NUM 9
|
---|
179 | # endif
|
---|
180 |
|
---|
181 | # ifdef SIXTEEN_BIT
|
---|
182 | # ifndef BN_DIV2W
|
---|
183 | # define BN_DIV2W
|
---|
184 | # endif
|
---|
185 | # define BN_ULLONG unsigned long
|
---|
186 | # define BN_ULONG unsigned short
|
---|
187 | # define BN_LONG short
|
---|
188 | # define BN_BITS 32
|
---|
189 | # define BN_BYTES 2
|
---|
190 | # define BN_BITS2 16
|
---|
191 | # define BN_BITS4 8
|
---|
192 | # define BN_MASK (0xffffffff)
|
---|
193 | # define BN_MASK2 (0xffff)
|
---|
194 | # define BN_MASK2l (0xff)
|
---|
195 | # define BN_MASK2h1 (0xff80)
|
---|
196 | # define BN_MASK2h (0xff00)
|
---|
197 | # define BN_TBIT (0x8000)
|
---|
198 | # define BN_DEC_CONV (100000)
|
---|
199 | # define BN_DEC_FMT1 "%u"
|
---|
200 | # define BN_DEC_FMT2 "%05u"
|
---|
201 | # define BN_DEC_NUM 5
|
---|
202 | # endif
|
---|
203 |
|
---|
204 | # ifdef EIGHT_BIT
|
---|
205 | # ifndef BN_DIV2W
|
---|
206 | # define BN_DIV2W
|
---|
207 | # endif
|
---|
208 | # define BN_ULLONG unsigned short
|
---|
209 | # define BN_ULONG unsigned char
|
---|
210 | # define BN_LONG char
|
---|
211 | # define BN_BITS 16
|
---|
212 | # define BN_BYTES 1
|
---|
213 | # define BN_BITS2 8
|
---|
214 | # define BN_BITS4 4
|
---|
215 | # define BN_MASK (0xffff)
|
---|
216 | # define BN_MASK2 (0xff)
|
---|
217 | # define BN_MASK2l (0xf)
|
---|
218 | # define BN_MASK2h1 (0xf8)
|
---|
219 | # define BN_MASK2h (0xf0)
|
---|
220 | # define BN_TBIT (0x80)
|
---|
221 | # define BN_DEC_CONV (100)
|
---|
222 | # define BN_DEC_FMT1 "%u"
|
---|
223 | # define BN_DEC_FMT2 "%02u"
|
---|
224 | # define BN_DEC_NUM 2
|
---|
225 | # endif
|
---|
226 |
|
---|
227 | # define BN_DEFAULT_BITS 1280
|
---|
228 |
|
---|
229 | # ifdef BIGNUM
|
---|
230 | # undef BIGNUM
|
---|
231 | # endif
|
---|
232 |
|
---|
233 | # define BN_FLG_MALLOCED 0x01
|
---|
234 | # define BN_FLG_STATIC_DATA 0x02
|
---|
235 | # define BN_FLG_FREE 0x8000 /* used for debuging */
|
---|
236 | # define BN_set_flags(b,n) ((b)->flags|=(n))
|
---|
237 | # define BN_get_flags(b,n) ((b)->flags&(n))
|
---|
238 |
|
---|
239 | typedef struct bignum_st {
|
---|
240 | BN_ULONG *d; /* Pointer to an array of 'BN_BITS2' bit chunks. */
|
---|
241 | int top; /* Index of last used d +1. */
|
---|
242 | /* The next are internal book keeping for bn_expand. */
|
---|
243 | int dmax; /* Size of the d array. */
|
---|
244 | int neg; /* one if the number is negative */
|
---|
245 | int flags;
|
---|
246 | } BIGNUM;
|
---|
247 |
|
---|
248 | /* Used for temp variables */
|
---|
249 | # define BN_CTX_NUM 16
|
---|
250 | # define BN_CTX_NUM_POS 12
|
---|
251 | typedef struct bignum_ctx {
|
---|
252 | int tos;
|
---|
253 | BIGNUM bn[BN_CTX_NUM];
|
---|
254 | int flags;
|
---|
255 | int depth;
|
---|
256 | int pos[BN_CTX_NUM_POS];
|
---|
257 | int too_many;
|
---|
258 | } BN_CTX;
|
---|
259 |
|
---|
260 | typedef struct bn_blinding_st {
|
---|
261 | int init;
|
---|
262 | BIGNUM *A;
|
---|
263 | BIGNUM *Ai;
|
---|
264 | BIGNUM *mod; /* just a reference */
|
---|
265 | } BN_BLINDING;
|
---|
266 |
|
---|
267 | /* Used for montgomery multiplication */
|
---|
268 | typedef struct bn_mont_ctx_st {
|
---|
269 | int ri; /* number of bits in R */
|
---|
270 | BIGNUM RR; /* used to convert to montgomery form */
|
---|
271 | BIGNUM N; /* The modulus */
|
---|
272 | BIGNUM Ni; /* R*(1/R mod N) - N*Ni = 1
|
---|
273 | * (Ni is only stored for bignum algorithm) */
|
---|
274 | BN_ULONG n0; /* least significant word of Ni */
|
---|
275 | int flags;
|
---|
276 | } BN_MONT_CTX;
|
---|
277 |
|
---|
278 | /* Used for reciprocal division/mod functions
|
---|
279 | * It cannot be shared between threads
|
---|
280 | */
|
---|
281 | typedef struct bn_recp_ctx_st {
|
---|
282 | BIGNUM N; /* the divisor */
|
---|
283 | BIGNUM Nr; /* the reciprocal */
|
---|
284 | int num_bits;
|
---|
285 | int shift;
|
---|
286 | int flags;
|
---|
287 | } BN_RECP_CTX;
|
---|
288 |
|
---|
289 | # define BN_to_montgomery(r,a,mont,ctx) BN_mod_mul_montgomery(\
|
---|
290 | r,a,&((mont)->RR),(mont),ctx)
|
---|
291 |
|
---|
292 | # define BN_prime_checks 0 /* default: select number of iterations
|
---|
293 | based on the size of the number */
|
---|
294 |
|
---|
295 | /* number of Miller-Rabin iterations for an error rate of less than 2^-80
|
---|
296 | * for random 'b'-bit input, b >= 100 (taken from table 4.4 in the Handbook
|
---|
297 | * of Applied Cryptography [Menezes, van Oorschot, Vanstone; CRC Press 1996];
|
---|
298 | * original paper: Damgaard, Landrock, Pomerance: Average case error estimates
|
---|
299 | * for the strong probable prime test. -- Math. Comp. 61 (1993) 177-194) */
|
---|
300 | # define BN_prime_checks_for_size(b) ((b) >= 1300 ? 2 : \
|
---|
301 | (b) >= 850 ? 3 : \
|
---|
302 | (b) >= 650 ? 4 : \
|
---|
303 | (b) >= 550 ? 5 : \
|
---|
304 | (b) >= 450 ? 6 : \
|
---|
305 | (b) >= 400 ? 7 : \
|
---|
306 | (b) >= 350 ? 8 : \
|
---|
307 | (b) >= 300 ? 9 : \
|
---|
308 | (b) >= 250 ? 12 : \
|
---|
309 | (b) >= 200 ? 15 : \
|
---|
310 | (b) >= 150 ? 18 : \
|
---|
311 | /* b >= 100 */ 27)
|
---|
312 |
|
---|
313 | # define BN_num_bytes(a) ((BN_num_bits(a)+7)/8)
|
---|
314 | # define BN_is_word(a,w) (((a)->top == 1) && ((a)->d[0] == (BN_ULONG)(w)))
|
---|
315 | # define BN_is_zero(a) (((a)->top == 0) || BN_is_word(a,0))
|
---|
316 | # define BN_is_one(a) (BN_is_word((a),1))
|
---|
317 | # define BN_is_odd(a) (((a)->top > 0) && ((a)->d[0] & 1))
|
---|
318 | # define BN_one(a) (BN_set_word((a),1))
|
---|
319 | # define BN_zero(a) (BN_set_word((a),0))
|
---|
320 |
|
---|
321 | /*#define BN_ascii2bn(a) BN_hex2bn(a) */
|
---|
322 |
|
---|
323 | /*#define BN_bn2ascii(a) BN_bn2hex(a) */
|
---|
324 |
|
---|
325 | BIGNUM *BN_value_one(void);
|
---|
326 | char *BN_options(void);
|
---|
327 | BN_CTX *BN_CTX_new(void);
|
---|
328 | void BN_CTX_init(BN_CTX * c);
|
---|
329 | void BN_CTX_free(BN_CTX * c);
|
---|
330 | void BN_CTX_start(BN_CTX * ctx);
|
---|
331 | BIGNUM *BN_CTX_get(BN_CTX * ctx);
|
---|
332 | void BN_CTX_end(BN_CTX * ctx);
|
---|
333 | int BN_rand(BIGNUM * rnd, int bits, int top, int bottom);
|
---|
334 | int BN_pseudo_rand(BIGNUM * rnd, int bits, int top, int bottom);
|
---|
335 | int BN_rand_range(BIGNUM * rnd, BIGNUM * range);
|
---|
336 | int BN_pseudo_rand_range(BIGNUM * rnd, BIGNUM * range);
|
---|
337 | int BN_num_bits(const BIGNUM * a);
|
---|
338 | int BN_num_bits_word(BN_ULONG);
|
---|
339 | BIGNUM *BN_new(void);
|
---|
340 | void BN_init(BIGNUM *);
|
---|
341 | void BN_clear_free(BIGNUM * a);
|
---|
342 | BIGNUM *BN_copy(BIGNUM * a, const BIGNUM * b);
|
---|
343 | BIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM * ret);
|
---|
344 | int BN_bn2bin(const BIGNUM * a, unsigned char *to);
|
---|
345 | BIGNUM *BN_mpi2bn(unsigned char *s, int len, BIGNUM * ret);
|
---|
346 | int BN_bn2mpi(const BIGNUM * a, unsigned char *to);
|
---|
347 | int BN_sub(BIGNUM * r, const BIGNUM * a, const BIGNUM * b);
|
---|
348 | int BN_usub(BIGNUM * r, const BIGNUM * a, const BIGNUM * b);
|
---|
349 | int BN_uadd(BIGNUM * r, const BIGNUM * a, const BIGNUM * b);
|
---|
350 | int BN_add(BIGNUM * r, const BIGNUM * a, const BIGNUM * b);
|
---|
351 | int BN_mod(BIGNUM * rem, const BIGNUM * m, const BIGNUM * d, BN_CTX * ctx);
|
---|
352 | int BN_div(BIGNUM * dv, BIGNUM * rem, const BIGNUM * m, const BIGNUM * d, BN_CTX * ctx);
|
---|
353 | int BN_mul(BIGNUM * r, BIGNUM * a, BIGNUM * b, BN_CTX * ctx);
|
---|
354 | int BN_sqr(BIGNUM * r, BIGNUM * a, BN_CTX * ctx);
|
---|
355 | BN_ULONG BN_mod_word(const BIGNUM * a, BN_ULONG w);
|
---|
356 | BN_ULONG BN_div_word(BIGNUM * a, BN_ULONG w);
|
---|
357 | int BN_mul_word(BIGNUM * a, BN_ULONG w);
|
---|
358 | int BN_add_word(BIGNUM * a, BN_ULONG w);
|
---|
359 | int BN_sub_word(BIGNUM * a, BN_ULONG w);
|
---|
360 | int BN_set_word(BIGNUM * a, BN_ULONG w);
|
---|
361 | BN_ULONG BN_get_word(BIGNUM * a);
|
---|
362 | int BN_cmp(const BIGNUM * a, const BIGNUM * b);
|
---|
363 | void BN_free(BIGNUM * a);
|
---|
364 | int BN_is_bit_set(const BIGNUM * a, int n);
|
---|
365 | int BN_lshift(BIGNUM * r, const BIGNUM * a, int n);
|
---|
366 | int BN_lshift1(BIGNUM * r, BIGNUM * a);
|
---|
367 | int BN_exp(BIGNUM * r, BIGNUM * a, BIGNUM * p, BN_CTX * ctx);
|
---|
368 | int BN_mod_exp(BIGNUM * r, BIGNUM * a, const BIGNUM * p, const BIGNUM * m, BN_CTX * ctx);
|
---|
369 | int BN_mod_exp_mont(BIGNUM * r, BIGNUM * a, const BIGNUM * p, const BIGNUM * m, BN_CTX * ctx, BN_MONT_CTX * m_ctx);
|
---|
370 | int BN_mod_exp_mont_word(BIGNUM * r, BN_ULONG a, const BIGNUM * p, const BIGNUM * m, BN_CTX * ctx, BN_MONT_CTX * m_ctx);
|
---|
371 | int BN_mod_exp2_mont(BIGNUM * r, BIGNUM * a1, BIGNUM * p1, BIGNUM * a2, BIGNUM * p2, BIGNUM * m, BN_CTX * ctx, BN_MONT_CTX * m_ctx);
|
---|
372 | int BN_mod_exp_simple(BIGNUM * r, BIGNUM * a, const BIGNUM * p, const BIGNUM * m, BN_CTX * ctx);
|
---|
373 | int BN_mask_bits(BIGNUM * a, int n);
|
---|
374 | int BN_mod_mul(BIGNUM * ret, BIGNUM * a, BIGNUM * b, const BIGNUM * m, BN_CTX * ctx);
|
---|
375 | # ifndef NO_FP_API
|
---|
376 | int BN_print_fp(FILE * fp, const BIGNUM * a);
|
---|
377 | # endif
|
---|
378 | # ifdef HEADER_BIO_H
|
---|
379 | int BN_print(BIO * fp, const BIGNUM * a);
|
---|
380 | # else
|
---|
381 | int BN_print(void *fp, const BIGNUM * a);
|
---|
382 | # endif
|
---|
383 | int BN_reciprocal(BIGNUM * r, BIGNUM * m, int len, BN_CTX * ctx);
|
---|
384 | int BN_rshift(BIGNUM * r, BIGNUM * a, int n);
|
---|
385 | int BN_rshift1(BIGNUM * r, BIGNUM * a);
|
---|
386 | void BN_clear(BIGNUM * a);
|
---|
387 | BIGNUM *BN_dup(const BIGNUM * a);
|
---|
388 | int BN_ucmp(const BIGNUM * a, const BIGNUM * b);
|
---|
389 | int BN_set_bit(BIGNUM * a, int n);
|
---|
390 | int BN_clear_bit(BIGNUM * a, int n);
|
---|
391 | char *BN_bn2hex(const BIGNUM * a);
|
---|
392 | char *BN_bn2dec(const BIGNUM * a);
|
---|
393 | int BN_hex2bn(BIGNUM ** a, const char *str);
|
---|
394 | int BN_dec2bn(BIGNUM ** a, const char *str);
|
---|
395 | int BN_gcd(BIGNUM * r, BIGNUM * in_a, BIGNUM * in_b, BN_CTX * ctx);
|
---|
396 | BIGNUM *BN_mod_inverse(BIGNUM * ret, BIGNUM * a, const BIGNUM * n, BN_CTX * ctx);
|
---|
397 | BIGNUM *BN_generate_prime(BIGNUM * ret, int bits, int safe, BIGNUM * add, BIGNUM * rem, void (*callback) (int, int, void *), void *cb_arg);
|
---|
398 | int BN_is_prime(const BIGNUM * p, int nchecks, void (*callback) (int, int, void *), BN_CTX * ctx, void *cb_arg);
|
---|
399 | int BN_is_prime_fasttest(const BIGNUM * p, int nchecks, void (*callback) (int, int, void *), BN_CTX * ctx, void *cb_arg, int do_trial_division);
|
---|
400 |
|
---|
401 | BN_MONT_CTX *BN_MONT_CTX_new(void);
|
---|
402 | void BN_MONT_CTX_init(BN_MONT_CTX * ctx);
|
---|
403 | int BN_mod_mul_montgomery(BIGNUM * r, BIGNUM * a, BIGNUM * b, BN_MONT_CTX * mont, BN_CTX * ctx);
|
---|
404 | int BN_from_montgomery(BIGNUM * r, BIGNUM * a, BN_MONT_CTX * mont, BN_CTX * ctx);
|
---|
405 | void BN_MONT_CTX_free(BN_MONT_CTX * mont);
|
---|
406 | int BN_MONT_CTX_set(BN_MONT_CTX * mont, const BIGNUM * modulus, BN_CTX * ctx);
|
---|
407 | BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX * to, BN_MONT_CTX * from);
|
---|
408 |
|
---|
409 | BN_BLINDING *BN_BLINDING_new(BIGNUM * A, BIGNUM * Ai, BIGNUM * mod);
|
---|
410 | void BN_BLINDING_free(BN_BLINDING * b);
|
---|
411 | int BN_BLINDING_update(BN_BLINDING * b, BN_CTX * ctx);
|
---|
412 | int BN_BLINDING_convert(BIGNUM * n, BN_BLINDING * r, BN_CTX * ctx);
|
---|
413 | int BN_BLINDING_invert(BIGNUM * n, BN_BLINDING * b, BN_CTX * ctx);
|
---|
414 |
|
---|
415 | void BN_set_params(int mul, int high, int low, int mont);
|
---|
416 | int BN_get_params(int which); /* 0, mul, 1 high, 2 low, 3 mont */
|
---|
417 |
|
---|
418 | void BN_RECP_CTX_init(BN_RECP_CTX * recp);
|
---|
419 | BN_RECP_CTX *BN_RECP_CTX_new(void);
|
---|
420 | void BN_RECP_CTX_free(BN_RECP_CTX * recp);
|
---|
421 | int BN_RECP_CTX_set(BN_RECP_CTX * recp, const BIGNUM * rdiv, BN_CTX * ctx);
|
---|
422 | int BN_mod_mul_reciprocal(BIGNUM * r, BIGNUM * x, BIGNUM * y, BN_RECP_CTX * recp, BN_CTX * ctx);
|
---|
423 | int BN_mod_exp_recp(BIGNUM * r, const BIGNUM * a, const BIGNUM * p, const BIGNUM * m, BN_CTX * ctx);
|
---|
424 | int BN_div_recp(BIGNUM * dv, BIGNUM * rem, BIGNUM * m, BN_RECP_CTX * recp, BN_CTX * ctx);
|
---|
425 |
|
---|
426 | /* library internal functions */
|
---|
427 |
|
---|
428 | # define bn_expand(a,bits) ((((((bits+BN_BITS2-1))/BN_BITS2)) <= (a)->dmax)?\
|
---|
429 | (a):bn_expand2((a),(bits)/BN_BITS2+1))
|
---|
430 | # define bn_wexpand(a,words) (((words) <= (a)->dmax)?(a):bn_expand2((a),(words)))
|
---|
431 | BIGNUM *bn_expand2(BIGNUM * a, int words);
|
---|
432 |
|
---|
433 | # define bn_fix_top(a) \
|
---|
434 | { \
|
---|
435 | BN_ULONG *ftl; \
|
---|
436 | if ((a)->top > 0) \
|
---|
437 | { \
|
---|
438 | for (ftl= &((a)->d[(a)->top-1]); (a)->top > 0; (a)->top--) \
|
---|
439 | if (*(ftl--)) break; \
|
---|
440 | } \
|
---|
441 | }
|
---|
442 |
|
---|
443 | BN_ULONG bn_mul_add_words(BN_ULONG * rp, BN_ULONG * ap, int num, BN_ULONG w);
|
---|
444 | BN_ULONG bn_mul_words(BN_ULONG * rp, BN_ULONG * ap, int num, BN_ULONG w);
|
---|
445 | void bn_sqr_words(BN_ULONG * rp, BN_ULONG * ap, int num);
|
---|
446 | BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d);
|
---|
447 | BN_ULONG bn_add_words(BN_ULONG * rp, BN_ULONG * ap, BN_ULONG * bp, int num);
|
---|
448 | BN_ULONG bn_sub_words(BN_ULONG * rp, BN_ULONG * ap, BN_ULONG * bp, int num);
|
---|
449 |
|
---|
450 | # ifdef BN_DEBUG
|
---|
451 | void bn_dump1(FILE * o, const char *a, BN_ULONG * b, int n);
|
---|
452 | # define bn_print(a) {fprintf(stderr, #a "="); BN_print_fp(stderr,a); \
|
---|
453 | fprintf(stderr,"\n");}
|
---|
454 | # define bn_dump(a,n) bn_dump1(stderr,#a,a,n);
|
---|
455 | # else
|
---|
456 | # define bn_print(a)
|
---|
457 | # define bn_dump(a,b)
|
---|
458 | # endif
|
---|
459 |
|
---|
460 | int BN_bntest_rand(BIGNUM * rnd, int bits, int top, int bottom);
|
---|
461 |
|
---|
462 | /* BEGIN ERROR CODES */
|
---|
463 |
|
---|
464 | /* The following lines are auto generated by the script mkerr.pl. Any changes
|
---|
465 | * made after this point may be overwritten when the script is next run.
|
---|
466 | */
|
---|
467 | void ERR_load_BN_strings(void);
|
---|
468 |
|
---|
469 | /* Error codes for the BN functions. */
|
---|
470 |
|
---|
471 | /* Function codes. */
|
---|
472 | # define BN_F_BN_BLINDING_CONVERT 100
|
---|
473 | # define BN_F_BN_BLINDING_INVERT 101
|
---|
474 | # define BN_F_BN_BLINDING_NEW 102
|
---|
475 | # define BN_F_BN_BLINDING_UPDATE 103
|
---|
476 | # define BN_F_BN_BN2DEC 104
|
---|
477 | # define BN_F_BN_BN2HEX 105
|
---|
478 | # define BN_F_BN_CTX_GET 116
|
---|
479 | # define BN_F_BN_CTX_NEW 106
|
---|
480 | # define BN_F_BN_DIV 107
|
---|
481 | # define BN_F_BN_EXPAND2 108
|
---|
482 | # define BN_F_BN_MOD_EXP2_MONT 118
|
---|
483 | # define BN_F_BN_MOD_EXP_MONT 109
|
---|
484 | # define BN_F_BN_MOD_EXP_MONT_WORD 117
|
---|
485 | # define BN_F_BN_MOD_INVERSE 110
|
---|
486 | # define BN_F_BN_MOD_MUL_RECIPROCAL 111
|
---|
487 | # define BN_F_BN_MPI2BN 112
|
---|
488 | # define BN_F_BN_NEW 113
|
---|
489 | # define BN_F_BN_RAND 114
|
---|
490 | # define BN_F_BN_RAND_RANGE 122
|
---|
491 | # define BN_F_BN_USUB 115
|
---|
492 |
|
---|
493 | /* Reason codes. */
|
---|
494 | # define BN_R_ARG2_LT_ARG3 100
|
---|
495 | # define BN_R_BAD_RECIPROCAL 101
|
---|
496 | # define BN_R_BIGNUM_TOO_LONG 114
|
---|
497 | # define BN_R_CALLED_WITH_EVEN_MODULUS 102
|
---|
498 | # define BN_R_DIV_BY_ZERO 103
|
---|
499 | # define BN_R_ENCODING_ERROR 104
|
---|
500 | # define BN_R_EXPAND_ON_STATIC_BIGNUM_DATA 105
|
---|
501 | # define BN_R_INVALID_LENGTH 106
|
---|
502 | # define BN_R_INVALID_RANGE 115
|
---|
503 | # define BN_R_NOT_INITIALIZED 107
|
---|
504 | # define BN_R_NO_INVERSE 108
|
---|
505 | # define BN_R_TOO_MANY_TEMPORARY_VARIABLES 109
|
---|
506 |
|
---|
507 | # ifdef __cplusplus
|
---|
508 | }
|
---|
509 | # endif
|
---|
510 | #endif
|
---|