Deleted Added
sdiff udiff text old ( 206048 ) new ( 215698 )
full compact
bn.3 (206048) bn.3 (215698)
1.\" Automatically generated by Pod::Man v1.37, Pod::Parser v1.37
1.\" Automatically generated by Pod::Man 2.22 (Pod::Simple 3.07)
2.\"
3.\" Standard preamble:
4.\" ========================================================================
2.\"
3.\" Standard preamble:
4.\" ========================================================================
5.de Sh \" Subsection heading
6.br
7.if t .Sp
8.ne 5
9.PP
10\fB\\$1\fR
11.PP
12..
13.de Sp \" Vertical space (when we can't use .PP)
14.if t .sp .5v
15.if n .sp
16..
17.de Vb \" Begin verbatim text
18.ft CW
19.nf
20.ne \\$1
21..
22.de Ve \" End verbatim text
23.ft R
24.fi
25..
26.\" Set up some character translations and predefined strings. \*(-- will
27.\" give an unbreakable dash, \*(PI will give pi, \*(L" will give a left
5.de Sp \" Vertical space (when we can't use .PP)
6.if t .sp .5v
7.if n .sp
8..
9.de Vb \" Begin verbatim text
10.ft CW
11.nf
12.ne \\$1
13..
14.de Ve \" End verbatim text
15.ft R
16.fi
17..
18.\" Set up some character translations and predefined strings. \*(-- will
19.\" give an unbreakable dash, \*(PI will give pi, \*(L" will give a left
28.\" double quote, and \*(R" will give a right double quote. | will give a
29.\" real vertical bar. \*(C+ will give a nicer C++. Capital omega is used to
30.\" do unbreakable dashes and therefore won't be available. \*(C` and \*(C'
31.\" expand to `' in nroff, nothing in troff, for use with C<>.
32.tr \(*W-|\(bv\*(Tr
20.\" double quote, and \*(R" will give a right double quote. \*(C+ will
21.\" give a nicer C++. Capital omega is used to do unbreakable dashes and
22.\" therefore won't be available. \*(C` and \*(C' expand to `' in nroff,
23.\" nothing in troff, for use with C<>.
24.tr \(*W-
33.ds C+ C\v'-.1v'\h'-1p'\s-2+\h'-1p'+\s0\v'.1v'\h'-1p'
34.ie n \{\
35. ds -- \(*W-
36. ds PI pi
37. if (\n(.H=4u)&(1m=24u) .ds -- \(*W\h'-12u'\(*W\h'-12u'-\" diablo 10 pitch
38. if (\n(.H=4u)&(1m=20u) .ds -- \(*W\h'-12u'\(*W\h'-8u'-\" diablo 12 pitch
39. ds L" ""
40. ds R" ""
41. ds C` ""
42. ds C' ""
43'br\}
44.el\{\
45. ds -- \|\(em\|
46. ds PI \(*p
47. ds L" ``
48. ds R" ''
49'br\}
50.\"
25.ds C+ C\v'-.1v'\h'-1p'\s-2+\h'-1p'+\s0\v'.1v'\h'-1p'
26.ie n \{\
27. ds -- \(*W-
28. ds PI pi
29. if (\n(.H=4u)&(1m=24u) .ds -- \(*W\h'-12u'\(*W\h'-12u'-\" diablo 10 pitch
30. if (\n(.H=4u)&(1m=20u) .ds -- \(*W\h'-12u'\(*W\h'-8u'-\" diablo 12 pitch
31. ds L" ""
32. ds R" ""
33. ds C` ""
34. ds C' ""
35'br\}
36.el\{\
37. ds -- \|\(em\|
38. ds PI \(*p
39. ds L" ``
40. ds R" ''
41'br\}
42.\"
43.\" Escape single quotes in literal strings from groff's Unicode transform.
44.ie \n(.g .ds Aq \(aq
45.el .ds Aq '
46.\"
51.\" If the F register is turned on, we'll generate index entries on stderr for
47.\" If the F register is turned on, we'll generate index entries on stderr for
52.\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
48.\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
53.\" entries marked with X<> in POD. Of course, you'll have to process the
54.\" output yourself in some meaningful fashion.
49.\" entries marked with X<> in POD. Of course, you'll have to process the
50.\" output yourself in some meaningful fashion.
55.if \nF \{\
51.ie \nF \{\
56. de IX
57. tm Index:\\$1\t\\n%\t"\\$2"
58..
59. nr % 0
60. rr F
61.\}
52. de IX
53. tm Index:\\$1\t\\n%\t"\\$2"
54..
55. nr % 0
56. rr F
57.\}
58.el \{\
59. de IX
60..
61.\}
62.\"
62.\"
63.\" For nroff, turn off justification. Always turn off hyphenation; it makes
64.\" way too many mistakes in technical documents.
65.hy 0
66.if n .na
67.\"
68.\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
69.\" Fear. Run. Save yourself. No user-serviceable parts.
70. \" fudge factors for nroff and troff
71.if n \{\
72. ds #H 0
73. ds #V .8m
74. ds #F .3m
75. ds #[ \f1

--- 48 unchanged lines hidden (view full) ---

124. ds Th \o'LP'
125. ds ae ae
126. ds Ae AE
127.\}
128.rm #[ #] #H #V #F C
129.\" ========================================================================
130.\"
131.IX Title "bn 3"
63.\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
64.\" Fear. Run. Save yourself. No user-serviceable parts.
65. \" fudge factors for nroff and troff
66.if n \{\
67. ds #H 0
68. ds #V .8m
69. ds #F .3m
70. ds #[ \f1

--- 48 unchanged lines hidden (view full) ---

119. ds Th \o'LP'
120. ds ae ae
121. ds Ae AE
122.\}
123.rm #[ #] #H #V #F C
124.\" ========================================================================
125.\"
126.IX Title "bn 3"
132.TH bn 3 "2010-03-24" "0.9.8n" "OpenSSL"
127.TH bn 3 "2010-11-16" "0.9.8p" "OpenSSL"
128.\" For nroff, turn off justification. Always turn off hyphenation; it makes
129.\" way too many mistakes in technical documents.
130.if n .ad l
131.nh
133.SH "NAME"
134bn \- multiprecision integer arithmetics
135.SH "SYNOPSIS"
136.IX Header "SYNOPSIS"
137.Vb 1
138\& #include <openssl/bn.h>
132.SH "NAME"
133bn \- multiprecision integer arithmetics
134.SH "SYNOPSIS"
135.IX Header "SYNOPSIS"
136.Vb 1
137\& #include <openssl/bn.h>
139.Ve
140.PP
141.Vb 5
138\&
142\& BIGNUM *BN_new(void);
143\& void BN_free(BIGNUM *a);
144\& void BN_init(BIGNUM *);
145\& void BN_clear(BIGNUM *a);
146\& void BN_clear_free(BIGNUM *a);
139\& BIGNUM *BN_new(void);
140\& void BN_free(BIGNUM *a);
141\& void BN_init(BIGNUM *);
142\& void BN_clear(BIGNUM *a);
143\& void BN_clear_free(BIGNUM *a);
147.Ve
148.PP
149.Vb 3
144\&
150\& BN_CTX *BN_CTX_new(void);
151\& void BN_CTX_init(BN_CTX *c);
152\& void BN_CTX_free(BN_CTX *c);
145\& BN_CTX *BN_CTX_new(void);
146\& void BN_CTX_init(BN_CTX *c);
147\& void BN_CTX_free(BN_CTX *c);
153.Ve
154.PP
155.Vb 2
148\&
156\& BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b);
157\& BIGNUM *BN_dup(const BIGNUM *a);
149\& BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b);
150\& BIGNUM *BN_dup(const BIGNUM *a);
158.Ve
159.PP
160.Vb 1
151\&
161\& BIGNUM *BN_swap(BIGNUM *a, BIGNUM *b);
152\& BIGNUM *BN_swap(BIGNUM *a, BIGNUM *b);
162.Ve
163.PP
164.Vb 3
153\&
165\& int BN_num_bytes(const BIGNUM *a);
166\& int BN_num_bits(const BIGNUM *a);
167\& int BN_num_bits_word(BN_ULONG w);
154\& int BN_num_bytes(const BIGNUM *a);
155\& int BN_num_bits(const BIGNUM *a);
156\& int BN_num_bits_word(BN_ULONG w);
168.Ve
169.PP
170.Vb 2
157\&
171\& void BN_set_negative(BIGNUM *a, int n);
172\& int BN_is_negative(const BIGNUM *a);
158\& void BN_set_negative(BIGNUM *a, int n);
159\& int BN_is_negative(const BIGNUM *a);
173.Ve
174.PP
175.Vb 19
160\&
176\& int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
177\& int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
178\& int BN_mul(BIGNUM *r, BIGNUM *a, BIGNUM *b, BN_CTX *ctx);
179\& int BN_sqr(BIGNUM *r, BIGNUM *a, BN_CTX *ctx);
180\& int BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *a, const BIGNUM *d,
181\& BN_CTX *ctx);
182\& int BN_mod(BIGNUM *rem, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);
183\& int BN_nnmod(BIGNUM *rem, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);
184\& int BN_mod_add(BIGNUM *ret, BIGNUM *a, BIGNUM *b, const BIGNUM *m,
185\& BN_CTX *ctx);
186\& int BN_mod_sub(BIGNUM *ret, BIGNUM *a, BIGNUM *b, const BIGNUM *m,
187\& BN_CTX *ctx);
188\& int BN_mod_mul(BIGNUM *ret, BIGNUM *a, BIGNUM *b, const BIGNUM *m,
189\& BN_CTX *ctx);
190\& int BN_mod_sqr(BIGNUM *ret, BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);
191\& int BN_exp(BIGNUM *r, BIGNUM *a, BIGNUM *p, BN_CTX *ctx);
192\& int BN_mod_exp(BIGNUM *r, BIGNUM *a, const BIGNUM *p,
193\& const BIGNUM *m, BN_CTX *ctx);
194\& int BN_gcd(BIGNUM *r, BIGNUM *a, BIGNUM *b, BN_CTX *ctx);
161\& int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
162\& int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
163\& int BN_mul(BIGNUM *r, BIGNUM *a, BIGNUM *b, BN_CTX *ctx);
164\& int BN_sqr(BIGNUM *r, BIGNUM *a, BN_CTX *ctx);
165\& int BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *a, const BIGNUM *d,
166\& BN_CTX *ctx);
167\& int BN_mod(BIGNUM *rem, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);
168\& int BN_nnmod(BIGNUM *rem, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);
169\& int BN_mod_add(BIGNUM *ret, BIGNUM *a, BIGNUM *b, const BIGNUM *m,
170\& BN_CTX *ctx);
171\& int BN_mod_sub(BIGNUM *ret, BIGNUM *a, BIGNUM *b, const BIGNUM *m,
172\& BN_CTX *ctx);
173\& int BN_mod_mul(BIGNUM *ret, BIGNUM *a, BIGNUM *b, const BIGNUM *m,
174\& BN_CTX *ctx);
175\& int BN_mod_sqr(BIGNUM *ret, BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);
176\& int BN_exp(BIGNUM *r, BIGNUM *a, BIGNUM *p, BN_CTX *ctx);
177\& int BN_mod_exp(BIGNUM *r, BIGNUM *a, const BIGNUM *p,
178\& const BIGNUM *m, BN_CTX *ctx);
179\& int BN_gcd(BIGNUM *r, BIGNUM *a, BIGNUM *b, BN_CTX *ctx);
195.Ve
196.PP
197.Vb 5
180\&
198\& int BN_add_word(BIGNUM *a, BN_ULONG w);
199\& int BN_sub_word(BIGNUM *a, BN_ULONG w);
200\& int BN_mul_word(BIGNUM *a, BN_ULONG w);
201\& BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w);
202\& BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w);
181\& int BN_add_word(BIGNUM *a, BN_ULONG w);
182\& int BN_sub_word(BIGNUM *a, BN_ULONG w);
183\& int BN_mul_word(BIGNUM *a, BN_ULONG w);
184\& BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w);
185\& BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w);
203.Ve
204.PP
205.Vb 6
186\&
206\& int BN_cmp(BIGNUM *a, BIGNUM *b);
207\& int BN_ucmp(BIGNUM *a, BIGNUM *b);
208\& int BN_is_zero(BIGNUM *a);
209\& int BN_is_one(BIGNUM *a);
210\& int BN_is_word(BIGNUM *a, BN_ULONG w);
211\& int BN_is_odd(BIGNUM *a);
187\& int BN_cmp(BIGNUM *a, BIGNUM *b);
188\& int BN_ucmp(BIGNUM *a, BIGNUM *b);
189\& int BN_is_zero(BIGNUM *a);
190\& int BN_is_one(BIGNUM *a);
191\& int BN_is_word(BIGNUM *a, BN_ULONG w);
192\& int BN_is_odd(BIGNUM *a);
212.Ve
213.PP
214.Vb 5
193\&
215\& int BN_zero(BIGNUM *a);
216\& int BN_one(BIGNUM *a);
217\& const BIGNUM *BN_value_one(void);
218\& int BN_set_word(BIGNUM *a, unsigned long w);
219\& unsigned long BN_get_word(BIGNUM *a);
194\& int BN_zero(BIGNUM *a);
195\& int BN_one(BIGNUM *a);
196\& const BIGNUM *BN_value_one(void);
197\& int BN_set_word(BIGNUM *a, unsigned long w);
198\& unsigned long BN_get_word(BIGNUM *a);
220.Ve
221.PP
222.Vb 4
199\&
223\& int BN_rand(BIGNUM *rnd, int bits, int top, int bottom);
224\& int BN_pseudo_rand(BIGNUM *rnd, int bits, int top, int bottom);
225\& int BN_rand_range(BIGNUM *rnd, BIGNUM *range);
226\& int BN_pseudo_rand_range(BIGNUM *rnd, BIGNUM *range);
200\& int BN_rand(BIGNUM *rnd, int bits, int top, int bottom);
201\& int BN_pseudo_rand(BIGNUM *rnd, int bits, int top, int bottom);
202\& int BN_rand_range(BIGNUM *rnd, BIGNUM *range);
203\& int BN_pseudo_rand_range(BIGNUM *rnd, BIGNUM *range);
227.Ve
228.PP
229.Vb 4
204\&
230\& BIGNUM *BN_generate_prime(BIGNUM *ret, int bits,int safe, BIGNUM *add,
231\& BIGNUM *rem, void (*callback)(int, int, void *), void *cb_arg);
232\& int BN_is_prime(const BIGNUM *p, int nchecks,
233\& void (*callback)(int, int, void *), BN_CTX *ctx, void *cb_arg);
205\& BIGNUM *BN_generate_prime(BIGNUM *ret, int bits,int safe, BIGNUM *add,
206\& BIGNUM *rem, void (*callback)(int, int, void *), void *cb_arg);
207\& int BN_is_prime(const BIGNUM *p, int nchecks,
208\& void (*callback)(int, int, void *), BN_CTX *ctx, void *cb_arg);
234.Ve
235.PP
236.Vb 8
209\&
237\& int BN_set_bit(BIGNUM *a, int n);
238\& int BN_clear_bit(BIGNUM *a, int n);
239\& int BN_is_bit_set(const BIGNUM *a, int n);
240\& int BN_mask_bits(BIGNUM *a, int n);
241\& int BN_lshift(BIGNUM *r, const BIGNUM *a, int n);
242\& int BN_lshift1(BIGNUM *r, BIGNUM *a);
243\& int BN_rshift(BIGNUM *r, BIGNUM *a, int n);
244\& int BN_rshift1(BIGNUM *r, BIGNUM *a);
210\& int BN_set_bit(BIGNUM *a, int n);
211\& int BN_clear_bit(BIGNUM *a, int n);
212\& int BN_is_bit_set(const BIGNUM *a, int n);
213\& int BN_mask_bits(BIGNUM *a, int n);
214\& int BN_lshift(BIGNUM *r, const BIGNUM *a, int n);
215\& int BN_lshift1(BIGNUM *r, BIGNUM *a);
216\& int BN_rshift(BIGNUM *r, BIGNUM *a, int n);
217\& int BN_rshift1(BIGNUM *r, BIGNUM *a);
245.Ve
246.PP
247.Vb 10
218\&
248\& int BN_bn2bin(const BIGNUM *a, unsigned char *to);
249\& BIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM *ret);
250\& char *BN_bn2hex(const BIGNUM *a);
251\& char *BN_bn2dec(const BIGNUM *a);
252\& int BN_hex2bn(BIGNUM **a, const char *str);
253\& int BN_dec2bn(BIGNUM **a, const char *str);
254\& int BN_print(BIO *fp, const BIGNUM *a);
255\& int BN_print_fp(FILE *fp, const BIGNUM *a);
256\& int BN_bn2mpi(const BIGNUM *a, unsigned char *to);
257\& BIGNUM *BN_mpi2bn(unsigned char *s, int len, BIGNUM *ret);
219\& int BN_bn2bin(const BIGNUM *a, unsigned char *to);
220\& BIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM *ret);
221\& char *BN_bn2hex(const BIGNUM *a);
222\& char *BN_bn2dec(const BIGNUM *a);
223\& int BN_hex2bn(BIGNUM **a, const char *str);
224\& int BN_dec2bn(BIGNUM **a, const char *str);
225\& int BN_print(BIO *fp, const BIGNUM *a);
226\& int BN_print_fp(FILE *fp, const BIGNUM *a);
227\& int BN_bn2mpi(const BIGNUM *a, unsigned char *to);
228\& BIGNUM *BN_mpi2bn(unsigned char *s, int len, BIGNUM *ret);
258.Ve
259.PP
260.Vb 2
229\&
261\& BIGNUM *BN_mod_inverse(BIGNUM *r, BIGNUM *a, const BIGNUM *n,
262\& BN_CTX *ctx);
230\& BIGNUM *BN_mod_inverse(BIGNUM *r, BIGNUM *a, const BIGNUM *n,
231\& BN_CTX *ctx);
263.Ve
264.PP
265.Vb 6
232\&
266\& BN_RECP_CTX *BN_RECP_CTX_new(void);
267\& void BN_RECP_CTX_init(BN_RECP_CTX *recp);
268\& void BN_RECP_CTX_free(BN_RECP_CTX *recp);
269\& int BN_RECP_CTX_set(BN_RECP_CTX *recp, const BIGNUM *m, BN_CTX *ctx);
270\& int BN_mod_mul_reciprocal(BIGNUM *r, BIGNUM *a, BIGNUM *b,
271\& BN_RECP_CTX *recp, BN_CTX *ctx);
233\& BN_RECP_CTX *BN_RECP_CTX_new(void);
234\& void BN_RECP_CTX_init(BN_RECP_CTX *recp);
235\& void BN_RECP_CTX_free(BN_RECP_CTX *recp);
236\& int BN_RECP_CTX_set(BN_RECP_CTX *recp, const BIGNUM *m, BN_CTX *ctx);
237\& int BN_mod_mul_reciprocal(BIGNUM *r, BIGNUM *a, BIGNUM *b,
238\& BN_RECP_CTX *recp, BN_CTX *ctx);
272.Ve
273.PP
274.Vb 11
239\&
275\& BN_MONT_CTX *BN_MONT_CTX_new(void);
276\& void BN_MONT_CTX_init(BN_MONT_CTX *ctx);
277\& void BN_MONT_CTX_free(BN_MONT_CTX *mont);
278\& int BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *m, BN_CTX *ctx);
279\& BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to, BN_MONT_CTX *from);
280\& int BN_mod_mul_montgomery(BIGNUM *r, BIGNUM *a, BIGNUM *b,
281\& BN_MONT_CTX *mont, BN_CTX *ctx);
282\& int BN_from_montgomery(BIGNUM *r, BIGNUM *a, BN_MONT_CTX *mont,
283\& BN_CTX *ctx);
284\& int BN_to_montgomery(BIGNUM *r, BIGNUM *a, BN_MONT_CTX *mont,
285\& BN_CTX *ctx);
240\& BN_MONT_CTX *BN_MONT_CTX_new(void);
241\& void BN_MONT_CTX_init(BN_MONT_CTX *ctx);
242\& void BN_MONT_CTX_free(BN_MONT_CTX *mont);
243\& int BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *m, BN_CTX *ctx);
244\& BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to, BN_MONT_CTX *from);
245\& int BN_mod_mul_montgomery(BIGNUM *r, BIGNUM *a, BIGNUM *b,
246\& BN_MONT_CTX *mont, BN_CTX *ctx);
247\& int BN_from_montgomery(BIGNUM *r, BIGNUM *a, BN_MONT_CTX *mont,
248\& BN_CTX *ctx);
249\& int BN_to_montgomery(BIGNUM *r, BIGNUM *a, BN_MONT_CTX *mont,
250\& BN_CTX *ctx);
286.Ve
287.PP
288.Vb 19
251\&
289\& BN_BLINDING *BN_BLINDING_new(const BIGNUM *A, const BIGNUM *Ai,
290\& BIGNUM *mod);
291\& void BN_BLINDING_free(BN_BLINDING *b);
292\& int BN_BLINDING_update(BN_BLINDING *b,BN_CTX *ctx);
293\& int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
294\& int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
295\& int BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b,
296\& BN_CTX *ctx);

--- 8 unchanged lines hidden (view full) ---

305\& int (*bn_mod_exp)(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
306\& const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx),
307\& BN_MONT_CTX *m_ctx);
308.Ve
309.SH "DESCRIPTION"
310.IX Header "DESCRIPTION"
311This library performs arithmetic operations on integers of arbitrary
312size. It was written for use in public key cryptography, such as \s-1RSA\s0
252\& BN_BLINDING *BN_BLINDING_new(const BIGNUM *A, const BIGNUM *Ai,
253\& BIGNUM *mod);
254\& void BN_BLINDING_free(BN_BLINDING *b);
255\& int BN_BLINDING_update(BN_BLINDING *b,BN_CTX *ctx);
256\& int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
257\& int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
258\& int BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b,
259\& BN_CTX *ctx);

--- 8 unchanged lines hidden (view full) ---

268\& int (*bn_mod_exp)(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
269\& const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx),
270\& BN_MONT_CTX *m_ctx);
271.Ve
272.SH "DESCRIPTION"
273.IX Header "DESCRIPTION"
274This library performs arithmetic operations on integers of arbitrary
275size. It was written for use in public key cryptography, such as \s-1RSA\s0
313and Diffie\-Hellman.
276and Diffie-Hellman.
314.PP
315It uses dynamic memory allocation for storing its data structures.
316That means that there is no limit on the size of the numbers
317manipulated by these functions, but return values must always be
318checked in case a memory allocation error has occurred.
319.PP
320The basic object in this library is a \fB\s-1BIGNUM\s0\fR. It is used to hold a
321single large integer. This type should be considered opaque and fields

--- 22 unchanged lines hidden --- 		277.PP
278It uses dynamic memory allocation for storing its data structures.
279That means that there is no limit on the size of the numbers
280manipulated by these functions, but return values must always be
281checked in case a memory allocation error has occurred.
282.PP
283The basic object in this library is a \fB\s-1BIGNUM\s0\fR. It is used to hold a
284single large integer. This type should be considered opaque and fields

--- 22 unchanged lines hidden ---