You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 
 

326 line
11 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. *
  57. * The DSS routines are based on patches supplied by
  58. * Steven Schoch <schoch@sheba.arc.nasa.gov>. */
  59. #include <openssl/dsa.h>
  60. #include <string.h>
  61. #include <openssl/bn.h>
  62. #include <openssl/crypto.h>
  63. #include <openssl/err.h>
  64. #include "internal.h"
  65. static int dsa_cb(int p, int n, BN_GENCB *arg);
  66. /* The following values are taken from the updated Appendix 5 to FIPS PUB 186
  67. * and also appear in Appendix 5 to FIPS PUB 186-1. */
  68. static const uint8_t seed[20] = {
  69. 0xd5, 0x01, 0x4e, 0x4b, 0x60, 0xef, 0x2b, 0xa8, 0xb6, 0x21, 0x1b,
  70. 0x40, 0x62, 0xba, 0x32, 0x24, 0xe0, 0x42, 0x7d, 0xd3,
  71. };
  72. static const uint8_t fips_p[] = {
  73. 0x8d, 0xf2, 0xa4, 0x94, 0x49, 0x22, 0x76, 0xaa, 0x3d, 0x25, 0x75,
  74. 0x9b, 0xb0, 0x68, 0x69, 0xcb, 0xea, 0xc0, 0xd8, 0x3a, 0xfb, 0x8d,
  75. 0x0c, 0xf7, 0xcb, 0xb8, 0x32, 0x4f, 0x0d, 0x78, 0x82, 0xe5, 0xd0,
  76. 0x76, 0x2f, 0xc5, 0xb7, 0x21, 0x0e, 0xaf, 0xc2, 0xe9, 0xad, 0xac,
  77. 0x32, 0xab, 0x7a, 0xac, 0x49, 0x69, 0x3d, 0xfb, 0xf8, 0x37, 0x24,
  78. 0xc2, 0xec, 0x07, 0x36, 0xee, 0x31, 0xc8, 0x02, 0x91,
  79. };
  80. static const uint8_t fips_q[] = {
  81. 0xc7, 0x73, 0x21, 0x8c, 0x73, 0x7e, 0xc8, 0xee, 0x99, 0x3b, 0x4f,
  82. 0x2d, 0xed, 0x30, 0xf4, 0x8e, 0xda, 0xce, 0x91, 0x5f,
  83. };
  84. static const uint8_t fips_g[] = {
  85. 0x62, 0x6d, 0x02, 0x78, 0x39, 0xea, 0x0a, 0x13, 0x41, 0x31, 0x63,
  86. 0xa5, 0x5b, 0x4c, 0xb5, 0x00, 0x29, 0x9d, 0x55, 0x22, 0x95, 0x6c,
  87. 0xef, 0xcb, 0x3b, 0xff, 0x10, 0xf3, 0x99, 0xce, 0x2c, 0x2e, 0x71,
  88. 0xcb, 0x9d, 0xe5, 0xfa, 0x24, 0xba, 0xbf, 0x58, 0xe5, 0xb7, 0x95,
  89. 0x21, 0x92, 0x5c, 0x9c, 0xc4, 0x2e, 0x9f, 0x6f, 0x46, 0x4b, 0x08,
  90. 0x8c, 0xc5, 0x72, 0xaf, 0x53, 0xe6, 0xd7, 0x88, 0x02,
  91. };
  92. static const uint8_t fips_x[] = {
  93. 0x20, 0x70, 0xb3, 0x22, 0x3d, 0xba, 0x37, 0x2f, 0xde, 0x1c, 0x0f,
  94. 0xfc, 0x7b, 0x2e, 0x3b, 0x49, 0x8b, 0x26, 0x06, 0x14,
  95. };
  96. static const uint8_t fips_y[] = {
  97. 0x19, 0x13, 0x18, 0x71, 0xd7, 0x5b, 0x16, 0x12, 0xa8, 0x19, 0xf2,
  98. 0x9d, 0x78, 0xd1, 0xb0, 0xd7, 0x34, 0x6f, 0x7a, 0xa7, 0x7b, 0xb6,
  99. 0x2a, 0x85, 0x9b, 0xfd, 0x6c, 0x56, 0x75, 0xda, 0x9d, 0x21, 0x2d,
  100. 0x3a, 0x36, 0xef, 0x16, 0x72, 0xef, 0x66, 0x0b, 0x8c, 0x7c, 0x25,
  101. 0x5c, 0xc0, 0xec, 0x74, 0x85, 0x8f, 0xba, 0x33, 0xf4, 0x4c, 0x06,
  102. 0x69, 0x96, 0x30, 0xa7, 0x6b, 0x03, 0x0e, 0xe3, 0x33,
  103. };
  104. static const uint8_t fips_digest[] = {
  105. 0xa9, 0x99, 0x3e, 0x36, 0x47, 0x06, 0x81, 0x6a, 0xba, 0x3e, 0x25,
  106. 0x71, 0x78, 0x50, 0xc2, 0x6c, 0x9c, 0xd0, 0xd8, 0x9d,
  107. };
  108. /* fips_sig is a DER-encoded version of the r and s values in FIPS PUB 186-1. */
  109. static const uint8_t fips_sig[] = {
  110. 0x30, 0x2d, 0x02, 0x15, 0x00, 0x8b, 0xac, 0x1a, 0xb6, 0x64, 0x10,
  111. 0x43, 0x5c, 0xb7, 0x18, 0x1f, 0x95, 0xb1, 0x6a, 0xb9, 0x7c, 0x92,
  112. 0xb3, 0x41, 0xc0, 0x02, 0x14, 0x41, 0xe2, 0x34, 0x5f, 0x1f, 0x56,
  113. 0xdf, 0x24, 0x58, 0xf4, 0x26, 0xd1, 0x55, 0xb4, 0xba, 0x2d, 0xb6,
  114. 0xdc, 0xd8, 0xc8,
  115. };
  116. /* fips_sig_negative is fips_sig with r encoded as a negative number. */
  117. static const uint8_t fips_sig_negative[] = {
  118. 0x30, 0x2c, 0x02, 0x14, 0x8b, 0xac, 0x1a, 0xb6, 0x64, 0x10, 0x43,
  119. 0x5c, 0xb7, 0x18, 0x1f, 0x95, 0xb1, 0x6a, 0xb9, 0x7c, 0x92, 0xb3,
  120. 0x41, 0xc0, 0x02, 0x14, 0x41, 0xe2, 0x34, 0x5f, 0x1f, 0x56, 0xdf,
  121. 0x24, 0x58, 0xf4, 0x26, 0xd1, 0x55, 0xb4, 0xba, 0x2d, 0xb6, 0xdc,
  122. 0xd8, 0xc8,
  123. };
  124. /* fip_sig_extra is fips_sig with trailing data. */
  125. static const uint8_t fips_sig_extra[] = {
  126. 0x30, 0x2d, 0x02, 0x15, 0x00, 0x8b, 0xac, 0x1a, 0xb6, 0x64, 0x10,
  127. 0x43, 0x5c, 0xb7, 0x18, 0x1f, 0x95, 0xb1, 0x6a, 0xb9, 0x7c, 0x92,
  128. 0xb3, 0x41, 0xc0, 0x02, 0x14, 0x41, 0xe2, 0x34, 0x5f, 0x1f, 0x56,
  129. 0xdf, 0x24, 0x58, 0xf4, 0x26, 0xd1, 0x55, 0xb4, 0xba, 0x2d, 0xb6,
  130. 0xdc, 0xd8, 0xc8, 0x00,
  131. };
  132. /* fips_sig_lengths is fips_sig with a non-minimally encoded length. */
  133. static const uint8_t fips_sig_bad_length[] = {
  134. 0x30, 0x81, 0x2d, 0x02, 0x15, 0x00, 0x8b, 0xac, 0x1a, 0xb6, 0x64,
  135. 0x10, 0x43, 0x5c, 0xb7, 0x18, 0x1f, 0x95, 0xb1, 0x6a, 0xb9, 0x7c,
  136. 0x92, 0xb3, 0x41, 0xc0, 0x02, 0x14, 0x41, 0xe2, 0x34, 0x5f, 0x1f,
  137. 0x56, 0xdf, 0x24, 0x58, 0xf4, 0x26, 0xd1, 0x55, 0xb4, 0xba, 0x2d,
  138. 0xb6, 0xdc, 0xd8, 0xc8, 0x00,
  139. };
  140. /* fips_sig_bad_r is fips_sig with a bad r value. */
  141. static const uint8_t fips_sig_bad_r[] = {
  142. 0x30, 0x2d, 0x02, 0x15, 0x00, 0x8c, 0xac, 0x1a, 0xb6, 0x64, 0x10,
  143. 0x43, 0x5c, 0xb7, 0x18, 0x1f, 0x95, 0xb1, 0x6a, 0xb9, 0x7c, 0x92,
  144. 0xb3, 0x41, 0xc0, 0x02, 0x14, 0x41, 0xe2, 0x34, 0x5f, 0x1f, 0x56,
  145. 0xdf, 0x24, 0x58, 0xf4, 0x26, 0xd1, 0x55, 0xb4, 0xba, 0x2d, 0xb6,
  146. 0xdc, 0xd8, 0xc8,
  147. };
  148. static DSA *get_fips_dsa(void) {
  149. DSA *dsa = DSA_new();
  150. if (!dsa) {
  151. return NULL;
  152. }
  153. dsa->p = BN_bin2bn(fips_p, sizeof(fips_p), NULL);
  154. dsa->q = BN_bin2bn(fips_q, sizeof(fips_q), NULL);
  155. dsa->g = BN_bin2bn(fips_g, sizeof(fips_g), NULL);
  156. dsa->pub_key = BN_bin2bn(fips_y, sizeof(fips_y), NULL);
  157. dsa->priv_key = BN_bin2bn(fips_x, sizeof(fips_x), NULL);
  158. if (dsa->p == NULL || dsa->q == NULL || dsa->g == NULL ||
  159. dsa->pub_key == NULL || dsa->priv_key == NULL) {
  160. DSA_free(dsa);
  161. return NULL;
  162. }
  163. return dsa;
  164. }
  165. static int test_generate(FILE *out) {
  166. BN_GENCB cb;
  167. DSA *dsa = NULL;
  168. int counter, ok = 0, i, j;
  169. uint8_t buf[256];
  170. unsigned long h;
  171. uint8_t sig[256];
  172. unsigned int siglen;
  173. fprintf(out, "test generation of DSA parameters\n");
  174. BN_GENCB_set(&cb, dsa_cb, out);
  175. dsa = DSA_new();
  176. if (dsa == NULL ||
  177. !DSA_generate_parameters_ex(dsa, 512, seed, 20, &counter, &h, &cb)) {
  178. goto end;
  179. }
  180. fprintf(out, "seed\n");
  181. for (i = 0; i < 20; i += 4) {
  182. fprintf(out, "%02X%02X%02X%02X ", seed[i], seed[i + 1], seed[i + 2],
  183. seed[i + 3]);
  184. }
  185. fprintf(out, "\ncounter=%d h=%ld\n", counter, h);
  186. if (counter != 105) {
  187. fprintf(stderr, "counter should be 105\n");
  188. goto end;
  189. }
  190. if (h != 2) {
  191. fprintf(stderr, "h should be 2\n");
  192. goto end;
  193. }
  194. i = BN_bn2bin(dsa->q, buf);
  195. j = sizeof(fips_q);
  196. if (i != j || memcmp(buf, fips_q, i) != 0) {
  197. fprintf(stderr, "q value is wrong\n");
  198. goto end;
  199. }
  200. i = BN_bn2bin(dsa->p, buf);
  201. j = sizeof(fips_p);
  202. if (i != j || memcmp(buf, fips_p, i) != 0) {
  203. fprintf(stderr, "p value is wrong\n");
  204. goto end;
  205. }
  206. i = BN_bn2bin(dsa->g, buf);
  207. j = sizeof(fips_g);
  208. if (i != j || memcmp(buf, fips_g, i) != 0) {
  209. fprintf(stderr, "g value is wrong\n");
  210. goto end;
  211. }
  212. if (!DSA_generate_key(dsa) ||
  213. !DSA_sign(0, fips_digest, sizeof(fips_digest), sig, &siglen, dsa)) {
  214. goto end;
  215. }
  216. if (DSA_verify(0, fips_digest, sizeof(fips_digest), sig, siglen, dsa) == 1) {
  217. ok = 1;
  218. } else {
  219. fprintf(stderr, "verification failure\n");
  220. }
  221. end:
  222. DSA_free(dsa);
  223. return ok;
  224. }
  225. static int test_verify(const uint8_t *sig, size_t sig_len, int expect) {
  226. int ok = 0;
  227. DSA *dsa = get_fips_dsa();
  228. if (dsa == NULL) {
  229. goto end;
  230. }
  231. int ret = DSA_verify(0, fips_digest, sizeof(fips_digest), sig, sig_len, dsa);
  232. if (ret != expect) {
  233. fprintf(stderr, "DSA_verify returned %d, want %d\n", ret, expect);
  234. goto end;
  235. }
  236. ok = 1;
  237. /* Clear any errorrs from a test with expected failure. */
  238. ERR_clear_error();
  239. end:
  240. DSA_free(dsa);
  241. return ok;
  242. }
  243. int main(int argc, char **argv) {
  244. CRYPTO_library_init();
  245. if (!test_generate(stdout) ||
  246. !test_verify(fips_sig, sizeof(fips_sig), 1) ||
  247. !test_verify(fips_sig_negative, sizeof(fips_sig_negative), -1) ||
  248. !test_verify(fips_sig_extra, sizeof(fips_sig_extra), -1) ||
  249. !test_verify(fips_sig_bad_length, sizeof(fips_sig_bad_length), -1) ||
  250. !test_verify(fips_sig_bad_r, sizeof(fips_sig_bad_r), 0)) {
  251. ERR_print_errors_fp(stderr);
  252. return 1;
  253. }
  254. printf("PASS\n");
  255. return 0;
  256. }
  257. static int dsa_cb(int p, int n, BN_GENCB *arg) {
  258. char c = '*';
  259. static int ok = 0, num = 0;
  260. switch (p) {
  261. case 0:
  262. c = '.';
  263. num++;
  264. break;
  265. case 1:
  266. c = '+';
  267. break;
  268. case 2:
  269. c = '*';
  270. ok++;
  271. break;
  272. case 3:
  273. c = '\n';
  274. }
  275. fputc(c, arg->arg);
  276. fflush(arg->arg);
  277. if (!ok && p == 0 && num > 1) {
  278. fprintf(stderr, "error in dsatest\n");
  279. return 0;
  280. }
  281. return 1;
  282. }