rsa_chk.c 6.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199
  1. /* crypto/rsa/rsa_chk.c */
  2. /* ====================================================================
  3. * Copyright (c) 1999-2019 The OpenSSL Project. All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions
  7. * are met:
  8. *
  9. * 1. Redistributions of source code must retain the above copyright
  10. * notice, this list of conditions and the following disclaimer.
  11. *
  12. * 2. Redistributions in binary form must reproduce the above copyright
  13. * notice, this list of conditions and the following disclaimer in
  14. * the documentation and/or other materials provided with the
  15. * distribution.
  16. *
  17. * 3. All advertising materials mentioning features or use of this
  18. * software must display the following acknowledgment:
  19. * "This product includes software developed by the OpenSSL Project
  20. * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
  21. *
  22. * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
  23. * endorse or promote products derived from this software without
  24. * prior written permission. For written permission, please contact
  25. * [email protected].
  26. *
  27. * 5. Products derived from this software may not be called "OpenSSL"
  28. * nor may "OpenSSL" appear in their names without prior written
  29. * permission of the OpenSSL Project.
  30. *
  31. * 6. Redistributions of any form whatsoever must retain the following
  32. * acknowledgment:
  33. * "This product includes software developed by the OpenSSL Project
  34. * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
  35. *
  36. * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
  37. * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  38. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
  39. * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
  40. * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  41. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  42. * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  43. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  44. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
  45. * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  46. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
  47. * OF THE POSSIBILITY OF SUCH DAMAGE.
  48. * ====================================================================
  49. */
  50. #include <openssl/bn.h>
  51. #include <openssl/err.h>
  52. #include <openssl/rsa.h>
  53. int RSA_check_key(const RSA *key)
  54. {
  55. BIGNUM *i, *j, *k, *l, *m;
  56. BN_CTX *ctx;
  57. int ret = 1;
  58. if (!key->p || !key->q || !key->n || !key->e || !key->d) {
  59. RSAerr(RSA_F_RSA_CHECK_KEY, RSA_R_VALUE_MISSING);
  60. return 0;
  61. }
  62. /* Set consant-time flag on private parameters */
  63. BN_set_flags(key->p, BN_FLG_CONSTTIME);
  64. BN_set_flags(key->q, BN_FLG_CONSTTIME);
  65. BN_set_flags(key->d, BN_FLG_CONSTTIME);
  66. i = BN_new();
  67. j = BN_new();
  68. k = BN_new();
  69. l = BN_new();
  70. m = BN_new();
  71. ctx = BN_CTX_new();
  72. if (i == NULL || j == NULL || k == NULL || l == NULL
  73. || m == NULL || ctx == NULL) {
  74. ret = -1;
  75. RSAerr(RSA_F_RSA_CHECK_KEY, ERR_R_MALLOC_FAILURE);
  76. goto err;
  77. }
  78. if (BN_is_one(key->e)) {
  79. ret = 0;
  80. RSAerr(RSA_F_RSA_CHECK_KEY, RSA_R_BAD_E_VALUE);
  81. }
  82. if (!BN_is_odd(key->e)) {
  83. ret = 0;
  84. RSAerr(RSA_F_RSA_CHECK_KEY, RSA_R_BAD_E_VALUE);
  85. }
  86. /* p prime? */
  87. if (BN_is_prime_ex(key->p, BN_prime_checks, NULL, NULL) != 1) {
  88. ret = 0;
  89. RSAerr(RSA_F_RSA_CHECK_KEY, RSA_R_P_NOT_PRIME);
  90. }
  91. /* q prime? */
  92. if (BN_is_prime_ex(key->q, BN_prime_checks, NULL, NULL) != 1) {
  93. ret = 0;
  94. RSAerr(RSA_F_RSA_CHECK_KEY, RSA_R_Q_NOT_PRIME);
  95. }
  96. /* n = p*q? */
  97. if (!BN_mul(i, key->p, key->q, ctx)) {
  98. ret = -1;
  99. goto err;
  100. }
  101. if (BN_cmp(i, key->n) != 0) {
  102. ret = 0;
  103. RSAerr(RSA_F_RSA_CHECK_KEY, RSA_R_N_DOES_NOT_EQUAL_P_Q);
  104. }
  105. /* d*e = 1 mod lcm(p-1,q-1)? */
  106. if (!BN_sub(i, key->p, BN_value_one())) {
  107. ret = -1;
  108. goto err;
  109. }
  110. if (!BN_sub(j, key->q, BN_value_one())) {
  111. ret = -1;
  112. goto err;
  113. }
  114. /* now compute k = lcm(i,j) */
  115. if (!BN_mul(l, i, j, ctx)) {
  116. ret = -1;
  117. goto err;
  118. }
  119. if (!BN_gcd(m, i, j, ctx)) {
  120. ret = -1;
  121. goto err;
  122. }
  123. if (!BN_div(k, NULL, l, m, ctx)) { /* remainder is 0 */
  124. ret = -1;
  125. goto err;
  126. }
  127. if (!BN_mod_mul(i, key->d, key->e, k, ctx)) {
  128. ret = -1;
  129. goto err;
  130. }
  131. if (!BN_is_one(i)) {
  132. ret = 0;
  133. RSAerr(RSA_F_RSA_CHECK_KEY, RSA_R_D_E_NOT_CONGRUENT_TO_1);
  134. }
  135. if (key->dmp1 != NULL && key->dmq1 != NULL && key->iqmp != NULL) {
  136. /* Set consant-time flag on CRT parameters */
  137. BN_set_flags(key->dmp1, BN_FLG_CONSTTIME);
  138. BN_set_flags(key->dmq1, BN_FLG_CONSTTIME);
  139. BN_set_flags(key->iqmp, BN_FLG_CONSTTIME);
  140. /* dmp1 = d mod (p-1)? */
  141. if (!BN_sub(i, key->p, BN_value_one())) {
  142. ret = -1;
  143. goto err;
  144. }
  145. if (!BN_mod(j, key->d, i, ctx)) {
  146. ret = -1;
  147. goto err;
  148. }
  149. if (BN_cmp(j, key->dmp1) != 0) {
  150. ret = 0;
  151. RSAerr(RSA_F_RSA_CHECK_KEY, RSA_R_DMP1_NOT_CONGRUENT_TO_D);
  152. }
  153. /* dmq1 = d mod (q-1)? */
  154. if (!BN_sub(i, key->q, BN_value_one())) {
  155. ret = -1;
  156. goto err;
  157. }
  158. if (!BN_mod(j, key->d, i, ctx)) {
  159. ret = -1;
  160. goto err;
  161. }
  162. if (BN_cmp(j, key->dmq1) != 0) {
  163. ret = 0;
  164. RSAerr(RSA_F_RSA_CHECK_KEY, RSA_R_DMQ1_NOT_CONGRUENT_TO_D);
  165. }
  166. /* iqmp = q^-1 mod p? */
  167. if (!BN_mod_inverse(i, key->q, key->p, ctx)) {
  168. ret = -1;
  169. goto err;
  170. }
  171. if (BN_cmp(i, key->iqmp) != 0) {
  172. ret = 0;
  173. RSAerr(RSA_F_RSA_CHECK_KEY, RSA_R_IQMP_NOT_INVERSE_OF_Q);
  174. }
  175. }
  176. err:
  177. BN_free(i);
  178. BN_free(j);
  179. BN_free(k);
  180. BN_free(l);
  181. BN_free(m);
  182. BN_CTX_free(ctx);
  183. return ret;
  184. }