]> git.ipfire.org Git - thirdparty/openssl.git/blame - crypto/bn/bn.h
projects / thirdparty / openssl.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
Run util/openssl-format-source -v -c .
[thirdparty/openssl.git] / crypto / bn / bn.h
CommitLineData
169cc7a1 1/* crypto/bn/bn.h */
d02b48c6
RE		 2/* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com)
3 * All rights reserved.
4 *
5 * This package is an SSL implementation written
6 * by Eric Young (eay@cryptsoft.com).
7 * The implementation was written so as to conform with Netscapes SSL.
ae5c8664 8 *
d02b48c6
RE		 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).
ae5c8664 15 *
d02b48c6
RE		 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.
ae5c8664 22 *
d02b48c6
RE		 23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
25 * are met:
26 * 1. Redistributions of source code must retain the copyright
27 * notice, this list of conditions and the following disclaimer.
28 * 2. Redistributions in binary form must reproduce the above copyright
29 * notice, this list of conditions and the following disclaimer in the
30 * documentation and/or other materials provided with the distribution.
31 * 3. All advertising materials mentioning features or use of this software
32 * must display the following acknowledgement:
33 * "This product includes cryptographic software written by
34 * Eric Young (eay@cryptsoft.com)"
35 * The word 'cryptographic' can be left out if the rouines from the library
36 * being used are not cryptographic related :-).
ae5c8664 37 * 4. If you include any Windows specific code (or a derivative thereof) from
d02b48c6
RE		 38 * the apps directory (application code) you must include an acknowledgement:
39 * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
ae5c8664 40 *
d02b48c6
RE		 41 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
42 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
43 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
44 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
45 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
46 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
47 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
48 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
49 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
50 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
51 * SUCH DAMAGE.
ae5c8664 52 *
d02b48c6
RE		 53 * The licence and distribution terms for any publically available version or
54 * derivative of this code cannot be changed. i.e. this code cannot simply be
55 * copied and put under another distribution licence
56 * [including the GNU Public Licence.]
57 */
48fc582f
BM		 58/* ====================================================================
59 * Copyright (c) 1998-2006 The OpenSSL Project. All rights reserved.
60 *
61 * Redistribution and use in source and binary forms, with or without
62 * modification, are permitted provided that the following conditions
63 * are met:
64 *
65 * 1. Redistributions of source code must retain the above copyright
ae5c8664 66 * notice, this list of conditions and the following disclaimer.
48fc582f
BM		 67 *
68 * 2. Redistributions in binary form must reproduce the above copyright
69 * notice, this list of conditions and the following disclaimer in
70 * the documentation and/or other materials provided with the
71 * distribution.
72 *
73 * 3. All advertising materials mentioning features or use of this
74 * software must display the following acknowledgment:
75 * "This product includes software developed by the OpenSSL Project
76 * for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
77 *
78 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
79 * endorse or promote products derived from this software without
80 * prior written permission. For written permission, please contact
81 * openssl-core@openssl.org.
82 *
83 * 5. Products derived from this software may not be called "OpenSSL"
84 * nor may "OpenSSL" appear in their names without prior written
85 * permission of the OpenSSL Project.
86 *
87 * 6. Redistributions of any form whatsoever must retain the following
88 * acknowledgment:
89 * "This product includes software developed by the OpenSSL Project
90 * for use in the OpenSSL Toolkit (http://www.openssl.org/)"
91 *
92 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
93 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
94 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
95 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
96 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
97 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
98 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
99 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
100 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
101 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
102 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
103 * OF THE POSSIBILITY OF SUCH DAMAGE.
104 * ====================================================================
105 *
106 * This product includes cryptographic software written by Eric Young
107 * (eay@cryptsoft.com). This product includes software written by Tim
108 * Hudson (tjh@cryptsoft.com).
109 *
110 */
1dc920c8
BM		 111/* ====================================================================
112 * Copyright 2002 Sun Microsystems, Inc. ALL RIGHTS RESERVED.
113 *
ae5c8664 114 * Portions of the attached software ("Contribution") are developed by
1dc920c8
BM		 115 * SUN MICROSYSTEMS, INC., and are contributed to the OpenSSL project.
116 *
117 * The Contribution is licensed pursuant to the Eric Young open source
118 * license provided above.
119 *
ae5c8664 120 * The binary polynomial arithmetic software is originally written by
1dc920c8
BM		 121 * Sheueling Chang Shantz and Douglas Stebila of Sun Microsystems Laboratories.
122 *
123 */
d02b48c6 124
d02b48c6 125#ifndef HEADER_BN_H
ae5c8664 126# define HEADER_BN_H
d02b48c6 127
ae5c8664
MC		 128# include <openssl/e_os2.h>
129# ifndef OPENSSL_NO_FP_API
130# include <stdio.h> /* FILE */
131# endif
132# include <openssl/ossl_typ.h>
133# include <openssl/crypto.h>
8e10f2b3 134
d02b48c6
RE		 135#ifdef __cplusplus
136extern "C" {
137#endif
138
ae5c8664
MC		 139/*
140 * These preprocessor symbols control various aspects of the bignum headers
141 * and library code. They're not defined by any "normal" configuration, as
142 * they are intended for development and testing purposes. NB: defining all
143 * three can be useful for debugging application code as well as openssl
144 * itself. BN_DEBUG - turn on various debugging alterations to the bignum
145 * code BN_DEBUG_RAND - uses random poisoning of unused words to trip up
46cb8d36 146 * mismanagement of bignum internals. You must also define BN_DEBUG.
46cb8d36
GT		 147 */
148/* #define BN_DEBUG */
149/* #define BN_DEBUG_RAND */
46cb8d36 150
ae5c8664
MC		 151# ifndef OPENSSL_SMALL_FOOTPRINT
152# define BN_MUL_COMBA
153# define BN_SQR_COMBA
154# define BN_RECURSION
155# endif
d02b48c6 156
ae5c8664
MC		 157/*
158 * This next option uses the C libraries (2 word)/(1 word) function. If it is
159 * not defined, I use my C version (which is slower). The reason for this
160 * flag is that when the particular C compiler library routine is used, and
161 * the library is linked with a different compiler, the library is missing.
162 * This mostly happens when the library is built with gcc and then linked
163 * using normal cc. This would be a common occurrence because gcc normally
164 * produces code that is 2 times faster than system compilers for the big
165 * number stuff. For machines with only one compiler (or shared libraries),
166 * this should be on. Again this in only really a problem on machines using
167 * "long long's", are 32bit, and are not using my assembler code.
168 */
169# if defined(OPENSSL_SYS_MSDOS) || defined(OPENSSL_SYS_WINDOWS) || \
cf1b7d96 170 defined(OPENSSL_SYS_WIN32) || defined(linux)
ae5c8664
MC		 171# ifndef BN_DIV2W
172# define BN_DIV2W
173# endif
c5d4ab7e 174# endif
d02b48c6 175
ae5c8664
MC		 176/*
177 * assuming long is 64bit - this is the DEC Alpha unsigned long long is only
178 * 64 bits :-(, don't define BN_LLONG for the DEC Alpha
179 */
180# ifdef SIXTY_FOUR_BIT_LONG
181# define BN_ULLONG unsigned long long
182# define BN_ULONG unsigned long
183# define BN_LONG long
184# define BN_BITS 128
185# define BN_BYTES 8
186# define BN_BITS2 64
187# define BN_BITS4 32
188# define BN_MASK (0xffffffffffffffffffffffffffffffffLL)
189# define BN_MASK2 (0xffffffffffffffffL)
190# define BN_MASK2l (0xffffffffL)
191# define BN_MASK2h (0xffffffff00000000L)
192# define BN_MASK2h1 (0xffffffff80000000L)
193# define BN_TBIT (0x8000000000000000L)
194# define BN_DEC_CONV (10000000000000000000UL)
195# define BN_DEC_FMT1 "%lu"
196# define BN_DEC_FMT2 "%019lu"
197# define BN_DEC_NUM 19
198# define BN_HEX_FMT1 "%lX"
199# define BN_HEX_FMT2 "%016lX"
200# endif
d02b48c6 201
ae5c8664
MC		 202/*
203 * This is where the long long data type is 64 bits, but long is 32. For
204 * machines where there are 64bit registers, this is the mode to use. IRIX,
205 * on R4000 and above should use this mode, along with the relevant assembler
206 * code :-). Do NOT define BN_LLONG.
dfeab068 207 */
ae5c8664
MC		 208# ifdef SIXTY_FOUR_BIT
209# undef BN_LLONG
210# undef BN_ULLONG
211# define BN_ULONG unsigned long long
212# define BN_LONG long long
213# define BN_BITS 128
214# define BN_BYTES 8
215# define BN_BITS2 64
216# define BN_BITS4 32
217# define BN_MASK2 (0xffffffffffffffffLL)
218# define BN_MASK2l (0xffffffffL)
219# define BN_MASK2h (0xffffffff00000000LL)
220# define BN_MASK2h1 (0xffffffff80000000LL)
221# define BN_TBIT (0x8000000000000000LL)
222# define BN_DEC_CONV (10000000000000000000ULL)
223# define BN_DEC_FMT1 "%llu"
224# define BN_DEC_FMT2 "%019llu"
225# define BN_DEC_NUM 19
226# define BN_HEX_FMT1 "%llX"
227# define BN_HEX_FMT2 "%016llX"
228# endif
d02b48c6 229
ae5c8664
MC		 230# ifdef THIRTY_TWO_BIT
231# ifdef BN_LLONG
232# if defined(_WIN32) && !defined(__GNUC__)
233# define BN_ULLONG unsigned __int64
234# define BN_MASK (0xffffffffffffffffI64)
235# else
236# define BN_ULLONG unsigned long long
237# define BN_MASK (0xffffffffffffffffLL)
238# endif
239# endif
240# define BN_ULONG unsigned int
241# define BN_LONG int
242# define BN_BITS 64
243# define BN_BYTES 4
244# define BN_BITS2 32
245# define BN_BITS4 16
246# define BN_MASK2 (0xffffffffL)
247# define BN_MASK2l (0xffff)
248# define BN_MASK2h1 (0xffff8000L)
249# define BN_MASK2h (0xffff0000L)
250# define BN_TBIT (0x80000000L)
251# define BN_DEC_CONV (1000000000L)
252# define BN_DEC_FMT1 "%u"
253# define BN_DEC_FMT2 "%09u"
254# define BN_DEC_NUM 9
255# define BN_HEX_FMT1 "%X"
256# define BN_HEX_FMT2 "%08X"
82e8cb40 257# endif
d02b48c6 258
ae5c8664 259# define BN_DEFAULT_BITS 1280
d02b48c6 260
ae5c8664
MC		 261# define BN_FLG_MALLOCED 0x01
262# define BN_FLG_STATIC_DATA 0x02
bd31fb21 263
65a6a1ff
MC		 264/*
265 * avoid leaking exponent information through timing,
266 * BN_mod_exp_mont() will call BN_mod_exp_mont_consttime,
267 * BN_div() will call BN_div_no_branch,
268 * BN_mod_inverse() will call BN_mod_inverse_no_branch.
269 */
ae5c8664 270# define BN_FLG_CONSTTIME 0x04
65a6a1ff 271
ae5c8664 272# ifdef OPENSSL_NO_DEPRECATED
65a6a1ff 273/* deprecated name for the flag */
ae5c8664 274# define BN_FLG_EXP_CONSTTIME BN_FLG_CONSTTIME
65a6a1ff
MC		 275/*
276 * avoid leaking exponent information through timings
277 * (BN_mod_exp_mont() will call BN_mod_exp_mont_consttime)
278 */
ae5c8664 279# endif
bd31fb21 280
ae5c8664
MC		 281# ifndef OPENSSL_NO_DEPRECATED
282# define BN_FLG_FREE 0x8000
283 /* used for debuging */
284# endif
285# define BN_set_flags(b,n) ((b)->flags|=(n))
286# define BN_get_flags(b,n) ((b)->flags&(n))
dfeab068 287
ae5c8664
MC		 288/*
289 * get a clone of a BIGNUM with changed flags, for *temporary* use only (the
290 * two BIGNUMs cannot not be used in parallel!)
291 */
292# define BN_with_flags(dest,b,n) ((dest)->d=(b)->d, \
46a64376
BM		 293 (dest)->top=(b)->top, \
294 (dest)->dmax=(b)->dmax, \
295 (dest)->neg=(b)->neg, \
296 (dest)->flags=(((dest)->flags & BN_FLG_MALLOCED) \
297 | ((b)->flags & ~BN_FLG_MALLOCED) \
298 | BN_FLG_STATIC_DATA \
299 | (n)))
300
d6dda126 301/* Already declared in ossl_typ.h */
ae5c8664 302# if 0
d6dda126
GT		 303typedef struct bignum_st BIGNUM;
304/* Used for temp variables (declaration hidden in bn_lcl.h) */
305typedef struct bignum_ctx BN_CTX;
306typedef struct bn_blinding_st BN_BLINDING;
307typedef struct bn_mont_ctx_st BN_MONT_CTX;
308typedef struct bn_recp_ctx_st BN_RECP_CTX;
309typedef struct bn_gencb_st BN_GENCB;
ae5c8664 310# endif
d6dda126 311
ae5c8664
MC		 312struct bignum_st {
313 BN_ULONG *d; /* Pointer to an array of 'BN_BITS2' bit
314 * chunks. */
315 int top; /* Index of last used d +1. */
316 /* The next are internal book keeping for bn_expand. */
317 int dmax; /* Size of the d array. */
318 int neg; /* one if the number is negative */
319 int flags;
320};
d02b48c6
RE		 321
322/* Used for montgomery multiplication */
ae5c8664
MC		 323struct bn_mont_ctx_st {
324 int ri; /* number of bits in R */
325 BIGNUM RR; /* used to convert to montgomery form */
326 BIGNUM N; /* The modulus */
327 BIGNUM Ni; /* R*(1/R mod N) - N*Ni = 1 (Ni is only
328 * stored for bignum algorithm) */
329 BN_ULONG n0[2]; /* least significant word(s) of Ni; (type
330 * changed with 0.9.9, was "BN_ULONG n0;"
331 * before) */
332 int flags;
333};
334
335/*
336 * Used for reciprocal division/mod functions It cannot be shared between
337 * threads
dfeab068 338 */
ae5c8664
MC		 339struct bn_recp_ctx_st {
340 BIGNUM N; /* the divisor */
341 BIGNUM Nr; /* the reciprocal */
342 int num_bits;
343 int shift;
344 int flags;
345};
dfeab068 346
e9224c71 347/* Used for slow "generation" functions. */
ae5c8664
MC		 348struct bn_gencb_st {
349 unsigned int ver; /* To handle binary (in)compatibility */
350 void *arg; /* callback-specific data */
351 union {
352 /* if(ver==1) - handles old style callbacks */
353 void (*cb_1) (int, int, void *);
354 /* if(ver==2) - new callback style */
355 int (*cb_2) (int, int, BN_GENCB *);
356 } cb;
357};
e9224c71
GT		 358/* Wrapper function to make using BN_GENCB easier, */
359int BN_GENCB_call(BN_GENCB *cb, int a, int b);
e1898724 360/* Macro to populate a BN_GENCB structure with an "old"-style callback */
ae5c8664
MC		 361# define BN_GENCB_set_old(gencb, callback, cb_arg) { \
362 BN_GENCB *tmp_gencb = (gencb); \
363 tmp_gencb->ver = 1; \
364 tmp_gencb->arg = (cb_arg); \
365 tmp_gencb->cb.cb_1 = (callback); }
e1898724 366/* Macro to populate a BN_GENCB structure with a "new"-style callback */
ae5c8664
MC		 367# define BN_GENCB_set(gencb, callback, cb_arg) { \
368 BN_GENCB *tmp_gencb = (gencb); \
369 tmp_gencb->ver = 2; \
370 tmp_gencb->arg = (cb_arg); \
371 tmp_gencb->cb.cb_2 = (callback); }
372
373# define BN_prime_checks 0 /* default: select number of iterations based
374 * on the size of the number */
375
376/*
377 * number of Miller-Rabin iterations for an error rate of less than 2^-80 for
378 * random 'b'-bit input, b >= 100 (taken from table 4.4 in the Handbook of
379 * Applied Cryptography [Menezes, van Oorschot, Vanstone; CRC Press 1996];
380 * original paper: Damgaard, Landrock, Pomerance: Average case error
381 * estimates for the strong probable prime test. -- Math. Comp. 61 (1993)
382 * 177-194)
383 */
384# define BN_prime_checks_for_size(b) ((b) >= 1300 ? 2 : \
38e33cef
UM		 385 (b) >= 850 ? 3 : \
386 (b) >= 650 ? 4 : \
387 (b) >= 550 ? 5 : \
388 (b) >= 450 ? 6 : \
389 (b) >= 400 ? 7 : \
390 (b) >= 350 ? 8 : \
391 (b) >= 300 ? 9 : \
392 (b) >= 250 ? 12 : \
393 (b) >= 200 ? 15 : \
394 (b) >= 150 ? 18 : \
395 /* b >= 100 */ 27)
396
ae5c8664 397# define BN_num_bytes(a) ((BN_num_bits(a)+7)/8)
dcbd0d74 398
23fc5ac6 399/* Note that BN_abs_is_word didn't work reliably for w == 0 until 0.9.8 */
ae5c8664
MC		 400# define BN_abs_is_word(a,w) ((((a)->top == 1) && ((a)->d[0] == (BN_ULONG)(w))) || \
401 (((w) == 0) && ((a)->top == 0)))
402# define BN_is_zero(a) ((a)->top == 0)
403# define BN_is_one(a) (BN_abs_is_word((a),1) && !(a)->neg)
404# define BN_is_word(a,w) (BN_abs_is_word((a),(w)) && (!(w) || !(a)->neg))
405# define BN_is_odd(a) (((a)->top > 0) && ((a)->d[0] & 1))
406
407# define BN_one(a) (BN_set_word((a),1))
408# define BN_zero_ex(a) \
409 do { \
410 BIGNUM *_tmp_bn = (a); \
411 _tmp_bn->top = 0; \
412 _tmp_bn->neg = 0; \
413 } while(0)
414# ifdef OPENSSL_NO_DEPRECATED
415# define BN_zero(a) BN_zero_ex(a)
416# else
417# define BN_zero(a) (BN_set_word((a),0))
418# endif
d02b48c6 419
98499135 420const BIGNUM *BN_value_one(void);
ae5c8664 421char *BN_options(void);
d02b48c6 422BN_CTX *BN_CTX_new(void);
ae5c8664
MC		 423# ifndef OPENSSL_NO_DEPRECATED
424void BN_CTX_init(BN_CTX *c);
425# endif
426void BN_CTX_free(BN_CTX *c);
427void BN_CTX_start(BN_CTX *ctx);
9b141126 428BIGNUM *BN_CTX_get(BN_CTX *ctx);
ae5c8664
MC		 429void BN_CTX_end(BN_CTX *ctx);
430int BN_rand(BIGNUM *rnd, int bits, int top, int bottom);
431int BN_pseudo_rand(BIGNUM *rnd, int bits, int top, int bottom);
432int BN_rand_range(BIGNUM *rnd, const BIGNUM *range);
433int BN_pseudo_rand_range(BIGNUM *rnd, const BIGNUM *range);
434int BN_num_bits(const BIGNUM *a);
435int BN_num_bits_word(BN_ULONG);
d02b48c6 436BIGNUM *BN_new(void);
ae5c8664
MC		 437void BN_init(BIGNUM *);
438void BN_clear_free(BIGNUM *a);
84c15db5 439BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b);
ae5c8664
MC		 440void BN_swap(BIGNUM *a, BIGNUM *b);
441BIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM *ret);
442int BN_bn2bin(const BIGNUM *a, unsigned char *to);
443BIGNUM *BN_mpi2bn(const unsigned char *s, int len, BIGNUM *ret);
444int BN_bn2mpi(const BIGNUM *a, unsigned char *to);
445int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
446int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
447int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
448int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
449int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);
450int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx);
3798cb81
NL		 451/** BN_set_negative sets sign of a BIGNUM
452 * \param b pointer to the BIGNUM object
ae5c8664 453 * \param n 0 if the BIGNUM b should be positive and a value != 0 otherwise
3798cb81 454 */
ae5c8664 455void BN_set_negative(BIGNUM *b, int n);
3798cb81
NL		 456/** BN_is_negative returns 1 if the BIGNUM is negative
457 * \param a pointer to the BIGNUM object
458 * \return 1 if a < 0 and 0 otherwise
459 */
ae5c8664
MC		 460# define BN_is_negative(a) ((a)->neg != 0)
461
462int BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, const BIGNUM *d,
463 BN_CTX *ctx);
464# define BN_mod(rem,m,d,ctx) BN_div(NULL,(rem),(m),(d),(ctx))
465int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx);
466int BN_mod_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
467 BN_CTX *ctx);
468int BN_mod_add_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
469 const BIGNUM *m);
470int BN_mod_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
471 BN_CTX *ctx);
472int BN_mod_sub_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
473 const BIGNUM *m);
474int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
475 BN_CTX *ctx);
476int BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);
477int BN_mod_lshift1(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);
478int BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *m);
479int BN_mod_lshift(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m,
480 BN_CTX *ctx);
481int BN_mod_lshift_quick(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m);
5acaa495 482
7999c65c 483BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w);
dfeab068 484BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w);
ae5c8664
MC		 485int BN_mul_word(BIGNUM *a, BN_ULONG w);
486int BN_add_word(BIGNUM *a, BN_ULONG w);
487int BN_sub_word(BIGNUM *a, BN_ULONG w);
488int BN_set_word(BIGNUM *a, BN_ULONG w);
020fc820 489BN_ULONG BN_get_word(const BIGNUM *a);
5acaa495 490
ae5c8664
MC		 491int BN_cmp(const BIGNUM *a, const BIGNUM *b);
492void BN_free(BIGNUM *a);
493int BN_is_bit_set(const BIGNUM *a, int n);
494int BN_lshift(BIGNUM *r, const BIGNUM *a, int n);
495int BN_lshift1(BIGNUM *r, const BIGNUM *a);
496int BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
497
498int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
499 const BIGNUM *m, BN_CTX *ctx);
500int BN_mod_exp_mont(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
501 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);
46a64376 502int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
ae5c8664
MC		 503 const BIGNUM *m, BN_CTX *ctx,
504 BN_MONT_CTX *in_mont);
505int BN_mod_exp_mont_word(BIGNUM *r, BN_ULONG a, const BIGNUM *p,
506 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);
507int BN_mod_exp2_mont(BIGNUM *r, const BIGNUM *a1, const BIGNUM *p1,
508 const BIGNUM *a2, const BIGNUM *p2, const BIGNUM *m,
509 BN_CTX *ctx, BN_MONT_CTX *m_ctx);
510int BN_mod_exp_simple(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
511 const BIGNUM *m, BN_CTX *ctx);
512
513int BN_mask_bits(BIGNUM *a, int n);
514# ifndef OPENSSL_NO_FP_API
515int BN_print_fp(FILE *fp, const BIGNUM *a);
516# endif
517# ifdef HEADER_BIO_H
518int BN_print(BIO *fp, const BIGNUM *a);
519# else
520int BN_print(void *fp, const BIGNUM *a);
521# endif
522int BN_reciprocal(BIGNUM *r, const BIGNUM *m, int len, BN_CTX *ctx);
523int BN_rshift(BIGNUM *r, const BIGNUM *a, int n);
524int BN_rshift1(BIGNUM *r, const BIGNUM *a);
525void BN_clear(BIGNUM *a);
84c15db5 526BIGNUM *BN_dup(const BIGNUM *a);
ae5c8664
MC		 527int BN_ucmp(const BIGNUM *a, const BIGNUM *b);
528int BN_set_bit(BIGNUM *a, int n);
529int BN_clear_bit(BIGNUM *a, int n);
530char *BN_bn2hex(const BIGNUM *a);
531char *BN_bn2dec(const BIGNUM *a);
532int BN_hex2bn(BIGNUM **a, const char *str);
533int BN_dec2bn(BIGNUM **a, const char *str);
534int BN_asc2bn(BIGNUM **a, const char *str);
535int BN_gcd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);
536int BN_kronecker(const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx); /* returns
537 * -2 for
538 * error */
020fc820 539BIGNUM *BN_mod_inverse(BIGNUM *ret,
ae5c8664 540 const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx);
cd2eebfd 541BIGNUM *BN_mod_sqrt(BIGNUM *ret,
ae5c8664 542 const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx);
e9224c71 543
ae5c8664 544void BN_consttime_swap(BN_ULONG swap, BIGNUM *a, BIGNUM *b, int nwords);
0a9f7780 545
e9224c71 546/* Deprecated versions */
ae5c8664
MC		 547# ifndef OPENSSL_NO_DEPRECATED
548BIGNUM *BN_generate_prime(BIGNUM *ret, int bits, int safe,
549 const BIGNUM *add, const BIGNUM *rem,
550 void (*callback) (int, int, void *), void *cb_arg);
551int BN_is_prime(const BIGNUM *p, int nchecks,
552 void (*callback) (int, int, void *),
553 BN_CTX *ctx, void *cb_arg);
554int BN_is_prime_fasttest(const BIGNUM *p, int nchecks,
555 void (*callback) (int, int, void *), BN_CTX *ctx,
556 void *cb_arg, int do_trial_division);
557# endif /* !defined(OPENSSL_NO_DEPRECATED) */
e9224c71
GT		 558
559/* Newer versions */
ae5c8664
MC		 560int BN_generate_prime_ex(BIGNUM *ret, int bits, int safe, const BIGNUM *add,
561 const BIGNUM *rem, BN_GENCB *cb);
562int BN_is_prime_ex(const BIGNUM *p, int nchecks, BN_CTX *ctx, BN_GENCB *cb);
563int BN_is_prime_fasttest_ex(const BIGNUM *p, int nchecks, BN_CTX *ctx,
564 int do_trial_division, BN_GENCB *cb);
d02b48c6 565
8ed84541
DSH		 566int BN_X931_generate_Xpq(BIGNUM *Xp, BIGNUM *Xq, int nbits, BN_CTX *ctx);
567
568int BN_X931_derive_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2,
ae5c8664
MC		 569 const BIGNUM *Xp, const BIGNUM *Xp1,
570 const BIGNUM *Xp2, const BIGNUM *e, BN_CTX *ctx,
571 BN_GENCB *cb);
572int BN_X931_generate_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2, BIGNUM *Xp1,
573 BIGNUM *Xp2, const BIGNUM *Xp, const BIGNUM *e,
574 BN_CTX *ctx, BN_GENCB *cb);
575
576BN_MONT_CTX *BN_MONT_CTX_new(void);
dfeab068 577void BN_MONT_CTX_init(BN_MONT_CTX *ctx);
ae5c8664
MC		 578int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
579 BN_MONT_CTX *mont, BN_CTX *ctx);
580# define BN_to_montgomery(r,a,mont,ctx) BN_mod_mul_montgomery(\
581 (r),(a),&((mont)->RR),(mont),(ctx))
582int BN_from_montgomery(BIGNUM *r, const BIGNUM *a,
583 BN_MONT_CTX *mont, BN_CTX *ctx);
d02b48c6 584void BN_MONT_CTX_free(BN_MONT_CTX *mont);
ae5c8664
MC		 585int BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *mod, BN_CTX *ctx);
586BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to, BN_MONT_CTX *from);
6ec8e63a 587BN_MONT_CTX *BN_MONT_CTX_set_locked(BN_MONT_CTX **pmont, int lock,
ae5c8664 588 const BIGNUM *mod, BN_CTX *ctx);
d02b48c6 589
800e400d 590/* BN_BLINDING flags */
ae5c8664
MC		 591# define BN_BLINDING_NO_UPDATE 0x00000001
592# define BN_BLINDING_NO_RECREATE 0x00000002
800e400d
NL		 593
594BN_BLINDING *BN_BLINDING_new(const BIGNUM *A, const BIGNUM *Ai, BIGNUM *mod);
58964a49 595void BN_BLINDING_free(BN_BLINDING *b);
ae5c8664 596int BN_BLINDING_update(BN_BLINDING *b, BN_CTX *ctx);
800e400d 597int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
58964a49 598int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
800e400d 599int BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b, BN_CTX *);
ae5c8664
MC		 600int BN_BLINDING_invert_ex(BIGNUM *n, const BIGNUM *r, BN_BLINDING *b,
601 BN_CTX *);
602# ifndef OPENSSL_NO_DEPRECATED
800e400d
NL		 603unsigned long BN_BLINDING_get_thread_id(const BN_BLINDING *);
604void BN_BLINDING_set_thread_id(BN_BLINDING *, unsigned long);
ae5c8664 605# endif
4c329696 606CRYPTO_THREADID *BN_BLINDING_thread_id(BN_BLINDING *);
800e400d
NL		 607unsigned long BN_BLINDING_get_flags(const BN_BLINDING *);
608void BN_BLINDING_set_flags(BN_BLINDING *, unsigned long);
609BN_BLINDING *BN_BLINDING_create_param(BN_BLINDING *b,
ae5c8664
MC		 610 const BIGNUM *e, BIGNUM *m, BN_CTX *ctx,
611 int (*bn_mod_exp) (BIGNUM *r,
612 const BIGNUM *a,
613 const BIGNUM *p,
614 const BIGNUM *m,
615 BN_CTX *ctx,
616 BN_MONT_CTX *m_ctx),
617 BN_MONT_CTX *m_ctx);
618
619# ifndef OPENSSL_NO_DEPRECATED
620void BN_set_params(int mul, int high, int low, int mont);
621int BN_get_params(int which); /* 0, mul, 1 high, 2 low, 3 mont */
622# endif
dfeab068 623
ae5c8664 624void BN_RECP_CTX_init(BN_RECP_CTX *recp);
dfeab068 625BN_RECP_CTX *BN_RECP_CTX_new(void);
ae5c8664
MC		 626void BN_RECP_CTX_free(BN_RECP_CTX *recp);
627int BN_RECP_CTX_set(BN_RECP_CTX *recp, const BIGNUM *rdiv, BN_CTX *ctx);
628int BN_mod_mul_reciprocal(BIGNUM *r, const BIGNUM *x, const BIGNUM *y,
629 BN_RECP_CTX *recp, BN_CTX *ctx);
630int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
631 const BIGNUM *m, BN_CTX *ctx);
632int BN_div_recp(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m,
633 BN_RECP_CTX *recp, BN_CTX *ctx);
634
635# ifndef OPENSSL_NO_EC2M
636
637/*
638 * Functions for arithmetic over binary polynomials represented by BIGNUMs.
b53e44e5 639 * The BIGNUM::neg property of BIGNUMs representing binary polynomials is
ae5c8664
MC		 640 * ignored. Note that input arguments are not const so that their bit arrays
641 * can be expanded to the appropriate size if needed.
1dc920c8 642 */
b53e44e5 643
ae5c8664
MC		 644/*
645 * r = a + b
646 */
647int BN_GF2m_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
648# define BN_GF2m_sub(r, a, b) BN_GF2m_add(r, a, b)
649/*
650 * r=a mod p
651 */
652int BN_GF2m_mod(BIGNUM *r, const BIGNUM *a, const BIGNUM *p);
bc2d623c 653/* r = (a * b) mod p */
ae5c8664
MC		 654int BN_GF2m_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
655 const BIGNUM *p, BN_CTX *ctx);
bc2d623c 656/* r = (a * a) mod p */
ae5c8664 657int BN_GF2m_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
bc2d623c 658/* r = (1 / b) mod p */
ae5c8664 659int BN_GF2m_mod_inv(BIGNUM *r, const BIGNUM *b, const BIGNUM *p, BN_CTX *ctx);
bc2d623c 660/* r = (a / b) mod p */
ae5c8664
MC		 661int BN_GF2m_mod_div(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
662 const BIGNUM *p, BN_CTX *ctx);
bc2d623c 663/* r = (a ^ b) mod p */
ae5c8664
MC		 664int BN_GF2m_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
665 const BIGNUM *p, BN_CTX *ctx);
bc2d623c 666/* r = sqrt(a) mod p */
ae5c8664
MC		 667int BN_GF2m_mod_sqrt(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
668 BN_CTX *ctx);
bc2d623c 669/* r^2 + r = a mod p */
ae5c8664
MC		 670int BN_GF2m_mod_solve_quad(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
671 BN_CTX *ctx);
672# define BN_GF2m_cmp(a, b) BN_ucmp((a), (b))
c695ebe2
MC		 673/*-
674 * Some functions allow for representation of the irreducible polynomials
1dc920c8
BM		 675 * as an unsigned int[], say p. The irreducible f(t) is then of the form:
676 * t^p[0] + t^p[1] + ... + t^p[k]
677 * where m = p[0] > p[1] > ... > p[k] = 0.
678 */
bc2d623c 679/* r = a mod p */
ae5c8664 680int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const int p[]);
bc2d623c 681/* r = (a * b) mod p */
ae5c8664
MC		 682int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
683 const int p[], BN_CTX *ctx);
bc2d623c 684/* r = (a * a) mod p */
ae5c8664
MC		 685int BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const int p[],
686 BN_CTX *ctx);
bc2d623c 687/* r = (1 / b) mod p */
ae5c8664
MC		 688int BN_GF2m_mod_inv_arr(BIGNUM *r, const BIGNUM *b, const int p[],
689 BN_CTX *ctx);
bc2d623c 690/* r = (a / b) mod p */
ae5c8664
MC		 691int BN_GF2m_mod_div_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
692 const int p[], BN_CTX *ctx);
bc2d623c 693/* r = (a ^ b) mod p */
ae5c8664
MC		 694int BN_GF2m_mod_exp_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
695 const int p[], BN_CTX *ctx);
bc2d623c 696/* r = sqrt(a) mod p */
ae5c8664
MC		 697int BN_GF2m_mod_sqrt_arr(BIGNUM *r, const BIGNUM *a,
698 const int p[], BN_CTX *ctx);
bc2d623c 699/* r^2 + r = a mod p */
ae5c8664
MC		 700int BN_GF2m_mod_solve_quad_arr(BIGNUM *r, const BIGNUM *a,
701 const int p[], BN_CTX *ctx);
702int BN_GF2m_poly2arr(const BIGNUM *a, int p[], int max);
703int BN_GF2m_arr2poly(const int p[], BIGNUM *a);
1dc920c8 704
ae5c8664 705# endif
f610a516 706
ae5c8664
MC		 707/*
708 * faster mod functions for the 'NIST primes' 0 <= a < p^2
709 */
5c6bf031
BM		 710int BN_nist_mod_192(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
711int BN_nist_mod_224(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
712int BN_nist_mod_256(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
713int BN_nist_mod_384(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
714int BN_nist_mod_521(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
715
716const BIGNUM *BN_get0_nist_prime_192(void);
717const BIGNUM *BN_get0_nist_prime_224(void);
718const BIGNUM *BN_get0_nist_prime_256(void);
719const BIGNUM *BN_get0_nist_prime_384(void);
720const BIGNUM *BN_get0_nist_prime_521(void);
721
775c63fc
UM		 722/* library internal functions */
723
ae5c8664
MC		 724# define bn_expand(a,bits) ((((((bits+BN_BITS2-1))/BN_BITS2)) <= (a)->dmax)?\
725 (a):bn_expand2((a),(bits+BN_BITS2-1)/BN_BITS2))
726# define bn_wexpand(a,words) (((words) <= (a)->dmax)?(a):bn_expand2((a),(words)))
6343829a 727BIGNUM *bn_expand2(BIGNUM *a, int words);
ae5c8664 728# ifndef OPENSSL_NO_DEPRECATED
6343829a 729BIGNUM *bn_dup_expand(const BIGNUM *a, int words); /* unused */
ae5c8664 730# endif
775c63fc 731
6977c7e2
TH		 732/*-
733 * Bignum consistency macros
d870740c
GT		 734 * There is one "API" macro, bn_fix_top(), for stripping leading zeroes from
735 * bignum data after direct manipulations on the data. There is also an
736 * "internal" macro, bn_check_top(), for verifying that there are no leading
737 * zeroes. Unfortunately, some auditing is required due to the fact that
738 * bn_fix_top() has become an overabused duct-tape because bignum data is
739 * occasionally passed around in an inconsistent state. So the following
740 * changes have been made to sort this out;
741 * - bn_fix_top()s implementation has been moved to bn_correct_top()
742 * - if BN_DEBUG isn't defined, bn_fix_top() maps to bn_correct_top(), and
743 * bn_check_top() is as before.
744 * - if BN_DEBUG *is* defined;
745 * - bn_check_top() tries to pollute unused words even if the bignum 'top' is
746 * consistent. (ed: only if BN_DEBUG_RAND is defined)
747 * - bn_fix_top() maps to bn_check_top() rather than "fixing" anything.
748 * The idea is to have debug builds flag up inconsistent bignums when they
749 * occur. If that occurs in a bn_fix_top(), we examine the code in question; if
750 * the use of bn_fix_top() was appropriate (ie. it follows directly after code
751 * that manipulates the bignum) it is converted to bn_correct_top(), and if it
752 * was not appropriate, we convert it permanently to bn_check_top() and track
753 * down the cause of the bug. Eventually, no internal code should be using the
754 * bn_fix_top() macro. External applications and libraries should try this with
755 * their own code too, both in terms of building against the openssl headers
756 * with BN_DEBUG defined *and* linking with a version of OpenSSL built with it
757 * defined. This not only improves external code, it provides more test
758 * coverage for openssl's own code.
759 */
775c63fc 760
ae5c8664 761# ifdef BN_DEBUG
d870740c
GT		 762
763/* We only need assert() when debugging */
ae5c8664 764# include <assert.h>
d870740c 765
ae5c8664 766# ifdef BN_DEBUG_RAND
d870740c 767/* To avoid "make update" cvs wars due to BN_DEBUG, use some tricks */
ae5c8664
MC		 768# ifndef RAND_pseudo_bytes
769int RAND_pseudo_bytes(unsigned char *buf, int num);
770# define BN_DEBUG_TRIX
771# endif
772# define bn_pollute(a) \
773 do { \
774 const BIGNUM *_bnum1 = (a); \
775 if(_bnum1->top < _bnum1->dmax) { \
776 unsigned char _tmp_char; \
777 /* We cast away const without the compiler knowing, any \
778 * *genuinely* constant variables that aren't mutable \
779 * wouldn't be constructed with top!=dmax. */ \
780 BN_ULONG *_not_const; \
781 memcpy(&_not_const, &_bnum1->d, sizeof(BN_ULONG*)); \
782 RAND_pseudo_bytes(&_tmp_char, 1); \
783 memset((unsigned char *)(_not_const + _bnum1->top), _tmp_char, \
784 (_bnum1->dmax - _bnum1->top) * sizeof(BN_ULONG)); \
785 } \
786 } while(0)
787# ifdef BN_DEBUG_TRIX
788# undef RAND_pseudo_bytes
789# endif
790# else
791# define bn_pollute(a)
792# endif
793# define bn_check_top(a) \
794 do { \
795 const BIGNUM *_bnum2 = (a); \
796 if (_bnum2 != NULL) { \
797 assert((_bnum2->top == 0) || \
798 (_bnum2->d[_bnum2->top - 1] != 0)); \
799 bn_pollute(_bnum2); \
800 } \
801 } while(0)
802
803# define bn_fix_top(a) bn_check_top(a)
804
805# define bn_check_size(bn, bits) bn_wcheck_size(bn, ((bits+BN_BITS2-1))/BN_BITS2)
806# define bn_wcheck_size(bn, words) \
807 do { \
808 const BIGNUM *_bnum2 = (bn); \
809 assert((words) <= (_bnum2)->dmax && (words) >= (_bnum2)->top); \
810 /* avoid unused variable warning with NDEBUG */ \
811 (void)(_bnum2); \
812 } while(0)
813
814# else /* !BN_DEBUG */
815
816# define bn_pollute(a)
817# define bn_check_top(a)
818# define bn_fix_top(a) bn_correct_top(a)
819# define bn_check_size(bn, bits)
820# define bn_wcheck_size(bn, words)
d870740c 821
ae5c8664 822# endif
d870740c 823
ae5c8664 824# define bn_correct_top(a) \
f75abcef
GT		 825 { \
826 BN_ULONG *ftl; \
ae5c8664
MC		 827 int tmp_top = (a)->top; \
828 if (tmp_top > 0) \
829 { \
830 for (ftl= &((a)->d[tmp_top-1]); tmp_top > 0; tmp_top--) \
831 if (*(ftl--)) break; \
832 (a)->top = tmp_top; \
833 } \
834 bn_pollute(a); \
835 }
836
837BN_ULONG bn_mul_add_words(BN_ULONG *rp, const BN_ULONG *ap, int num,
838 BN_ULONG w);
6343829a 839BN_ULONG bn_mul_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w);
ae5c8664 840void bn_sqr_words(BN_ULONG *rp, const BN_ULONG *ap, int num);
775c63fc 841BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d);
ae5c8664
MC		 842BN_ULONG bn_add_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,
843 int num);
844BN_ULONG bn_sub_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,
845 int num);
775c63fc 846
bf3d6c0c 847/* Primes from RFC 2409 */
40a3c123
DSH		 848BIGNUM *get_rfc2409_prime_768(BIGNUM *bn);
849BIGNUM *get_rfc2409_prime_1024(BIGNUM *bn);
bf3d6c0c
BL		 850
851/* Primes from RFC 3526 */
40a3c123
DSH		 852BIGNUM *get_rfc3526_prime_1536(BIGNUM *bn);
853BIGNUM *get_rfc3526_prime_2048(BIGNUM *bn);
854BIGNUM *get_rfc3526_prime_3072(BIGNUM *bn);
855BIGNUM *get_rfc3526_prime_4096(BIGNUM *bn);
856BIGNUM *get_rfc3526_prime_6144(BIGNUM *bn);
857BIGNUM *get_rfc3526_prime_8192(BIGNUM *bn);
bf3d6c0c 858
ae5c8664 859int BN_bntest_rand(BIGNUM *rnd, int bits, int top, int bottom);
111482cf 860
d02b48c6 861/* BEGIN ERROR CODES */
ae5c8664
MC		 862/*
863 * The following lines are auto generated by the script mkerr.pl. Any changes
6d311938
DSH		 864 * made after this point may be overwritten when the script is next run.
865 */
b476df64 866void ERR_load_BN_strings(void);
6d311938 867
d02b48c6
RE		 868/* Error codes for the BN functions. */
869
870/* Function codes. */
ae5c8664
MC		 871# define BN_F_BNRAND 127
872# define BN_F_BN_BLINDING_CONVERT_EX 100
873# define BN_F_BN_BLINDING_CREATE_PARAM 128
874# define BN_F_BN_BLINDING_INVERT_EX 101
875# define BN_F_BN_BLINDING_NEW 102
876# define BN_F_BN_BLINDING_UPDATE 103
877# define BN_F_BN_BN2DEC 104
878# define BN_F_BN_BN2HEX 105
879# define BN_F_BN_CTX_GET 116
880# define BN_F_BN_CTX_NEW 106
881# define BN_F_BN_CTX_START 129
882# define BN_F_BN_DIV 107
883# define BN_F_BN_DIV_NO_BRANCH 138
884# define BN_F_BN_DIV_RECP 130
885# define BN_F_BN_EXP 123
886# define BN_F_BN_EXPAND2 108
887# define BN_F_BN_EXPAND_INTERNAL 120
888# define BN_F_BN_GF2M_MOD 131
889# define BN_F_BN_GF2M_MOD_EXP 132
890# define BN_F_BN_GF2M_MOD_MUL 133
891# define BN_F_BN_GF2M_MOD_SOLVE_QUAD 134
892# define BN_F_BN_GF2M_MOD_SOLVE_QUAD_ARR 135
893# define BN_F_BN_GF2M_MOD_SQR 136
894# define BN_F_BN_GF2M_MOD_SQRT 137
895# define BN_F_BN_MOD_EXP2_MONT 118
896# define BN_F_BN_MOD_EXP_MONT 109
897# define BN_F_BN_MOD_EXP_MONT_CONSTTIME 124
898# define BN_F_BN_MOD_EXP_MONT_WORD 117
899# define BN_F_BN_MOD_EXP_RECP 125
900# define BN_F_BN_MOD_EXP_SIMPLE 126
901# define BN_F_BN_MOD_INVERSE 110
902# define BN_F_BN_MOD_INVERSE_NO_BRANCH 139
903# define BN_F_BN_MOD_LSHIFT_QUICK 119
904# define BN_F_BN_MOD_MUL_RECIPROCAL 111
905# define BN_F_BN_MOD_SQRT 121
906# define BN_F_BN_MPI2BN 112
907# define BN_F_BN_NEW 113
908# define BN_F_BN_RAND 114
909# define BN_F_BN_RAND_RANGE 122
910# define BN_F_BN_USUB 115
d02b48c6
RE		 911
912/* Reason codes. */
ae5c8664
MC		 913# define BN_R_ARG2_LT_ARG3 100
914# define BN_R_BAD_RECIPROCAL 101
915# define BN_R_BIGNUM_TOO_LONG 114
916# define BN_R_CALLED_WITH_EVEN_MODULUS 102
917# define BN_R_DIV_BY_ZERO 103
918# define BN_R_ENCODING_ERROR 104
919# define BN_R_EXPAND_ON_STATIC_BIGNUM_DATA 105
920# define BN_R_INPUT_NOT_REDUCED 110
921# define BN_R_INVALID_LENGTH 106
922# define BN_R_INVALID_RANGE 115
923# define BN_R_NOT_A_SQUARE 111
924# define BN_R_NOT_INITIALIZED 107
925# define BN_R_NO_INVERSE 108
926# define BN_R_NO_SOLUTION 116
927# define BN_R_P_IS_NOT_PRIME 112
928# define BN_R_TOO_MANY_ITERATIONS 113
929# define BN_R_TOO_MANY_TEMPORARY_VARIABLES 109
6d311938 930
d02b48c6
RE		 931#ifdef __cplusplus
932}
933#endif
934#endif
A mirror of the official openssl repository