BN_generate_prime.pod 6.5 KB
Newer Older
1 2 3 4
=pod

=head1 NAME

M
Matt Caswell 已提交
5
BN_generate_prime_ex, BN_is_prime_ex, BN_is_prime_fasttest_ex, BN_GENCB_call,
6 7 8
BN_GENCB_new, BN_GENCB_free, BN_GENCB_set_old, BN_GENCB_set, BN_GENCB_get_arg,
BN_generate_prime, BN_is_prime, BN_is_prime_fasttest - generate primes and test
for primality
9 10 11 12 13

=head1 SYNOPSIS

 #include <openssl/bn.h>

14
 int BN_generate_prime_ex(BIGNUM *ret, int bits, int safe, const BIGNUM *add,
15
                          const BIGNUM *rem, BN_GENCB *cb);
M
Matt Caswell 已提交
16

17
 int BN_is_prime_ex(const BIGNUM *p, int nchecks, BN_CTX *ctx, BN_GENCB *cb);
M
Matt Caswell 已提交
18

19
 int BN_is_prime_fasttest_ex(const BIGNUM *p, int nchecks, BN_CTX *ctx,
20
                             int do_trial_division, BN_GENCB *cb);
M
Matt Caswell 已提交
21 22 23

 int BN_GENCB_call(BN_GENCB *cb, int a, int b);

24
 BN_GENCB *BN_GENCB_new(void);
M
Matt Caswell 已提交
25

26
 void BN_GENCB_free(BN_GENCB *cb);
M
Matt Caswell 已提交
27

28
 void BN_GENCB_set_old(BN_GENCB *gencb,
29
                       void (*callback)(int, int, void *), void *cb_arg);
30 31

 void BN_GENCB_set(BN_GENCB *gencb,
32
                   int (*callback)(int, int, BN_GENCB *), void *cb_arg);
33 34

 void *BN_GENCB_get_arg(BN_GENCB *cb);
M
Matt Caswell 已提交
35 36 37

Deprecated:

38
 #if OPENSSL_API_COMPAT < 0x00908000L
39
 BIGNUM *BN_generate_prime(BIGNUM *ret, int num, int safe, BIGNUM *add,
40 41
                           BIGNUM *rem, void (*callback)(int, int, void *),
                           void *cb_arg);
42

43 44
 int BN_is_prime(const BIGNUM *a, int checks,
                 void (*callback)(int, int, void *), BN_CTX *ctx, void *cb_arg);
45

46
 int BN_is_prime_fasttest(const BIGNUM *a, int checks,
47 48
                          void (*callback)(int, int, void *), BN_CTX *ctx,
                          void *cb_arg, int do_trial_division);
49
 #endif
50

51 52
=head1 DESCRIPTION

M
Matt Caswell 已提交
53
BN_generate_prime_ex() generates a pseudo-random prime number of
54
at least bit length B<bits>.
55
If B<ret> is not B<NULL>, it will be used to store the number.
56

M
Matt Caswell 已提交
57
If B<cb> is not B<NULL>, it is used as follows:
58

R
Rich Salz 已提交
59
=over 2
60 61 62

=item *

M
Matt Caswell 已提交
63
B<BN_GENCB_call(cb, 0, i)> is called after generating the i-th
64 65 66 67
potential prime number.

=item *

M
Matt Caswell 已提交
68 69
While the number is being tested for primality,
B<BN_GENCB_call(cb, 1, j)> is called as described below.
70 71 72

=item *

M
Matt Caswell 已提交
73
When a prime has been found, B<BN_GENCB_call(cb, 2, i)> is called.
74 75 76 77 78 79

=back

The prime may have to fulfill additional requirements for use in
Diffie-Hellman key exchange:

80 81
If B<add> is not B<NULL>, the prime will fulfill the condition p % B<add>
== B<rem> (p % B<add> == 1 if B<rem> == B<NULL>) in order to suit a given
82 83 84 85 86
generator.

If B<safe> is true, it will be a safe prime (i.e. a prime p so
that (p-1)/2 is also prime).

M
Matt Caswell 已提交
87
The PRNG must be seeded prior to calling BN_generate_prime_ex().
88 89
The prime number generation has a negligible error probability.

M
Matt Caswell 已提交
90
BN_is_prime_ex() and BN_is_prime_fasttest_ex() test if the number B<p> is
91
prime.  The following tests are performed until one of them shows that
M
Matt Caswell 已提交
92
B<p> is composite; if B<p> passes all these tests, it is considered
93 94
prime.

M
Matt Caswell 已提交
95
BN_is_prime_fasttest_ex(), when called with B<do_trial_division == 1>,
96
first attempts trial division by a number of small primes;
M
Matt Caswell 已提交
97 98
if no divisors are found by this test and B<cb> is not B<NULL>,
B<BN_GENCB_call(cb, 1, -1)> is called.
99 100
If B<do_trial_division == 0>, this test is skipped.

M
Matt Caswell 已提交
101 102 103
Both BN_is_prime_ex() and BN_is_prime_fasttest_ex() perform a Miller-Rabin
probabilistic primality test with B<nchecks> iterations. If
B<nchecks == BN_prime_checks>, a number of iterations is used that
104
yields a false positive rate of at most 2^-80 for random input.
105

M
Matt Caswell 已提交
106
If B<cb> is not B<NULL>, B<BN_GENCB_call(cb, 1, j)> is called
107 108
after the j-th iteration (j = 0, 1, ...). B<ctx> is a
pre-allocated B<BN_CTX> (to save the overhead of allocating and
109
freeing the structure in a loop), or B<NULL>.
110

M
Matt Caswell 已提交
111 112 113 114 115 116
BN_GENCB_call calls the callback function held in the B<BN_GENCB> structure
and passes the ints B<a> and B<b> as arguments. There are two types of
B<BN_GENCB> structure that are supported: "new" style and "old" style. New
programs should prefer the "new" style, whilst the "old" style is provided
for backwards compatibility purposes.

R
Rich Salz 已提交
117 118
A BN_GENCB structure should be created through a call to BN_GENCB_new(),
and freed through a call to BN_GENCB_free().
119

M
Matt Caswell 已提交
120
For "new" style callbacks a BN_GENCB structure should be initialised with a
121
call to BN_GENCB_set(), where B<gencb> is a B<BN_GENCB *>, B<callback> is of
M
Matt Caswell 已提交
122 123
type B<int (*callback)(int, int, BN_GENCB *)> and B<cb_arg> is a B<void *>.
"Old" style callbacks are the same except they are initialised with a call
124
to BN_GENCB_set_old() and B<callback> is of type
M
Matt Caswell 已提交
125 126 127 128 129 130
B<void (*callback)(int, int, void *)>.

A callback is invoked through a call to B<BN_GENCB_call>. This will check
the type of the callback and will invoke B<callback(a, b, gencb)> for new
style callbacks or B<callback(a, b, cb_arg)> for old style.

131 132 133
It is possible to obtained the argument associated with a BN_GENCB structure
(set via a call to BN_GENCB_set or BN_GENCB_set_old) using BN_GENCB_get_arg.

M
Matt Caswell 已提交
134 135 136 137 138 139 140
BN_generate_prime (deprecated) works in the same way as
BN_generate_prime_ex but expects an old style callback function
directly in the B<callback> parameter, and an argument to pass to it in
the B<cb_arg>. Similarly BN_is_prime and BN_is_prime_fasttest are
deprecated and can be compared to BN_is_prime_ex and
BN_is_prime_fasttest_ex respectively.

141 142
=head1 RETURN VALUES

M
Matt Caswell 已提交
143
BN_generate_prime_ex() return 1 on success or 0 on error.
144

M
Matt Caswell 已提交
145 146 147
BN_is_prime_ex(), BN_is_prime_fasttest_ex(), BN_is_prime() and
BN_is_prime_fasttest() return 0 if the number is composite, 1 if it is
prime with an error probability of less than 0.25^B<nchecks>, and
148 149
-1 on error.

M
Matt Caswell 已提交
150 151
BN_generate_prime() returns the prime number on success, B<NULL> otherwise.

152 153 154 155 156 157
BN_GENCB_new returns a pointer to a BN_GENCB structure on success, or B<NULL>
otherwise.

BN_GENCB_get_arg returns the argument previously associated with a BN_GENCB
structure.

M
Matt Caswell 已提交
158 159
Callback functions should return 1 on success or 0 on error.

R
Rich Salz 已提交
160
The error codes can be obtained by L<ERR_get_error(3)>.
161

162 163 164 165 166 167 168 169 170 171 172
=head1 REMOVED FUNCTIONALITY

As of OpenSSL 1.1.0 it is no longer possible to create a BN_GENCB structure
directly, as in:

 BN_GENCB callback;

Instead applications should create a BN_GENCB structure using BN_GENCB_new:

 BN_GENCB *callback;
 callback = BN_GENCB_new();
173 174
 if (!callback)
     /* error */
175 176 177
 ...
 BN_GENCB_free(callback);

178 179
=head1 SEE ALSO

R
Rich Salz 已提交
180
L<ERR_get_error(3)>, L<RAND_bytes(3)>
181 182 183

=head1 HISTORY

R
Rich Salz 已提交
184 185
BN_GENCB_new(), BN_GENCB_free(),
and BN_GENCB_get_arg() were added in OpenSSL 1.1.0
186

R
Rich Salz 已提交
187 188
=head1 COPYRIGHT

R
Rich Salz 已提交
189
Copyright 2000-2017 The OpenSSL Project Authors. All Rights Reserved.
R
Rich Salz 已提交
190 191 192 193 194 195 196

Licensed under the OpenSSL license (the "License").  You may not use
this file except in compliance with the License.  You can obtain a copy
in the file LICENSE in the source distribution or at
L<https://www.openssl.org/source/license.html>.

=cut