hmac_test.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325
  1. /* LibTomCrypt, modular cryptographic library -- Tom St Denis
  2. *
  3. * LibTomCrypt is a library that provides various cryptographic
  4. * algorithms in a highly modular and flexible manner.
  5. *
  6. * The library is free for all purposes without any express
  7. * guarantee it works.
  8. *
  9. * Tom St Denis, [email protected], http://libtomcrypt.org
  10. */
  11. /* Submited by Dobes Vandermeer ([email protected]) */
  12. #include "mycrypt.h"
  13. /*
  14. (1) append zeros to the end of K to create a B byte string
  15. (e.g., if K is of length 20 bytes and B=64, then K will be
  16. appended with 44 zero bytes 0x00)
  17. (2) XOR (bitwise exclusive-OR) the B byte string computed in step
  18. (1) with ipad (ipad = the byte 0x36 repeated B times)
  19. (3) append the stream of data 'text' to the B byte string resulting
  20. from step (2)
  21. (4) apply H to the stream generated in step (3)
  22. (5) XOR (bitwise exclusive-OR) the B byte string computed in
  23. step (1) with opad (opad = the byte 0x5C repeated B times.)
  24. (6) append the H result from step (4) to the B byte string
  25. resulting from step (5)
  26. (7) apply H to the stream generated in step (6) and output
  27. the result
  28. */
  29. #ifdef HMAC
  30. #define HMAC_BLOCKSIZE hash_descriptor[hash].blocksize
  31. /*
  32. TEST CASES SOURCE:
  33. Network Working Group P. Cheng
  34. Request for Comments: 2202 IBM
  35. Category: Informational R. Glenn
  36. NIST
  37. September 1997
  38. Test Cases for HMAC-MD5 and HMAC-SHA-1
  39. */
  40. int hmac_test(void)
  41. {
  42. #ifndef LTC_TEST
  43. return CRYPT_NOP;
  44. #else
  45. unsigned char digest[MAXBLOCKSIZE];
  46. int i;
  47. static const struct hmac_test_case {
  48. int num;
  49. char *algo;
  50. unsigned char key[128];
  51. unsigned long keylen;
  52. unsigned char data[128];
  53. unsigned long datalen;
  54. unsigned char digest[MAXBLOCKSIZE];
  55. } cases[] = {
  56. /*
  57. 3. Test Cases for HMAC-SHA-1
  58. test_case = 1
  59. key = 0x0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b
  60. key_len = 20
  61. data = "Hi Ther 20
  62. digest = 0x4c1a03424b55e07fe7f27be1d58bb9324a9a5a04
  63. digest-96 = 0x4c1a03424b55e07fe7f27be1
  64. */
  65. { 5, "sha1",
  66. {0x0c, 0x0c, 0x0c, 0x0c, 0x0c, 0x0c, 0x0c, 0x0c,
  67. 0x0c, 0x0c, 0x0c, 0x0c, 0x0c, 0x0c, 0x0c, 0x0c,
  68. 0x0c, 0x0c, 0x0c, 0x0c}, 20,
  69. "Test With Truncation", 20,
  70. {0x4c, 0x1a, 0x03, 0x42, 0x4b, 0x55, 0xe0, 0x7f, 0xe7, 0xf2,
  71. 0x7b, 0xe1, 0xd5, 0x8b, 0xb9, 0x32, 0x4a, 0x9a, 0x5a, 0x04} },
  72. /*
  73. test_case = 6
  74. key = 0xaa repeated 80 times
  75. key_len = 80
  76. data = "Test Using Larger Than Block-Size Key - Hash Key First"
  77. data_len = 54
  78. digest = 0xaa4ae5e15272d00e95705637ce8a3b55ed402112
  79. */
  80. { 6, "sha1",
  81. {0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  82. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  83. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  84. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  85. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  86. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  87. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  88. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  89. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  90. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa}, 80,
  91. "Test Using Larger Than Block-Size Key - Hash Key First", 54,
  92. {0xaa, 0x4a, 0xe5, 0xe1, 0x52, 0x72, 0xd0, 0x0e,
  93. 0x95, 0x70, 0x56, 0x37, 0xce, 0x8a, 0x3b, 0x55,
  94. 0xed, 0x40, 0x21, 0x12} },
  95. /*
  96. test_case = 7
  97. key = 0xaa repeated 80 times
  98. key_len = 80
  99. data = "Test Using Larger Than Block-Size Key and Larger
  100. Than One Block-Size Data"
  101. data_len = 73
  102. digest = 0xe8e99d0f45237d786d6bbaa7965c7808bbff1a91
  103. */
  104. { 7, "sha1",
  105. {0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  106. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  107. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  108. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  109. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  110. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  111. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  112. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  113. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  114. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa}, 80,
  115. "Test Using Larger Than Block-Size Key and Larger Than One Block-Size Data", 73,
  116. {0xe8, 0xe9, 0x9d, 0x0f, 0x45, 0x23, 0x7d, 0x78, 0x6d,
  117. 0x6b, 0xba, 0xa7, 0x96, 0x5c, 0x78, 0x08, 0xbb, 0xff, 0x1a, 0x91} },
  118. /*
  119. 2. Test Cases for HMAC-MD5
  120. test_case = 1
  121. key = 0x0b 0b 0b 0b
  122. 0b 0b 0b 0b
  123. 0b 0b 0b 0b
  124. 0b 0b 0b 0b
  125. key_len = 16
  126. data = "Hi There"
  127. data_len = 8
  128. digest = 0x92 94 72 7a
  129. 36 38 bb 1c
  130. 13 f4 8e f8
  131. 15 8b fc 9d
  132. */
  133. { 1, "md5",
  134. {0x0b, 0x0b, 0x0b, 0x0b, 0x0b, 0x0b, 0x0b, 0x0b,
  135. 0x0b, 0x0b, 0x0b, 0x0b, 0x0b, 0x0b, 0x0b, 0x0b}, 16,
  136. "Hi There", 8,
  137. {0x92, 0x94, 0x72, 0x7a, 0x36, 0x38, 0xbb, 0x1c,
  138. 0x13, 0xf4, 0x8e, 0xf8, 0x15, 0x8b, 0xfc, 0x9d} },
  139. /*
  140. test_case = 2
  141. key = "Jefe"
  142. key_len = 4
  143. data = "what do ya want for nothing?"
  144. data_len = 28
  145. digest = 0x750c783e6ab0b503eaa86e310a5db738
  146. */
  147. { 2, "md5",
  148. "Jefe", 4,
  149. "what do ya want for nothing?", 28,
  150. {0x75, 0x0c, 0x78, 0x3e, 0x6a, 0xb0, 0xb5, 0x03,
  151. 0xea, 0xa8, 0x6e, 0x31, 0x0a, 0x5d, 0xb7, 0x38} },
  152. /*
  153. test_case = 3
  154. key = 0xaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
  155. key_len 16
  156. data = 0xdd repeated 50 times
  157. data_len = 50
  158. digest = 0x56be34521d144c88dbb8c733f0e8b3f6
  159. */
  160. { 3, "md5",
  161. {0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  162. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa}, 16,
  163. {0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd,
  164. 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd,
  165. 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd,
  166. 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd,
  167. 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd}, 50,
  168. {0x56, 0xbe, 0x34, 0x52, 0x1d, 0x14, 0x4c, 0x88,
  169. 0xdb, 0xb8, 0xc7, 0x33, 0xf0, 0xe8, 0xb3, 0xf6} },
  170. /*
  171. test_case = 4
  172. key = 0x0102030405060708090a0b0c0d0e0f10111213141516171819
  173. key_len 25
  174. data = 0xcd repeated 50 times
  175. data_len = 50
  176. digest = 0x697eaf0aca3a3aea3a75164746ffaa79
  177. */
  178. { 4, "md5",
  179. {0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0x09, 0x0a,
  180. 0x0b, 0x0c, 0x0d, 0x0e, 0x0f, 0x10, 0x11, 0x12, 0x13, 0x14,
  181. 0x15, 0x16, 0x17, 0x18, 0x19}, 25,
  182. {0xcd, 0xcd, 0xcd, 0xcd, 0xcd, 0xcd, 0xcd, 0xcd, 0xcd, 0xcd,
  183. 0xcd, 0xcd, 0xcd, 0xcd, 0xcd, 0xcd, 0xcd, 0xcd, 0xcd, 0xcd,
  184. 0xcd, 0xcd, 0xcd, 0xcd, 0xcd, 0xcd, 0xcd, 0xcd, 0xcd, 0xcd,
  185. 0xcd, 0xcd, 0xcd, 0xcd, 0xcd, 0xcd, 0xcd, 0xcd, 0xcd, 0xcd,
  186. 0xcd, 0xcd, 0xcd, 0xcd, 0xcd, 0xcd, 0xcd, 0xcd, 0xcd, 0xcd}, 50,
  187. {0x69, 0x7e, 0xaf, 0x0a, 0xca, 0x3a, 0x3a, 0xea,
  188. 0x3a, 0x75, 0x16, 0x47, 0x46, 0xff, 0xaa, 0x79} },
  189. /*
  190. test_case = 5
  191. key = 0x0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c
  192. key_len = 16
  193. data = "Test With Truncation"
  194. data_len = 20
  195. digest = 0x56461ef2342edc00f9bab995690efd4c
  196. digest-96 0x56461ef2342edc00f9bab995
  197. */
  198. { 5, "md5",
  199. {0x0c, 0x0c, 0x0c, 0x0c, 0x0c, 0x0c, 0x0c, 0x0c,
  200. 0x0c, 0x0c, 0x0c, 0x0c, 0x0c, 0x0c, 0x0c, 0x0c}, 16,
  201. "Test With Truncation", 20,
  202. {0x56, 0x46, 0x1e, 0xf2, 0x34, 0x2e, 0xdc, 0x00,
  203. 0xf9, 0xba, 0xb9, 0x95, 0x69, 0x0e, 0xfd, 0x4c} },
  204. /*
  205. test_case = 6
  206. key = 0xaa repeated 80 times
  207. key_len = 80
  208. data = "Test Using Larger Than Block-Size Key - Hash
  209. Key First"
  210. data_len = 54
  211. digest = 0x6b1ab7fe4bd7bf8f0b62e6ce61b9d0cd
  212. */
  213. { 6, "md5",
  214. {0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  215. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  216. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  217. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  218. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  219. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  220. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  221. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  222. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  223. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa}, 80,
  224. "Test Using Larger Than Block-Size Key - Hash Key First", 54,
  225. {0x6b, 0x1a, 0xb7, 0xfe, 0x4b, 0xd7, 0xbf, 0x8f,
  226. 0x0b, 0x62, 0xe6, 0xce, 0x61, 0xb9, 0xd0, 0xcd} },
  227. /*
  228. test_case = 7
  229. key = 0xaa repeated 80 times
  230. key_len = 80
  231. data = "Test Using Larger Than Block-Size Key and Larger
  232. Than One Block-Size Data"
  233. data_len = 73
  234. digest = 0x6f630fad67cda0ee1fb1f562db3aa53e
  235. */
  236. { 7, "md5",
  237. {0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  238. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  239. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  240. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  241. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  242. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  243. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  244. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  245. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa,
  246. 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa, 0xaa}, 80,
  247. "Test Using Larger Than Block-Size Key and Larger Than One Block-Size Data", 73,
  248. {0x6f, 0x63, 0x0f, 0xad, 0x67, 0xcd, 0xa0, 0xee,
  249. 0x1f, 0xb1, 0xf5, 0x62, 0xdb, 0x3a, 0xa5, 0x3e} }
  250. };
  251. unsigned long outlen;
  252. int err;
  253. int tested=0,failed=0;
  254. for(i=0; i < (int)(sizeof(cases) / sizeof(cases[0])); i++) {
  255. int hash = find_hash(cases[i].algo);
  256. if (hash == -1) continue;
  257. ++tested;
  258. outlen = sizeof(digest);
  259. if((err = hmac_memory(hash, cases[i].key, cases[i].keylen, cases[i].data, cases[i].datalen, digest, &outlen)) != CRYPT_OK) {
  260. #if 0
  261. printf("HMAC-%s test #%d, %s\n", cases[i].algo, cases[i].num, error_to_string(err));
  262. #endif
  263. return err;
  264. }
  265. if(memcmp(digest, cases[i].digest, (size_t)hash_descriptor[hash].hashsize) != 0) {
  266. failed++;
  267. #if 0
  268. unsigned int j;
  269. printf("\nHMAC-%s test #%d:\n", cases[i].algo, cases[i].num);
  270. printf( "Result: 0x");
  271. for(j=0; j < hash_descriptor[hash].hashsize; j++) {
  272. printf("%2x ", digest[j]);
  273. }
  274. printf("\nCorrect: 0x");
  275. for(j=0; j < hash_descriptor[hash].hashsize; j++) {
  276. printf("%2x ", cases[i].digest[j]);
  277. }
  278. printf("\n");
  279. return CRYPT_ERROR;
  280. #endif
  281. } else {
  282. /* printf("HMAC-%s test #%d: Passed\n", cases[i].algo, cases[i].num); */
  283. }
  284. }
  285. if (failed != 0) {
  286. return CRYPT_FAIL_TESTVECTOR;
  287. } else if (tested == 0) {
  288. return CRYPT_NOP;
  289. } else {
  290. return CRYPT_OK;
  291. }
  292. #endif
  293. }
  294. #endif