test-sha1.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448
  1. /*
  2. * Test program for SHA1 and MD5
  3. * Copyright (c) 2003-2006, Jouni Malinen <j@w1.fi>
  4. *
  5. * This program is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU General Public License version 2 as
  7. * published by the Free Software Foundation.
  8. *
  9. * Alternatively, this software may be distributed under the terms of BSD
  10. * license.
  11. *
  12. * See README and COPYING for more details.
  13. */
  14. #include "includes.h"
  15. #include "common.h"
  16. #include "crypto/crypto.h"
  17. #include "crypto/md5.h"
  18. #include "crypto/sha1.h"
  19. static int test_eap_fast(void)
  20. {
  21. /* RFC 4851, Appendix B.1 */
  22. const u8 pac_key[] = {
  23. 0x0B, 0x97, 0x39, 0x0F, 0x37, 0x51, 0x78, 0x09,
  24. 0x81, 0x1E, 0xFD, 0x9C, 0x6E, 0x65, 0x94, 0x2B,
  25. 0x63, 0x2C, 0xE9, 0x53, 0x89, 0x38, 0x08, 0xBA,
  26. 0x36, 0x0B, 0x03, 0x7C, 0xD1, 0x85, 0xE4, 0x14
  27. };
  28. const u8 seed[] = {
  29. 0x3F, 0xFB, 0x11, 0xC4, 0x6C, 0xBF, 0xA5, 0x7A,
  30. 0x54, 0x40, 0xDA, 0xE8, 0x22, 0xD3, 0x11, 0xD3,
  31. 0xF7, 0x6D, 0xE4, 0x1D, 0xD9, 0x33, 0xE5, 0x93,
  32. 0x70, 0x97, 0xEB, 0xA9, 0xB3, 0x66, 0xF4, 0x2A,
  33. 0x00, 0x00, 0x00, 0x02, 0x6A, 0x66, 0x43, 0x2A,
  34. 0x8D, 0x14, 0x43, 0x2C, 0xEC, 0x58, 0x2D, 0x2F,
  35. 0xC7, 0x9C, 0x33, 0x64, 0xBA, 0x04, 0xAD, 0x3A,
  36. 0x52, 0x54, 0xD6, 0xA5, 0x79, 0xAD, 0x1E, 0x00
  37. };
  38. const u8 master_secret[] = {
  39. 0x4A, 0x1A, 0x51, 0x2C, 0x01, 0x60, 0xBC, 0x02,
  40. 0x3C, 0xCF, 0xBC, 0x83, 0x3F, 0x03, 0xBC, 0x64,
  41. 0x88, 0xC1, 0x31, 0x2F, 0x0B, 0xA9, 0xA2, 0x77,
  42. 0x16, 0xA8, 0xD8, 0xE8, 0xBD, 0xC9, 0xD2, 0x29,
  43. 0x38, 0x4B, 0x7A, 0x85, 0xBE, 0x16, 0x4D, 0x27,
  44. 0x33, 0xD5, 0x24, 0x79, 0x87, 0xB1, 0xC5, 0xA2
  45. };
  46. const u8 key_block[] = {
  47. 0x59, 0x59, 0xBE, 0x8E, 0x41, 0x3A, 0x77, 0x74,
  48. 0x8B, 0xB2, 0xE5, 0xD3, 0x60, 0xAC, 0x4D, 0x35,
  49. 0xDF, 0xFB, 0xC8, 0x1E, 0x9C, 0x24, 0x9C, 0x8B,
  50. 0x0E, 0xC3, 0x1D, 0x72, 0xC8, 0x84, 0x9D, 0x57,
  51. 0x48, 0x51, 0x2E, 0x45, 0x97, 0x6C, 0x88, 0x70,
  52. 0xBE, 0x5F, 0x01, 0xD3, 0x64, 0xE7, 0x4C, 0xBB,
  53. 0x11, 0x24, 0xE3, 0x49, 0xE2, 0x3B, 0xCD, 0xEF,
  54. 0x7A, 0xB3, 0x05, 0x39, 0x5D, 0x64, 0x8A, 0x44,
  55. 0x11, 0xB6, 0x69, 0x88, 0x34, 0x2E, 0x8E, 0x29,
  56. 0xD6, 0x4B, 0x7D, 0x72, 0x17, 0x59, 0x28, 0x05,
  57. 0xAF, 0xF9, 0xB7, 0xFF, 0x66, 0x6D, 0xA1, 0x96,
  58. 0x8F, 0x0B, 0x5E, 0x06, 0x46, 0x7A, 0x44, 0x84,
  59. 0x64, 0xC1, 0xC8, 0x0C, 0x96, 0x44, 0x09, 0x98,
  60. 0xFF, 0x92, 0xA8, 0xB4, 0xC6, 0x42, 0x28, 0x71
  61. };
  62. const u8 sks[] = {
  63. 0xD6, 0x4B, 0x7D, 0x72, 0x17, 0x59, 0x28, 0x05,
  64. 0xAF, 0xF9, 0xB7, 0xFF, 0x66, 0x6D, 0xA1, 0x96,
  65. 0x8F, 0x0B, 0x5E, 0x06, 0x46, 0x7A, 0x44, 0x84,
  66. 0x64, 0xC1, 0xC8, 0x0C, 0x96, 0x44, 0x09, 0x98,
  67. 0xFF, 0x92, 0xA8, 0xB4, 0xC6, 0x42, 0x28, 0x71
  68. };
  69. const u8 isk[] = {
  70. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  71. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  72. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  73. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
  74. };
  75. const u8 imck[] = {
  76. 0x16, 0x15, 0x3C, 0x3F, 0x21, 0x55, 0xEF, 0xD9,
  77. 0x7F, 0x34, 0xAE, 0xC8, 0x1A, 0x4E, 0x66, 0x80,
  78. 0x4C, 0xC3, 0x76, 0xF2, 0x8A, 0xA9, 0x6F, 0x96,
  79. 0xC2, 0x54, 0x5F, 0x8C, 0xAB, 0x65, 0x02, 0xE1,
  80. 0x18, 0x40, 0x7B, 0x56, 0xBE, 0xEA, 0xA7, 0xC5,
  81. 0x76, 0x5D, 0x8F, 0x0B, 0xC5, 0x07, 0xC6, 0xB9,
  82. 0x04, 0xD0, 0x69, 0x56, 0x72, 0x8B, 0x6B, 0xB8,
  83. 0x15, 0xEC, 0x57, 0x7B
  84. };
  85. const u8 msk[] = {
  86. 0x4D, 0x83, 0xA9, 0xBE, 0x6F, 0x8A, 0x74, 0xED,
  87. 0x6A, 0x02, 0x66, 0x0A, 0x63, 0x4D, 0x2C, 0x33,
  88. 0xC2, 0xDA, 0x60, 0x15, 0xC6, 0x37, 0x04, 0x51,
  89. 0x90, 0x38, 0x63, 0xDA, 0x54, 0x3E, 0x14, 0xB9,
  90. 0x27, 0x99, 0x18, 0x1E, 0x07, 0xBF, 0x0F, 0x5A,
  91. 0x5E, 0x3C, 0x32, 0x93, 0x80, 0x8C, 0x6C, 0x49,
  92. 0x67, 0xED, 0x24, 0xFE, 0x45, 0x40, 0xA0, 0x59,
  93. 0x5E, 0x37, 0xC2, 0xE9, 0xD0, 0x5D, 0x0A, 0xE3
  94. };
  95. const u8 emsk[] = {
  96. 0x3A, 0xD4, 0xAB, 0xDB, 0x76, 0xB2, 0x7F, 0x3B,
  97. 0xEA, 0x32, 0x2C, 0x2B, 0x74, 0xF4, 0x28, 0x55,
  98. 0xEF, 0x2D, 0xBA, 0x78, 0xC9, 0x57, 0x2F, 0x0D,
  99. 0x06, 0xCD, 0x51, 0x7C, 0x20, 0x93, 0x98, 0xA9,
  100. 0x76, 0xEA, 0x70, 0x21, 0xD7, 0x0E, 0x25, 0x54,
  101. 0x97, 0xED, 0xB2, 0x8A, 0xF6, 0xED, 0xFD, 0x0A,
  102. 0x2A, 0xE7, 0xA1, 0x58, 0x90, 0x10, 0x50, 0x44,
  103. 0xB3, 0x82, 0x85, 0xDB, 0x06, 0x14, 0xD2, 0xF9
  104. };
  105. /* RFC 4851, Appendix B.2 */
  106. u8 tlv[] = {
  107. 0x80, 0x0C, 0x00, 0x38, 0x00, 0x01, 0x01, 0x00,
  108. 0xD8, 0x6A, 0x8C, 0x68, 0x3C, 0x32, 0x31, 0xA8,
  109. 0x56, 0x63, 0xB6, 0x40, 0x21, 0xFE, 0x21, 0x14,
  110. 0x4E, 0xE7, 0x54, 0x20, 0x79, 0x2D, 0x42, 0x62,
  111. 0xC9, 0xBF, 0x53, 0x7F, 0x54, 0xFD, 0xAC, 0x58,
  112. 0x43, 0x24, 0x6E, 0x30, 0x92, 0x17, 0x6D, 0xCF,
  113. 0xE6, 0xE0, 0x69, 0xEB, 0x33, 0x61, 0x6A, 0xCC,
  114. 0x05, 0xC5, 0x5B, 0xB7
  115. };
  116. const u8 compound_mac[] = {
  117. 0x43, 0x24, 0x6E, 0x30, 0x92, 0x17, 0x6D, 0xCF,
  118. 0xE6, 0xE0, 0x69, 0xEB, 0x33, 0x61, 0x6A, 0xCC,
  119. 0x05, 0xC5, 0x5B, 0xB7
  120. };
  121. u8 buf[512];
  122. const u8 *simck, *cmk;
  123. int errors = 0;
  124. printf("EAP-FAST test cases\n");
  125. printf("- T-PRF (SHA1) test case / master_secret\n");
  126. sha1_t_prf(pac_key, sizeof(pac_key), "PAC to master secret label hash",
  127. seed, sizeof(seed), buf, sizeof(master_secret));
  128. if (memcmp(master_secret, buf, sizeof(master_secret)) != 0) {
  129. printf("T-PRF test - FAILED!\n");
  130. errors++;
  131. }
  132. printf("- PRF (TLS, SHA1/MD5) test case / key_block\n");
  133. if (tls_prf_sha1_md5(master_secret, sizeof(master_secret),
  134. "key expansion", seed, sizeof(seed),
  135. buf, sizeof(key_block)) ||
  136. memcmp(key_block, buf, sizeof(key_block)) != 0) {
  137. printf("PRF test - FAILED!\n");
  138. errors++;
  139. }
  140. printf("- T-PRF (SHA1) test case / IMCK\n");
  141. sha1_t_prf(sks, sizeof(sks), "Inner Methods Compound Keys",
  142. isk, sizeof(isk), buf, sizeof(imck));
  143. if (memcmp(imck, buf, sizeof(imck)) != 0) {
  144. printf("T-PRF test - FAILED!\n");
  145. errors++;
  146. }
  147. simck = imck;
  148. cmk = imck + 40;
  149. printf("- T-PRF (SHA1) test case / MSK\n");
  150. sha1_t_prf(simck, 40, "Session Key Generating Function",
  151. (u8 *) "", 0, buf, sizeof(msk));
  152. if (memcmp(msk, buf, sizeof(msk)) != 0) {
  153. printf("T-PRF test - FAILED!\n");
  154. errors++;
  155. }
  156. printf("- T-PRF (SHA1) test case / EMSK\n");
  157. sha1_t_prf(simck, 40, "Extended Session Key Generating Function",
  158. (u8 *) "", 0, buf, sizeof(msk));
  159. if (memcmp(emsk, buf, sizeof(emsk)) != 0) {
  160. printf("T-PRF test - FAILED!\n");
  161. errors++;
  162. }
  163. printf("- Compound MAC test case\n");
  164. memset(tlv + sizeof(tlv) - 20, 0, 20);
  165. hmac_sha1(cmk, 20, tlv, sizeof(tlv), tlv + sizeof(tlv) - 20);
  166. if (memcmp(tlv + sizeof(tlv) - 20, compound_mac, sizeof(compound_mac))
  167. != 0) {
  168. printf("Compound MAC test - FAILED!\n");
  169. errors++;
  170. }
  171. return errors;
  172. }
  173. static u8 key0[] =
  174. {
  175. 0x0b, 0x0b, 0x0b, 0x0b, 0x0b, 0x0b, 0x0b, 0x0b,
  176. 0x0b, 0x0b, 0x0b, 0x0b, 0x0b, 0x0b, 0x0b, 0x0b,
  177. 0x0b, 0x0b, 0x0b, 0x0b
  178. };
  179. static u8 data0[] = "Hi There";
  180. static u8 prf0[] =
  181. {
  182. 0xbc, 0xd4, 0xc6, 0x50, 0xb3, 0x0b, 0x96, 0x84,
  183. 0x95, 0x18, 0x29, 0xe0, 0xd7, 0x5f, 0x9d, 0x54,
  184. 0xb8, 0x62, 0x17, 0x5e, 0xd9, 0xf0, 0x06, 0x06,
  185. 0xe1, 0x7d, 0x8d, 0xa3, 0x54, 0x02, 0xff, 0xee,
  186. 0x75, 0xdf, 0x78, 0xc3, 0xd3, 0x1e, 0x0f, 0x88,
  187. 0x9f, 0x01, 0x21, 0x20, 0xc0, 0x86, 0x2b, 0xeb,
  188. 0x67, 0x75, 0x3e, 0x74, 0x39, 0xae, 0x24, 0x2e,
  189. 0xdb, 0x83, 0x73, 0x69, 0x83, 0x56, 0xcf, 0x5a
  190. };
  191. static u8 key1[] = "Jefe";
  192. static u8 data1[] = "what do ya want for nothing?";
  193. static u8 prf1[] =
  194. {
  195. 0x51, 0xf4, 0xde, 0x5b, 0x33, 0xf2, 0x49, 0xad,
  196. 0xf8, 0x1a, 0xeb, 0x71, 0x3a, 0x3c, 0x20, 0xf4,
  197. 0xfe, 0x63, 0x14, 0x46, 0xfa, 0xbd, 0xfa, 0x58,
  198. 0x24, 0x47, 0x59, 0xae, 0x58, 0xef, 0x90, 0x09,
  199. 0xa9, 0x9a, 0xbf, 0x4e, 0xac, 0x2c, 0xa5, 0xfa,
  200. 0x87, 0xe6, 0x92, 0xc4, 0x40, 0xeb, 0x40, 0x02,
  201. 0x3e, 0x7b, 0xab, 0xb2, 0x06, 0xd6, 0x1d, 0xe7,
  202. 0xb9, 0x2f, 0x41, 0x52, 0x90, 0x92, 0xb8, 0xfc
  203. };
  204. static u8 key2[] =
  205. {
  206. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  207. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  208. 0xaa, 0xaa, 0xaa, 0xaa
  209. };
  210. static u8 data2[] =
  211. {
  212. 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd,
  213. 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd,
  214. 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd,
  215. 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd,
  216. 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd,
  217. 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd,
  218. 0xdd, 0xdd
  219. };
  220. static u8 prf2[] =
  221. {
  222. 0xe1, 0xac, 0x54, 0x6e, 0xc4, 0xcb, 0x63, 0x6f,
  223. 0x99, 0x76, 0x48, 0x7b, 0xe5, 0xc8, 0x6b, 0xe1,
  224. 0x7a, 0x02, 0x52, 0xca, 0x5d, 0x8d, 0x8d, 0xf1,
  225. 0x2c, 0xfb, 0x04, 0x73, 0x52, 0x52, 0x49, 0xce,
  226. 0x9d, 0xd8, 0xd1, 0x77, 0xea, 0xd7, 0x10, 0xbc,
  227. 0x9b, 0x59, 0x05, 0x47, 0x23, 0x91, 0x07, 0xae,
  228. 0xf7, 0xb4, 0xab, 0xd4, 0x3d, 0x87, 0xf0, 0xa6,
  229. 0x8f, 0x1c, 0xbd, 0x9e, 0x2b, 0x6f, 0x76, 0x07
  230. };
  231. struct passphrase_test {
  232. char *passphrase;
  233. char *ssid;
  234. char psk[32];
  235. };
  236. static struct passphrase_test passphrase_tests[] =
  237. {
  238. {
  239. "password",
  240. "IEEE",
  241. {
  242. 0xf4, 0x2c, 0x6f, 0xc5, 0x2d, 0xf0, 0xeb, 0xef,
  243. 0x9e, 0xbb, 0x4b, 0x90, 0xb3, 0x8a, 0x5f, 0x90,
  244. 0x2e, 0x83, 0xfe, 0x1b, 0x13, 0x5a, 0x70, 0xe2,
  245. 0x3a, 0xed, 0x76, 0x2e, 0x97, 0x10, 0xa1, 0x2e
  246. }
  247. },
  248. {
  249. "ThisIsAPassword",
  250. "ThisIsASSID",
  251. {
  252. 0x0d, 0xc0, 0xd6, 0xeb, 0x90, 0x55, 0x5e, 0xd6,
  253. 0x41, 0x97, 0x56, 0xb9, 0xa1, 0x5e, 0xc3, 0xe3,
  254. 0x20, 0x9b, 0x63, 0xdf, 0x70, 0x7d, 0xd5, 0x08,
  255. 0xd1, 0x45, 0x81, 0xf8, 0x98, 0x27, 0x21, 0xaf
  256. }
  257. },
  258. {
  259. "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa",
  260. "ZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZ",
  261. {
  262. 0xbe, 0xcb, 0x93, 0x86, 0x6b, 0xb8, 0xc3, 0x83,
  263. 0x2c, 0xb7, 0x77, 0xc2, 0xf5, 0x59, 0x80, 0x7c,
  264. 0x8c, 0x59, 0xaf, 0xcb, 0x6e, 0xae, 0x73, 0x48,
  265. 0x85, 0x00, 0x13, 0x00, 0xa9, 0x81, 0xcc, 0x62
  266. }
  267. },
  268. };
  269. #define NUM_PASSPHRASE_TESTS \
  270. (sizeof(passphrase_tests) / sizeof(passphrase_tests[0]))
  271. struct rfc6070_test {
  272. char *p;
  273. char *s;
  274. int c;
  275. char dk[32];
  276. size_t dk_len;
  277. };
  278. static struct rfc6070_test rfc6070_tests[] =
  279. {
  280. {
  281. "password",
  282. "salt",
  283. 1,
  284. {
  285. 0x0c, 0x60, 0xc8, 0x0f, 0x96, 0x1f, 0x0e, 0x71,
  286. 0xf3, 0xa9, 0xb5, 0x24, 0xaf, 0x60, 0x12, 0x06,
  287. 0x2f, 0xe0, 0x37, 0xa6
  288. },
  289. 20
  290. },
  291. {
  292. "password",
  293. "salt",
  294. 2,
  295. {
  296. 0xea, 0x6c, 0x01, 0x4d, 0xc7, 0x2d, 0x6f, 0x8c,
  297. 0xcd, 0x1e, 0xd9, 0x2a, 0xce, 0x1d, 0x41, 0xf0,
  298. 0xd8, 0xde, 0x89, 0x57
  299. },
  300. 20
  301. },
  302. {
  303. "password",
  304. "salt",
  305. 4096,
  306. {
  307. 0x4b, 0x00, 0x79, 0x01, 0xb7, 0x65, 0x48, 0x9a,
  308. 0xbe, 0xad, 0x49, 0xd9, 0x26, 0xf7, 0x21, 0xd0,
  309. 0x65, 0xa4, 0x29, 0xc1
  310. },
  311. 20
  312. },
  313. #if 0 /* This takes quite long to derive.. */
  314. {
  315. "password",
  316. "salt",
  317. 16777216,
  318. {
  319. 0xee, 0xfe, 0x3d, 0x61, 0xcd, 0x4d, 0xa4, 0xe4,
  320. 0xe9, 0x94, 0x5b, 0x3d, 0x6b, 0xa2, 0x15, 0x8c,
  321. 0x26, 0x34, 0xe9, 0x84
  322. },
  323. 20
  324. },
  325. #endif
  326. {
  327. "passwordPASSWORDpassword",
  328. "saltSALTsaltSALTsaltSALTsaltSALTsalt",
  329. 4096,
  330. {
  331. 0x3d, 0x2e, 0xec, 0x4f, 0xe4, 0x1c, 0x84, 0x9b,
  332. 0x80, 0xc8, 0xd8, 0x36, 0x62, 0xc0, 0xe4, 0x4a,
  333. 0x8b, 0x29, 0x1a, 0x96, 0x4c, 0xf2, 0xf0, 0x70,
  334. 0x38
  335. },
  336. 25
  337. },
  338. #if 0 /* \0 not currently supported in passphrase parameters.. */
  339. {
  340. "pass\0word",
  341. "sa\0lt",
  342. 4096,
  343. {
  344. 0x56, 0xfa, 0x6a, 0xa7, 0x55, 0x48, 0x09, 0x9d,
  345. 0xcc, 0x37, 0xd7, 0xf0, 0x34, 0x25, 0xe0, 0xc3
  346. },
  347. 16
  348. },
  349. #endif
  350. };
  351. #define NUM_RFC6070_TESTS \
  352. (sizeof(rfc6070_tests) / sizeof(rfc6070_tests[0]))
  353. int main(int argc, char *argv[])
  354. {
  355. u8 res[512];
  356. int ret = 0;
  357. unsigned int i;
  358. printf("PRF-SHA1 test cases:\n");
  359. sha1_prf(key0, sizeof(key0), "prefix", data0, sizeof(data0) - 1,
  360. res, sizeof(prf0));
  361. if (memcmp(res, prf0, sizeof(prf0)) == 0)
  362. printf("Test case 0 - OK\n");
  363. else {
  364. printf("Test case 0 - FAILED!\n");
  365. ret++;
  366. }
  367. sha1_prf(key1, sizeof(key1) - 1, "prefix", data1, sizeof(data1) - 1,
  368. res, sizeof(prf1));
  369. if (memcmp(res, prf1, sizeof(prf1)) == 0)
  370. printf("Test case 1 - OK\n");
  371. else {
  372. printf("Test case 1 - FAILED!\n");
  373. ret++;
  374. }
  375. sha1_prf(key2, sizeof(key2), "prefix", data2, sizeof(data2),
  376. res, sizeof(prf2));
  377. if (memcmp(res, prf2, sizeof(prf2)) == 0)
  378. printf("Test case 2 - OK\n");
  379. else {
  380. printf("Test case 2 - FAILED!\n");
  381. ret++;
  382. }
  383. ret += test_eap_fast();
  384. printf("PBKDF2-SHA1 Passphrase test cases:\n");
  385. for (i = 0; i < NUM_PASSPHRASE_TESTS; i++) {
  386. u8 psk[32];
  387. struct passphrase_test *test = &passphrase_tests[i];
  388. pbkdf2_sha1(test->passphrase,
  389. test->ssid, strlen(test->ssid),
  390. 4096, psk, 32);
  391. if (memcmp(psk, test->psk, 32) == 0)
  392. printf("Test case %d - OK\n", i);
  393. else {
  394. printf("Test case %d - FAILED!\n", i);
  395. ret++;
  396. }
  397. }
  398. printf("PBKDF2-SHA1 test cases (RFC 6070):\n");
  399. for (i = 0; i < NUM_RFC6070_TESTS; i++) {
  400. u8 dk[25];
  401. struct rfc6070_test *test = &rfc6070_tests[i];
  402. pbkdf2_sha1(test->p, test->s, strlen(test->s), test->c,
  403. dk, test->dk_len);
  404. if (memcmp(dk, test->dk, test->dk_len) == 0)
  405. printf("Test case %d - OK\n", i);
  406. else {
  407. printf("Test case %d - FAILED!\n", i);
  408. ret++;
  409. }
  410. }
  411. return ret;
  412. }