選択できるのは25トピックまでです。 トピックは、先頭が英数字で、英数字とダッシュ('-')を使用した35文字以内のものにしてください。
 
 
 
 
 
 

181 行
5.7 KiB

  1. /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
  2. * All rights reserved.
  3. *
  4. * This package is an SSL implementation written
  5. * by Eric Young (eay@cryptsoft.com).
  6. * The implementation was written so as to conform with Netscapes SSL.
  7. *
  8. * This library is free for commercial and non-commercial use as long as
  9. * the following conditions are aheared to. The following conditions
  10. * apply to all code found in this distribution, be it the RC4, RSA,
  11. * lhash, DES, etc., code; not just the SSL code. The SSL documentation
  12. * included with this distribution is covered by the same copyright terms
  13. * except that the holder is Tim Hudson (tjh@cryptsoft.com).
  14. *
  15. * Copyright remains Eric Young's, and as such any Copyright notices in
  16. * the code are not to be removed.
  17. * If this package is used in a product, Eric Young should be given attribution
  18. * as the author of the parts of the library used.
  19. * This can be in the form of a textual message at program startup or
  20. * in documentation (online or textual) provided with the package.
  21. *
  22. * Redistribution and use in source and binary forms, with or without
  23. * modification, are permitted provided that the following conditions
  24. * are met:
  25. * 1. Redistributions of source code must retain the copyright
  26. * notice, this list of conditions and the following disclaimer.
  27. * 2. Redistributions in binary form must reproduce the above copyright
  28. * notice, this list of conditions and the following disclaimer in the
  29. * documentation and/or other materials provided with the distribution.
  30. * 3. All advertising materials mentioning features or use of this software
  31. * must display the following acknowledgement:
  32. * "This product includes cryptographic software written by
  33. * Eric Young (eay@cryptsoft.com)"
  34. * The word 'cryptographic' can be left out if the rouines from the library
  35. * being used are not cryptographic related :-).
  36. * 4. If you include any Windows specific code (or a derivative thereof) from
  37. * the apps directory (application code) you must include an acknowledgement:
  38. * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
  39. *
  40. * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
  41. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  42. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  43. * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
  44. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  45. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  46. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  47. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  48. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  49. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  50. * SUCH DAMAGE.
  51. *
  52. * The licence and distribution terms for any publically available version or
  53. * derivative of this code cannot be changed. i.e. this code cannot simply be
  54. * copied and put under another distribution licence
  55. * [including the GNU Public Licence.] */
  56. #include <openssl/dh.h>
  57. #include <openssl/bn.h>
  58. #include "internal.h"
  59. int DH_check_pub_key(const DH *dh, const BIGNUM *pub_key, int *ret) {
  60. int ok = 0;
  61. BIGNUM q;
  62. *ret = 0;
  63. BN_init(&q);
  64. if (!BN_set_word(&q, 1)) {
  65. goto err;
  66. }
  67. if (BN_cmp(pub_key, &q) <= 0) {
  68. *ret |= DH_CHECK_PUBKEY_TOO_SMALL;
  69. }
  70. if (!BN_copy(&q, dh->p) ||
  71. !BN_sub_word(&q, 1)) {
  72. goto err;
  73. }
  74. if (BN_cmp(pub_key, &q) >= 0) {
  75. *ret |= DH_CHECK_PUBKEY_TOO_LARGE;
  76. }
  77. ok = 1;
  78. err:
  79. BN_free(&q);
  80. return ok;
  81. }
  82. int DH_check(const DH *dh, int *ret) {
  83. /* Check that p is a safe prime and if g is 2, 3 or 5, check that it is a
  84. * suitable generator where:
  85. * for 2, p mod 24 == 11
  86. * for 3, p mod 12 == 5
  87. * for 5, p mod 10 == 3 or 7
  88. * should hold.
  89. */
  90. int ok = 0;
  91. BN_CTX *ctx = NULL;
  92. BN_ULONG l;
  93. BIGNUM *t1 = NULL, *t2 = NULL;
  94. *ret = 0;
  95. ctx = BN_CTX_new();
  96. if (ctx == NULL) {
  97. goto err;
  98. }
  99. BN_CTX_start(ctx);
  100. t1 = BN_CTX_get(ctx);
  101. if (t1 == NULL) {
  102. goto err;
  103. }
  104. t2 = BN_CTX_get(ctx);
  105. if (t2 == NULL) {
  106. goto err;
  107. }
  108. if (dh->q) {
  109. if (BN_cmp(dh->g, BN_value_one()) <= 0) {
  110. *ret |= DH_CHECK_NOT_SUITABLE_GENERATOR;
  111. } else if (BN_cmp(dh->g, dh->p) >= 0) {
  112. *ret |= DH_CHECK_NOT_SUITABLE_GENERATOR;
  113. } else {
  114. /* Check g^q == 1 mod p */
  115. if (!BN_mod_exp(t1, dh->g, dh->q, dh->p, ctx)) {
  116. goto err;
  117. }
  118. if (!BN_is_one(t1)) {
  119. *ret |= DH_CHECK_NOT_SUITABLE_GENERATOR;
  120. }
  121. }
  122. if (!BN_is_prime_ex(dh->q, BN_prime_checks, ctx, NULL)) {
  123. *ret |= DH_CHECK_Q_NOT_PRIME;
  124. }
  125. /* Check p == 1 mod q i.e. q divides p - 1 */
  126. if (!BN_div(t1, t2, dh->p, dh->q, ctx)) {
  127. goto err;
  128. }
  129. if (!BN_is_one(t2)) {
  130. *ret |= DH_CHECK_INVALID_Q_VALUE;
  131. }
  132. if (dh->j && BN_cmp(dh->j, t1)) {
  133. *ret |= DH_CHECK_INVALID_J_VALUE;
  134. }
  135. } else if (BN_is_word(dh->g, DH_GENERATOR_2)) {
  136. l = BN_mod_word(dh->p, 24);
  137. if (l != 11) {
  138. *ret |= DH_CHECK_NOT_SUITABLE_GENERATOR;
  139. }
  140. } else if (BN_is_word(dh->g, DH_GENERATOR_5)) {
  141. l = BN_mod_word(dh->p, 10);
  142. if (l != 3 && l != 7) {
  143. *ret |= DH_CHECK_NOT_SUITABLE_GENERATOR;
  144. }
  145. } else {
  146. *ret |= DH_CHECK_UNABLE_TO_CHECK_GENERATOR;
  147. }
  148. if (!BN_is_prime_ex(dh->p, BN_prime_checks, ctx, NULL)) {
  149. *ret |= DH_CHECK_P_NOT_PRIME;
  150. } else if (!dh->q) {
  151. if (!BN_rshift1(t1, dh->p)) {
  152. goto err;
  153. }
  154. if (!BN_is_prime_ex(t1, BN_prime_checks, ctx, NULL)) {
  155. *ret |= DH_CHECK_P_NOT_SAFE_PRIME;
  156. }
  157. }
  158. ok = 1;
  159. err:
  160. if (ctx != NULL) {
  161. BN_CTX_end(ctx);
  162. BN_CTX_free(ctx);
  163. }
  164. return ok;
  165. }