« back to all changes in this revision
Viewing changes to crypto/bn.h
- browse files at revision 1
- compare with another revision
- download diff
- download tarball
- view history from revision 1
- Committer: Bazaar Package Importer
- Author(s): Sam Johnston
- Date: 2004-02-04 17:52:26 UTC
- Revision ID: james.westby@ubuntu.com-20040204175226-87kz4bzs1nimji68
Tags: upstream-1.3.1
Import upstream version 1.3.1
- files added:
- crypto
- doc
- keymaps
added
removed
crypto/bn.h
1
/* crypto/bn/bn.h */
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
*/
58
59
#ifndef HEADER_BN_H
60
#define HEADER_BN_H
61
62
#ifndef NO_FP_API
63
#include <stdio.h> /* FILE */
64
#endif
65
66
#ifdef __cplusplus
67
extern "C" {
68
#endif
69
70
void error(char *format, ...);
71
void *xmalloc(int size);
72
void xfree(void *mem);
73
74
#define BNerr(context,err) error("crypto error\n");
75
#define OPENSSL_malloc(size) xmalloc(size)
76
#define OPENSSL_free(ptr) xfree(ptr);
77
78
/* Only one for the following should be defined */
79
#if defined(__alpha) || defined(__ia64)
80
#define SIXTY_FOUR_BIT_LONG
81
#elif defined(__mips)
82
#define SIXTY_FOUR_BIT
83
#else
84
#define THIRTY_TWO_BIT
85
#endif
86
87
#undef BN_LLONG
88
#undef BN_MUL_COMBA
89
#undef BN_SQR_COMBA
90
#undef BN_RECURSION
91
#undef RECP_MUL_MOD
92
#undef MONT_MUL_MOD
93
94
/* This next option uses the C libraries (2 word)/(1 word) function.
95
* If it is not defined, I use my C version (which is slower).
96
* The reason for this flag is that when the particular C compiler
97
* library routine is used, and the library is linked with a different
98
* compiler, the library is missing. This mostly happens when the
99
* library is built with gcc and then linked using normal cc. This would
100
* be a common occurrence because gcc normally produces code that is
101
* 2 times faster than system compilers for the big number stuff.
102
* For machines with only one compiler (or shared libraries), this should
103
* be on. Again this in only really a problem on machines
104
* using "long long's", are 32bit, and are not using my assembler code. */
105
#if defined(MSDOS) || defined(WINDOWS) || defined(WIN32) || defined(linux)
106
# ifndef BN_DIV2W
107
# define BN_DIV2W
108
# endif
109
#endif
110
111
/* assuming long is 64bit - this is the DEC Alpha
112
* unsigned long long is only 64 bits :-(, don't define
113
* BN_LLONG for the DEC Alpha */
114
#ifdef SIXTY_FOUR_BIT_LONG
115
#define BN_ULLONG unsigned long long
116
#define BN_ULONG unsigned long
117
#define BN_LONG long
118
#define BN_BITS 128
119
#define BN_BYTES 8
120
#define BN_BITS2 64
121
#define BN_BITS4 32
122
#define BN_MASK (0xffffffffffffffffffffffffffffffffLL)
123
#define BN_MASK2 (0xffffffffffffffffL)
124
#define BN_MASK2l (0xffffffffL)
125
#define BN_MASK2h (0xffffffff00000000L)
126
#define BN_MASK2h1 (0xffffffff80000000L)
127
#define BN_TBIT (0x8000000000000000L)
128
#define BN_DEC_CONV (10000000000000000000UL)
129
#define BN_DEC_FMT1 "%lu"
130
#define BN_DEC_FMT2 "%019lu"
131
#define BN_DEC_NUM 19
132
#endif
133
134
/* This is where the long long data type is 64 bits, but long is 32.
135
* For machines where there are 64bit registers, this is the mode to use.
136
* IRIX, on R4000 and above should use this mode, along with the relevant
137
* assembler code :-). Do NOT define BN_LLONG.
138
*/
139
#ifdef SIXTY_FOUR_BIT
140
#undef BN_LLONG
141
#undef BN_ULLONG
142
#define BN_ULONG unsigned long long
143
#define BN_LONG long long
144
#define BN_BITS 128
145
#define BN_BYTES 8
146
#define BN_BITS2 64
147
#define BN_BITS4 32
148
#define BN_MASK2 (0xffffffffffffffffLL)
149
#define BN_MASK2l (0xffffffffL)
150
#define BN_MASK2h (0xffffffff00000000LL)
151
#define BN_MASK2h1 (0xffffffff80000000LL)
152
#define BN_TBIT (0x8000000000000000LL)
153
#define BN_DEC_CONV (10000000000000000000LL)
154
#define BN_DEC_FMT1 "%llu"
155
#define BN_DEC_FMT2 "%019llu"
156
#define BN_DEC_NUM 19
157
#endif
158
159
#ifdef THIRTY_TWO_BIT
160
#if defined(WIN32) && !defined(__GNUC__)
161
#define BN_ULLONG unsigned _int64
162
#else
163
#define BN_ULLONG unsigned long long
164
#endif
165
#define BN_ULONG unsigned long
166
#define BN_LONG long
167
#define BN_BITS 64
168
#define BN_BYTES 4
169
#define BN_BITS2 32
170
#define BN_BITS4 16
171
#ifdef _MSC_VER
172
/* VC++ doesn't like the LL suffix */
173
#define BN_MASK (0xffffffffffffffffL)
174
#else
175
#define BN_MASK (0xffffffffffffffffLL)
176
#endif
177
#define BN_MASK2 (0xffffffffL)
178
#define BN_MASK2l (0xffff)
179
#define BN_MASK2h1 (0xffff8000L)
180
#define BN_MASK2h (0xffff0000L)
181
#define BN_TBIT (0x80000000L)
182
#define BN_DEC_CONV (1000000000L)
183
#define BN_DEC_FMT1 "%lu"
184
#define BN_DEC_FMT2 "%09lu"
185
#define BN_DEC_NUM 9
186
#endif
187
188
#ifdef SIXTEEN_BIT
189
#ifndef BN_DIV2W
190
#define BN_DIV2W
191
#endif
192
#define BN_ULLONG unsigned long
193
#define BN_ULONG unsigned short
194
#define BN_LONG short
195
#define BN_BITS 32
196
#define BN_BYTES 2
197
#define BN_BITS2 16
198
#define BN_BITS4 8
199
#define BN_MASK (0xffffffff)
200
#define BN_MASK2 (0xffff)
201
#define BN_MASK2l (0xff)
202
#define BN_MASK2h1 (0xff80)
203
#define BN_MASK2h (0xff00)
204
#define BN_TBIT (0x8000)
205
#define BN_DEC_CONV (100000)
206
#define BN_DEC_FMT1 "%u"
207
#define BN_DEC_FMT2 "%05u"
208
#define BN_DEC_NUM 5
209
#endif
210
211
#ifdef EIGHT_BIT
212
#ifndef BN_DIV2W
213
#define BN_DIV2W
214
#endif
215
#define BN_ULLONG unsigned short
216
#define BN_ULONG unsigned char
217
#define BN_LONG char
218
#define BN_BITS 16
219
#define BN_BYTES 1
220
#define BN_BITS2 8
221
#define BN_BITS4 4
222
#define BN_MASK (0xffff)
223
#define BN_MASK2 (0xff)
224
#define BN_MASK2l (0xf)
225
#define BN_MASK2h1 (0xf8)
226
#define BN_MASK2h (0xf0)
227
#define BN_TBIT (0x80)
228
#define BN_DEC_CONV (100)
229
#define BN_DEC_FMT1 "%u"
230
#define BN_DEC_FMT2 "%02u"
231
#define BN_DEC_NUM 2
232
#endif
233
234
#define BN_DEFAULT_BITS 1280
235
236
#ifdef BIGNUM
237
#undef BIGNUM
238
#endif
239
240
#define BN_FLG_MALLOCED 0x01
241
#define BN_FLG_STATIC_DATA 0x02
242
#define BN_FLG_FREE 0x8000 /* used for debuging */
243
#define BN_set_flags(b,n) ((b)->flags|=(n))
244
#define BN_get_flags(b,n) ((b)->flags&(n))
245
246
typedef struct bignum_st
247
{
248
BN_ULONG *d; /* Pointer to an array of 'BN_BITS2' bit chunks. */
249
int top; /* Index of last used d +1. */
250
/* The next are internal book keeping for bn_expand. */
251
int dmax; /* Size of the d array. */
252
int neg; /* one if the number is negative */
253
int flags;
254
} BIGNUM;
255
256
/* Used for temp variables */
257
#define BN_CTX_NUM 16
258
#define BN_CTX_NUM_POS 12
259
typedef struct bignum_ctx
260
{
261
int tos;
262
BIGNUM bn[BN_CTX_NUM];
263
int flags;
264
int depth;
265
int pos[BN_CTX_NUM_POS];
266
int too_many;
267
} BN_CTX;
268
269
typedef struct bn_blinding_st
270
{
271
int init;
272
BIGNUM *A;
273
BIGNUM *Ai;
274
BIGNUM *mod; /* just a reference */
275
} BN_BLINDING;
276
277
/* Used for montgomery multiplication */
278
typedef struct bn_mont_ctx_st
279
{
280
int ri; /* number of bits in R */
281
BIGNUM RR; /* used to convert to montgomery form */
282
BIGNUM N; /* The modulus */
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 */
286
int flags;
287
} BN_MONT_CTX;
288
289
/* Used for reciprocal division/mod functions
290
* It cannot be shared between threads
291
*/
292
typedef struct bn_recp_ctx_st
293
{
294
BIGNUM N; /* the divisor */
295
BIGNUM Nr; /* the reciprocal */
296
int num_bits;
297
int shift;
298
int flags;
299
} BN_RECP_CTX;
300
301
#define BN_to_montgomery(r,a,mont,ctx) BN_mod_mul_montgomery(\
302
r,a,&((mont)->RR),(mont),ctx)
303
304
#define BN_prime_checks 0 /* default: select number of iterations
305
based on the size of the number */
306
307
/* number of Miller-Rabin iterations for an error rate of less than 2^-80
308
* for random 'b'-bit input, b >= 100 (taken from table 4.4 in the Handbook
309
* of Applied Cryptography [Menezes, van Oorschot, Vanstone; CRC Press 1996];
310
* original paper: Damgaard, Landrock, Pomerance: Average case error estimates
311
* for the strong probable prime test. -- Math. Comp. 61 (1993) 177-194) */
312
#define BN_prime_checks_for_size(b) ((b) >= 1300 ? 2 : \
313
(b) >= 850 ? 3 : \
314
(b) >= 650 ? 4 : \
315
(b) >= 550 ? 5 : \
316
(b) >= 450 ? 6 : \
317
(b) >= 400 ? 7 : \
318
(b) >= 350 ? 8 : \
319
(b) >= 300 ? 9 : \
320
(b) >= 250 ? 12 : \
321
(b) >= 200 ? 15 : \
322
(b) >= 150 ? 18 : \
323
/* b >= 100 */ 27)
324
325
#define BN_num_bytes(a) ((BN_num_bits(a)+7)/8)
326
#define BN_is_word(a,w) (((a)->top == 1) && ((a)->d[0] == (BN_ULONG)(w)))
327
#define BN_is_zero(a) (((a)->top == 0) || BN_is_word(a,0))
328
#define BN_is_one(a) (BN_is_word((a),1))
329
#define BN_is_odd(a) (((a)->top > 0) && ((a)->d[0] & 1))
330
#define BN_one(a) (BN_set_word((a),1))
331
#define BN_zero(a) (BN_set_word((a),0))
332
333
/*#define BN_ascii2bn(a) BN_hex2bn(a) */
334
/*#define BN_bn2ascii(a) BN_bn2hex(a) */
335
336
BIGNUM *BN_value_one(void);
337
char * BN_options(void);
338
BN_CTX *BN_CTX_new(void);
339
void BN_CTX_init(BN_CTX *c);
340
void BN_CTX_free(BN_CTX *c);
341
void BN_CTX_start(BN_CTX *ctx);
342
BIGNUM *BN_CTX_get(BN_CTX *ctx);
343
void BN_CTX_end(BN_CTX *ctx);
344
int BN_rand(BIGNUM *rnd, int bits, int top,int bottom);
345
int BN_pseudo_rand(BIGNUM *rnd, int bits, int top,int bottom);
346
int BN_rand_range(BIGNUM *rnd, BIGNUM *range);
347
int BN_pseudo_rand_range(BIGNUM *rnd, BIGNUM *range);
348
int BN_num_bits(const BIGNUM *a);
349
int BN_num_bits_word(BN_ULONG);
350
BIGNUM *BN_new(void);
351
void BN_init(BIGNUM *);
352
void BN_clear_free(BIGNUM *a);
353
BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b);
354
BIGNUM *BN_bin2bn(const unsigned char *s,int len,BIGNUM *ret);
355
int BN_bn2bin(const BIGNUM *a, unsigned char *to);
356
BIGNUM *BN_mpi2bn(unsigned char *s,int len,BIGNUM *ret);
357
int BN_bn2mpi(const BIGNUM *a, unsigned char *to);
358
int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
359
int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
360
int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
361
int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
362
int BN_mod(BIGNUM *rem, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx);
363
int BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, const BIGNUM *d,
364
BN_CTX *ctx);
365
int BN_mul(BIGNUM *r, BIGNUM *a, BIGNUM *b, BN_CTX *ctx);
366
int BN_sqr(BIGNUM *r, BIGNUM *a,BN_CTX *ctx);
367
BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w);
368
BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w);
369
int BN_mul_word(BIGNUM *a, BN_ULONG w);
370
int BN_add_word(BIGNUM *a, BN_ULONG w);
371
int BN_sub_word(BIGNUM *a, BN_ULONG w);
372
int BN_set_word(BIGNUM *a, BN_ULONG w);
373
BN_ULONG BN_get_word(BIGNUM *a);
374
int BN_cmp(const BIGNUM *a, const BIGNUM *b);
375
void BN_free(BIGNUM *a);
376
int BN_is_bit_set(const BIGNUM *a, int n);
377
int BN_lshift(BIGNUM *r, const BIGNUM *a, int n);
378
int BN_lshift1(BIGNUM *r, BIGNUM *a);
379
int BN_exp(BIGNUM *r, BIGNUM *a, BIGNUM *p,BN_CTX *ctx);
380
int BN_mod_exp(BIGNUM *r, BIGNUM *a, const BIGNUM *p,
381
const BIGNUM *m,BN_CTX *ctx);
382
int BN_mod_exp_mont(BIGNUM *r, BIGNUM *a, const BIGNUM *p,
383
const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);
384
int BN_mod_exp_mont_word(BIGNUM *r, BN_ULONG a, const BIGNUM *p,
385
const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);
386
int BN_mod_exp2_mont(BIGNUM *r, BIGNUM *a1, BIGNUM *p1,BIGNUM *a2,
387
BIGNUM *p2,BIGNUM *m,BN_CTX *ctx,BN_MONT_CTX *m_ctx);
388
int BN_mod_exp_simple(BIGNUM *r, BIGNUM *a, const BIGNUM *p,
389
const BIGNUM *m,BN_CTX *ctx);
390
int BN_mask_bits(BIGNUM *a,int n);
391
int BN_mod_mul(BIGNUM *ret, BIGNUM *a, BIGNUM *b, const BIGNUM *m, BN_CTX *ctx);
392
#ifndef NO_FP_API
393
int BN_print_fp(FILE *fp, const BIGNUM *a);
394
#endif
395
#ifdef HEADER_BIO_H
396
int BN_print(BIO *fp, const BIGNUM *a);
397
#else
398
int BN_print(void *fp, const BIGNUM *a);
399
#endif
400
int BN_reciprocal(BIGNUM *r, BIGNUM *m, int len, BN_CTX *ctx);
401
int BN_rshift(BIGNUM *r, BIGNUM *a, int n);
402
int BN_rshift1(BIGNUM *r, BIGNUM *a);
403
void BN_clear(BIGNUM *a);
404
BIGNUM *BN_dup(const BIGNUM *a);
405
int BN_ucmp(const BIGNUM *a, const BIGNUM *b);
406
int BN_set_bit(BIGNUM *a, int n);
407
int BN_clear_bit(BIGNUM *a, int n);
408
char * BN_bn2hex(const BIGNUM *a);
409
char * BN_bn2dec(const BIGNUM *a);
410
int BN_hex2bn(BIGNUM **a, const char *str);
411
int BN_dec2bn(BIGNUM **a, const char *str);
412
int BN_gcd(BIGNUM *r,BIGNUM *in_a,BIGNUM *in_b,BN_CTX *ctx);
413
BIGNUM *BN_mod_inverse(BIGNUM *ret,BIGNUM *a, const BIGNUM *n,BN_CTX *ctx);
414
BIGNUM *BN_generate_prime(BIGNUM *ret,int bits,int safe,BIGNUM *add,
415
BIGNUM *rem,void (*callback)(int,int,void *),void *cb_arg);
416
int BN_is_prime(const BIGNUM *p,int nchecks,
417
void (*callback)(int,int,void *),
418
BN_CTX *ctx,void *cb_arg);
419
int BN_is_prime_fasttest(const BIGNUM *p,int nchecks,
420
void (*callback)(int,int,void *),BN_CTX *ctx,void *cb_arg,
421
int do_trial_division);
422
423
BN_MONT_CTX *BN_MONT_CTX_new(void );
424
void BN_MONT_CTX_init(BN_MONT_CTX *ctx);
425
int BN_mod_mul_montgomery(BIGNUM *r,BIGNUM *a,BIGNUM *b,BN_MONT_CTX *mont,
426
BN_CTX *ctx);
427
int BN_from_montgomery(BIGNUM *r,BIGNUM *a,BN_MONT_CTX *mont,BN_CTX *ctx);
428
void BN_MONT_CTX_free(BN_MONT_CTX *mont);
429
int BN_MONT_CTX_set(BN_MONT_CTX *mont,const BIGNUM *modulus,BN_CTX *ctx);
430
BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to,BN_MONT_CTX *from);
431
432
BN_BLINDING *BN_BLINDING_new(BIGNUM *A,BIGNUM *Ai,BIGNUM *mod);
433
void BN_BLINDING_free(BN_BLINDING *b);
434
int BN_BLINDING_update(BN_BLINDING *b,BN_CTX *ctx);
435
int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *r, BN_CTX *ctx);
436
int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
437
438
void BN_set_params(int mul,int high,int low,int mont);
439
int BN_get_params(int which); /* 0, mul, 1 high, 2 low, 3 mont */
440
441
void BN_RECP_CTX_init(BN_RECP_CTX *recp);
442
BN_RECP_CTX *BN_RECP_CTX_new(void);
443
void BN_RECP_CTX_free(BN_RECP_CTX *recp);
444
int BN_RECP_CTX_set(BN_RECP_CTX *recp,const BIGNUM *rdiv,BN_CTX *ctx);
445
int BN_mod_mul_reciprocal(BIGNUM *r, BIGNUM *x, BIGNUM *y,
446
BN_RECP_CTX *recp,BN_CTX *ctx);
447
int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
448
const BIGNUM *m, BN_CTX *ctx);
449
int BN_div_recp(BIGNUM *dv, BIGNUM *rem, BIGNUM *m,
450
BN_RECP_CTX *recp, BN_CTX *ctx);
451
452
/* library internal functions */
453
454
#define bn_expand(a,bits) ((((((bits+BN_BITS2-1))/BN_BITS2)) <= (a)->dmax)?\
455
(a):bn_expand2((a),(bits)/BN_BITS2+1))
456
#define bn_wexpand(a,words) (((words) <= (a)->dmax)?(a):bn_expand2((a),(words)))
457
BIGNUM *bn_expand2(BIGNUM *a, int words);
458
459
#define bn_fix_top(a) \
460
{ \
461
BN_ULONG *ftl; \
462
if ((a)->top > 0) \
463
{ \
464
for (ftl= &((a)->d[(a)->top-1]); (a)->top > 0; (a)->top--) \
465
if (*(ftl--)) break; \
466
} \
467
}
468
469
BN_ULONG bn_mul_add_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w);
470
BN_ULONG bn_mul_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w);
471
void bn_sqr_words(BN_ULONG *rp, BN_ULONG *ap, int num);
472
BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d);
473
BN_ULONG bn_add_words(BN_ULONG *rp, BN_ULONG *ap, BN_ULONG *bp,int num);
474
BN_ULONG bn_sub_words(BN_ULONG *rp, BN_ULONG *ap, BN_ULONG *bp,int num);
475
476
#ifdef BN_DEBUG
477
void bn_dump1(FILE *o, const char *a, BN_ULONG *b,int n);
478
# define bn_print(a) {fprintf(stderr, #a "="); BN_print_fp(stderr,a); \
479
fprintf(stderr,"\n");}
480
# define bn_dump(a,n) bn_dump1(stderr,#a,a,n);
481
#else
482
# define bn_print(a)
483
# define bn_dump(a,b)
484
#endif
485
486
int BN_bntest_rand(BIGNUM *rnd, int bits, int top,int bottom);
487
488
#ifdef __cplusplus
489
}
490
#endif
491
#endif
Loggerhead is a web-based interface for Breezy
Version: 2.0.1