]>
Commit | Line | Data |
---|---|---|
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. | |
8 | * | |
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). | |
15 | * | |
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. | |
22 | * | |
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 :-). | |
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)" | |
40 | * | |
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. | |
52 | * | |
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 | */ | |
1dc920c8 BM |
58 | /* ==================================================================== |
59 | * Copyright 2002 Sun Microsystems, Inc. ALL RIGHTS RESERVED. | |
60 | * | |
61 | * Portions of the attached software ("Contribution") are developed by | |
62 | * SUN MICROSYSTEMS, INC., and are contributed to the OpenSSL project. | |
63 | * | |
64 | * The Contribution is licensed pursuant to the Eric Young open source | |
65 | * license provided above. | |
66 | * | |
1dc920c8 BM |
67 | * The binary polynomial arithmetic software is originally written by |
68 | * Sheueling Chang Shantz and Douglas Stebila of Sun Microsystems Laboratories. | |
69 | * | |
70 | */ | |
d02b48c6 | 71 | |
d02b48c6 RE |
72 | #ifndef HEADER_BN_H |
73 | #define HEADER_BN_H | |
74 | ||
a5bc1e85 | 75 | #include <openssl/e_os2.h> |
cf1b7d96 | 76 | #ifndef OPENSSL_NO_FP_API |
2b6405fa BM |
77 | #include <stdio.h> /* FILE */ |
78 | #endif | |
d6dda126 | 79 | #include <openssl/ossl_typ.h> |
8e10f2b3 | 80 | |
d02b48c6 RE |
81 | #ifdef __cplusplus |
82 | extern "C" { | |
83 | #endif | |
84 | ||
46cb8d36 GT |
85 | /* These preprocessor symbols control various aspects of the bignum headers and |
86 | * library code. They're not defined by any "normal" configuration, as they are | |
87 | * intended for development and testing purposes. NB: defining all three can be | |
88 | * useful for debugging application code as well as openssl itself. | |
89 | * | |
90 | * BN_DEBUG - turn on various debugging alterations to the bignum code | |
91 | * BN_DEBUG_RAND - uses random poisoning of unused words to trip up | |
92 | * mismanagement of bignum internals. You must also define BN_DEBUG. | |
46cb8d36 GT |
93 | */ |
94 | /* #define BN_DEBUG */ | |
95 | /* #define BN_DEBUG_RAND */ | |
46cb8d36 | 96 | |
81208130 | 97 | #ifdef OPENSSL_SYS_VMS |
7d7d2cbc UM |
98 | #undef BN_LLONG /* experimental, so far... */ |
99 | #endif | |
100 | ||
dfeab068 RE |
101 | #define BN_MUL_COMBA |
102 | #define BN_SQR_COMBA | |
103 | #define BN_RECURSION | |
d02b48c6 RE |
104 | |
105 | /* This next option uses the C libraries (2 word)/(1 word) function. | |
106 | * If it is not defined, I use my C version (which is slower). | |
107 | * The reason for this flag is that when the particular C compiler | |
108 | * library routine is used, and the library is linked with a different | |
109 | * compiler, the library is missing. This mostly happens when the | |
657e60fa UM |
110 | * library is built with gcc and then linked using normal cc. This would |
111 | * be a common occurrence because gcc normally produces code that is | |
d02b48c6 RE |
112 | * 2 times faster than system compilers for the big number stuff. |
113 | * For machines with only one compiler (or shared libraries), this should | |
114 | * be on. Again this in only really a problem on machines | |
657e60fa | 115 | * using "long long's", are 32bit, and are not using my assembler code. */ |
cf1b7d96 RL |
116 | #if defined(OPENSSL_SYS_MSDOS) || defined(OPENSSL_SYS_WINDOWS) || \ |
117 | defined(OPENSSL_SYS_WIN32) || defined(linux) | |
c5d4ab7e BM |
118 | # ifndef BN_DIV2W |
119 | # define BN_DIV2W | |
120 | # endif | |
d02b48c6 RE |
121 | #endif |
122 | ||
d02b48c6 RE |
123 | /* assuming long is 64bit - this is the DEC Alpha |
124 | * unsigned long long is only 64 bits :-(, don't define | |
125 | * BN_LLONG for the DEC Alpha */ | |
126 | #ifdef SIXTY_FOUR_BIT_LONG | |
127 | #define BN_ULLONG unsigned long long | |
128 | #define BN_ULONG unsigned long | |
129 | #define BN_LONG long | |
130 | #define BN_BITS 128 | |
131 | #define BN_BYTES 8 | |
132 | #define BN_BITS2 64 | |
133 | #define BN_BITS4 32 | |
dfeab068 | 134 | #define BN_MASK (0xffffffffffffffffffffffffffffffffLL) |
d02b48c6 RE |
135 | #define BN_MASK2 (0xffffffffffffffffL) |
136 | #define BN_MASK2l (0xffffffffL) | |
137 | #define BN_MASK2h (0xffffffff00000000L) | |
138 | #define BN_MASK2h1 (0xffffffff80000000L) | |
139 | #define BN_TBIT (0x8000000000000000L) | |
dfeab068 | 140 | #define BN_DEC_CONV (10000000000000000000UL) |
58964a49 RE |
141 | #define BN_DEC_FMT1 "%lu" |
142 | #define BN_DEC_FMT2 "%019lu" | |
143 | #define BN_DEC_NUM 19 | |
d02b48c6 RE |
144 | #endif |
145 | ||
dfeab068 RE |
146 | /* This is where the long long data type is 64 bits, but long is 32. |
147 | * For machines where there are 64bit registers, this is the mode to use. | |
657e60fa UM |
148 | * IRIX, on R4000 and above should use this mode, along with the relevant |
149 | * assembler code :-). Do NOT define BN_LLONG. | |
dfeab068 | 150 | */ |
d02b48c6 | 151 | #ifdef SIXTY_FOUR_BIT |
e14d4443 UM |
152 | #undef BN_LLONG |
153 | #undef BN_ULLONG | |
d02b48c6 RE |
154 | #define BN_ULONG unsigned long long |
155 | #define BN_LONG long long | |
156 | #define BN_BITS 128 | |
157 | #define BN_BYTES 8 | |
158 | #define BN_BITS2 64 | |
159 | #define BN_BITS4 32 | |
160 | #define BN_MASK2 (0xffffffffffffffffLL) | |
161 | #define BN_MASK2l (0xffffffffL) | |
162 | #define BN_MASK2h (0xffffffff00000000LL) | |
163 | #define BN_MASK2h1 (0xffffffff80000000LL) | |
164 | #define BN_TBIT (0x8000000000000000LL) | |
2f9cf160 | 165 | #define BN_DEC_CONV (10000000000000000000ULL) |
dfeab068 RE |
166 | #define BN_DEC_FMT1 "%llu" |
167 | #define BN_DEC_FMT2 "%019llu" | |
58964a49 | 168 | #define BN_DEC_NUM 19 |
d02b48c6 RE |
169 | #endif |
170 | ||
171 | #ifdef THIRTY_TWO_BIT | |
cf1b7d96 | 172 | #if defined(OPENSSL_SYS_WIN32) && !defined(__GNUC__) |
d02b48c6 RE |
173 | #define BN_ULLONG unsigned _int64 |
174 | #else | |
175 | #define BN_ULLONG unsigned long long | |
176 | #endif | |
177 | #define BN_ULONG unsigned long | |
178 | #define BN_LONG long | |
179 | #define BN_BITS 64 | |
180 | #define BN_BYTES 4 | |
181 | #define BN_BITS2 32 | |
182 | #define BN_BITS4 16 | |
cf1b7d96 | 183 | #ifdef OPENSSL_SYS_WIN32 |
9b3086fe DSH |
184 | /* VC++ doesn't like the LL suffix */ |
185 | #define BN_MASK (0xffffffffffffffffL) | |
186 | #else | |
dfeab068 | 187 | #define BN_MASK (0xffffffffffffffffLL) |
9b3086fe | 188 | #endif |
d02b48c6 RE |
189 | #define BN_MASK2 (0xffffffffL) |
190 | #define BN_MASK2l (0xffff) | |
191 | #define BN_MASK2h1 (0xffff8000L) | |
192 | #define BN_MASK2h (0xffff0000L) | |
193 | #define BN_TBIT (0x80000000L) | |
58964a49 RE |
194 | #define BN_DEC_CONV (1000000000L) |
195 | #define BN_DEC_FMT1 "%lu" | |
196 | #define BN_DEC_FMT2 "%09lu" | |
197 | #define BN_DEC_NUM 9 | |
d02b48c6 RE |
198 | #endif |
199 | ||
200 | #ifdef SIXTEEN_BIT | |
201 | #ifndef BN_DIV2W | |
202 | #define BN_DIV2W | |
203 | #endif | |
204 | #define BN_ULLONG unsigned long | |
205 | #define BN_ULONG unsigned short | |
206 | #define BN_LONG short | |
207 | #define BN_BITS 32 | |
208 | #define BN_BYTES 2 | |
209 | #define BN_BITS2 16 | |
210 | #define BN_BITS4 8 | |
dfeab068 | 211 | #define BN_MASK (0xffffffff) |
d02b48c6 RE |
212 | #define BN_MASK2 (0xffff) |
213 | #define BN_MASK2l (0xff) | |
214 | #define BN_MASK2h1 (0xff80) | |
215 | #define BN_MASK2h (0xff00) | |
216 | #define BN_TBIT (0x8000) | |
58964a49 RE |
217 | #define BN_DEC_CONV (100000) |
218 | #define BN_DEC_FMT1 "%u" | |
219 | #define BN_DEC_FMT2 "%05u" | |
220 | #define BN_DEC_NUM 5 | |
d02b48c6 RE |
221 | #endif |
222 | ||
223 | #ifdef EIGHT_BIT | |
224 | #ifndef BN_DIV2W | |
225 | #define BN_DIV2W | |
226 | #endif | |
227 | #define BN_ULLONG unsigned short | |
228 | #define BN_ULONG unsigned char | |
229 | #define BN_LONG char | |
230 | #define BN_BITS 16 | |
231 | #define BN_BYTES 1 | |
232 | #define BN_BITS2 8 | |
233 | #define BN_BITS4 4 | |
dfeab068 | 234 | #define BN_MASK (0xffff) |
d02b48c6 RE |
235 | #define BN_MASK2 (0xff) |
236 | #define BN_MASK2l (0xf) | |
237 | #define BN_MASK2h1 (0xf8) | |
238 | #define BN_MASK2h (0xf0) | |
239 | #define BN_TBIT (0x80) | |
58964a49 RE |
240 | #define BN_DEC_CONV (100) |
241 | #define BN_DEC_FMT1 "%u" | |
242 | #define BN_DEC_FMT2 "%02u" | |
243 | #define BN_DEC_NUM 2 | |
d02b48c6 RE |
244 | #endif |
245 | ||
246 | #define BN_DEFAULT_BITS 1280 | |
247 | ||
dfeab068 RE |
248 | #define BN_FLG_MALLOCED 0x01 |
249 | #define BN_FLG_STATIC_DATA 0x02 | |
2ae1ea37 | 250 | #ifndef OPENSSL_NO_DEPRECATED |
dfeab068 | 251 | #define BN_FLG_FREE 0x8000 /* used for debuging */ |
2ae1ea37 | 252 | #endif |
dfeab068 RE |
253 | #define BN_set_flags(b,n) ((b)->flags|=(n)) |
254 | #define BN_get_flags(b,n) ((b)->flags&(n)) | |
255 | ||
d6dda126 GT |
256 | /* Already declared in ossl_typ.h */ |
257 | #if 0 | |
258 | typedef struct bignum_st BIGNUM; | |
259 | /* Used for temp variables (declaration hidden in bn_lcl.h) */ | |
260 | typedef struct bignum_ctx BN_CTX; | |
261 | typedef struct bn_blinding_st BN_BLINDING; | |
262 | typedef struct bn_mont_ctx_st BN_MONT_CTX; | |
263 | typedef struct bn_recp_ctx_st BN_RECP_CTX; | |
264 | typedef struct bn_gencb_st BN_GENCB; | |
265 | #endif | |
266 | ||
267 | struct bignum_st | |
d02b48c6 RE |
268 | { |
269 | BN_ULONG *d; /* Pointer to an array of 'BN_BITS2' bit chunks. */ | |
270 | int top; /* Index of last used d +1. */ | |
271 | /* The next are internal book keeping for bn_expand. */ | |
2d978cbd | 272 | int dmax; /* Size of the d array. */ |
d02b48c6 | 273 | int neg; /* one if the number is negative */ |
dfeab068 | 274 | int flags; |
d6dda126 | 275 | }; |
d02b48c6 RE |
276 | |
277 | /* Used for montgomery multiplication */ | |
d6dda126 | 278 | struct bn_mont_ctx_st |
e93f9a32 | 279 | { |
e93f9a32 UM |
280 | int ri; /* number of bits in R */ |
281 | BIGNUM RR; /* used to convert to montgomery form */ | |
282 | BIGNUM N; /* The modulus */ | |
ec1258dd BM |
283 | BIGNUM Ni; /* R*(1/R mod N) - N*Ni = 1 |
284 | * (Ni is only stored for bignum algorithm) */ | |
285 | BN_ULONG n0; /* least significant word of Ni */ | |
dfeab068 | 286 | int flags; |
d6dda126 | 287 | }; |
d02b48c6 | 288 | |
dfeab068 RE |
289 | /* Used for reciprocal division/mod functions |
290 | * It cannot be shared between threads | |
291 | */ | |
d6dda126 | 292 | struct bn_recp_ctx_st |
dfeab068 RE |
293 | { |
294 | BIGNUM N; /* the divisor */ | |
295 | BIGNUM Nr; /* the reciprocal */ | |
296 | int num_bits; | |
297 | int shift; | |
298 | int flags; | |
d6dda126 | 299 | }; |
dfeab068 | 300 | |
e9224c71 | 301 | /* Used for slow "generation" functions. */ |
e9224c71 GT |
302 | struct bn_gencb_st |
303 | { | |
304 | unsigned int ver; /* To handle binary (in)compatibility */ | |
305 | void *arg; /* callback-specific data */ | |
306 | union | |
307 | { | |
308 | /* if(ver==1) - handles old style callbacks */ | |
309 | void (*cb_1)(int, int, void *); | |
310 | /* if(ver==2) - new callback style */ | |
311 | int (*cb_2)(int, int, BN_GENCB *); | |
e1898724 | 312 | } cb; |
e9224c71 GT |
313 | }; |
314 | /* Wrapper function to make using BN_GENCB easier, */ | |
315 | int BN_GENCB_call(BN_GENCB *cb, int a, int b); | |
e1898724 GT |
316 | /* Macro to populate a BN_GENCB structure with an "old"-style callback */ |
317 | #define BN_GENCB_set_old(gencb, callback, cb_arg) { \ | |
318 | BN_GENCB *tmp_gencb = (gencb); \ | |
319 | tmp_gencb->ver = 1; \ | |
320 | tmp_gencb->arg = (cb_arg); \ | |
321 | tmp_gencb->cb.cb_1 = (callback); } | |
322 | /* Macro to populate a BN_GENCB structure with a "new"-style callback */ | |
323 | #define BN_GENCB_set(gencb, callback, cb_arg) { \ | |
324 | BN_GENCB *tmp_gencb = (gencb); \ | |
325 | tmp_gencb->ver = 2; \ | |
326 | tmp_gencb->arg = (cb_arg); \ | |
327 | tmp_gencb->cb.cb_2 = (callback); } | |
e9224c71 | 328 | |
4486d0cd UM |
329 | #define BN_prime_checks 0 /* default: select number of iterations |
330 | based on the size of the number */ | |
d02b48c6 | 331 | |
38e33cef UM |
332 | /* number of Miller-Rabin iterations for an error rate of less than 2^-80 |
333 | * for random 'b'-bit input, b >= 100 (taken from table 4.4 in the Handbook | |
334 | * of Applied Cryptography [Menezes, van Oorschot, Vanstone; CRC Press 1996]; | |
335 | * original paper: Damgaard, Landrock, Pomerance: Average case error estimates | |
336 | * for the strong probable prime test. -- Math. Comp. 61 (1993) 177-194) */ | |
a87030a1 | 337 | #define BN_prime_checks_for_size(b) ((b) >= 1300 ? 2 : \ |
38e33cef UM |
338 | (b) >= 850 ? 3 : \ |
339 | (b) >= 650 ? 4 : \ | |
340 | (b) >= 550 ? 5 : \ | |
341 | (b) >= 450 ? 6 : \ | |
342 | (b) >= 400 ? 7 : \ | |
343 | (b) >= 350 ? 8 : \ | |
344 | (b) >= 300 ? 9 : \ | |
345 | (b) >= 250 ? 12 : \ | |
346 | (b) >= 200 ? 15 : \ | |
347 | (b) >= 150 ? 18 : \ | |
348 | /* b >= 100 */ 27) | |
349 | ||
d02b48c6 | 350 | #define BN_num_bytes(a) ((BN_num_bits(a)+7)/8) |
dcbd0d74 | 351 | |
23fc5ac6 GT |
352 | /* Note that BN_abs_is_word didn't work reliably for w == 0 until 0.9.8 */ |
353 | #define BN_abs_is_word(a,w) ((((a)->top == 1) && ((a)->d[0] == (BN_ULONG)(w))) || \ | |
354 | (((w) == 0) && ((a)->top == 0))) | |
46cb8d36 | 355 | #define BN_is_zero(a) ((a)->top == 0) |
dcbd0d74 | 356 | #define BN_is_one(a) (BN_abs_is_word((a),1) && !(a)->neg) |
23fc5ac6 | 357 | #define BN_is_word(a,w) (BN_abs_is_word((a),(w)) && (!(w) || !(a)->neg)) |
dcbd0d74 BM |
358 | #define BN_is_odd(a) (((a)->top > 0) && ((a)->d[0] & 1)) |
359 | ||
d02b48c6 | 360 | #define BN_one(a) (BN_set_word((a),1)) |
5d735465 GT |
361 | #define BN_zero_ex(a) \ |
362 | do { \ | |
363 | BIGNUM *_tmp_bn = (a); \ | |
364 | _tmp_bn->top = 0; \ | |
365 | _tmp_bn->neg = 0; \ | |
366 | } while(0) | |
367 | #ifdef OPENSSL_NO_DEPRECATED | |
368 | #define BN_zero(a) BN_zero_ex(a) | |
369 | #else | |
d02b48c6 | 370 | #define BN_zero(a) (BN_set_word((a),0)) |
5d735465 | 371 | #endif |
d02b48c6 | 372 | |
98499135 | 373 | const BIGNUM *BN_value_one(void); |
d02b48c6 RE |
374 | char * BN_options(void); |
375 | BN_CTX *BN_CTX_new(void); | |
2ce90b9b | 376 | #ifndef OPENSSL_NO_DEPRECATED |
dfeab068 | 377 | void BN_CTX_init(BN_CTX *c); |
2ce90b9b | 378 | #endif |
d02b48c6 | 379 | void BN_CTX_free(BN_CTX *c); |
9b141126 UM |
380 | void BN_CTX_start(BN_CTX *ctx); |
381 | BIGNUM *BN_CTX_get(BN_CTX *ctx); | |
382 | void BN_CTX_end(BN_CTX *ctx); | |
d02b48c6 | 383 | int BN_rand(BIGNUM *rnd, int bits, int top,int bottom); |
f95a9f67 | 384 | int BN_pseudo_rand(BIGNUM *rnd, int bits, int top,int bottom); |
e3068929 | 385 | int BN_rand_range(BIGNUM *rnd, BIGNUM *range); |
983495c4 | 386 | int BN_pseudo_rand_range(BIGNUM *rnd, BIGNUM *range); |
84c15db5 | 387 | int BN_num_bits(const BIGNUM *a); |
d02b48c6 RE |
388 | int BN_num_bits_word(BN_ULONG); |
389 | BIGNUM *BN_new(void); | |
dfeab068 | 390 | void BN_init(BIGNUM *); |
d02b48c6 | 391 | void BN_clear_free(BIGNUM *a); |
84c15db5 | 392 | BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b); |
5c6bf031 BM |
393 | /* BN_ncopy(): like BN_copy() but copies at most the first n BN_ULONGs */ |
394 | BIGNUM *BN_ncopy(BIGNUM *a, const BIGNUM *b, size_t n); | |
78a0c1f1 | 395 | void BN_swap(BIGNUM *a, BIGNUM *b); |
61f5b6f3 | 396 | BIGNUM *BN_bin2bn(const unsigned char *s,int len,BIGNUM *ret); |
8623f693 | 397 | int BN_bn2bin(const BIGNUM *a, unsigned char *to); |
cbd48ba6 | 398 | BIGNUM *BN_mpi2bn(const unsigned char *s,int len,BIGNUM *ret); |
8623f693 | 399 | int BN_bn2mpi(const BIGNUM *a, unsigned char *to); |
84c15db5 BL |
400 | int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); |
401 | int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); | |
402 | int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); | |
dd8dec69 | 403 | int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); |
020fc820 RL |
404 | int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx); |
405 | int BN_sqr(BIGNUM *r, const BIGNUM *a,BN_CTX *ctx); | |
ff22e913 NL |
406 | /* BN_set_negative(): sets sign of a bignum */ |
407 | void BN_set_negative(BIGNUM *b, int n); | |
408 | /* BN_get_negative(): returns 1 if the bignum is < 0 and 0 otherwise */ | |
409 | #define BN_is_negative(a) ((a)->neg != 0) | |
5acaa495 | 410 | |
78a0c1f1 BM |
411 | int BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, const BIGNUM *d, |
412 | BN_CTX *ctx); | |
413 | #define BN_mod(rem,m,d,ctx) BN_div(NULL,(rem),(m),(d),(ctx)) | |
5acaa495 BM |
414 | int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx); |
415 | int BN_mod_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m, BN_CTX *ctx); | |
416 | int BN_mod_add_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m); | |
417 | int BN_mod_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m, BN_CTX *ctx); | |
418 | int BN_mod_sub_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m); | |
419 | int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, | |
78a0c1f1 | 420 | const BIGNUM *m, BN_CTX *ctx); |
cd2eebfd | 421 | int BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx); |
5acaa495 BM |
422 | int BN_mod_lshift1(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx); |
423 | int BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *m); | |
424 | int BN_mod_lshift(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m, BN_CTX *ctx); | |
425 | int BN_mod_lshift_quick(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m); | |
426 | ||
7999c65c | 427 | BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w); |
dfeab068 RE |
428 | BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w); |
429 | int BN_mul_word(BIGNUM *a, BN_ULONG w); | |
430 | int BN_add_word(BIGNUM *a, BN_ULONG w); | |
431 | int BN_sub_word(BIGNUM *a, BN_ULONG w); | |
432 | int BN_set_word(BIGNUM *a, BN_ULONG w); | |
020fc820 | 433 | BN_ULONG BN_get_word(const BIGNUM *a); |
5acaa495 | 434 | |
84c15db5 | 435 | int BN_cmp(const BIGNUM *a, const BIGNUM *b); |
d02b48c6 | 436 | void BN_free(BIGNUM *a); |
84c15db5 BL |
437 | int BN_is_bit_set(const BIGNUM *a, int n); |
438 | int BN_lshift(BIGNUM *r, const BIGNUM *a, int n); | |
020fc820 RL |
439 | int BN_lshift1(BIGNUM *r, const BIGNUM *a); |
440 | int BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,BN_CTX *ctx); | |
5acaa495 | 441 | |
020fc820 RL |
442 | int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, |
443 | const BIGNUM *m,BN_CTX *ctx); | |
444 | int BN_mod_exp_mont(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, | |
445 | const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx); | |
6dad7bd6 | 446 | int BN_mod_exp_mont_word(BIGNUM *r, BN_ULONG a, const BIGNUM *p, |
020fc820 RL |
447 | const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx); |
448 | int BN_mod_exp2_mont(BIGNUM *r, const BIGNUM *a1, const BIGNUM *p1, | |
449 | const BIGNUM *a2, const BIGNUM *p2,const BIGNUM *m, | |
450 | BN_CTX *ctx,BN_MONT_CTX *m_ctx); | |
451 | int BN_mod_exp_simple(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, | |
452 | const BIGNUM *m,BN_CTX *ctx); | |
5acaa495 | 453 | |
d02b48c6 | 454 | int BN_mask_bits(BIGNUM *a,int n); |
cf1b7d96 | 455 | #ifndef OPENSSL_NO_FP_API |
e93f9a32 | 456 | int BN_print_fp(FILE *fp, const BIGNUM *a); |
d02b48c6 RE |
457 | #endif |
458 | #ifdef HEADER_BIO_H | |
8d8a8041 | 459 | int BN_print(BIO *fp, const BIGNUM *a); |
d02b48c6 | 460 | #else |
775c63fc | 461 | int BN_print(void *fp, const BIGNUM *a); |
d02b48c6 | 462 | #endif |
020fc820 RL |
463 | int BN_reciprocal(BIGNUM *r, const BIGNUM *m, int len, BN_CTX *ctx); |
464 | int BN_rshift(BIGNUM *r, const BIGNUM *a, int n); | |
465 | int BN_rshift1(BIGNUM *r, const BIGNUM *a); | |
d02b48c6 | 466 | void BN_clear(BIGNUM *a); |
84c15db5 BL |
467 | BIGNUM *BN_dup(const BIGNUM *a); |
468 | int BN_ucmp(const BIGNUM *a, const BIGNUM *b); | |
d02b48c6 RE |
469 | int BN_set_bit(BIGNUM *a, int n); |
470 | int BN_clear_bit(BIGNUM *a, int n); | |
8623f693 DSH |
471 | char * BN_bn2hex(const BIGNUM *a); |
472 | char * BN_bn2dec(const BIGNUM *a); | |
473 | int BN_hex2bn(BIGNUM **a, const char *str); | |
474 | int BN_dec2bn(BIGNUM **a, const char *str); | |
dcbd0d74 BM |
475 | int BN_gcd(BIGNUM *r,const BIGNUM *a,const BIGNUM *b,BN_CTX *ctx); |
476 | int BN_kronecker(const BIGNUM *a,const BIGNUM *b,BN_CTX *ctx); /* returns -2 for error */ | |
020fc820 RL |
477 | BIGNUM *BN_mod_inverse(BIGNUM *ret, |
478 | const BIGNUM *a, const BIGNUM *n,BN_CTX *ctx); | |
cd2eebfd BM |
479 | BIGNUM *BN_mod_sqrt(BIGNUM *ret, |
480 | const BIGNUM *a, const BIGNUM *n,BN_CTX *ctx); | |
e9224c71 GT |
481 | |
482 | /* Deprecated versions */ | |
483 | #ifndef OPENSSL_NO_DEPRECATED | |
020fc820 RL |
484 | BIGNUM *BN_generate_prime(BIGNUM *ret,int bits,int safe, |
485 | const BIGNUM *add, const BIGNUM *rem, | |
486 | void (*callback)(int,int,void *),void *cb_arg); | |
aff0825c | 487 | int BN_is_prime(const BIGNUM *p,int nchecks, |
227385b7 RL |
488 | void (*callback)(int,int,void *), |
489 | BN_CTX *ctx,void *cb_arg); | |
aff0825c | 490 | int BN_is_prime_fasttest(const BIGNUM *p,int nchecks, |
227385b7 RL |
491 | void (*callback)(int,int,void *),BN_CTX *ctx,void *cb_arg, |
492 | int do_trial_division); | |
e9224c71 GT |
493 | #endif /* !defined(OPENSSL_NO_DEPRECATED) */ |
494 | ||
495 | /* Newer versions */ | |
496 | int BN_generate_prime_ex(BIGNUM *ret,int bits,int safe, const BIGNUM *add, | |
497 | const BIGNUM *rem, BN_GENCB *cb); | |
498 | int BN_is_prime_ex(const BIGNUM *p,int nchecks, BN_CTX *ctx, BN_GENCB *cb); | |
499 | int BN_is_prime_fasttest_ex(const BIGNUM *p,int nchecks, BN_CTX *ctx, | |
500 | int do_trial_division, BN_GENCB *cb); | |
d02b48c6 | 501 | |
d02b48c6 | 502 | BN_MONT_CTX *BN_MONT_CTX_new(void ); |
dfeab068 | 503 | void BN_MONT_CTX_init(BN_MONT_CTX *ctx); |
020fc820 RL |
504 | int BN_mod_mul_montgomery(BIGNUM *r,const BIGNUM *a,const BIGNUM *b, |
505 | BN_MONT_CTX *mont, BN_CTX *ctx); | |
78a0c1f1 BM |
506 | #define BN_to_montgomery(r,a,mont,ctx) BN_mod_mul_montgomery(\ |
507 | (r),(a),&((mont)->RR),(mont),(ctx)) | |
cbd48ba6 RL |
508 | int BN_from_montgomery(BIGNUM *r,const BIGNUM *a, |
509 | BN_MONT_CTX *mont, BN_CTX *ctx); | |
d02b48c6 | 510 | void BN_MONT_CTX_free(BN_MONT_CTX *mont); |
f13ddd5d | 511 | int BN_MONT_CTX_set(BN_MONT_CTX *mont,const BIGNUM *mod,BN_CTX *ctx); |
dfeab068 | 512 | BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to,BN_MONT_CTX *from); |
6ec8e63a DSH |
513 | BN_MONT_CTX *BN_MONT_CTX_set_locked(BN_MONT_CTX **pmont, int lock, |
514 | const BIGNUM *mod, BN_CTX *ctx); | |
d02b48c6 | 515 | |
800e400d NL |
516 | /* BN_BLINDING flags */ |
517 | #define BN_BLINDING_NO_UPDATE 0x00000001 | |
518 | #define BN_BLINDING_NO_RECREATE 0x00000002 | |
519 | ||
520 | BN_BLINDING *BN_BLINDING_new(const BIGNUM *A, const BIGNUM *Ai, BIGNUM *mod); | |
58964a49 RE |
521 | void BN_BLINDING_free(BN_BLINDING *b); |
522 | int BN_BLINDING_update(BN_BLINDING *b,BN_CTX *ctx); | |
800e400d | 523 | int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx); |
58964a49 | 524 | int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx); |
800e400d NL |
525 | int BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b, BN_CTX *); |
526 | int BN_BLINDING_invert_ex(BIGNUM *n, const BIGNUM *r, BN_BLINDING *b, BN_CTX *); | |
527 | unsigned long BN_BLINDING_get_thread_id(const BN_BLINDING *); | |
528 | void BN_BLINDING_set_thread_id(BN_BLINDING *, unsigned long); | |
529 | unsigned long BN_BLINDING_get_flags(const BN_BLINDING *); | |
530 | void BN_BLINDING_set_flags(BN_BLINDING *, unsigned long); | |
531 | BN_BLINDING *BN_BLINDING_create_param(BN_BLINDING *b, | |
532 | const BIGNUM *e, BIGNUM *m, BN_CTX *ctx, | |
533 | int (*bn_mod_exp)(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, | |
534 | const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx), | |
535 | BN_MONT_CTX *m_ctx); | |
58964a49 | 536 | |
df11e1e9 | 537 | #ifndef OPENSSL_NO_DEPRECATED |
dfeab068 RE |
538 | void BN_set_params(int mul,int high,int low,int mont); |
539 | int BN_get_params(int which); /* 0, mul, 1 high, 2 low, 3 mont */ | |
df11e1e9 | 540 | #endif |
dfeab068 | 541 | |
dfeab068 RE |
542 | void BN_RECP_CTX_init(BN_RECP_CTX *recp); |
543 | BN_RECP_CTX *BN_RECP_CTX_new(void); | |
544 | void BN_RECP_CTX_free(BN_RECP_CTX *recp); | |
84c15db5 | 545 | int BN_RECP_CTX_set(BN_RECP_CTX *recp,const BIGNUM *rdiv,BN_CTX *ctx); |
020fc820 | 546 | int BN_mod_mul_reciprocal(BIGNUM *r, const BIGNUM *x, const BIGNUM *y, |
227385b7 | 547 | BN_RECP_CTX *recp,BN_CTX *ctx); |
84c15db5 | 548 | int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, |
227385b7 | 549 | const BIGNUM *m, BN_CTX *ctx); |
020fc820 | 550 | int BN_div_recp(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, |
227385b7 | 551 | BN_RECP_CTX *recp, BN_CTX *ctx); |
dfeab068 | 552 | |
1dc920c8 BM |
553 | /* Functions for arithmetic over binary polynomials represented by BIGNUMs. |
554 | * | |
b53e44e5 BM |
555 | * The BIGNUM::neg property of BIGNUMs representing binary polynomials is |
556 | * ignored. | |
1dc920c8 BM |
557 | * |
558 | * Note that input arguments are not const so that their bit arrays can | |
559 | * be expanded to the appropriate size if needed. | |
560 | */ | |
b53e44e5 BM |
561 | |
562 | int BN_GF2m_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); /*r = a + b*/ | |
1dc920c8 | 563 | #define BN_GF2m_sub(r, a, b) BN_GF2m_add(r, a, b) |
b53e44e5 BM |
564 | int BN_GF2m_mod(BIGNUM *r, const BIGNUM *a, const BIGNUM *p); /*r=a mod p*/ |
565 | int BN_GF2m_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, | |
566 | const BIGNUM *p, BN_CTX *ctx); /* r = (a * b) mod p */ | |
567 | int BN_GF2m_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, | |
568 | BN_CTX *ctx); /* r = (a * a) mod p */ | |
569 | int BN_GF2m_mod_inv(BIGNUM *r, const BIGNUM *b, const BIGNUM *p, | |
570 | BN_CTX *ctx); /* r = (1 / b) mod p */ | |
571 | int BN_GF2m_mod_div(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, | |
572 | const BIGNUM *p, BN_CTX *ctx); /* r = (a / b) mod p */ | |
573 | int BN_GF2m_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, | |
574 | const BIGNUM *p, BN_CTX *ctx); /* r = (a ^ b) mod p */ | |
575 | int BN_GF2m_mod_sqrt(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, | |
576 | BN_CTX *ctx); /* r = sqrt(a) mod p */ | |
577 | int BN_GF2m_mod_solve_quad(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, | |
578 | BN_CTX *ctx); /* r^2 + r = a mod p */ | |
1dc920c8 BM |
579 | #define BN_GF2m_cmp(a, b) BN_ucmp((a), (b)) |
580 | /* Some functions allow for representation of the irreducible polynomials | |
581 | * as an unsigned int[], say p. The irreducible f(t) is then of the form: | |
582 | * t^p[0] + t^p[1] + ... + t^p[k] | |
583 | * where m = p[0] > p[1] > ... > p[k] = 0. | |
584 | */ | |
b53e44e5 BM |
585 | int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const unsigned int p[]); |
586 | /* r = a mod p */ | |
587 | int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, | |
588 | const unsigned int p[], BN_CTX *ctx); /* r = (a * b) mod p */ | |
589 | int BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const unsigned int p[], | |
590 | BN_CTX *ctx); /* r = (a * a) mod p */ | |
591 | int BN_GF2m_mod_inv_arr(BIGNUM *r, const BIGNUM *b, const unsigned int p[], | |
592 | BN_CTX *ctx); /* r = (1 / b) mod p */ | |
593 | int BN_GF2m_mod_div_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, | |
594 | const unsigned int p[], BN_CTX *ctx); /* r = (a / b) mod p */ | |
595 | int BN_GF2m_mod_exp_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, | |
596 | const unsigned int p[], BN_CTX *ctx); /* r = (a ^ b) mod p */ | |
597 | int BN_GF2m_mod_sqrt_arr(BIGNUM *r, const BIGNUM *a, | |
598 | const unsigned int p[], BN_CTX *ctx); /* r = sqrt(a) mod p */ | |
599 | int BN_GF2m_mod_solve_quad_arr(BIGNUM *r, const BIGNUM *a, | |
600 | const unsigned int p[], BN_CTX *ctx); /* r^2 + r = a mod p */ | |
601 | int BN_GF2m_poly2arr(const BIGNUM *a, unsigned int p[], int max); | |
602 | int BN_GF2m_arr2poly(const unsigned int p[], BIGNUM *a); | |
1dc920c8 | 603 | |
5c6bf031 BM |
604 | /* faster mod functions for the 'NIST primes' |
605 | * 0 <= a < p^2 */ | |
606 | int BN_nist_mod_192(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx); | |
607 | int BN_nist_mod_224(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx); | |
608 | int BN_nist_mod_256(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx); | |
609 | int BN_nist_mod_384(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx); | |
610 | int BN_nist_mod_521(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx); | |
611 | ||
612 | const BIGNUM *BN_get0_nist_prime_192(void); | |
613 | const BIGNUM *BN_get0_nist_prime_224(void); | |
614 | const BIGNUM *BN_get0_nist_prime_256(void); | |
615 | const BIGNUM *BN_get0_nist_prime_384(void); | |
616 | const BIGNUM *BN_get0_nist_prime_521(void); | |
617 | ||
775c63fc UM |
618 | /* library internal functions */ |
619 | ||
2d978cbd | 620 | #define bn_expand(a,bits) ((((((bits+BN_BITS2-1))/BN_BITS2)) <= (a)->dmax)?\ |
e042540f | 621 | (a):bn_expand2((a),(bits+BN_BITS2-1)/BN_BITS2)) |
2d978cbd | 622 | #define bn_wexpand(a,words) (((words) <= (a)->dmax)?(a):bn_expand2((a),(words))) |
775c63fc | 623 | BIGNUM *bn_expand2(BIGNUM *a, int words); |
e042540f GT |
624 | #ifndef OPENSSL_NO_DEPRECATED |
625 | BIGNUM *bn_dup_expand(const BIGNUM *a, int words); /* unused */ | |
626 | #endif | |
775c63fc | 627 | |
d870740c GT |
628 | /* Bignum consistency macros |
629 | * There is one "API" macro, bn_fix_top(), for stripping leading zeroes from | |
630 | * bignum data after direct manipulations on the data. There is also an | |
631 | * "internal" macro, bn_check_top(), for verifying that there are no leading | |
632 | * zeroes. Unfortunately, some auditing is required due to the fact that | |
633 | * bn_fix_top() has become an overabused duct-tape because bignum data is | |
634 | * occasionally passed around in an inconsistent state. So the following | |
635 | * changes have been made to sort this out; | |
636 | * - bn_fix_top()s implementation has been moved to bn_correct_top() | |
637 | * - if BN_DEBUG isn't defined, bn_fix_top() maps to bn_correct_top(), and | |
638 | * bn_check_top() is as before. | |
639 | * - if BN_DEBUG *is* defined; | |
640 | * - bn_check_top() tries to pollute unused words even if the bignum 'top' is | |
641 | * consistent. (ed: only if BN_DEBUG_RAND is defined) | |
642 | * - bn_fix_top() maps to bn_check_top() rather than "fixing" anything. | |
643 | * The idea is to have debug builds flag up inconsistent bignums when they | |
644 | * occur. If that occurs in a bn_fix_top(), we examine the code in question; if | |
645 | * the use of bn_fix_top() was appropriate (ie. it follows directly after code | |
646 | * that manipulates the bignum) it is converted to bn_correct_top(), and if it | |
647 | * was not appropriate, we convert it permanently to bn_check_top() and track | |
648 | * down the cause of the bug. Eventually, no internal code should be using the | |
649 | * bn_fix_top() macro. External applications and libraries should try this with | |
650 | * their own code too, both in terms of building against the openssl headers | |
651 | * with BN_DEBUG defined *and* linking with a version of OpenSSL built with it | |
652 | * defined. This not only improves external code, it provides more test | |
653 | * coverage for openssl's own code. | |
654 | */ | |
775c63fc | 655 | |
d870740c GT |
656 | #ifdef BN_DEBUG |
657 | ||
658 | /* We only need assert() when debugging */ | |
659 | #include <assert.h> | |
660 | ||
661 | #ifdef BN_DEBUG_RAND | |
662 | /* To avoid "make update" cvs wars due to BN_DEBUG, use some tricks */ | |
663 | #ifndef RAND_pseudo_bytes | |
664 | int RAND_pseudo_bytes(unsigned char *buf,int num); | |
665 | #define BN_DEBUG_TRIX | |
666 | #endif | |
f75abcef | 667 | #define bn_pollute(a) \ |
d870740c | 668 | do { \ |
f75abcef GT |
669 | const BIGNUM *_bnum1 = (a); \ |
670 | if(_bnum1->top < _bnum1->dmax) { \ | |
5734bebe | 671 | unsigned char _tmp_char; \ |
d870740c GT |
672 | /* We cast away const without the compiler knowing, any \ |
673 | * *genuinely* constant variables that aren't mutable \ | |
674 | * wouldn't be constructed with top!=dmax. */ \ | |
675 | BN_ULONG *_not_const; \ | |
f75abcef | 676 | memcpy(&_not_const, &_bnum1->d, sizeof(BN_ULONG*)); \ |
5734bebe GT |
677 | RAND_pseudo_bytes(&_tmp_char, 1); \ |
678 | memset((unsigned char *)(_not_const + _bnum1->top), _tmp_char, \ | |
f75abcef | 679 | (_bnum1->dmax - _bnum1->top) * sizeof(BN_ULONG)); \ |
d870740c GT |
680 | } \ |
681 | } while(0) | |
682 | #ifdef BN_DEBUG_TRIX | |
683 | #undef RAND_pseudo_bytes | |
684 | #endif | |
f75abcef GT |
685 | #else |
686 | #define bn_pollute(a) | |
687 | #endif | |
d870740c GT |
688 | #define bn_check_top(a) \ |
689 | do { \ | |
f75abcef GT |
690 | const BIGNUM *_bnum2 = (a); \ |
691 | assert((_bnum2->top == 0) || \ | |
692 | (_bnum2->d[_bnum2->top - 1] != 0)); \ | |
693 | bn_pollute(_bnum2); \ | |
d870740c | 694 | } while(0) |
d870740c GT |
695 | |
696 | #define bn_fix_top(a) bn_check_top(a) | |
697 | ||
698 | #else /* !BN_DEBUG */ | |
699 | ||
f75abcef | 700 | #define bn_pollute(a) |
2b96c951 | 701 | #define bn_check_top(a) |
d870740c GT |
702 | #define bn_fix_top(a) bn_correct_top(a) |
703 | ||
704 | #endif | |
705 | ||
f75abcef GT |
706 | #define bn_correct_top(a) \ |
707 | { \ | |
708 | BN_ULONG *ftl; \ | |
709 | if ((a)->top > 0) \ | |
710 | { \ | |
711 | for (ftl= &((a)->d[(a)->top-1]); (a)->top > 0; (a)->top--) \ | |
712 | if (*(ftl--)) break; \ | |
713 | } \ | |
714 | bn_pollute(a); \ | |
715 | } | |
716 | ||
cbd48ba6 RL |
717 | BN_ULONG bn_mul_add_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w); |
718 | BN_ULONG bn_mul_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w); | |
719 | void bn_sqr_words(BN_ULONG *rp, const BN_ULONG *ap, int num); | |
775c63fc | 720 | BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d); |
cbd48ba6 RL |
721 | BN_ULONG bn_add_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,int num); |
722 | BN_ULONG bn_sub_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,int num); | |
775c63fc | 723 | |
111482cf UM |
724 | int BN_bntest_rand(BIGNUM *rnd, int bits, int top,int bottom); |
725 | ||
d02b48c6 | 726 | /* BEGIN ERROR CODES */ |
6d311938 DSH |
727 | /* The following lines are auto generated by the script mkerr.pl. Any changes |
728 | * made after this point may be overwritten when the script is next run. | |
729 | */ | |
b476df64 | 730 | void ERR_load_BN_strings(void); |
6d311938 | 731 | |
d02b48c6 RE |
732 | /* Error codes for the BN functions. */ |
733 | ||
734 | /* Function codes. */ | |
aa4ce731 | 735 | #define BN_F_BNRAND 114 |
58964a49 | 736 | #define BN_F_BN_BLINDING_CONVERT 100 |
800e400d | 737 | #define BN_F_BN_BLINDING_CREATE_PARAM 133 |
58964a49 RE |
738 | #define BN_F_BN_BLINDING_INVERT 101 |
739 | #define BN_F_BN_BLINDING_NEW 102 | |
740 | #define BN_F_BN_BLINDING_UPDATE 103 | |
a0a54079 MC |
741 | #define BN_F_BN_BN2DEC 104 |
742 | #define BN_F_BN_BN2HEX 105 | |
9b141126 | 743 | #define BN_F_BN_CTX_GET 116 |
a0a54079 | 744 | #define BN_F_BN_CTX_NEW 106 |
aa4ce731 | 745 | #define BN_F_BN_CTX_START 130 |
a0a54079 | 746 | #define BN_F_BN_DIV 107 |
aa4ce731 | 747 | #define BN_F_BN_DIV_RECP 131 |
a0a54079 | 748 | #define BN_F_BN_EXPAND2 108 |
a08bcccc | 749 | #define BN_F_BN_EXPAND_INTERNAL 120 |
1dc920c8 BM |
750 | #define BN_F_BN_GF2M_MOD 126 |
751 | #define BN_F_BN_GF2M_MOD_DIV 123 | |
752 | #define BN_F_BN_GF2M_MOD_EXP 127 | |
753 | #define BN_F_BN_GF2M_MOD_MUL 124 | |
754 | #define BN_F_BN_GF2M_MOD_SOLVE_QUAD 128 | |
755 | #define BN_F_BN_GF2M_MOD_SOLVE_QUAD_ARR 129 | |
756 | #define BN_F_BN_GF2M_MOD_SQR 125 | |
aa4ce731 | 757 | #define BN_F_BN_GF2M_MOD_SQRT 132 |
dc434bbc | 758 | #define BN_F_BN_MOD_EXP2_MONT 118 |
a0a54079 | 759 | #define BN_F_BN_MOD_EXP_MONT 109 |
6dad7bd6 | 760 | #define BN_F_BN_MOD_EXP_MONT_WORD 117 |
a0a54079 | 761 | #define BN_F_BN_MOD_INVERSE 110 |
5acaa495 | 762 | #define BN_F_BN_MOD_LSHIFT_QUICK 119 |
a0a54079 | 763 | #define BN_F_BN_MOD_MUL_RECIPROCAL 111 |
cd2eebfd | 764 | #define BN_F_BN_MOD_SQRT 121 |
a0a54079 MC |
765 | #define BN_F_BN_MPI2BN 112 |
766 | #define BN_F_BN_NEW 113 | |
35ed8cb8 | 767 | #define BN_F_BN_RAND_RANGE 122 |
a0a54079 | 768 | #define BN_F_BN_USUB 115 |
d02b48c6 RE |
769 | |
770 | /* Reason codes. */ | |
dfeab068 RE |
771 | #define BN_R_ARG2_LT_ARG3 100 |
772 | #define BN_R_BAD_RECIPROCAL 101 | |
e5164b70 | 773 | #define BN_R_BIGNUM_TOO_LONG 114 |
dfeab068 RE |
774 | #define BN_R_CALLED_WITH_EVEN_MODULUS 102 |
775 | #define BN_R_DIV_BY_ZERO 103 | |
776 | #define BN_R_ENCODING_ERROR 104 | |
777 | #define BN_R_EXPAND_ON_STATIC_BIGNUM_DATA 105 | |
5acaa495 | 778 | #define BN_R_INPUT_NOT_REDUCED 110 |
dfeab068 | 779 | #define BN_R_INVALID_LENGTH 106 |
35ed8cb8 | 780 | #define BN_R_INVALID_RANGE 115 |
cd2eebfd | 781 | #define BN_R_NOT_A_SQUARE 111 |
1dc920c8 | 782 | #define BN_R_NOT_IMPLEMENTED 116 |
df82f5c8 | 783 | #define BN_R_NOT_INITIALIZED 107 |
dfeab068 | 784 | #define BN_R_NO_INVERSE 108 |
ace3ebd6 | 785 | #define BN_R_NO_SOLUTION 117 |
cd2eebfd BM |
786 | #define BN_R_P_IS_NOT_PRIME 112 |
787 | #define BN_R_TOO_MANY_ITERATIONS 113 | |
9b141126 | 788 | #define BN_R_TOO_MANY_TEMPORARY_VARIABLES 109 |
6d311938 | 789 | |
d02b48c6 RE |
790 | #ifdef __cplusplus |
791 | } | |
792 | #endif | |
793 | #endif |