]> git.ipfire.org Git - thirdparty/openssl.git/blame - include/openssl/bn.h
projects / thirdparty / openssl.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
Stop symlinking, move files to intended directory
[thirdparty/openssl.git] / include / openssl / 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.
0f113f3e 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).
0f113f3e 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.
0f113f3e 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 :-).
0f113f3e 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)"
0f113f3e 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.
0f113f3e 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
0f113f3e 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 *
0f113f3e 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 *
0f113f3e 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
0f113f3e 126# define HEADER_BN_H
d02b48c6 127
0f113f3e
MC		 128# include <openssl/e_os2.h>
129# ifndef OPENSSL_NO_STDIO
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
0f113f3e
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
0f113f3e
MC		 151# ifndef OPENSSL_SMALL_FOOTPRINT
152# define BN_MUL_COMBA
153# define BN_SQR_COMBA
154# define BN_RECURSION
155# endif
d02b48c6 156
0f113f3e
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)
0f113f3e
MC		 171# ifndef BN_DIV2W
172# define BN_DIV2W
173# endif
c5d4ab7e 174# endif
d02b48c6 175
0f113f3e
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
0f113f3e
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 */
0f113f3e
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
0f113f3e
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
0f113f3e 259# define BN_DEFAULT_BITS 1280
d02b48c6 260
0f113f3e
MC		 261# define BN_FLG_MALLOCED 0x01
262# define BN_FLG_STATIC_DATA 0x02
dbd87ffc
MC		 263
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 */
0f113f3e 270# define BN_FLG_CONSTTIME 0x04
bd31fb21 271
0f113f3e 272# ifdef OPENSSL_USE_DEPRECATED
dbd87ffc 273/* deprecated name for the flag */
0f113f3e 274# define BN_FLG_EXP_CONSTTIME BN_FLG_CONSTTIME
dbd87ffc
MC		 275/*
276 * avoid leaking exponent information through timings
277 * (BN_mod_exp_mont() will call BN_mod_exp_mont_consttime)
278 */
0f113f3e 279# endif
bd31fb21 280
0f113f3e
MC		 281# ifdef OPENSSL_USE_DEPRECATED
282# define BN_FLG_FREE 0x8000
283 /* used for debuging */
284# endif
85bcf27c
MC		 285
286void BN_set_flags(BIGNUM *b, int n);
287int BN_get_flags(const BIGNUM *b, int n);
dfeab068 288
0f113f3e
MC		 289/*
290 * get a clone of a BIGNUM with changed flags, for *temporary* use only (the
291 * two BIGNUMs cannot not be used in parallel!)
292 */
85bcf27c
MC		 293void BN_with_flags(BIGNUM *dest, const BIGNUM *b, int n);
294
e9224c71
GT		 295/* Wrapper function to make using BN_GENCB easier, */
296int BN_GENCB_call(BN_GENCB *cb, int a, int b);
85bcf27c
MC		 297
298BN_GENCB *BN_GENCB_new(void);
299void BN_GENCB_free(BN_GENCB *cb);
300
301/* Populate a BN_GENCB structure with an "old"-style callback */
0f113f3e
MC		 302void BN_GENCB_set_old(BN_GENCB *gencb, void (*callback) (int, int, void *),
303 void *cb_arg);
85bcf27c
MC		 304
305/* Populate a BN_GENCB structure with a "new"-style callback */
0f113f3e
MC		 306void BN_GENCB_set(BN_GENCB *gencb, int (*callback) (int, int, BN_GENCB *),
307 void *cb_arg);
85bcf27c
MC		 308
309void *BN_GENCB_get_arg(BN_GENCB *cb);
e9224c71 310
0f113f3e
MC		 311# define BN_prime_checks 0 /* default: select number of iterations based
312 * on the size of the number */
d02b48c6 313
0f113f3e
MC		 314/*
315 * number of Miller-Rabin iterations for an error rate of less than 2^-80 for
316 * random 'b'-bit input, b >= 100 (taken from table 4.4 in the Handbook of
317 * Applied Cryptography [Menezes, van Oorschot, Vanstone; CRC Press 1996];
318 * original paper: Damgaard, Landrock, Pomerance: Average case error
319 * estimates for the strong probable prime test. -- Math. Comp. 61 (1993)
320 * 177-194)
321 */
322# define BN_prime_checks_for_size(b) ((b) >= 1300 ? 2 : \
38e33cef
UM		 323 (b) >= 850 ? 3 : \
324 (b) >= 650 ? 4 : \
325 (b) >= 550 ? 5 : \
326 (b) >= 450 ? 6 : \
327 (b) >= 400 ? 7 : \
328 (b) >= 350 ? 8 : \
329 (b) >= 300 ? 9 : \
330 (b) >= 250 ? 12 : \
331 (b) >= 200 ? 15 : \
332 (b) >= 150 ? 18 : \
333 /* b >= 100 */ 27)
334
0f113f3e 335# define BN_num_bytes(a) ((BN_num_bits(a)+7)/8)
85bcf27c
MC		 336
337int BN_abs_is_word(const BIGNUM *a, const BN_ULONG w);
338int BN_is_zero(const BIGNUM *a);
339int BN_is_one(const BIGNUM *a);
340int BN_is_word(const BIGNUM *a, const BN_ULONG w);
341int BN_is_odd(const BIGNUM *a);
342
0f113f3e 343# define BN_one(a) (BN_set_word((a),1))
85bcf27c
MC		 344
345void BN_zero_ex(BIGNUM *a);
346
0f113f3e
MC		 347# ifndef OPENSSL_USE_DEPRECATED
348# define BN_zero(a) BN_zero_ex(a)
349# else
350# define BN_zero(a) (BN_set_word((a),0))
351# endif
d02b48c6 352
98499135 353const BIGNUM *BN_value_one(void);
0f113f3e 354char *BN_options(void);
d02b48c6 355BN_CTX *BN_CTX_new(void);
0f113f3e
MC		 356void BN_CTX_free(BN_CTX *c);
357void BN_CTX_start(BN_CTX *ctx);
9b141126 358BIGNUM *BN_CTX_get(BN_CTX *ctx);
0f113f3e
MC		 359void BN_CTX_end(BN_CTX *ctx);
360int BN_rand(BIGNUM *rnd, int bits, int top, int bottom);
361int BN_pseudo_rand(BIGNUM *rnd, int bits, int top, int bottom);
362int BN_rand_range(BIGNUM *rnd, const BIGNUM *range);
363int BN_pseudo_rand_range(BIGNUM *rnd, const BIGNUM *range);
364int BN_num_bits(const BIGNUM *a);
365int BN_num_bits_word(BN_ULONG l);
366int BN_security_bits(int L, int N);
d02b48c6 367BIGNUM *BN_new(void);
0f113f3e 368void BN_clear_free(BIGNUM *a);
84c15db5 369BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b);
0f113f3e
MC		 370void BN_swap(BIGNUM *a, BIGNUM *b);
371BIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM *ret);
372int BN_bn2bin(const BIGNUM *a, unsigned char *to);
373BIGNUM *BN_mpi2bn(const unsigned char *s, int len, BIGNUM *ret);
374int BN_bn2mpi(const BIGNUM *a, unsigned char *to);
375int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
376int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
377int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
378int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
379int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);
380int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx);
3798cb81
NL		 381/** BN_set_negative sets sign of a BIGNUM
382 * \param b pointer to the BIGNUM object
0f113f3e 383 * \param n 0 if the BIGNUM b should be positive and a value != 0 otherwise
3798cb81 384 */
0f113f3e 385void BN_set_negative(BIGNUM *b, int n);
3798cb81
NL		 386/** BN_is_negative returns 1 if the BIGNUM is negative
387 * \param a pointer to the BIGNUM object
388 * \return 1 if a < 0 and 0 otherwise
389 */
0f113f3e
MC		 390int BN_is_negative(const BIGNUM *b);
391
392int BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, const BIGNUM *d,
393 BN_CTX *ctx);
394# define BN_mod(rem,m,d,ctx) BN_div(NULL,(rem),(m),(d),(ctx))
395int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx);
396int BN_mod_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
397 BN_CTX *ctx);
398int BN_mod_add_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
399 const BIGNUM *m);
400int BN_mod_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
401 BN_CTX *ctx);
402int BN_mod_sub_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
403 const BIGNUM *m);
404int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
405 BN_CTX *ctx);
406int BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);
407int BN_mod_lshift1(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);
408int BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *m);
409int BN_mod_lshift(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m,
410 BN_CTX *ctx);
411int BN_mod_lshift_quick(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m);
5acaa495 412
7999c65c 413BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w);
dfeab068 414BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w);
0f113f3e
MC		 415int BN_mul_word(BIGNUM *a, BN_ULONG w);
416int BN_add_word(BIGNUM *a, BN_ULONG w);
417int BN_sub_word(BIGNUM *a, BN_ULONG w);
418int BN_set_word(BIGNUM *a, BN_ULONG w);
020fc820 419BN_ULONG BN_get_word(const BIGNUM *a);
5acaa495 420
0f113f3e
MC		 421int BN_cmp(const BIGNUM *a, const BIGNUM *b);
422void BN_free(BIGNUM *a);
423int BN_is_bit_set(const BIGNUM *a, int n);
424int BN_lshift(BIGNUM *r, const BIGNUM *a, int n);
425int BN_lshift1(BIGNUM *r, const BIGNUM *a);
426int BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
427
428int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
429 const BIGNUM *m, BN_CTX *ctx);
430int BN_mod_exp_mont(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
431 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);
46a64376 432int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
0f113f3e
MC		 433 const BIGNUM *m, BN_CTX *ctx,
434 BN_MONT_CTX *in_mont);
435int BN_mod_exp_mont_word(BIGNUM *r, BN_ULONG a, const BIGNUM *p,
436 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);
437int BN_mod_exp2_mont(BIGNUM *r, const BIGNUM *a1, const BIGNUM *p1,
438 const BIGNUM *a2, const BIGNUM *p2, const BIGNUM *m,
439 BN_CTX *ctx, BN_MONT_CTX *m_ctx);
440int BN_mod_exp_simple(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
441 const BIGNUM *m, BN_CTX *ctx);
442
443int BN_mask_bits(BIGNUM *a, int n);
444# ifndef OPENSSL_NO_STDIO
445int BN_print_fp(FILE *fp, const BIGNUM *a);
446# endif
447# ifdef HEADER_BIO_H
448int BN_print(BIO *fp, const BIGNUM *a);
449# else
450int BN_print(void *fp, const BIGNUM *a);
451# endif
452int BN_reciprocal(BIGNUM *r, const BIGNUM *m, int len, BN_CTX *ctx);
453int BN_rshift(BIGNUM *r, const BIGNUM *a, int n);
454int BN_rshift1(BIGNUM *r, const BIGNUM *a);
455void BN_clear(BIGNUM *a);
84c15db5 456BIGNUM *BN_dup(const BIGNUM *a);
0f113f3e
MC		 457int BN_ucmp(const BIGNUM *a, const BIGNUM *b);
458int BN_set_bit(BIGNUM *a, int n);
459int BN_clear_bit(BIGNUM *a, int n);
460char *BN_bn2hex(const BIGNUM *a);
461char *BN_bn2dec(const BIGNUM *a);
462int BN_hex2bn(BIGNUM **a, const char *str);
463int BN_dec2bn(BIGNUM **a, const char *str);
464int BN_asc2bn(BIGNUM **a, const char *str);
465int BN_gcd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);
466int BN_kronecker(const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx); /* returns
467 * -2 for
468 * error */
020fc820 469BIGNUM *BN_mod_inverse(BIGNUM *ret,
0f113f3e 470 const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx);
cd2eebfd 471BIGNUM *BN_mod_sqrt(BIGNUM *ret,
0f113f3e 472 const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx);
e9224c71 473
0f113f3e 474void BN_consttime_swap(BN_ULONG swap, BIGNUM *a, BIGNUM *b, int nwords);
f9b6c0ba 475
e9224c71 476/* Deprecated versions */
0f113f3e
MC		 477# ifdef OPENSSL_USE_DEPRECATED
478DECLARE_DEPRECATED(BIGNUM *BN_generate_prime(BIGNUM *ret, int bits, int safe,
479 const BIGNUM *add,
480 const BIGNUM *rem,
481 void (*callback) (int, int,
482 void *),
483 void *cb_arg));
484DECLARE_DEPRECATED(int
485 BN_is_prime(const BIGNUM *p, int nchecks,
486 void (*callback) (int, int, void *),
487 BN_CTX *ctx, void *cb_arg));
488DECLARE_DEPRECATED(int
489 BN_is_prime_fasttest(const BIGNUM *p, int nchecks,
490 void (*callback) (int, int, void *),
491 BN_CTX *ctx, void *cb_arg,
492 int do_trial_division));
493# endif /* defined(OPENSSL_USE_DEPRECATED) */
e9224c71
GT		 494
495/* Newer versions */
0f113f3e
MC		 496int BN_generate_prime_ex(BIGNUM *ret, int bits, int safe, const BIGNUM *add,
497 const BIGNUM *rem, BN_GENCB *cb);
498int BN_is_prime_ex(const BIGNUM *p, int nchecks, BN_CTX *ctx, BN_GENCB *cb);
499int BN_is_prime_fasttest_ex(const BIGNUM *p, int nchecks, BN_CTX *ctx,
500 int do_trial_division, BN_GENCB *cb);
d02b48c6 501
7b1a0451
DSH		 502int BN_X931_generate_Xpq(BIGNUM *Xp, BIGNUM *Xq, int nbits, BN_CTX *ctx);
503
504int BN_X931_derive_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2,
0f113f3e
MC		 505 const BIGNUM *Xp, const BIGNUM *Xp1,
506 const BIGNUM *Xp2, const BIGNUM *e, BN_CTX *ctx,
507 BN_GENCB *cb);
508int BN_X931_generate_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2, BIGNUM *Xp1,
509 BIGNUM *Xp2, const BIGNUM *Xp, const BIGNUM *e,
510 BN_CTX *ctx, BN_GENCB *cb);
511
512BN_MONT_CTX *BN_MONT_CTX_new(void);
513int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
514 BN_MONT_CTX *mont, BN_CTX *ctx);
515int BN_to_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
516 BN_CTX *ctx);
517int BN_from_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
518 BN_CTX *ctx);
d02b48c6 519void BN_MONT_CTX_free(BN_MONT_CTX *mont);
0f113f3e
MC		 520int BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *mod, BN_CTX *ctx);
521BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to, BN_MONT_CTX *from);
6ec8e63a 522BN_MONT_CTX *BN_MONT_CTX_set_locked(BN_MONT_CTX **pmont, int lock,
0f113f3e 523 const BIGNUM *mod, BN_CTX *ctx);
d02b48c6 524
800e400d 525/* BN_BLINDING flags */
0f113f3e
MC		 526# define BN_BLINDING_NO_UPDATE 0x00000001
527# define BN_BLINDING_NO_RECREATE 0x00000002
800e400d
NL		 528
529BN_BLINDING *BN_BLINDING_new(const BIGNUM *A, const BIGNUM *Ai, BIGNUM *mod);
58964a49 530void BN_BLINDING_free(BN_BLINDING *b);
0f113f3e 531int BN_BLINDING_update(BN_BLINDING *b, BN_CTX *ctx);
800e400d 532int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
58964a49 533int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
800e400d 534int BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b, BN_CTX *);
0f113f3e
MC		 535int BN_BLINDING_invert_ex(BIGNUM *n, const BIGNUM *r, BN_BLINDING *b,
536 BN_CTX *);
537# ifdef OPENSSL_USE_DEPRECATED
538DECLARE_DEPRECATED(unsigned long
539 BN_BLINDING_get_thread_id(const BN_BLINDING *));
540DECLARE_DEPRECATED(void
541 BN_BLINDING_set_thread_id(BN_BLINDING *, unsigned long));
542# endif
4c329696 543CRYPTO_THREADID *BN_BLINDING_thread_id(BN_BLINDING *);
800e400d
NL		 544unsigned long BN_BLINDING_get_flags(const BN_BLINDING *);
545void BN_BLINDING_set_flags(BN_BLINDING *, unsigned long);
546BN_BLINDING *BN_BLINDING_create_param(BN_BLINDING *b,
0f113f3e
MC		 547 const BIGNUM *e, BIGNUM *m, BN_CTX *ctx,
548 int (*bn_mod_exp) (BIGNUM *r,
549 const BIGNUM *a,
550 const BIGNUM *p,
551 const BIGNUM *m,
552 BN_CTX *ctx,
553 BN_MONT_CTX *m_ctx),
554 BN_MONT_CTX *m_ctx);
555
556# ifdef OPENSSL_USE_DEPRECATED
557DECLARE_DEPRECATED(void BN_set_params(int mul, int high, int low, int mont));
558DECLARE_DEPRECATED(int BN_get_params(int which)); /* 0, mul, 1 high, 2 low, 3
559 * mont */
560# endif
dfeab068 561
dfeab068 562BN_RECP_CTX *BN_RECP_CTX_new(void);
0f113f3e
MC		 563void BN_RECP_CTX_free(BN_RECP_CTX *recp);
564int BN_RECP_CTX_set(BN_RECP_CTX *recp, const BIGNUM *rdiv, BN_CTX *ctx);
565int BN_mod_mul_reciprocal(BIGNUM *r, const BIGNUM *x, const BIGNUM *y,
566 BN_RECP_CTX *recp, BN_CTX *ctx);
567int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
568 const BIGNUM *m, BN_CTX *ctx);
569int BN_div_recp(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m,
570 BN_RECP_CTX *recp, BN_CTX *ctx);
571
572# ifndef OPENSSL_NO_EC2M
573
574/*
575 * Functions for arithmetic over binary polynomials represented by BIGNUMs.
b53e44e5 576 * The BIGNUM::neg property of BIGNUMs representing binary polynomials is
0f113f3e
MC		 577 * ignored. Note that input arguments are not const so that their bit arrays
578 * can be expanded to the appropriate size if needed.
1dc920c8 579 */
b53e44e5 580
0f113f3e
MC		 581/*
582 * r = a + b
583 */
584int BN_GF2m_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
585# define BN_GF2m_sub(r, a, b) BN_GF2m_add(r, a, b)
586/*
587 * r=a mod p
588 */
589int BN_GF2m_mod(BIGNUM *r, const BIGNUM *a, const BIGNUM *p);
e636e2ac 590/* r = (a * b) mod p */
0f113f3e
MC		 591int BN_GF2m_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
592 const BIGNUM *p, BN_CTX *ctx);
e636e2ac 593/* r = (a * a) mod p */
0f113f3e 594int BN_GF2m_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
e636e2ac 595/* r = (1 / b) mod p */
0f113f3e 596int BN_GF2m_mod_inv(BIGNUM *r, const BIGNUM *b, const BIGNUM *p, BN_CTX *ctx);
e636e2ac 597/* r = (a / b) mod p */
0f113f3e
MC		 598int BN_GF2m_mod_div(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
599 const BIGNUM *p, BN_CTX *ctx);
e636e2ac 600/* r = (a ^ b) mod p */
0f113f3e
MC		 601int BN_GF2m_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
602 const BIGNUM *p, BN_CTX *ctx);
e636e2ac 603/* r = sqrt(a) mod p */
0f113f3e
MC		 604int BN_GF2m_mod_sqrt(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
605 BN_CTX *ctx);
e636e2ac 606/* r^2 + r = a mod p */
0f113f3e
MC		 607int BN_GF2m_mod_solve_quad(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
608 BN_CTX *ctx);
609# define BN_GF2m_cmp(a, b) BN_ucmp((a), (b))
c80fd6b2
MC		 610/*-
611 * Some functions allow for representation of the irreducible polynomials
1dc920c8
BM		 612 * as an unsigned int[], say p. The irreducible f(t) is then of the form:
613 * t^p[0] + t^p[1] + ... + t^p[k]
614 * where m = p[0] > p[1] > ... > p[k] = 0.
615 */
e636e2ac 616/* r = a mod p */
0f113f3e 617int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const int p[]);
e636e2ac 618/* r = (a * b) mod p */
0f113f3e
MC		 619int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
620 const int p[], BN_CTX *ctx);
e636e2ac 621/* r = (a * a) mod p */
0f113f3e
MC		 622int BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const int p[],
623 BN_CTX *ctx);
e636e2ac 624/* r = (1 / b) mod p */
0f113f3e
MC		 625int BN_GF2m_mod_inv_arr(BIGNUM *r, const BIGNUM *b, const int p[],
626 BN_CTX *ctx);
e636e2ac 627/* r = (a / b) mod p */
0f113f3e
MC		 628int BN_GF2m_mod_div_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
629 const int p[], BN_CTX *ctx);
e636e2ac 630/* r = (a ^ b) mod p */
0f113f3e
MC		 631int BN_GF2m_mod_exp_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
632 const int p[], BN_CTX *ctx);
e636e2ac 633/* r = sqrt(a) mod p */
0f113f3e
MC		 634int BN_GF2m_mod_sqrt_arr(BIGNUM *r, const BIGNUM *a,
635 const int p[], BN_CTX *ctx);
e636e2ac 636/* r^2 + r = a mod p */
0f113f3e
MC		 637int BN_GF2m_mod_solve_quad_arr(BIGNUM *r, const BIGNUM *a,
638 const int p[], BN_CTX *ctx);
639int BN_GF2m_poly2arr(const BIGNUM *a, int p[], int max);
640int BN_GF2m_arr2poly(const int p[], BIGNUM *a);
1dc920c8 641
0f113f3e 642# endif
c9a90645 643
0f113f3e
MC		 644/*
645 * faster mod functions for the 'NIST primes' 0 <= a < p^2
646 */
5c6bf031
BM		 647int BN_nist_mod_192(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
648int BN_nist_mod_224(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
649int BN_nist_mod_256(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
650int BN_nist_mod_384(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
651int BN_nist_mod_521(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
652
653const BIGNUM *BN_get0_nist_prime_192(void);
654const BIGNUM *BN_get0_nist_prime_224(void);
655const BIGNUM *BN_get0_nist_prime_256(void);
656const BIGNUM *BN_get0_nist_prime_384(void);
657const BIGNUM *BN_get0_nist_prime_521(void);
658
0f113f3e
MC		 659int (*BN_nist_mod_func(const BIGNUM *p)) (BIGNUM *r, const BIGNUM *a,
660 const BIGNUM *field, BN_CTX *ctx);
8a99cb29 661
0f113f3e
MC		 662int BN_generate_dsa_nonce(BIGNUM *out, const BIGNUM *range,
663 const BIGNUM *priv, const unsigned char *message,
664 size_t message_len, BN_CTX *ctx);
775c63fc 665
bf3d6c0c 666/* Primes from RFC 2409 */
40a3c123
DSH		 667BIGNUM *get_rfc2409_prime_768(BIGNUM *bn);
668BIGNUM *get_rfc2409_prime_1024(BIGNUM *bn);
bf3d6c0c
BL		 669
670/* Primes from RFC 3526 */
40a3c123
DSH		 671BIGNUM *get_rfc3526_prime_1536(BIGNUM *bn);
672BIGNUM *get_rfc3526_prime_2048(BIGNUM *bn);
673BIGNUM *get_rfc3526_prime_3072(BIGNUM *bn);
674BIGNUM *get_rfc3526_prime_4096(BIGNUM *bn);
675BIGNUM *get_rfc3526_prime_6144(BIGNUM *bn);
676BIGNUM *get_rfc3526_prime_8192(BIGNUM *bn);
bf3d6c0c 677
0f113f3e 678int BN_bntest_rand(BIGNUM *rnd, int bits, int top, int bottom);
85bcf27c 679
d02b48c6 680/* BEGIN ERROR CODES */
0f113f3e
MC		 681/*
682 * The following lines are auto generated by the script mkerr.pl. Any changes
6d311938
DSH		 683 * made after this point may be overwritten when the script is next run.
684 */
b476df64 685void ERR_load_BN_strings(void);
6d311938 686
d02b48c6
RE		 687/* Error codes for the BN functions. */
688
689/* Function codes. */
0f113f3e
MC		 690# define BN_F_BNRAND 127
691# define BN_F_BN_BLINDING_CONVERT_EX 100
692# define BN_F_BN_BLINDING_CREATE_PARAM 128
693# define BN_F_BN_BLINDING_INVERT_EX 101
694# define BN_F_BN_BLINDING_NEW 102
695# define BN_F_BN_BLINDING_UPDATE 103
696# define BN_F_BN_BN2DEC 104
697# define BN_F_BN_BN2HEX 105
698# define BN_F_BN_COMPUTE_WNAF 142
699# define BN_F_BN_CTX_GET 116
700# define BN_F_BN_CTX_NEW 106
701# define BN_F_BN_CTX_START 129
702# define BN_F_BN_DIV 107
703# define BN_F_BN_DIV_NO_BRANCH 138
704# define BN_F_BN_DIV_RECP 130
705# define BN_F_BN_EXP 123
706# define BN_F_BN_EXPAND2 108
707# define BN_F_BN_EXPAND_INTERNAL 120
708# define BN_F_BN_GENCB_NEW 143
709# define BN_F_BN_GENERATE_DSA_NONCE 140
710# define BN_F_BN_GENERATE_PRIME_EX 141
711# define BN_F_BN_GF2M_MOD 131
712# define BN_F_BN_GF2M_MOD_EXP 132
713# define BN_F_BN_GF2M_MOD_MUL 133
714# define BN_F_BN_GF2M_MOD_SOLVE_QUAD 134
715# define BN_F_BN_GF2M_MOD_SOLVE_QUAD_ARR 135
716# define BN_F_BN_GF2M_MOD_SQR 136
717# define BN_F_BN_GF2M_MOD_SQRT 137
718# define BN_F_BN_MOD_EXP2_MONT 118
719# define BN_F_BN_MOD_EXP_MONT 109
720# define BN_F_BN_MOD_EXP_MONT_CONSTTIME 124
721# define BN_F_BN_MOD_EXP_MONT_WORD 117
722# define BN_F_BN_MOD_EXP_RECP 125
723# define BN_F_BN_MOD_EXP_SIMPLE 126
724# define BN_F_BN_MOD_INVERSE 110
725# define BN_F_BN_MOD_INVERSE_NO_BRANCH 139
726# define BN_F_BN_MOD_LSHIFT_QUICK 119
727# define BN_F_BN_MOD_MUL_RECIPROCAL 111
728# define BN_F_BN_MOD_SQRT 121
729# define BN_F_BN_MPI2BN 112
730# define BN_F_BN_NEW 113
731# define BN_F_BN_RAND 114
732# define BN_F_BN_RAND_RANGE 122
733# define BN_F_BN_USUB 115
d02b48c6
RE		 734
735/* Reason codes. */
0f113f3e
MC		 736# define BN_R_ARG2_LT_ARG3 100
737# define BN_R_BAD_RECIPROCAL 101
738# define BN_R_BIGNUM_TOO_LONG 114
739# define BN_R_BITS_TOO_SMALL 118
740# define BN_R_CALLED_WITH_EVEN_MODULUS 102
741# define BN_R_DIV_BY_ZERO 103
742# define BN_R_ENCODING_ERROR 104
743# define BN_R_EXPAND_ON_STATIC_BIGNUM_DATA 105
744# define BN_R_INPUT_NOT_REDUCED 110
745# define BN_R_INVALID_LENGTH 106
746# define BN_R_INVALID_RANGE 115
747# define BN_R_NOT_A_SQUARE 111
748# define BN_R_NOT_INITIALIZED 107
749# define BN_R_NO_INVERSE 108
750# define BN_R_NO_SOLUTION 116
751# define BN_R_PRIVATE_KEY_TOO_LARGE 117
752# define BN_R_P_IS_NOT_PRIME 112
753# define BN_R_TOO_MANY_ITERATIONS 113
754# define BN_R_TOO_MANY_TEMPORARY_VARIABLES 109
6d311938 755
d02b48c6
RE		 756#ifdef __cplusplus
757}
758#endif
759#endif
A mirror of the official openssl repository