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.
75 # include <openssl/e_os2.h>
76 # ifndef OPENSSL_NO_FP_API
77 # include <stdio.h> /* FILE */
79 # include <openssl/ossl_typ.h>
86 * These preprocessor symbols control various aspects of the bignum headers
87 * and library code. They're not defined by any "normal" configuration, as
88 * they are intended for development and testing purposes. NB: defining all
89 * three can be useful for debugging application code as well as openssl
90 * itself. BN_DEBUG - turn on various debugging alterations to the bignum
91 * code BN_DEBUG_RAND - uses random poisoning of unused words to trip up
92 * mismanagement of bignum internals. You must also define BN_DEBUG.
94 /* #define BN_DEBUG */
95 /* #define BN_DEBUG_RAND */
102 * This next option uses the C libraries (2 word)/(1 word) function. If it is
103 * not defined, I use my C version (which is slower). The reason for this
104 * flag is that when the particular C compiler library routine is used, and
105 * the library is linked with a different compiler, the library is missing.
106 * This mostly happens when the library is built with gcc and then linked
107 * using normal cc. This would be a common occurrence because gcc normally
108 * produces code that is 2 times faster than system compilers for the big
109 * number stuff. For machines with only one compiler (or shared libraries),
110 * this should be on. Again this in only really a problem on machines using
111 * "long long's", are 32bit, and are not using my assembler code.
113 # if defined(OPENSSL_SYS_MSDOS) || defined(OPENSSL_SYS_WINDOWS) || \
114 defined(OPENSSL_SYS_WIN32) || defined(linux)
121 * assuming long is 64bit - this is the DEC Alpha unsigned long long is only
122 * 64 bits :-(, don't define BN_LLONG for the DEC Alpha
124 # ifdef SIXTY_FOUR_BIT_LONG
125 # define BN_ULLONG unsigned long long
126 # define BN_ULONG unsigned long
127 # define BN_LONG long
132 # define BN_MASK (0xffffffffffffffffffffffffffffffffLL)
133 # define BN_MASK2 (0xffffffffffffffffL)
134 # define BN_MASK2l (0xffffffffL)
135 # define BN_MASK2h (0xffffffff00000000L)
136 # define BN_MASK2h1 (0xffffffff80000000L)
137 # define BN_TBIT (0x8000000000000000L)
138 # define BN_DEC_CONV (10000000000000000000UL)
139 # define BN_DEC_FMT1 "%lu"
140 # define BN_DEC_FMT2 "%019lu"
141 # define BN_DEC_NUM 19
145 * This is where the long long data type is 64 bits, but long is 32. For
146 * machines where there are 64bit registers, this is the mode to use. IRIX,
147 * on R4000 and above should use this mode, along with the relevant assembler
148 * code :-). Do NOT define BN_LLONG.
150 # ifdef SIXTY_FOUR_BIT
153 # define BN_ULONG unsigned long long
154 # define BN_LONG long long
159 # define BN_MASK2 (0xffffffffffffffffLL)
160 # define BN_MASK2l (0xffffffffL)
161 # define BN_MASK2h (0xffffffff00000000LL)
162 # define BN_MASK2h1 (0xffffffff80000000LL)
163 # define BN_TBIT (0x8000000000000000LL)
164 # define BN_DEC_CONV (10000000000000000000ULL)
165 # define BN_DEC_FMT1 "%llu"
166 # define BN_DEC_FMT2 "%019llu"
167 # define BN_DEC_NUM 19
170 # ifdef THIRTY_TWO_BIT
172 # if defined(OPENSSL_SYS_WIN32) && !defined(__GNUC__)
173 # define BN_ULLONG unsigned __int64
175 # define BN_ULLONG unsigned long long
178 # define BN_ULONG unsigned long
179 # define BN_LONG long
184 # ifdef OPENSSL_SYS_WIN32
185 /* VC++ doesn't like the LL suffix */
186 # define BN_MASK (0xffffffffffffffffL)
188 # define BN_MASK (0xffffffffffffffffLL)
190 # define BN_MASK2 (0xffffffffL)
191 # define BN_MASK2l (0xffff)
192 # define BN_MASK2h1 (0xffff8000L)
193 # define BN_MASK2h (0xffff0000L)
194 # define BN_TBIT (0x80000000L)
195 # define BN_DEC_CONV (1000000000L)
196 # define BN_DEC_FMT1 "%lu"
197 # define BN_DEC_FMT2 "%09lu"
198 # define BN_DEC_NUM 9
205 # define BN_ULLONG unsigned long
206 # define BN_ULONG unsigned short
207 # define BN_LONG short
212 # define BN_MASK (0xffffffff)
213 # define BN_MASK2 (0xffff)
214 # define BN_MASK2l (0xff)
215 # define BN_MASK2h1 (0xff80)
216 # define BN_MASK2h (0xff00)
217 # define BN_TBIT (0x8000)
218 # define BN_DEC_CONV (100000)
219 # define BN_DEC_FMT1 "%u"
220 # define BN_DEC_FMT2 "%05u"
221 # define BN_DEC_NUM 5
228 # define BN_ULLONG unsigned short
229 # define BN_ULONG unsigned char
230 # define BN_LONG char
235 # define BN_MASK (0xffff)
236 # define BN_MASK2 (0xff)
237 # define BN_MASK2l (0xf)
238 # define BN_MASK2h1 (0xf8)
239 # define BN_MASK2h (0xf0)
240 # define BN_TBIT (0x80)
241 # define BN_DEC_CONV (100)
242 # define BN_DEC_FMT1 "%u"
243 # define BN_DEC_FMT2 "%02u"
244 # define BN_DEC_NUM 2
247 # define BN_DEFAULT_BITS 1280
249 # define BN_FLG_MALLOCED 0x01
250 # define BN_FLG_STATIC_DATA 0x02
253 * avoid leaking exponent information through timing,
254 * BN_mod_exp_mont() will call BN_mod_exp_mont_consttime,
255 * BN_div() will call BN_div_no_branch,
256 * BN_mod_inverse() will call BN_mod_inverse_no_branch.
258 # define BN_FLG_CONSTTIME 0x04
260 # ifdef OPENSSL_NO_DEPRECATED
261 /* deprecated name for the flag */
262 # define BN_FLG_EXP_CONSTTIME BN_FLG_CONSTTIME
264 * avoid leaking exponent information through timings
265 * (BN_mod_exp_mont() will call BN_mod_exp_mont_consttime)
269 # ifndef OPENSSL_NO_DEPRECATED
270 # define BN_FLG_FREE 0x8000
271 /* used for debuging */
273 # define BN_set_flags(b,n) ((b)->flags|=(n))
274 # define BN_get_flags(b,n) ((b)->flags&(n))
277 * get a clone of a BIGNUM with changed flags, for *temporary* use only (the
278 * two BIGNUMs cannot not be used in parallel!)
280 # define BN_with_flags(dest,b,n) ((dest)->d=(b)->d, \
281 (dest)->top=(b)->top, \
282 (dest)->dmax=(b)->dmax, \
283 (dest)->neg=(b)->neg, \
284 (dest)->flags=(((dest)->flags & BN_FLG_MALLOCED) \
285 | ((b)->flags & ~BN_FLG_MALLOCED) \
286 | BN_FLG_STATIC_DATA \
289 /* Already declared in ossl_typ.h */
291 typedef struct bignum_st BIGNUM;
292 /* Used for temp variables (declaration hidden in bn_lcl.h) */
293 typedef struct bignum_ctx BN_CTX;
294 typedef struct bn_blinding_st BN_BLINDING;
295 typedef struct bn_mont_ctx_st BN_MONT_CTX;
296 typedef struct bn_recp_ctx_st BN_RECP_CTX;
297 typedef struct bn_gencb_st BN_GENCB;
301 BN_ULONG *d; /* Pointer to an array of 'BN_BITS2' bit
303 int top; /* Index of last used d +1. */
304 /* The next are internal book keeping for bn_expand. */
305 int dmax; /* Size of the d array. */
306 int neg; /* one if the number is negative */
310 /* Used for montgomery multiplication */
311 struct bn_mont_ctx_st {
312 int ri; /* number of bits in R */
313 BIGNUM RR; /* used to convert to montgomery form */
314 BIGNUM N; /* The modulus */
315 BIGNUM Ni; /* R*(1/R mod N) - N*Ni = 1 (Ni is only
316 * stored for bignum algorithm) */
318 /* OpenSSL 0.9.9 preview: */
319 BN_ULONG n0[2]; /* least significant word(s) of Ni */
321 BN_ULONG n0; /* least significant word of Ni */
327 * Used for reciprocal division/mod functions It cannot be shared between
330 struct bn_recp_ctx_st {
331 BIGNUM N; /* the divisor */
332 BIGNUM Nr; /* the reciprocal */
338 /* Used for slow "generation" functions. */
340 unsigned int ver; /* To handle binary (in)compatibility */
341 void *arg; /* callback-specific data */
343 /* if(ver==1) - handles old style callbacks */
344 void (*cb_1) (int, int, void *);
345 /* if(ver==2) - new callback style */
346 int (*cb_2) (int, int, BN_GENCB *);
349 /* Wrapper function to make using BN_GENCB easier, */
350 int BN_GENCB_call(BN_GENCB *cb, int a, int b);
351 /* Macro to populate a BN_GENCB structure with an "old"-style callback */
352 # define BN_GENCB_set_old(gencb, callback, cb_arg) { \
353 BN_GENCB *tmp_gencb = (gencb); \
354 tmp_gencb->ver = 1; \
355 tmp_gencb->arg = (cb_arg); \
356 tmp_gencb->cb.cb_1 = (callback); }
357 /* Macro to populate a BN_GENCB structure with a "new"-style callback */
358 # define BN_GENCB_set(gencb, callback, cb_arg) { \
359 BN_GENCB *tmp_gencb = (gencb); \
360 tmp_gencb->ver = 2; \
361 tmp_gencb->arg = (cb_arg); \
362 tmp_gencb->cb.cb_2 = (callback); }
364 # define BN_prime_checks 0 /* default: select number of iterations based
365 * on the size of the number */
368 * number of Miller-Rabin iterations for an error rate of less than 2^-80 for
369 * random 'b'-bit input, b >= 100 (taken from table 4.4 in the Handbook of
370 * Applied Cryptography [Menezes, van Oorschot, Vanstone; CRC Press 1996];
371 * original paper: Damgaard, Landrock, Pomerance: Average case error
372 * estimates for the strong probable prime test. -- Math. Comp. 61 (1993)
375 # define BN_prime_checks_for_size(b) ((b) >= 1300 ? 2 : \
388 # define BN_num_bytes(a) ((BN_num_bits(a)+7)/8)
390 /* Note that BN_abs_is_word didn't work reliably for w == 0 until 0.9.8 */
391 # define BN_abs_is_word(a,w) ((((a)->top == 1) && ((a)->d[0] == (BN_ULONG)(w))) || \
392 (((w) == 0) && ((a)->top == 0)))
393 # define BN_is_zero(a) ((a)->top == 0)
394 # define BN_is_one(a) (BN_abs_is_word((a),1) && !(a)->neg)
395 # define BN_is_word(a,w) (BN_abs_is_word((a),(w)) && (!(w) || !(a)->neg))
396 # define BN_is_odd(a) (((a)->top > 0) && ((a)->d[0] & 1))
398 # define BN_one(a) (BN_set_word((a),1))
399 # define BN_zero_ex(a) \
401 BIGNUM *_tmp_bn = (a); \
405 # ifdef OPENSSL_NO_DEPRECATED
406 # define BN_zero(a) BN_zero_ex(a)
408 # define BN_zero(a) (BN_set_word((a),0))
411 const BIGNUM *BN_value_one(void);
412 char *BN_options(void);
413 BN_CTX *BN_CTX_new(void);
414 # ifndef OPENSSL_NO_DEPRECATED
415 void BN_CTX_init(BN_CTX *c);
417 void BN_CTX_free(BN_CTX *c);
418 void BN_CTX_start(BN_CTX *ctx);
419 BIGNUM *BN_CTX_get(BN_CTX *ctx);
420 void BN_CTX_end(BN_CTX *ctx);
421 int BN_rand(BIGNUM *rnd, int bits, int top, int bottom);
422 int BN_pseudo_rand(BIGNUM *rnd, int bits, int top, int bottom);
423 int BN_rand_range(BIGNUM *rnd, const BIGNUM *range);
424 int BN_pseudo_rand_range(BIGNUM *rnd, const BIGNUM *range);
425 int BN_num_bits(const BIGNUM *a);
426 int BN_num_bits_word(BN_ULONG);
427 BIGNUM *BN_new(void);
428 void BN_init(BIGNUM *);
429 void BN_clear_free(BIGNUM *a);
430 BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b);
431 void BN_swap(BIGNUM *a, BIGNUM *b);
432 BIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM *ret);
433 int BN_bn2bin(const BIGNUM *a, unsigned char *to);
434 BIGNUM *BN_mpi2bn(const unsigned char *s, int len, BIGNUM *ret);
435 int BN_bn2mpi(const BIGNUM *a, unsigned char *to);
436 int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
437 int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
438 int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
439 int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
440 int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);
441 int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx);
442 /** BN_set_negative sets sign of a BIGNUM
443 * \param b pointer to the BIGNUM object
444 * \param n 0 if the BIGNUM b should be positive and a value != 0 otherwise
446 void BN_set_negative(BIGNUM *b, int n);
447 /** BN_is_negative returns 1 if the BIGNUM is negative
448 * \param a pointer to the BIGNUM object
449 * \return 1 if a < 0 and 0 otherwise
451 # define BN_is_negative(a) ((a)->neg != 0)
453 int BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, const BIGNUM *d,
455 # define BN_mod(rem,m,d,ctx) BN_div(NULL,(rem),(m),(d),(ctx))
456 int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx);
457 int BN_mod_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
459 int BN_mod_add_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
461 int BN_mod_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
463 int BN_mod_sub_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
465 int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
467 int BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);
468 int BN_mod_lshift1(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);
469 int BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *m);
470 int BN_mod_lshift(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m,
472 int BN_mod_lshift_quick(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m);
474 BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w);
475 BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w);
476 int BN_mul_word(BIGNUM *a, BN_ULONG w);
477 int BN_add_word(BIGNUM *a, BN_ULONG w);
478 int BN_sub_word(BIGNUM *a, BN_ULONG w);
479 int BN_set_word(BIGNUM *a, BN_ULONG w);
480 BN_ULONG BN_get_word(const BIGNUM *a);
482 int BN_cmp(const BIGNUM *a, const BIGNUM *b);
483 void BN_free(BIGNUM *a);
484 int BN_is_bit_set(const BIGNUM *a, int n);
485 int BN_lshift(BIGNUM *r, const BIGNUM *a, int n);
486 int BN_lshift1(BIGNUM *r, const BIGNUM *a);
487 int BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
489 int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
490 const BIGNUM *m, BN_CTX *ctx);
491 int BN_mod_exp_mont(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
492 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);
493 int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
494 const BIGNUM *m, BN_CTX *ctx,
495 BN_MONT_CTX *in_mont);
496 int BN_mod_exp_mont_word(BIGNUM *r, BN_ULONG a, const BIGNUM *p,
497 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);
498 int BN_mod_exp2_mont(BIGNUM *r, const BIGNUM *a1, const BIGNUM *p1,
499 const BIGNUM *a2, const BIGNUM *p2, const BIGNUM *m,
500 BN_CTX *ctx, BN_MONT_CTX *m_ctx);
501 int BN_mod_exp_simple(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
502 const BIGNUM *m, BN_CTX *ctx);
504 int BN_mask_bits(BIGNUM *a, int n);
505 # ifndef OPENSSL_NO_FP_API
506 int BN_print_fp(FILE *fp, const BIGNUM *a);
509 int BN_print(BIO *fp, const BIGNUM *a);
511 int BN_print(void *fp, const BIGNUM *a);
513 int BN_reciprocal(BIGNUM *r, const BIGNUM *m, int len, BN_CTX *ctx);
514 int BN_rshift(BIGNUM *r, const BIGNUM *a, int n);
515 int BN_rshift1(BIGNUM *r, const BIGNUM *a);
516 void BN_clear(BIGNUM *a);
517 BIGNUM *BN_dup(const BIGNUM *a);
518 int BN_ucmp(const BIGNUM *a, const BIGNUM *b);
519 int BN_set_bit(BIGNUM *a, int n);
520 int BN_clear_bit(BIGNUM *a, int n);
521 char *BN_bn2hex(const BIGNUM *a);
522 char *BN_bn2dec(const BIGNUM *a);
523 int BN_hex2bn(BIGNUM **a, const char *str);
524 int BN_dec2bn(BIGNUM **a, const char *str);
525 int BN_gcd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);
526 int BN_kronecker(const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx); /* returns
529 BIGNUM *BN_mod_inverse(BIGNUM *ret,
530 const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx);
531 BIGNUM *BN_mod_sqrt(BIGNUM *ret,
532 const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx);
534 void BN_consttime_swap(BN_ULONG swap, BIGNUM *a, BIGNUM *b, int nwords);
536 /* Deprecated versions */
537 # ifndef OPENSSL_NO_DEPRECATED
538 BIGNUM *BN_generate_prime(BIGNUM *ret, int bits, int safe,
539 const BIGNUM *add, const BIGNUM *rem,
540 void (*callback) (int, int, void *), void *cb_arg);
541 int BN_is_prime(const BIGNUM *p, int nchecks,
542 void (*callback) (int, int, void *),
543 BN_CTX *ctx, void *cb_arg);
544 int BN_is_prime_fasttest(const BIGNUM *p, int nchecks,
545 void (*callback) (int, int, void *), BN_CTX *ctx,
546 void *cb_arg, int do_trial_division);
547 # endif /* !defined(OPENSSL_NO_DEPRECATED) */
550 int BN_generate_prime_ex(BIGNUM *ret, int bits, int safe, const BIGNUM *add,
551 const BIGNUM *rem, BN_GENCB *cb);
552 int BN_is_prime_ex(const BIGNUM *p, int nchecks, BN_CTX *ctx, BN_GENCB *cb);
553 int BN_is_prime_fasttest_ex(const BIGNUM *p, int nchecks, BN_CTX *ctx,
554 int do_trial_division, BN_GENCB *cb);
556 int BN_X931_generate_Xpq(BIGNUM *Xp, BIGNUM *Xq, int nbits, BN_CTX *ctx);
558 int BN_X931_derive_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2,
559 const BIGNUM *Xp, const BIGNUM *Xp1,
560 const BIGNUM *Xp2, const BIGNUM *e, BN_CTX *ctx,
562 int BN_X931_generate_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2, BIGNUM *Xp1,
563 BIGNUM *Xp2, const BIGNUM *Xp, const BIGNUM *e,
564 BN_CTX *ctx, BN_GENCB *cb);
566 BN_MONT_CTX *BN_MONT_CTX_new(void);
567 void BN_MONT_CTX_init(BN_MONT_CTX *ctx);
568 int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
569 BN_MONT_CTX *mont, BN_CTX *ctx);
570 # define BN_to_montgomery(r,a,mont,ctx) BN_mod_mul_montgomery(\
571 (r),(a),&((mont)->RR),(mont),(ctx))
572 int BN_from_montgomery(BIGNUM *r, const BIGNUM *a,
573 BN_MONT_CTX *mont, BN_CTX *ctx);
574 void BN_MONT_CTX_free(BN_MONT_CTX *mont);
575 int BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *mod, BN_CTX *ctx);
576 BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to, BN_MONT_CTX *from);
577 BN_MONT_CTX *BN_MONT_CTX_set_locked(BN_MONT_CTX **pmont, int lock,
578 const BIGNUM *mod, BN_CTX *ctx);
580 /* BN_BLINDING flags */
581 # define BN_BLINDING_NO_UPDATE 0x00000001
582 # define BN_BLINDING_NO_RECREATE 0x00000002
584 BN_BLINDING *BN_BLINDING_new(const BIGNUM *A, const BIGNUM *Ai, BIGNUM *mod);
585 void BN_BLINDING_free(BN_BLINDING *b);
586 int BN_BLINDING_update(BN_BLINDING *b, BN_CTX *ctx);
587 int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
588 int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
589 int BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b, BN_CTX *);
590 int BN_BLINDING_invert_ex(BIGNUM *n, const BIGNUM *r, BN_BLINDING *b,
592 unsigned long BN_BLINDING_get_thread_id(const BN_BLINDING *);
593 void BN_BLINDING_set_thread_id(BN_BLINDING *, unsigned long);
594 unsigned long BN_BLINDING_get_flags(const BN_BLINDING *);
595 void BN_BLINDING_set_flags(BN_BLINDING *, unsigned long);
596 BN_BLINDING *BN_BLINDING_create_param(BN_BLINDING *b,
597 const BIGNUM *e, BIGNUM *m, BN_CTX *ctx,
598 int (*bn_mod_exp) (BIGNUM *r,
606 # ifndef OPENSSL_NO_DEPRECATED
607 void BN_set_params(int mul, int high, int low, int mont);
608 int BN_get_params(int which); /* 0, mul, 1 high, 2 low, 3 mont */
611 void BN_RECP_CTX_init(BN_RECP_CTX *recp);
612 BN_RECP_CTX *BN_RECP_CTX_new(void);
613 void BN_RECP_CTX_free(BN_RECP_CTX *recp);
614 int BN_RECP_CTX_set(BN_RECP_CTX *recp, const BIGNUM *rdiv, BN_CTX *ctx);
615 int BN_mod_mul_reciprocal(BIGNUM *r, const BIGNUM *x, const BIGNUM *y,
616 BN_RECP_CTX *recp, BN_CTX *ctx);
617 int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
618 const BIGNUM *m, BN_CTX *ctx);
619 int BN_div_recp(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m,
620 BN_RECP_CTX *recp, BN_CTX *ctx);
623 * Functions for arithmetic over binary polynomials represented by BIGNUMs.
624 * The BIGNUM::neg property of BIGNUMs representing binary polynomials is
625 * ignored. Note that input arguments are not const so that their bit arrays
626 * can be expanded to the appropriate size if needed.
632 int BN_GF2m_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
633 # define BN_GF2m_sub(r, a, b) BN_GF2m_add(r, a, b)
637 int BN_GF2m_mod(BIGNUM *r, const BIGNUM *a, const BIGNUM *p);
638 /* r = (a * b) mod p */
639 int BN_GF2m_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
640 const BIGNUM *p, BN_CTX *ctx);
641 /* r = (a * a) mod p */
642 int BN_GF2m_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
643 /* r = (1 / b) mod p */
644 int BN_GF2m_mod_inv(BIGNUM *r, const BIGNUM *b, const BIGNUM *p, BN_CTX *ctx);
645 /* r = (a / b) mod p */
646 int BN_GF2m_mod_div(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
647 const BIGNUM *p, BN_CTX *ctx);
648 /* r = (a ^ b) mod p */
649 int BN_GF2m_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
650 const BIGNUM *p, BN_CTX *ctx);
651 /* r = sqrt(a) mod p */
652 int BN_GF2m_mod_sqrt(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
654 /* r^2 + r = a mod p */
655 int BN_GF2m_mod_solve_quad(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
657 # define BN_GF2m_cmp(a, b) BN_ucmp((a), (b))
659 * Some functions allow for representation of the irreducible polynomials
660 * as an unsigned int[], say p. The irreducible f(t) is then of the form:
661 * t^p[0] + t^p[1] + ... + t^p[k]
662 * where m = p[0] > p[1] > ... > p[k] = 0.
665 int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const unsigned int p[]);
666 /* r = (a * b) mod p */
667 int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
668 const unsigned int p[], BN_CTX *ctx);
669 /* r = (a * a) mod p */
670 int BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const unsigned int p[],
672 /* r = (1 / b) mod p */
673 int BN_GF2m_mod_inv_arr(BIGNUM *r, const BIGNUM *b, const unsigned int p[],
675 /* r = (a / b) mod p */
676 int BN_GF2m_mod_div_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
677 const unsigned int p[], BN_CTX *ctx);
678 /* r = (a ^ b) mod p */
679 int BN_GF2m_mod_exp_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
680 const unsigned int p[], BN_CTX *ctx);
681 /* r = sqrt(a) mod p */
682 int BN_GF2m_mod_sqrt_arr(BIGNUM *r, const BIGNUM *a,
683 const unsigned int p[], BN_CTX *ctx);
684 /* r^2 + r = a mod p */
685 int BN_GF2m_mod_solve_quad_arr(BIGNUM *r, const BIGNUM *a,
686 const unsigned int p[], BN_CTX *ctx);
687 int BN_GF2m_poly2arr(const BIGNUM *a, unsigned int p[], int max);
688 int BN_GF2m_arr2poly(const unsigned int p[], BIGNUM *a);
691 * faster mod functions for the 'NIST primes' 0 <= a < p^2
693 int BN_nist_mod_192(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
694 int BN_nist_mod_224(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
695 int BN_nist_mod_256(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
696 int BN_nist_mod_384(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
697 int BN_nist_mod_521(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
699 const BIGNUM *BN_get0_nist_prime_192(void);
700 const BIGNUM *BN_get0_nist_prime_224(void);
701 const BIGNUM *BN_get0_nist_prime_256(void);
702 const BIGNUM *BN_get0_nist_prime_384(void);
703 const BIGNUM *BN_get0_nist_prime_521(void);
705 /* library internal functions */
707 # define bn_expand(a,bits) ((((((bits+BN_BITS2-1))/BN_BITS2)) <= (a)->dmax)?\
708 (a):bn_expand2((a),(bits+BN_BITS2-1)/BN_BITS2))
709 # define bn_wexpand(a,words) (((words) <= (a)->dmax)?(a):bn_expand2((a),(words)))
710 BIGNUM *bn_expand2(BIGNUM *a, int words);
711 # ifndef OPENSSL_NO_DEPRECATED
712 BIGNUM *bn_dup_expand(const BIGNUM *a, int words); /* unused */
716 * Bignum consistency macros
717 * There is one "API" macro, bn_fix_top(), for stripping leading zeroes from
718 * bignum data after direct manipulations on the data. There is also an
719 * "internal" macro, bn_check_top(), for verifying that there are no leading
720 * zeroes. Unfortunately, some auditing is required due to the fact that
721 * bn_fix_top() has become an overabused duct-tape because bignum data is
722 * occasionally passed around in an inconsistent state. So the following
723 * changes have been made to sort this out;
724 * - bn_fix_top()s implementation has been moved to bn_correct_top()
725 * - if BN_DEBUG isn't defined, bn_fix_top() maps to bn_correct_top(), and
726 * bn_check_top() is as before.
727 * - if BN_DEBUG *is* defined;
728 * - bn_check_top() tries to pollute unused words even if the bignum 'top' is
729 * consistent. (ed: only if BN_DEBUG_RAND is defined)
730 * - bn_fix_top() maps to bn_check_top() rather than "fixing" anything.
731 * The idea is to have debug builds flag up inconsistent bignums when they
732 * occur. If that occurs in a bn_fix_top(), we examine the code in question; if
733 * the use of bn_fix_top() was appropriate (ie. it follows directly after code
734 * that manipulates the bignum) it is converted to bn_correct_top(), and if it
735 * was not appropriate, we convert it permanently to bn_check_top() and track
736 * down the cause of the bug. Eventually, no internal code should be using the
737 * bn_fix_top() macro. External applications and libraries should try this with
738 * their own code too, both in terms of building against the openssl headers
739 * with BN_DEBUG defined *and* linking with a version of OpenSSL built with it
740 * defined. This not only improves external code, it provides more test
741 * coverage for openssl's own code.
746 /* We only need assert() when debugging */
749 # ifdef BN_DEBUG_RAND
750 /* To avoid "make update" cvs wars due to BN_DEBUG, use some tricks */
751 # ifndef RAND_pseudo_bytes
752 int RAND_pseudo_bytes(unsigned char *buf, int num);
753 # define BN_DEBUG_TRIX
755 # define bn_pollute(a) \
757 const BIGNUM *_bnum1 = (a); \
758 if(_bnum1->top < _bnum1->dmax) { \
759 unsigned char _tmp_char; \
760 /* We cast away const without the compiler knowing, any \
761 * *genuinely* constant variables that aren't mutable \
762 * wouldn't be constructed with top!=dmax. */ \
763 BN_ULONG *_not_const; \
764 memcpy(&_not_const, &_bnum1->d, sizeof(BN_ULONG*)); \
765 RAND_pseudo_bytes(&_tmp_char, 1); \
766 memset((unsigned char *)(_not_const + _bnum1->top), _tmp_char, \
767 (_bnum1->dmax - _bnum1->top) * sizeof(BN_ULONG)); \
770 # ifdef BN_DEBUG_TRIX
771 # undef RAND_pseudo_bytes
774 # define bn_pollute(a)
776 # define bn_check_top(a) \
778 const BIGNUM *_bnum2 = (a); \
779 if (_bnum2 != NULL) { \
780 assert((_bnum2->top == 0) || \
781 (_bnum2->d[_bnum2->top - 1] != 0)); \
782 bn_pollute(_bnum2); \
786 # define bn_fix_top(a) bn_check_top(a)
788 # define bn_check_size(bn, bits) bn_wcheck_size(bn, ((bits+BN_BITS2-1))/BN_BITS2)
789 # define bn_wcheck_size(bn, words) \
791 const BIGNUM *_bnum2 = (bn); \
792 assert(words <= (_bnum2)->dmax && words >= (_bnum2)->top); \
795 # else /* !BN_DEBUG */
797 # define bn_pollute(a)
798 # define bn_check_top(a)
799 # define bn_fix_top(a) bn_correct_top(a)
800 # define bn_check_size(bn, bits)
801 # define bn_wcheck_size(bn, words)
805 # define bn_correct_top(a) \
810 for (ftl= &((a)->d[(a)->top-1]); (a)->top > 0; (a)->top--) \
811 if (*(ftl--)) break; \
816 BN_ULONG bn_mul_add_words(BN_ULONG *rp, const BN_ULONG *ap, int num,
818 BN_ULONG bn_mul_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w);
819 void bn_sqr_words(BN_ULONG *rp, const BN_ULONG *ap, int num);
820 BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d);
821 BN_ULONG bn_add_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,
823 BN_ULONG bn_sub_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,
826 /* Primes from RFC 2409 */
827 BIGNUM *get_rfc2409_prime_768(BIGNUM *bn);
828 BIGNUM *get_rfc2409_prime_1024(BIGNUM *bn);
830 /* Primes from RFC 3526 */
831 BIGNUM *get_rfc3526_prime_1536(BIGNUM *bn);
832 BIGNUM *get_rfc3526_prime_2048(BIGNUM *bn);
833 BIGNUM *get_rfc3526_prime_3072(BIGNUM *bn);
834 BIGNUM *get_rfc3526_prime_4096(BIGNUM *bn);
835 BIGNUM *get_rfc3526_prime_6144(BIGNUM *bn);
836 BIGNUM *get_rfc3526_prime_8192(BIGNUM *bn);
838 int BN_bntest_rand(BIGNUM *rnd, int bits, int top, int bottom);
840 /* BEGIN ERROR CODES */
842 * The following lines are auto generated by the script mkerr.pl. Any changes
843 * made after this point may be overwritten when the script is next run.
845 void ERR_load_BN_strings(void);
847 /* Error codes for the BN functions. */
849 /* Function codes. */
850 # define BN_F_BNRAND 127
851 # define BN_F_BN_BLINDING_CONVERT_EX 100
852 # define BN_F_BN_BLINDING_CREATE_PARAM 128
853 # define BN_F_BN_BLINDING_INVERT_EX 101
854 # define BN_F_BN_BLINDING_NEW 102
855 # define BN_F_BN_BLINDING_UPDATE 103
856 # define BN_F_BN_BN2DEC 104
857 # define BN_F_BN_BN2HEX 105
858 # define BN_F_BN_CTX_GET 116
859 # define BN_F_BN_CTX_NEW 106
860 # define BN_F_BN_CTX_START 129
861 # define BN_F_BN_DIV 107
862 # define BN_F_BN_DIV_NO_BRANCH 138
863 # define BN_F_BN_DIV_RECP 130
864 # define BN_F_BN_EXP 123
865 # define BN_F_BN_EXPAND2 108
866 # define BN_F_BN_EXPAND_INTERNAL 120
867 # define BN_F_BN_GF2M_MOD 131
868 # define BN_F_BN_GF2M_MOD_EXP 132
869 # define BN_F_BN_GF2M_MOD_MUL 133
870 # define BN_F_BN_GF2M_MOD_SOLVE_QUAD 134
871 # define BN_F_BN_GF2M_MOD_SOLVE_QUAD_ARR 135
872 # define BN_F_BN_GF2M_MOD_SQR 136
873 # define BN_F_BN_GF2M_MOD_SQRT 137
874 # define BN_F_BN_LSHIFT 145
875 # define BN_F_BN_MOD_EXP2_MONT 118
876 # define BN_F_BN_MOD_EXP_MONT 109
877 # define BN_F_BN_MOD_EXP_MONT_CONSTTIME 124
878 # define BN_F_BN_MOD_EXP_MONT_WORD 117
879 # define BN_F_BN_MOD_EXP_RECP 125
880 # define BN_F_BN_MOD_EXP_SIMPLE 126
881 # define BN_F_BN_MOD_INVERSE 110
882 # define BN_F_BN_MOD_INVERSE_NO_BRANCH 139
883 # define BN_F_BN_MOD_LSHIFT_QUICK 119
884 # define BN_F_BN_MOD_MUL_RECIPROCAL 111
885 # define BN_F_BN_MOD_SQRT 121
886 # define BN_F_BN_MPI2BN 112
887 # define BN_F_BN_NEW 113
888 # define BN_F_BN_RAND 114
889 # define BN_F_BN_RAND_RANGE 122
890 # define BN_F_BN_RSHIFT 146
891 # define BN_F_BN_USUB 115
894 # define BN_R_ARG2_LT_ARG3 100
895 # define BN_R_BAD_RECIPROCAL 101
896 # define BN_R_BIGNUM_TOO_LONG 114
897 # define BN_R_BITS_TOO_SMALL 118
898 # define BN_R_CALLED_WITH_EVEN_MODULUS 102
899 # define BN_R_DIV_BY_ZERO 103
900 # define BN_R_ENCODING_ERROR 104
901 # define BN_R_EXPAND_ON_STATIC_BIGNUM_DATA 105
902 # define BN_R_INPUT_NOT_REDUCED 110
903 # define BN_R_INVALID_LENGTH 106
904 # define BN_R_INVALID_RANGE 115
905 # define BN_R_INVALID_SHIFT 119
906 # define BN_R_NOT_A_SQUARE 111
907 # define BN_R_NOT_INITIALIZED 107
908 # define BN_R_NO_INVERSE 108
909 # define BN_R_NO_SOLUTION 116
910 # define BN_R_P_IS_NOT_PRIME 112
911 # define BN_R_TOO_MANY_ITERATIONS 113
912 # define BN_R_TOO_MANY_TEMPORARY_VARIABLES 109