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.]
58 /* ====================================================================
59 * Copyright 2002 Sun Microsystems, Inc. ALL RIGHTS RESERVED.
61 * Portions of the attached software ("Contribution") are developed by
62 * SUN MICROSYSTEMS, INC., and are contributed to the OpenSSL project.
64 * The Contribution is licensed pursuant to the Eric Young open source
65 * license provided above.
67 * The binary polynomial arithmetic software is originally written by
68 * Sheueling Chang Shantz and Douglas Stebila of Sun Microsystems Laboratories.
72 © Portions copyright (c) 2006 Nokia Corporation. All rights reserved.
78 #if (defined(__SYMBIAN32__) && !defined(SYMBIAN))
85 #include <openssl/e_os2.h>
86 #ifndef OPENSSL_NO_FP_API
87 #include <stdio.h> /* FILE */
89 #include <openssl/ossl_typ.h>
95 /* These preprocessor symbols control various aspects of the bignum headers and
96 * library code. They're not defined by any "normal" configuration, as they are
97 * intended for development and testing purposes. NB: defining all three can be
98 * useful for debugging application code as well as openssl itself.
100 * BN_DEBUG - turn on various debugging alterations to the bignum code
101 * BN_DEBUG_RAND - uses random poisoning of unused words to trip up
102 * mismanagement of bignum internals. You must also define BN_DEBUG.
104 /* #define BN_DEBUG */
105 /* #define BN_DEBUG_RAND */
111 /* This next option uses the C libraries (2 word)/(1 word) function.
112 * If it is not defined, I use my C version (which is slower).
113 * The reason for this flag is that when the particular C compiler
114 * library routine is used, and the library is linked with a different
115 * compiler, the library is missing. This mostly happens when the
116 * library is built with gcc and then linked using normal cc. This would
117 * be a common occurrence because gcc normally produces code that is
118 * 2 times faster than system compilers for the big number stuff.
119 * For machines with only one compiler (or shared libraries), this should
120 * be on. Again this in only really a problem on machines
121 * using "long long's", are 32bit, and are not using my assembler code. */
122 #if defined(OPENSSL_SYS_MSDOS) || defined(OPENSSL_SYS_WINDOWS) || \
123 defined(OPENSSL_SYS_WIN32) || defined(linux)
129 /* assuming long is 64bit - this is the DEC Alpha
130 * unsigned long long is only 64 bits :-(, don't define
131 * BN_LLONG for the DEC Alpha */
132 #ifdef SIXTY_FOUR_BIT_LONG
133 #define BN_ULLONG unsigned long long
134 #define BN_ULONG unsigned long
140 #define BN_MASK (0xffffffffffffffffffffffffffffffffLL)
141 #define BN_MASK2 (0xffffffffffffffffL)
142 #define BN_MASK2l (0xffffffffL)
143 #define BN_MASK2h (0xffffffff00000000L)
144 #define BN_MASK2h1 (0xffffffff80000000L)
145 #define BN_TBIT (0x8000000000000000L)
146 #define BN_DEC_CONV (10000000000000000000UL)
147 #define BN_DEC_FMT1 "%lu"
148 #define BN_DEC_FMT2 "%019lu"
149 #define BN_DEC_NUM 19
152 /* This is where the long long data type is 64 bits, but long is 32.
153 * For machines where there are 64bit registers, this is the mode to use.
154 * IRIX, on R4000 and above should use this mode, along with the relevant
155 * assembler code :-). Do NOT define BN_LLONG.
157 #ifdef SIXTY_FOUR_BIT
160 #define BN_ULONG unsigned long long
161 #define BN_LONG long long
166 #define BN_MASK2 (0xffffffffffffffffLL)
167 #define BN_MASK2l (0xffffffffL)
168 #define BN_MASK2h (0xffffffff00000000LL)
169 #define BN_MASK2h1 (0xffffffff80000000LL)
170 #define BN_TBIT (0x8000000000000000LL)
171 #define BN_DEC_CONV (10000000000000000000ULL)
172 #define BN_DEC_FMT1 "%llu"
173 #define BN_DEC_FMT2 "%019llu"
174 #define BN_DEC_NUM 19
177 #ifdef THIRTY_TWO_BIT
179 # if defined(OPENSSL_SYS_WIN32) && !defined(__GNUC__)
180 # define BN_ULLONG unsigned __int64
182 # define BN_ULLONG unsigned long long
185 #define BN_ULONG unsigned long
191 #ifdef OPENSSL_SYS_WIN32
192 /* VC++ doesn't like the LL suffix */
193 #define BN_MASK (0xffffffffffffffffL)
195 #define BN_MASK (0xffffffffffffffffLL)
197 #define BN_MASK2 (0xffffffffL)
198 #define BN_MASK2l (0xffff)
199 #define BN_MASK2h1 (0xffff8000L)
200 #define BN_MASK2h (0xffff0000L)
201 #define BN_TBIT (0x80000000L)
202 #define BN_DEC_CONV (1000000000L)
203 #define BN_DEC_FMT1 "%lu"
204 #define BN_DEC_FMT2 "%09lu"
212 #define BN_ULLONG unsigned long
213 #define BN_ULONG unsigned short
214 #define BN_LONG short
219 #define BN_MASK (0xffffffff)
220 #define BN_MASK2 (0xffff)
221 #define BN_MASK2l (0xff)
222 #define BN_MASK2h1 (0xff80)
223 #define BN_MASK2h (0xff00)
224 #define BN_TBIT (0x8000)
225 #define BN_DEC_CONV (100000)
226 #define BN_DEC_FMT1 "%u"
227 #define BN_DEC_FMT2 "%05u"
235 #define BN_ULLONG unsigned short
236 #define BN_ULONG unsigned char
242 #define BN_MASK (0xffff)
243 #define BN_MASK2 (0xff)
244 #define BN_MASK2l (0xf)
245 #define BN_MASK2h1 (0xf8)
246 #define BN_MASK2h (0xf0)
247 #define BN_TBIT (0x80)
248 #define BN_DEC_CONV (100)
249 #define BN_DEC_FMT1 "%u"
250 #define BN_DEC_FMT2 "%02u"
254 #define BN_DEFAULT_BITS 1280
256 #define BN_FLG_MALLOCED 0x01
257 #define BN_FLG_STATIC_DATA 0x02
258 #define BN_FLG_CONSTTIME 0x04 /* avoid leaking exponent information through timing,
259 * BN_mod_exp_mont() will call BN_mod_exp_mont_consttime,
260 * BN_div() will call BN_div_no_branch,
261 * BN_mod_inverse() will call BN_mod_inverse_no_branch.
264 #ifndef OPENSSL_NO_DEPRECATED
265 #define BN_FLG_EXP_CONSTTIME BN_FLG_CONSTTIME /* deprecated name for the flag */
266 /* avoid leaking exponent information through timings
267 * (BN_mod_exp_mont() will call BN_mod_exp_mont_consttime) */
269 #ifndef OPENSSL_NO_DEPRECATED
270 #define BN_FLG_FREE 0x8000 /* used for debuging */
272 #define BN_set_flags(b,n) ((b)->flags|=(n))
273 #define BN_get_flags(b,n) ((b)->flags&(n))
275 /* get a clone of a BIGNUM with changed flags, for *temporary* use only
276 * (the two BIGNUMs cannot not be used in parallel!) */
277 #define BN_with_flags(dest,b,n) ((dest)->d=(b)->d, \
278 (dest)->top=(b)->top, \
279 (dest)->dmax=(b)->dmax, \
280 (dest)->neg=(b)->neg, \
281 (dest)->flags=(((dest)->flags & BN_FLG_MALLOCED) \
282 | ((b)->flags & ~BN_FLG_MALLOCED) \
283 | BN_FLG_STATIC_DATA \
286 /* Already declared in ossl_typ.h */
288 typedef struct bignum_st BIGNUM;
289 /* Used for temp variables (declaration hidden in bn_lcl.h) */
290 typedef struct bignum_ctx BN_CTX;
291 typedef struct bn_blinding_st BN_BLINDING;
292 typedef struct bn_mont_ctx_st BN_MONT_CTX;
293 typedef struct bn_recp_ctx_st BN_RECP_CTX;
294 typedef struct bn_gencb_st BN_GENCB;
299 BN_ULONG *d; /* Pointer to an array of 'BN_BITS2' bit chunks. */
300 int top; /* Index of last used d +1. */
301 /* The next are internal book keeping for bn_expand. */
302 int dmax; /* Size of the d array. */
303 int neg; /* one if the number is negative */
307 /* Used for montgomery multiplication */
308 struct bn_mont_ctx_st
310 int ri; /* number of bits in R */
311 BIGNUM RR; /* used to convert to montgomery form */
312 BIGNUM N; /* The modulus */
313 BIGNUM Ni; /* R*(1/R mod N) - N*Ni = 1
314 * (Ni is only stored for bignum algorithm) */
315 BN_ULONG n0; /* least significant word of Ni */
319 /* Used for reciprocal division/mod functions
320 * It cannot be shared between threads
322 struct bn_recp_ctx_st
324 BIGNUM N; /* the divisor */
325 BIGNUM Nr; /* the reciprocal */
331 /* Used for slow "generation" functions. */
334 unsigned int ver; /* To handle binary (in)compatibility */
335 void *arg; /* callback-specific data */
338 /* if(ver==1) - handles old style callbacks */
339 void (*cb_1)(int, int, void *);
340 /* if(ver==2) - new callback style */
341 int (*cb_2)(int, int, BN_GENCB *);
344 /* Wrapper function to make using BN_GENCB easier, */
345 IMPORT_C int BN_GENCB_call(BN_GENCB *cb, int a, int b);
346 /* Macro to populate a BN_GENCB structure with an "old"-style callback */
347 #define BN_GENCB_set_old(gencb, callback, cb_arg) { \
348 BN_GENCB *tmp_gencb = (gencb); \
349 tmp_gencb->ver = 1; \
350 tmp_gencb->arg = (cb_arg); \
351 tmp_gencb->cb.cb_1 = (callback); }
352 /* Macro to populate a BN_GENCB structure with a "new"-style callback */
353 #define BN_GENCB_set(gencb, callback, cb_arg) { \
354 BN_GENCB *tmp_gencb = (gencb); \
355 tmp_gencb->ver = 2; \
356 tmp_gencb->arg = (cb_arg); \
357 tmp_gencb->cb.cb_2 = (callback); }
359 #define BN_prime_checks 0 /* default: select number of iterations
360 based on the size of the number */
362 /* number of Miller-Rabin iterations for an error rate of less than 2^-80
363 * for random 'b'-bit input, b >= 100 (taken from table 4.4 in the Handbook
364 * of Applied Cryptography [Menezes, van Oorschot, Vanstone; CRC Press 1996];
365 * original paper: Damgaard, Landrock, Pomerance: Average case error estimates
366 * for the strong probable prime test. -- Math. Comp. 61 (1993) 177-194) */
367 #define BN_prime_checks_for_size(b) ((b) >= 1300 ? 2 : \
380 #define BN_num_bytes(a) ((BN_num_bits(a)+7)/8)
382 /* Note that BN_abs_is_word didn't work reliably for w == 0 until 0.9.8 */
383 #define BN_abs_is_word(a,w) ((((a)->top == 1) && ((a)->d[0] == (BN_ULONG)(w))) || \
384 (((w) == 0) && ((a)->top == 0)))
385 #define BN_is_zero(a) ((a)->top == 0)
386 #define BN_is_one(a) (BN_abs_is_word((a),1) && !(a)->neg)
387 #define BN_is_word(a,w) (BN_abs_is_word((a),(w)) && (!(w) || !(a)->neg))
388 #define BN_is_odd(a) (((a)->top > 0) && ((a)->d[0] & 1))
390 #define BN_one(a) (BN_set_word((a),1))
391 #define BN_zero_ex(a) \
393 BIGNUM *_tmp_bn = (a); \
397 #ifdef OPENSSL_NO_DEPRECATED
398 #define BN_zero(a) BN_zero_ex(a)
400 #define BN_zero(a) (BN_set_word((a),0))
403 IMPORT_C const BIGNUM *BN_value_one(void);
404 IMPORT_C char * BN_options(void);
405 IMPORT_C BN_CTX *BN_CTX_new(void);
406 #ifndef OPENSSL_NO_DEPRECATED
407 IMPORT_C void BN_CTX_init(BN_CTX *c);
409 IMPORT_C void BN_CTX_free(BN_CTX *c);
410 IMPORT_C void BN_CTX_start(BN_CTX *ctx);
411 IMPORT_C BIGNUM *BN_CTX_get(BN_CTX *ctx);
412 IMPORT_C void BN_CTX_end(BN_CTX *ctx);
413 IMPORT_C int BN_rand(BIGNUM *rnd, int bits, int top,int bottom);
414 IMPORT_C int BN_pseudo_rand(BIGNUM *rnd, int bits, int top,int bottom);
415 IMPORT_C int BN_rand_range(BIGNUM *rnd, BIGNUM *range);
416 IMPORT_C int BN_pseudo_rand_range(BIGNUM *rnd, BIGNUM *range);
417 IMPORT_C int BN_num_bits(const BIGNUM *a);
418 IMPORT_C int BN_num_bits_word(BN_ULONG);
419 IMPORT_C BIGNUM *BN_new(void);
420 IMPORT_C void BN_init(BIGNUM *);
421 IMPORT_C void BN_clear_free(BIGNUM *a);
422 IMPORT_C BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b);
423 IMPORT_C void BN_swap(BIGNUM *a, BIGNUM *b);
424 IMPORT_C BIGNUM *BN_bin2bn(const unsigned char *s,int len,BIGNUM *ret);
425 IMPORT_C int BN_bn2bin(const BIGNUM *a, unsigned char *to);
426 IMPORT_C BIGNUM *BN_mpi2bn(const unsigned char *s,int len,BIGNUM *ret);
427 IMPORT_C int BN_bn2mpi(const BIGNUM *a, unsigned char *to);
428 IMPORT_C int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
429 IMPORT_C int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
430 IMPORT_C int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
431 IMPORT_C int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
432 IMPORT_C int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);
433 IMPORT_C int BN_sqr(BIGNUM *r, const BIGNUM *a,BN_CTX *ctx);
434 /* BN_set_negative(): sets sign of a bignum */
435 IMPORT_C void BN_set_negative(BIGNUM *b, int n);
436 /* BN_get_negative(): returns 1 if the bignum is < 0 and 0 otherwise */
437 #define BN_is_negative(a) ((a)->neg != 0)
439 IMPORT_C int BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, const BIGNUM *d,
441 #define BN_mod(rem,m,d,ctx) BN_div(NULL,(rem),(m),(d),(ctx))
442 IMPORT_C int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx);
443 IMPORT_C int BN_mod_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m, BN_CTX *ctx);
444 IMPORT_C int BN_mod_add_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m);
445 IMPORT_C int BN_mod_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m, BN_CTX *ctx);
446 IMPORT_C int BN_mod_sub_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m);
447 IMPORT_C int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
448 const BIGNUM *m, BN_CTX *ctx);
449 IMPORT_C int BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);
450 IMPORT_C int BN_mod_lshift1(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);
451 IMPORT_C int BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *m);
452 IMPORT_C int BN_mod_lshift(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m, BN_CTX *ctx);
453 IMPORT_C int BN_mod_lshift_quick(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m);
455 IMPORT_C BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w);
456 IMPORT_C BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w);
457 IMPORT_C int BN_mul_word(BIGNUM *a, BN_ULONG w);
458 IMPORT_C int BN_add_word(BIGNUM *a, BN_ULONG w);
459 IMPORT_C int BN_sub_word(BIGNUM *a, BN_ULONG w);
460 IMPORT_C int BN_set_word(BIGNUM *a, BN_ULONG w);
461 IMPORT_C BN_ULONG BN_get_word(const BIGNUM *a);
463 IMPORT_C int BN_cmp(const BIGNUM *a, const BIGNUM *b);
464 IMPORT_C void BN_free(BIGNUM *a);
465 IMPORT_C int BN_is_bit_set(const BIGNUM *a, int n);
466 IMPORT_C int BN_lshift(BIGNUM *r, const BIGNUM *a, int n);
467 IMPORT_C int BN_lshift1(BIGNUM *r, const BIGNUM *a);
468 IMPORT_C int BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,BN_CTX *ctx);
470 IMPORT_C int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
471 const BIGNUM *m,BN_CTX *ctx);
472 IMPORT_C int BN_mod_exp_mont(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
473 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);
474 IMPORT_C int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
475 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont);
476 IMPORT_C int BN_mod_exp_mont_word(BIGNUM *r, BN_ULONG a, const BIGNUM *p,
477 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);
478 IMPORT_C int BN_mod_exp2_mont(BIGNUM *r, const BIGNUM *a1, const BIGNUM *p1,
479 const BIGNUM *a2, const BIGNUM *p2,const BIGNUM *m,
480 BN_CTX *ctx,BN_MONT_CTX *m_ctx);
481 IMPORT_C int BN_mod_exp_simple(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
482 const BIGNUM *m,BN_CTX *ctx);
484 IMPORT_C int BN_mask_bits(BIGNUM *a,int n);
485 #ifndef OPENSSL_NO_FP_API
486 IMPORT_C int BN_print_fp(FILE *fp, const BIGNUM *a);
489 IMPORT_C int BN_print(BIO *fp, const BIGNUM *a);
491 IMPORT_C int BN_print(void *fp, const BIGNUM *a);
493 IMPORT_C int BN_reciprocal(BIGNUM *r, const BIGNUM *m, int len, BN_CTX *ctx);
494 IMPORT_C int BN_rshift(BIGNUM *r, const BIGNUM *a, int n);
495 IMPORT_C int BN_rshift1(BIGNUM *r, const BIGNUM *a);
496 IMPORT_C void BN_clear(BIGNUM *a);
497 IMPORT_C BIGNUM *BN_dup(const BIGNUM *a);
498 IMPORT_C int BN_ucmp(const BIGNUM *a, const BIGNUM *b);
499 IMPORT_C int BN_set_bit(BIGNUM *a, int n);
500 IMPORT_C int BN_clear_bit(BIGNUM *a, int n);
501 IMPORT_C char * BN_bn2hex(const BIGNUM *a);
502 IMPORT_C char * BN_bn2dec(const BIGNUM *a);
503 IMPORT_C int BN_hex2bn(BIGNUM **a, const char *str);
504 IMPORT_C int BN_dec2bn(BIGNUM **a, const char *str);
505 IMPORT_C int BN_gcd(BIGNUM *r,const BIGNUM *a,const BIGNUM *b,BN_CTX *ctx);
506 IMPORT_C int BN_kronecker(const BIGNUM *a,const BIGNUM *b,BN_CTX *ctx); /* returns -2 for error */
507 IMPORT_C BIGNUM *BN_mod_inverse(BIGNUM *ret,
508 const BIGNUM *a, const BIGNUM *n,BN_CTX *ctx);
509 IMPORT_C BIGNUM *BN_mod_sqrt(BIGNUM *ret,
510 const BIGNUM *a, const BIGNUM *n,BN_CTX *ctx);
512 /* Deprecated versions */
513 #ifndef OPENSSL_NO_DEPRECATED
514 IMPORT_C BIGNUM *BN_generate_prime(BIGNUM *ret,int bits,int safe,
515 const BIGNUM *add, const BIGNUM *rem,
516 void (*callback)(int,int,void *),void *cb_arg);
517 IMPORT_C int BN_is_prime(const BIGNUM *p,int nchecks,
518 void (*callback)(int,int,void *),
519 BN_CTX *ctx,void *cb_arg);
520 IMPORT_C int BN_is_prime_fasttest(const BIGNUM *p,int nchecks,
521 void (*callback)(int,int,void *),BN_CTX *ctx,void *cb_arg,
522 int do_trial_division);
523 #endif /* !defined(OPENSSL_NO_DEPRECATED) */
526 IMPORT_C int BN_generate_prime_ex(BIGNUM *ret,int bits,int safe, const BIGNUM *add,
527 const BIGNUM *rem, BN_GENCB *cb);
528 IMPORT_C int BN_is_prime_ex(const BIGNUM *p,int nchecks, BN_CTX *ctx, BN_GENCB *cb);
529 IMPORT_C int BN_is_prime_fasttest_ex(const BIGNUM *p,int nchecks, BN_CTX *ctx,
530 int do_trial_division, BN_GENCB *cb);
532 IMPORT_C BN_MONT_CTX *BN_MONT_CTX_new(void );
533 IMPORT_C void BN_MONT_CTX_init(BN_MONT_CTX *ctx);
534 IMPORT_C int BN_mod_mul_montgomery(BIGNUM *r,const BIGNUM *a,const BIGNUM *b,
535 BN_MONT_CTX *mont, BN_CTX *ctx);
536 #define BN_to_montgomery(r,a,mont,ctx) BN_mod_mul_montgomery(\
537 (r),(a),&((mont)->RR),(mont),(ctx))
538 IMPORT_C int BN_from_montgomery(BIGNUM *r,const BIGNUM *a,
539 BN_MONT_CTX *mont, BN_CTX *ctx);
540 IMPORT_C void BN_MONT_CTX_free(BN_MONT_CTX *mont);
541 IMPORT_C int BN_MONT_CTX_set(BN_MONT_CTX *mont,const BIGNUM *mod,BN_CTX *ctx);
542 IMPORT_C BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to,BN_MONT_CTX *from);
543 IMPORT_C BN_MONT_CTX *BN_MONT_CTX_set_locked(BN_MONT_CTX **pmont, int lock,
544 const BIGNUM *mod, BN_CTX *ctx);
546 /* BN_BLINDING flags */
547 #define BN_BLINDING_NO_UPDATE 0x00000001
548 #define BN_BLINDING_NO_RECREATE 0x00000002
550 IMPORT_C BN_BLINDING *BN_BLINDING_new(const BIGNUM *A, const BIGNUM *Ai, BIGNUM *mod);
551 IMPORT_C void BN_BLINDING_free(BN_BLINDING *b);
552 IMPORT_C int BN_BLINDING_update(BN_BLINDING *b,BN_CTX *ctx);
553 IMPORT_C int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
554 IMPORT_C int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
555 IMPORT_C int BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b, BN_CTX *);
556 IMPORT_C int BN_BLINDING_invert_ex(BIGNUM *n, const BIGNUM *r, BN_BLINDING *b, BN_CTX *);
557 IMPORT_C unsigned long BN_BLINDING_get_thread_id(const BN_BLINDING *);
558 IMPORT_C void BN_BLINDING_set_thread_id(BN_BLINDING *, unsigned long);
559 IMPORT_C unsigned long BN_BLINDING_get_flags(const BN_BLINDING *);
560 IMPORT_C void BN_BLINDING_set_flags(BN_BLINDING *, unsigned long);
561 IMPORT_C BN_BLINDING *BN_BLINDING_create_param(BN_BLINDING *b,
562 const BIGNUM *e, BIGNUM *m, BN_CTX *ctx,
563 int (*bn_mod_exp)(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
564 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx),
567 #ifndef OPENSSL_NO_DEPRECATED
568 IMPORT_C void BN_set_params(int mul,int high,int low,int mont);
569 IMPORT_C int BN_get_params(int which); /* 0, mul, 1 high, 2 low, 3 mont */
572 IMPORT_C void BN_RECP_CTX_init(BN_RECP_CTX *recp);
573 IMPORT_C BN_RECP_CTX *BN_RECP_CTX_new(void);
574 IMPORT_C void BN_RECP_CTX_free(BN_RECP_CTX *recp);
575 IMPORT_C int BN_RECP_CTX_set(BN_RECP_CTX *recp,const BIGNUM *rdiv,BN_CTX *ctx);
576 IMPORT_C int BN_mod_mul_reciprocal(BIGNUM *r, const BIGNUM *x, const BIGNUM *y,
577 BN_RECP_CTX *recp,BN_CTX *ctx);
578 IMPORT_C int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
579 const BIGNUM *m, BN_CTX *ctx);
580 IMPORT_C int BN_div_recp(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m,
581 BN_RECP_CTX *recp, BN_CTX *ctx);
583 /* Functions for arithmetic over binary polynomials represented by BIGNUMs.
585 * The BIGNUM::neg property of BIGNUMs representing binary polynomials is
588 * Note that input arguments are not const so that their bit arrays can
589 * be expanded to the appropriate size if needed.
592 IMPORT_C int BN_GF2m_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); /*r = a + b*/
593 #define BN_GF2m_sub(r, a, b) BN_GF2m_add(r, a, b)
594 IMPORT_C int BN_GF2m_mod(BIGNUM *r, const BIGNUM *a, const BIGNUM *p); /*r=a mod p*/
595 IMPORT_C int BN_GF2m_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
596 const BIGNUM *p, BN_CTX *ctx); /* r = (a * b) mod p */
597 IMPORT_C int BN_GF2m_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
598 BN_CTX *ctx); /* r = (a * a) mod p */
599 IMPORT_C int BN_GF2m_mod_inv(BIGNUM *r, const BIGNUM *b, const BIGNUM *p,
600 BN_CTX *ctx); /* r = (1 / b) mod p */
601 IMPORT_C int BN_GF2m_mod_div(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
602 const BIGNUM *p, BN_CTX *ctx); /* r = (a / b) mod p */
603 IMPORT_C int BN_GF2m_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
604 const BIGNUM *p, BN_CTX *ctx); /* r = (a ^ b) mod p */
605 IMPORT_C int BN_GF2m_mod_sqrt(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
606 BN_CTX *ctx); /* r = sqrt(a) mod p */
607 IMPORT_C int BN_GF2m_mod_solve_quad(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
608 BN_CTX *ctx); /* r^2 + r = a mod p */
609 #define BN_GF2m_cmp(a, b) BN_ucmp((a), (b))
610 /* Some functions allow for representation of the irreducible polynomials
611 * as an unsigned int[], say p. The irreducible f(t) is then of the form:
612 * t^p[0] + t^p[1] + ... + t^p[k]
613 * where m = p[0] > p[1] > ... > p[k] = 0.
615 IMPORT_C int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const unsigned int p[]);
617 IMPORT_C int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
618 const unsigned int p[], BN_CTX *ctx); /* r = (a * b) mod p */
619 IMPORT_C int BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const unsigned int p[],
620 BN_CTX *ctx); /* r = (a * a) mod p */
621 IMPORT_C int BN_GF2m_mod_inv_arr(BIGNUM *r, const BIGNUM *b, const unsigned int p[],
622 BN_CTX *ctx); /* r = (1 / b) mod p */
623 IMPORT_C int BN_GF2m_mod_div_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
624 const unsigned int p[], BN_CTX *ctx); /* r = (a / b) mod p */
625 IMPORT_C int BN_GF2m_mod_exp_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
626 const unsigned int p[], BN_CTX *ctx); /* r = (a ^ b) mod p */
627 IMPORT_C int BN_GF2m_mod_sqrt_arr(BIGNUM *r, const BIGNUM *a,
628 const unsigned int p[], BN_CTX *ctx); /* r = sqrt(a) mod p */
629 IMPORT_C int BN_GF2m_mod_solve_quad_arr(BIGNUM *r, const BIGNUM *a,
630 const unsigned int p[], BN_CTX *ctx); /* r^2 + r = a mod p */
631 IMPORT_C int BN_GF2m_poly2arr(const BIGNUM *a, unsigned int p[], int max);
632 IMPORT_C int BN_GF2m_arr2poly(const unsigned int p[], BIGNUM *a);
634 /* faster mod functions for the 'NIST primes'
636 IMPORT_C int BN_nist_mod_192(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
637 IMPORT_C int BN_nist_mod_224(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
638 IMPORT_C int BN_nist_mod_256(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
639 IMPORT_C int BN_nist_mod_384(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
640 IMPORT_C int BN_nist_mod_521(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
642 IMPORT_C const BIGNUM *BN_get0_nist_prime_192(void);
643 IMPORT_C const BIGNUM *BN_get0_nist_prime_224(void);
644 IMPORT_C const BIGNUM *BN_get0_nist_prime_256(void);
645 IMPORT_C const BIGNUM *BN_get0_nist_prime_384(void);
646 IMPORT_C const BIGNUM *BN_get0_nist_prime_521(void);
648 /* library internal functions */
650 #define bn_expand(a,bits) ((((((bits+BN_BITS2-1))/BN_BITS2)) <= (a)->dmax)?\
651 (a):bn_expand2((a),(bits+BN_BITS2-1)/BN_BITS2))
652 #define bn_wexpand(a,words) (((words) <= (a)->dmax)?(a):bn_expand2((a),(words)))
653 IMPORT_C BIGNUM *bn_expand2(BIGNUM *a, int words);
654 #ifndef OPENSSL_NO_DEPRECATED
655 BIGNUM *bn_dup_expand(const BIGNUM *a, int words); /* unused */
658 /* Bignum consistency macros
659 * There is one "API" macro, bn_fix_top(), for stripping leading zeroes from
660 * bignum data after direct manipulations on the data. There is also an
661 * "internal" macro, bn_check_top(), for verifying that there are no leading
662 * zeroes. Unfortunately, some auditing is required due to the fact that
663 * bn_fix_top() has become an overabused duct-tape because bignum data is
664 * occasionally passed around in an inconsistent state. So the following
665 * changes have been made to sort this out;
666 * - bn_fix_top()s implementation has been moved to bn_correct_top()
667 * - if BN_DEBUG isn't defined, bn_fix_top() maps to bn_correct_top(), and
668 * bn_check_top() is as before.
669 * - if BN_DEBUG *is* defined;
670 * - bn_check_top() tries to pollute unused words even if the bignum 'top' is
671 * consistent. (ed: only if BN_DEBUG_RAND is defined)
672 * - bn_fix_top() maps to bn_check_top() rather than "fixing" anything.
673 * The idea is to have debug builds flag up inconsistent bignums when they
674 * occur. If that occurs in a bn_fix_top(), we examine the code in question; if
675 * the use of bn_fix_top() was appropriate (ie. it follows directly after code
676 * that manipulates the bignum) it is converted to bn_correct_top(), and if it
677 * was not appropriate, we convert it permanently to bn_check_top() and track
678 * down the cause of the bug. Eventually, no internal code should be using the
679 * bn_fix_top() macro. External applications and libraries should try this with
680 * their own code too, both in terms of building against the openssl headers
681 * with BN_DEBUG defined *and* linking with a version of OpenSSL built with it
682 * defined. This not only improves external code, it provides more test
683 * coverage for openssl's own code.
688 /* We only need assert() when debugging */
692 /* To avoid "make update" cvs wars due to BN_DEBUG, use some tricks */
693 #ifndef RAND_pseudo_bytes
694 int RAND_pseudo_bytes(unsigned char *buf,int num);
695 #define BN_DEBUG_TRIX
697 #define bn_pollute(a) \
699 const BIGNUM *_bnum1 = (a); \
700 if(_bnum1->top < _bnum1->dmax) { \
701 unsigned char _tmp_char; \
702 /* We cast away const without the compiler knowing, any \
703 * *genuinely* constant variables that aren't mutable \
704 * wouldn't be constructed with top!=dmax. */ \
705 BN_ULONG *_not_const; \
706 memcpy(&_not_const, &_bnum1->d, sizeof(BN_ULONG*)); \
707 RAND_pseudo_bytes(&_tmp_char, 1); \
708 memset((unsigned char *)(_not_const + _bnum1->top), _tmp_char, \
709 (_bnum1->dmax - _bnum1->top) * sizeof(BN_ULONG)); \
713 #undef RAND_pseudo_bytes
716 #define bn_pollute(a)
718 #define bn_check_top(a) \
720 const BIGNUM *_bnum2 = (a); \
721 if (_bnum2 != NULL) { \
722 assert((_bnum2->top == 0) || \
723 (_bnum2->d[_bnum2->top - 1] != 0)); \
724 bn_pollute(_bnum2); \
728 #define bn_fix_top(a) bn_check_top(a)
730 #else /* !BN_DEBUG */
732 #define bn_pollute(a)
733 #define bn_check_top(a)
734 #define bn_fix_top(a) bn_correct_top(a)
738 #define bn_correct_top(a) \
743 for (ftl= &((a)->d[(a)->top-1]); (a)->top > 0; (a)->top--) \
744 if (*(ftl--)) break; \
749 IMPORT_C BN_ULONG bn_mul_add_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w);
750 IMPORT_C BN_ULONG bn_mul_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w);
751 IMPORT_C void bn_sqr_words(BN_ULONG *rp, const BN_ULONG *ap, int num);
752 IMPORT_C BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d);
753 IMPORT_C BN_ULONG bn_add_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,int num);
754 IMPORT_C BN_ULONG bn_sub_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,int num);
756 /* Primes from RFC 2409 */
757 IMPORT_C BIGNUM *get_rfc2409_prime_768(BIGNUM *bn);
758 IMPORT_C BIGNUM *get_rfc2409_prime_1024(BIGNUM *bn);
760 /* Primes from RFC 3526 */
761 IMPORT_C BIGNUM *get_rfc3526_prime_1536(BIGNUM *bn);
762 IMPORT_C BIGNUM *get_rfc3526_prime_2048(BIGNUM *bn);
763 IMPORT_C BIGNUM *get_rfc3526_prime_3072(BIGNUM *bn);
764 IMPORT_C BIGNUM *get_rfc3526_prime_4096(BIGNUM *bn);
765 IMPORT_C BIGNUM *get_rfc3526_prime_6144(BIGNUM *bn);
766 IMPORT_C BIGNUM *get_rfc3526_prime_8192(BIGNUM *bn);
768 IMPORT_C int BN_bntest_rand(BIGNUM *rnd, int bits, int top,int bottom);
770 /* BEGIN ERROR CODES */
771 /* The following lines are auto generated by the script mkerr.pl. Any changes
772 * made after this point may be overwritten when the script is next run.
774 IMPORT_C void ERR_load_BN_strings(void);
776 /* Error codes for the BN functions. */
778 /* Function codes. */
779 #define BN_F_BNRAND 127
780 #define BN_F_BN_BLINDING_CONVERT_EX 100
781 #define BN_F_BN_BLINDING_CREATE_PARAM 128
782 #define BN_F_BN_BLINDING_INVERT_EX 101
783 #define BN_F_BN_BLINDING_NEW 102
784 #define BN_F_BN_BLINDING_UPDATE 103
785 #define BN_F_BN_BN2DEC 104
786 #define BN_F_BN_BN2HEX 105
787 #define BN_F_BN_CTX_GET 116
788 #define BN_F_BN_CTX_NEW 106
789 #define BN_F_BN_CTX_START 129
790 #define BN_F_BN_DIV 107
791 #define BN_F_BN_DIV_NO_BRANCH 138
792 #define BN_F_BN_DIV_RECP 130
793 #define BN_F_BN_EXP 123
794 #define BN_F_BN_EXPAND2 108
795 #define BN_F_BN_EXPAND_INTERNAL 120
796 #define BN_F_BN_GF2M_MOD 131
797 #define BN_F_BN_GF2M_MOD_EXP 132
798 #define BN_F_BN_GF2M_MOD_MUL 133
799 #define BN_F_BN_GF2M_MOD_SOLVE_QUAD 134
800 #define BN_F_BN_GF2M_MOD_SOLVE_QUAD_ARR 135
801 #define BN_F_BN_GF2M_MOD_SQR 136
802 #define BN_F_BN_GF2M_MOD_SQRT 137
803 #define BN_F_BN_MOD_EXP2_MONT 118
804 #define BN_F_BN_MOD_EXP_MONT 109
805 #define BN_F_BN_MOD_EXP_MONT_CONSTTIME 124
806 #define BN_F_BN_MOD_EXP_MONT_WORD 117
807 #define BN_F_BN_MOD_EXP_RECP 125
808 #define BN_F_BN_MOD_EXP_SIMPLE 126
809 #define BN_F_BN_MOD_INVERSE 110
810 #define BN_F_BN_MOD_INVERSE_NO_BRANCH 139
811 #define BN_F_BN_MOD_LSHIFT_QUICK 119
812 #define BN_F_BN_MOD_MUL_RECIPROCAL 111
813 #define BN_F_BN_MOD_SQRT 121
814 #define BN_F_BN_MPI2BN 112
815 #define BN_F_BN_NEW 113
816 #define BN_F_BN_RAND 114
817 #define BN_F_BN_RAND_RANGE 122
818 #define BN_F_BN_USUB 115
821 #define BN_R_ARG2_LT_ARG3 100
822 #define BN_R_BAD_RECIPROCAL 101
823 #define BN_R_BIGNUM_TOO_LONG 114
824 #define BN_R_CALLED_WITH_EVEN_MODULUS 102
825 #define BN_R_DIV_BY_ZERO 103
826 #define BN_R_ENCODING_ERROR 104
827 #define BN_R_EXPAND_ON_STATIC_BIGNUM_DATA 105
828 #define BN_R_INPUT_NOT_REDUCED 110
829 #define BN_R_INVALID_LENGTH 106
830 #define BN_R_INVALID_RANGE 115
831 #define BN_R_NOT_A_SQUARE 111
832 #define BN_R_NOT_INITIALIZED 107
833 #define BN_R_NO_INVERSE 108
834 #define BN_R_NO_SOLUTION 116
835 #define BN_R_P_IS_NOT_PRIME 112
836 #define BN_R_TOO_MANY_ITERATIONS 113
837 #define BN_R_TOO_MANY_TEMPORARY_VARIABLES 109