]>
git.ipfire.org Git - thirdparty/openssl.git/blob - crypto/bn/bn.h
218907b8cd0782c0edf23ed14cde1bde47cb3759
2 /* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com)
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.
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).
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.
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
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)"
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
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.]
62 #ifndef OPENSSL_NO_FP_API
63 #include <stdio.h> /* FILE */
65 #include <openssl/opensslconf.h>
71 #ifdef OPENSSL_SYS_VMS
72 #undef BN_LLONG /* experimental, so far... */
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
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
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
89 * using "long long's", are 32bit, and are not using my assembler code. */
90 #if defined(OPENSSL_SYS_MSDOS) || defined(OPENSSL_SYS_WINDOWS) || \
91 defined(OPENSSL_SYS_WIN32) || defined(linux)
96 /* assuming long is 64bit - this is the DEC Alpha
97 * unsigned long long is only 64 bits :-(, don't define
98 * BN_LLONG for the DEC Alpha */
99 #ifdef SIXTY_FOUR_BIT_LONG
100 #define BN_ULLONG unsigned long long
101 #define BN_ULONG unsigned long
107 #define BN_MASK (0xffffffffffffffffffffffffffffffffLL)
108 #define BN_MASK2 (0xffffffffffffffffL)
109 #define BN_MASK2l (0xffffffffL)
110 #define BN_MASK2h (0xffffffff00000000L)
111 #define BN_MASK2h1 (0xffffffff80000000L)
112 #define BN_TBIT (0x8000000000000000L)
113 #define BN_DEC_CONV (10000000000000000000UL)
114 #define BN_DEC_FMT1 "%lu"
115 #define BN_DEC_FMT2 "%019lu"
116 #define BN_DEC_NUM 19
119 /* This is where the long long data type is 64 bits, but long is 32.
120 * For machines where there are 64bit registers, this is the mode to use.
121 * IRIX, on R4000 and above should use this mode, along with the relevant
122 * assembler code :-). Do NOT define BN_LLONG.
124 #ifdef SIXTY_FOUR_BIT
127 #define BN_ULONG unsigned long long
128 #define BN_LONG long long
133 #define BN_MASK2 (0xffffffffffffffffLL)
134 #define BN_MASK2l (0xffffffffL)
135 #define BN_MASK2h (0xffffffff00000000LL)
136 #define BN_MASK2h1 (0xffffffff80000000LL)
137 #define BN_TBIT (0x8000000000000000LL)
138 #define BN_DEC_CONV (10000000000000000000LL)
139 #define BN_DEC_FMT1 "%llu"
140 #define BN_DEC_FMT2 "%019llu"
141 #define BN_DEC_NUM 19
144 #ifdef THIRTY_TWO_BIT
145 #if defined(OPENSSL_SYS_WIN32) && !defined(__GNUC__)
146 #define BN_ULLONG unsigned _int64
148 #define BN_ULLONG unsigned long long
150 #define BN_ULONG unsigned long
156 #ifdef OPENSSL_SYS_WIN32
157 /* VC++ doesn't like the LL suffix */
158 #define BN_MASK (0xffffffffffffffffL)
160 #define BN_MASK (0xffffffffffffffffLL)
162 #define BN_MASK2 (0xffffffffL)
163 #define BN_MASK2l (0xffff)
164 #define BN_MASK2h1 (0xffff8000L)
165 #define BN_MASK2h (0xffff0000L)
166 #define BN_TBIT (0x80000000L)
167 #define BN_DEC_CONV (1000000000L)
168 #define BN_DEC_FMT1 "%lu"
169 #define BN_DEC_FMT2 "%09lu"
177 #define BN_ULLONG unsigned long
178 #define BN_ULONG unsigned short
179 #define BN_LONG short
184 #define BN_MASK (0xffffffff)
185 #define BN_MASK2 (0xffff)
186 #define BN_MASK2l (0xff)
187 #define BN_MASK2h1 (0xff80)
188 #define BN_MASK2h (0xff00)
189 #define BN_TBIT (0x8000)
190 #define BN_DEC_CONV (100000)
191 #define BN_DEC_FMT1 "%u"
192 #define BN_DEC_FMT2 "%05u"
200 #define BN_ULLONG unsigned short
201 #define BN_ULONG unsigned char
207 #define BN_MASK (0xffff)
208 #define BN_MASK2 (0xff)
209 #define BN_MASK2l (0xf)
210 #define BN_MASK2h1 (0xf8)
211 #define BN_MASK2h (0xf0)
212 #define BN_TBIT (0x80)
213 #define BN_DEC_CONV (100)
214 #define BN_DEC_FMT1 "%u"
215 #define BN_DEC_FMT2 "%02u"
219 #define BN_DEFAULT_BITS 1280
225 #define BN_FLG_MALLOCED 0x01
226 #define BN_FLG_STATIC_DATA 0x02
227 #define BN_FLG_FREE 0x8000 /* used for debuging */
228 #define BN_set_flags(b,n) ((b)->flags|=(n))
229 #define BN_get_flags(b,n) ((b)->flags&(n))
231 typedef struct bignum_st
233 BN_ULONG
*d
; /* Pointer to an array of 'BN_BITS2' bit chunks. */
234 int top
; /* Index of last used d +1. */
235 /* The next are internal book keeping for bn_expand. */
236 int dmax
; /* Size of the d array. */
237 int neg
; /* one if the number is negative */
241 /* Used for temp variables */
242 #define BN_CTX_NUM 20
243 #define BN_CTX_NUM_POS 12
244 typedef struct bignum_ctx
247 BIGNUM bn
[BN_CTX_NUM
];
250 int pos
[BN_CTX_NUM_POS
];
254 typedef struct bn_blinding_st
259 BIGNUM
*mod
; /* just a reference */
262 /* Used for montgomery multiplication */
263 typedef struct bn_mont_ctx_st
265 int ri
; /* number of bits in R */
266 BIGNUM RR
; /* used to convert to montgomery form */
267 BIGNUM N
; /* The modulus */
268 BIGNUM Ni
; /* R*(1/R mod N) - N*Ni = 1
269 * (Ni is only stored for bignum algorithm) */
270 BN_ULONG n0
; /* least significant word of Ni */
274 /* Used for reciprocal division/mod functions
275 * It cannot be shared between threads
277 typedef struct bn_recp_ctx_st
279 BIGNUM N
; /* the divisor */
280 BIGNUM Nr
; /* the reciprocal */
286 #define BN_prime_checks 0 /* default: select number of iterations
287 based on the size of the number */
289 /* number of Miller-Rabin iterations for an error rate of less than 2^-80
290 * for random 'b'-bit input, b >= 100 (taken from table 4.4 in the Handbook
291 * of Applied Cryptography [Menezes, van Oorschot, Vanstone; CRC Press 1996];
292 * original paper: Damgaard, Landrock, Pomerance: Average case error estimates
293 * for the strong probable prime test. -- Math. Comp. 61 (1993) 177-194) */
294 #define BN_prime_checks_for_size(b) ((b) >= 1300 ? 2 : \
307 #define BN_num_bytes(a) ((BN_num_bits(a)+7)/8)
309 /* Note that BN_abs_is_word does not work reliably for w == 0 */
310 #define BN_abs_is_word(a,w) (((a)->top == 1) && ((a)->d[0] == (BN_ULONG)(w)))
311 #define BN_is_zero(a) (((a)->top == 0) || BN_abs_is_word(a,0))
312 #define BN_is_one(a) (BN_abs_is_word((a),1) && !(a)->neg)
313 #define BN_is_word(a,w) ((w) ? BN_abs_is_word((a),(w)) && !(a)->neg : \
315 #define BN_is_odd(a) (((a)->top > 0) && ((a)->d[0] & 1))
317 #define BN_one(a) (BN_set_word((a),1))
318 #define BN_zero(a) (BN_set_word((a),0))
320 /*#define BN_ascii2bn(a) BN_hex2bn(a) */
321 /*#define BN_bn2ascii(a) BN_bn2hex(a) */
323 BIGNUM
*BN_value_one(void);
324 char * BN_options(void);
325 BN_CTX
*BN_CTX_new(void);
326 void BN_CTX_init(BN_CTX
*c
);
327 void BN_CTX_free(BN_CTX
*c
);
328 void BN_CTX_start(BN_CTX
*ctx
);
329 BIGNUM
*BN_CTX_get(BN_CTX
*ctx
);
330 void BN_CTX_end(BN_CTX
*ctx
);
331 int BN_rand(BIGNUM
*rnd
, int bits
, int top
,int bottom
);
332 int BN_pseudo_rand(BIGNUM
*rnd
, int bits
, int top
,int bottom
);
333 int BN_rand_range(BIGNUM
*rnd
, BIGNUM
*range
);
334 int BN_num_bits(const BIGNUM
*a
);
335 int BN_num_bits_word(BN_ULONG
);
336 BIGNUM
*BN_new(void);
337 void BN_init(BIGNUM
*);
338 void BN_clear_free(BIGNUM
*a
);
339 BIGNUM
*BN_copy(BIGNUM
*a
, const BIGNUM
*b
);
340 void BN_swap(BIGNUM
*a
, BIGNUM
*b
);
341 BIGNUM
*BN_bin2bn(const unsigned char *s
,int len
,BIGNUM
*ret
);
342 int BN_bn2bin(const BIGNUM
*a
, unsigned char *to
);
343 BIGNUM
*BN_mpi2bn(const unsigned char *s
,int len
,BIGNUM
*ret
);
344 int BN_bn2mpi(const BIGNUM
*a
, unsigned char *to
);
345 int BN_sub(BIGNUM
*r
, const BIGNUM
*a
, const BIGNUM
*b
);
346 int BN_usub(BIGNUM
*r
, const BIGNUM
*a
, const BIGNUM
*b
);
347 int BN_uadd(BIGNUM
*r
, const BIGNUM
*a
, const BIGNUM
*b
);
348 int BN_add(BIGNUM
*r
, const BIGNUM
*a
, const BIGNUM
*b
);
349 int BN_mul(BIGNUM
*r
, const BIGNUM
*a
, const BIGNUM
*b
, BN_CTX
*ctx
);
350 int BN_sqr(BIGNUM
*r
, const BIGNUM
*a
,BN_CTX
*ctx
);
352 int BN_div(BIGNUM
*dv
, BIGNUM
*rem
, const BIGNUM
*m
, const BIGNUM
*d
,
354 #define BN_mod(rem,m,d,ctx) BN_div(NULL,(rem),(m),(d),(ctx))
355 int BN_nnmod(BIGNUM
*r
, const BIGNUM
*m
, const BIGNUM
*d
, BN_CTX
*ctx
);
356 int BN_mod_add(BIGNUM
*r
, const BIGNUM
*a
, const BIGNUM
*b
, const BIGNUM
*m
, BN_CTX
*ctx
);
357 int BN_mod_add_quick(BIGNUM
*r
, const BIGNUM
*a
, const BIGNUM
*b
, const BIGNUM
*m
);
358 int BN_mod_sub(BIGNUM
*r
, const BIGNUM
*a
, const BIGNUM
*b
, const BIGNUM
*m
, BN_CTX
*ctx
);
359 int BN_mod_sub_quick(BIGNUM
*r
, const BIGNUM
*a
, const BIGNUM
*b
, const BIGNUM
*m
);
360 int BN_mod_mul(BIGNUM
*r
, const BIGNUM
*a
, const BIGNUM
*b
,
361 const BIGNUM
*m
, BN_CTX
*ctx
);
362 int BN_mod_sqr(BIGNUM
*r
, const BIGNUM
*a
, const BIGNUM
*m
, BN_CTX
*ctx
);
363 int BN_mod_lshift1(BIGNUM
*r
, const BIGNUM
*a
, const BIGNUM
*m
, BN_CTX
*ctx
);
364 int BN_mod_lshift1_quick(BIGNUM
*r
, const BIGNUM
*a
, const BIGNUM
*m
);
365 int BN_mod_lshift(BIGNUM
*r
, const BIGNUM
*a
, int n
, const BIGNUM
*m
, BN_CTX
*ctx
);
366 int BN_mod_lshift_quick(BIGNUM
*r
, const BIGNUM
*a
, int n
, const BIGNUM
*m
);
368 BN_ULONG
BN_mod_word(const BIGNUM
*a
, BN_ULONG w
);
369 BN_ULONG
BN_div_word(BIGNUM
*a
, BN_ULONG w
);
370 int BN_mul_word(BIGNUM
*a
, BN_ULONG w
);
371 int BN_add_word(BIGNUM
*a
, BN_ULONG w
);
372 int BN_sub_word(BIGNUM
*a
, BN_ULONG w
);
373 int BN_set_word(BIGNUM
*a
, BN_ULONG w
);
374 BN_ULONG
BN_get_word(const BIGNUM
*a
);
376 int BN_cmp(const BIGNUM
*a
, const BIGNUM
*b
);
377 void BN_free(BIGNUM
*a
);
378 int BN_is_bit_set(const BIGNUM
*a
, int n
);
379 int BN_lshift(BIGNUM
*r
, const BIGNUM
*a
, int n
);
380 int BN_lshift1(BIGNUM
*r
, const BIGNUM
*a
);
381 int BN_exp(BIGNUM
*r
, const BIGNUM
*a
, const BIGNUM
*p
,BN_CTX
*ctx
);
383 int BN_mod_exp(BIGNUM
*r
, const BIGNUM
*a
, const BIGNUM
*p
,
384 const BIGNUM
*m
,BN_CTX
*ctx
);
385 int BN_mod_exp_mont(BIGNUM
*r
, const BIGNUM
*a
, const BIGNUM
*p
,
386 const BIGNUM
*m
, BN_CTX
*ctx
, BN_MONT_CTX
*m_ctx
);
387 int BN_mod_exp_mont_word(BIGNUM
*r
, BN_ULONG a
, const BIGNUM
*p
,
388 const BIGNUM
*m
, BN_CTX
*ctx
, BN_MONT_CTX
*m_ctx
);
389 int BN_mod_exp2_mont(BIGNUM
*r
, const BIGNUM
*a1
, const BIGNUM
*p1
,
390 const BIGNUM
*a2
, const BIGNUM
*p2
,const BIGNUM
*m
,
391 BN_CTX
*ctx
,BN_MONT_CTX
*m_ctx
);
392 int BN_mod_exp_simple(BIGNUM
*r
, const BIGNUM
*a
, const BIGNUM
*p
,
393 const BIGNUM
*m
,BN_CTX
*ctx
);
395 int BN_mask_bits(BIGNUM
*a
,int n
);
396 #ifndef OPENSSL_NO_FP_API
397 int BN_print_fp(FILE *fp
, const BIGNUM
*a
);
400 int BN_print(BIO
*fp
, const BIGNUM
*a
);
402 int BN_print(void *fp
, const BIGNUM
*a
);
404 int BN_reciprocal(BIGNUM
*r
, const BIGNUM
*m
, int len
, BN_CTX
*ctx
);
405 int BN_rshift(BIGNUM
*r
, const BIGNUM
*a
, int n
);
406 int BN_rshift1(BIGNUM
*r
, const BIGNUM
*a
);
407 void BN_clear(BIGNUM
*a
);
408 BIGNUM
*BN_dup(const BIGNUM
*a
);
409 int BN_ucmp(const BIGNUM
*a
, const BIGNUM
*b
);
410 int BN_set_bit(BIGNUM
*a
, int n
);
411 int BN_clear_bit(BIGNUM
*a
, int n
);
412 char * BN_bn2hex(const BIGNUM
*a
);
413 char * BN_bn2dec(const BIGNUM
*a
);
414 int BN_hex2bn(BIGNUM
**a
, const char *str
);
415 int BN_dec2bn(BIGNUM
**a
, const char *str
);
416 int BN_gcd(BIGNUM
*r
,const BIGNUM
*a
,const BIGNUM
*b
,BN_CTX
*ctx
);
417 int BN_kronecker(const BIGNUM
*a
,const BIGNUM
*b
,BN_CTX
*ctx
); /* returns -2 for error */
418 BIGNUM
*BN_mod_inverse(BIGNUM
*ret
,
419 const BIGNUM
*a
, const BIGNUM
*n
,BN_CTX
*ctx
);
420 BIGNUM
*BN_mod_sqrt(BIGNUM
*ret
,
421 const BIGNUM
*a
, const BIGNUM
*n
,BN_CTX
*ctx
);
422 BIGNUM
*BN_generate_prime(BIGNUM
*ret
,int bits
,int safe
,
423 const BIGNUM
*add
, const BIGNUM
*rem
,
424 void (*callback
)(int,int,void *),void *cb_arg
);
425 int BN_is_prime(const BIGNUM
*p
,int nchecks
,
426 void (*callback
)(int,int,void *),
427 BN_CTX
*ctx
,void *cb_arg
);
428 int BN_is_prime_fasttest(const BIGNUM
*p
,int nchecks
,
429 void (*callback
)(int,int,void *),BN_CTX
*ctx
,void *cb_arg
,
430 int do_trial_division
);
431 void ERR_load_BN_strings(void );
433 BN_MONT_CTX
*BN_MONT_CTX_new(void );
434 void BN_MONT_CTX_init(BN_MONT_CTX
*ctx
);
435 int BN_mod_mul_montgomery(BIGNUM
*r
,const BIGNUM
*a
,const BIGNUM
*b
,
436 BN_MONT_CTX
*mont
, BN_CTX
*ctx
);
437 #define BN_to_montgomery(r,a,mont,ctx) BN_mod_mul_montgomery(\
438 (r),(a),&((mont)->RR),(mont),(ctx))
439 int BN_from_montgomery(BIGNUM
*r
,const BIGNUM
*a
,
440 BN_MONT_CTX
*mont
, BN_CTX
*ctx
);
441 void BN_MONT_CTX_free(BN_MONT_CTX
*mont
);
442 int BN_MONT_CTX_set(BN_MONT_CTX
*mont
,const BIGNUM
*modulus
,BN_CTX
*ctx
);
443 BN_MONT_CTX
*BN_MONT_CTX_copy(BN_MONT_CTX
*to
,BN_MONT_CTX
*from
);
445 BN_BLINDING
*BN_BLINDING_new(BIGNUM
*A
,BIGNUM
*Ai
,BIGNUM
*mod
);
446 void BN_BLINDING_free(BN_BLINDING
*b
);
447 int BN_BLINDING_update(BN_BLINDING
*b
,BN_CTX
*ctx
);
448 int BN_BLINDING_convert(BIGNUM
*n
, BN_BLINDING
*r
, BN_CTX
*ctx
);
449 int BN_BLINDING_invert(BIGNUM
*n
, BN_BLINDING
*b
, BN_CTX
*ctx
);
451 void BN_set_params(int mul
,int high
,int low
,int mont
);
452 int BN_get_params(int which
); /* 0, mul, 1 high, 2 low, 3 mont */
454 void BN_RECP_CTX_init(BN_RECP_CTX
*recp
);
455 BN_RECP_CTX
*BN_RECP_CTX_new(void);
456 void BN_RECP_CTX_free(BN_RECP_CTX
*recp
);
457 int BN_RECP_CTX_set(BN_RECP_CTX
*recp
,const BIGNUM
*rdiv
,BN_CTX
*ctx
);
458 int BN_mod_mul_reciprocal(BIGNUM
*r
, const BIGNUM
*x
, const BIGNUM
*y
,
459 BN_RECP_CTX
*recp
,BN_CTX
*ctx
);
460 int BN_mod_exp_recp(BIGNUM
*r
, const BIGNUM
*a
, const BIGNUM
*p
,
461 const BIGNUM
*m
, BN_CTX
*ctx
);
462 int BN_div_recp(BIGNUM
*dv
, BIGNUM
*rem
, const BIGNUM
*m
,
463 BN_RECP_CTX
*recp
, BN_CTX
*ctx
);
465 /* library internal functions */
467 #define bn_expand(a,bits) ((((((bits+BN_BITS2-1))/BN_BITS2)) <= (a)->dmax)?\
468 (a):bn_expand2((a),(bits)/BN_BITS2+1))
469 #define bn_wexpand(a,words) (((words) <= (a)->dmax)?(a):bn_expand2((a),(words)))
470 BIGNUM
*bn_expand2(BIGNUM
*a
, int words
);
471 BIGNUM
*bn_dup_expand(const BIGNUM
*a
, int words
);
473 #define bn_fix_top(a) \
478 for (ftl= &((a)->d[(a)->top-1]); (a)->top > 0; (a)->top--) \
479 if (*(ftl--)) break; \
483 BN_ULONG
bn_mul_add_words(BN_ULONG
*rp
, const BN_ULONG
*ap
, int num
, BN_ULONG w
);
484 BN_ULONG
bn_mul_words(BN_ULONG
*rp
, const BN_ULONG
*ap
, int num
, BN_ULONG w
);
485 void bn_sqr_words(BN_ULONG
*rp
, const BN_ULONG
*ap
, int num
);
486 BN_ULONG
bn_div_words(BN_ULONG h
, BN_ULONG l
, BN_ULONG d
);
487 BN_ULONG
bn_add_words(BN_ULONG
*rp
, const BN_ULONG
*ap
, const BN_ULONG
*bp
,int num
);
488 BN_ULONG
bn_sub_words(BN_ULONG
*rp
, const BN_ULONG
*ap
, const BN_ULONG
*bp
,int num
);
491 void bn_dump1(FILE *o
, const char *a
, const BN_ULONG
*b
,int n
);
492 # define bn_print(a) {fprintf(stderr, #a "="); BN_print_fp(stderr,a); \
493 fprintf(stderr,"\n");}
494 # define bn_dump(a,n) bn_dump1(stderr,#a,a,n);
497 # define bn_dump(a,b)
500 int BN_bntest_rand(BIGNUM
*rnd
, int bits
, int top
,int bottom
);
502 /* BEGIN ERROR CODES */
503 /* The following lines are auto generated by the script mkerr.pl. Any changes
504 * made after this point may be overwritten when the script is next run.
507 /* Error codes for the BN functions. */
509 /* Function codes. */
510 #define BN_F_BN_BLINDING_CONVERT 100
511 #define BN_F_BN_BLINDING_INVERT 101
512 #define BN_F_BN_BLINDING_NEW 102
513 #define BN_F_BN_BLINDING_UPDATE 103
514 #define BN_F_BN_BN2DEC 104
515 #define BN_F_BN_BN2HEX 105
516 #define BN_F_BN_CTX_GET 116
517 #define BN_F_BN_CTX_NEW 106
518 #define BN_F_BN_DIV 107
519 #define BN_F_BN_EXPAND2 108
520 #define BN_F_BN_EXPAND_INTERNAL 120
521 #define BN_F_BN_MOD_EXP2_MONT 118
522 #define BN_F_BN_MOD_EXP_MONT 109
523 #define BN_F_BN_MOD_EXP_MONT_WORD 117
524 #define BN_F_BN_MOD_INVERSE 110
525 #define BN_F_BN_MOD_LSHIFT_QUICK 119
526 #define BN_F_BN_MOD_MUL_RECIPROCAL 111
527 #define BN_F_BN_MOD_SQRT 121
528 #define BN_F_BN_MPI2BN 112
529 #define BN_F_BN_NEW 113
530 #define BN_F_BN_RAND 114
531 #define BN_F_BN_RAND_RANGE 122
532 #define BN_F_BN_USUB 115
535 #define BN_R_ARG2_LT_ARG3 100
536 #define BN_R_BAD_RECIPROCAL 101
537 #define BN_R_BIGNUM_TOO_LONG 114
538 #define BN_R_CALLED_WITH_EVEN_MODULUS 102
539 #define BN_R_DIV_BY_ZERO 103
540 #define BN_R_ENCODING_ERROR 104
541 #define BN_R_EXPAND_ON_STATIC_BIGNUM_DATA 105
542 #define BN_R_INPUT_NOT_REDUCED 110
543 #define BN_R_INVALID_LENGTH 106
544 #define BN_R_INVALID_RANGE 115
545 #define BN_R_NOT_A_SQUARE 111
546 #define BN_R_NOT_INITIALIZED 107
547 #define BN_R_NO_INVERSE 108
548 #define BN_R_P_IS_NOT_PRIME 112
549 #define BN_R_TOO_MANY_ITERATIONS 113
550 #define BN_R_TOO_MANY_TEMPORARY_VARIABLES 109