BN_generate_prime.pod 6.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196
  1. =pod
  2. =head1 NAME
  3. BN_generate_prime_ex, BN_is_prime_ex, BN_is_prime_fasttest_ex, BN_GENCB_call,
  4. BN_GENCB_new, BN_GENCB_free, BN_GENCB_set_old, BN_GENCB_set, BN_GENCB_get_arg,
  5. BN_generate_prime, BN_is_prime, BN_is_prime_fasttest - generate primes and test
  6. for primality
  7. =head1 SYNOPSIS
  8. #include <openssl/bn.h>
  9. int BN_generate_prime_ex(BIGNUM *ret, int bits, int safe, const BIGNUM *add,
  10. const BIGNUM *rem, BN_GENCB *cb);
  11. int BN_is_prime_ex(const BIGNUM *p, int nchecks, BN_CTX *ctx, BN_GENCB *cb);
  12. int BN_is_prime_fasttest_ex(const BIGNUM *p, int nchecks, BN_CTX *ctx,
  13. int do_trial_division, BN_GENCB *cb);
  14. int BN_GENCB_call(BN_GENCB *cb, int a, int b);
  15. BN_GENCB *BN_GENCB_new(void);
  16. void BN_GENCB_free(BN_GENCB *cb);
  17. void BN_GENCB_set_old(BN_GENCB *gencb,
  18. void (*callback)(int, int, void *), void *cb_arg);
  19. void BN_GENCB_set(BN_GENCB *gencb,
  20. int (*callback)(int, int, BN_GENCB *), void *cb_arg);
  21. void *BN_GENCB_get_arg(BN_GENCB *cb);
  22. Deprecated:
  23. #if OPENSSL_API_COMPAT < 0x00908000L
  24. BIGNUM *BN_generate_prime(BIGNUM *ret, int num, int safe, BIGNUM *add,
  25. BIGNUM *rem, void (*callback)(int, int, void *),
  26. void *cb_arg);
  27. int BN_is_prime(const BIGNUM *a, int checks,
  28. void (*callback)(int, int, void *), BN_CTX *ctx, void *cb_arg);
  29. int BN_is_prime_fasttest(const BIGNUM *a, int checks,
  30. void (*callback)(int, int, void *), BN_CTX *ctx,
  31. void *cb_arg, int do_trial_division);
  32. #endif
  33. =head1 DESCRIPTION
  34. BN_generate_prime_ex() generates a pseudo-random prime number of
  35. at least bit length B<bits>.
  36. If B<ret> is not B<NULL>, it will be used to store the number.
  37. If B<cb> is not B<NULL>, it is used as follows:
  38. =over 2
  39. =item *
  40. B<BN_GENCB_call(cb, 0, i)> is called after generating the i-th
  41. potential prime number.
  42. =item *
  43. While the number is being tested for primality,
  44. B<BN_GENCB_call(cb, 1, j)> is called as described below.
  45. =item *
  46. When a prime has been found, B<BN_GENCB_call(cb, 2, i)> is called.
  47. =back
  48. The prime may have to fulfill additional requirements for use in
  49. Diffie-Hellman key exchange:
  50. If B<add> is not B<NULL>, the prime will fulfill the condition p % B<add>
  51. == B<rem> (p % B<add> == 1 if B<rem> == B<NULL>) in order to suit a given
  52. generator.
  53. If B<safe> is true, it will be a safe prime (i.e. a prime p so
  54. that (p-1)/2 is also prime).
  55. The PRNG must be seeded prior to calling BN_generate_prime_ex().
  56. The prime number generation has a negligible error probability.
  57. BN_is_prime_ex() and BN_is_prime_fasttest_ex() test if the number B<p> is
  58. prime. The following tests are performed until one of them shows that
  59. B<p> is composite; if B<p> passes all these tests, it is considered
  60. prime.
  61. BN_is_prime_fasttest_ex(), when called with B<do_trial_division == 1>,
  62. first attempts trial division by a number of small primes;
  63. if no divisors are found by this test and B<cb> is not B<NULL>,
  64. B<BN_GENCB_call(cb, 1, -1)> is called.
  65. If B<do_trial_division == 0>, this test is skipped.
  66. Both BN_is_prime_ex() and BN_is_prime_fasttest_ex() perform a Miller-Rabin
  67. probabilistic primality test with B<nchecks> iterations. If
  68. B<nchecks == BN_prime_checks>, a number of iterations is used that
  69. yields a false positive rate of at most 2^-80 for random input.
  70. If B<cb> is not B<NULL>, B<BN_GENCB_call(cb, 1, j)> is called
  71. after the j-th iteration (j = 0, 1, ...). B<ctx> is a
  72. pre-allocated B<BN_CTX> (to save the overhead of allocating and
  73. freeing the structure in a loop), or B<NULL>.
  74. BN_GENCB_call() calls the callback function held in the B<BN_GENCB> structure
  75. and passes the ints B<a> and B<b> as arguments. There are two types of
  76. B<BN_GENCB> structure that are supported: "new" style and "old" style. New
  77. programs should prefer the "new" style, whilst the "old" style is provided
  78. for backwards compatibility purposes.
  79. A B<BN_GENCB> structure should be created through a call to BN_GENCB_new(),
  80. and freed through a call to BN_GENCB_free().
  81. For "new" style callbacks a BN_GENCB structure should be initialised with a
  82. call to BN_GENCB_set(), where B<gencb> is a B<BN_GENCB *>, B<callback> is of
  83. type B<int (*callback)(int, int, BN_GENCB *)> and B<cb_arg> is a B<void *>.
  84. "Old" style callbacks are the same except they are initialised with a call
  85. to BN_GENCB_set_old() and B<callback> is of type
  86. B<void (*callback)(int, int, void *)>.
  87. A callback is invoked through a call to B<BN_GENCB_call>. This will check
  88. the type of the callback and will invoke B<callback(a, b, gencb)> for new
  89. style callbacks or B<callback(a, b, cb_arg)> for old style.
  90. It is possible to obtained the argument associated with a BN_GENCB structure
  91. (set via a call to BN_GENCB_set or BN_GENCB_set_old) using BN_GENCB_get_arg.
  92. BN_generate_prime() (deprecated) works in the same way as
  93. BN_generate_prime_ex() but expects an old-style callback function
  94. directly in the B<callback> parameter, and an argument to pass to it in
  95. the B<cb_arg>. BN_is_prime() and BN_is_prime_fasttest()
  96. can similarly be compared to BN_is_prime_ex() and
  97. BN_is_prime_fasttest_ex(), respectively.
  98. =head1 RETURN VALUES
  99. BN_generate_prime_ex() return 1 on success or 0 on error.
  100. BN_is_prime_ex(), BN_is_prime_fasttest_ex(), BN_is_prime() and
  101. BN_is_prime_fasttest() return 0 if the number is composite, 1 if it is
  102. prime with an error probability of less than 0.25^B<nchecks>, and
  103. -1 on error.
  104. BN_generate_prime() returns the prime number on success, B<NULL> otherwise.
  105. BN_GENCB_new returns a pointer to a BN_GENCB structure on success, or B<NULL>
  106. otherwise.
  107. BN_GENCB_get_arg returns the argument previously associated with a BN_GENCB
  108. structure.
  109. Callback functions should return 1 on success or 0 on error.
  110. The error codes can be obtained by L<ERR_get_error(3)>.
  111. =head1 REMOVED FUNCTIONALITY
  112. As of OpenSSL 1.1.0 it is no longer possible to create a BN_GENCB structure
  113. directly, as in:
  114. BN_GENCB callback;
  115. Instead applications should create a BN_GENCB structure using BN_GENCB_new:
  116. BN_GENCB *callback;
  117. callback = BN_GENCB_new();
  118. if (!callback)
  119. /* error */
  120. ...
  121. BN_GENCB_free(callback);
  122. =head1 SEE ALSO
  123. L<ERR_get_error(3)>, L<RAND_bytes(3)>
  124. =head1 HISTORY
  125. BN_GENCB_new(), BN_GENCB_free(),
  126. and BN_GENCB_get_arg() were added in OpenSSL 1.1.0
  127. =head1 COPYRIGHT
  128. Copyright 2000-2017 The OpenSSL Project Authors. All Rights Reserved.
  129. Licensed under the OpenSSL license (the "License"). You may not use
  130. this file except in compliance with the License. You can obtain a copy
  131. in the file LICENSE in the source distribution or at
  132. L<https://www.openssl.org/source/license.html>.
  133. =cut