sha256.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555
  1. /* sha256.c - SHA256 hash function
  2. * Copyright (C) 2003, 2006, 2008, 2009 Free Software Foundation, Inc.
  3. *
  4. * This file is part of Libgcrypt.
  5. *
  6. * Libgcrypt is free software; you can redistribute it and/or modify
  7. * it under the terms of the GNU Lesser General Public License as
  8. * published by the Free Software Foundation; either version 2.1 of
  9. * the License, or (at your option) any later version.
  10. *
  11. * Libgcrypt is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  14. * GNU Lesser General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU Lesser General Public
  17. * License along with this program; if not, see <http://www.gnu.org/licenses/>.
  18. */
  19. /* Test vectors:
  20. "abc"
  21. SHA224: 23097d22 3405d822 8642a477 bda255b3 2aadbce4 bda0b3f7 e36c9da7
  22. SHA256: ba7816bf 8f01cfea 414140de 5dae2223 b00361a3 96177a9c b410ff61 f20015ad
  23. "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
  24. SHA224: 75388b16 512776cc 5dba5da1 fd890150 b0c6455c b4f58b19 52522525
  25. SHA256: 248d6a61 d20638b8 e5c02693 0c3e6039 a33ce459 64ff2167 f6ecedd4 19db06c1
  26. "a" one million times
  27. SHA224: 20794655 980c91d8 bbb4c1ea 97618a4b f03f4258 1948b2ee 4ee7ad67
  28. SHA256: cdc76e5c 9914fb92 81a1c7e2 84d73e67 f1809a48 a497200e 046d39cc c7112cd0
  29. */
  30. #include <config.h>
  31. #include <stdio.h>
  32. #include <stdlib.h>
  33. #include <string.h>
  34. #include "g10lib.h"
  35. #include "bithelp.h"
  36. #include "cipher.h"
  37. #include "hash-common.h"
  38. typedef struct {
  39. u32 h0,h1,h2,h3,h4,h5,h6,h7;
  40. u32 nblocks;
  41. byte buf[64];
  42. int count;
  43. } SHA256_CONTEXT;
  44. static void
  45. sha256_init (void *context)
  46. {
  47. SHA256_CONTEXT *hd = context;
  48. hd->h0 = 0x6a09e667;
  49. hd->h1 = 0xbb67ae85;
  50. hd->h2 = 0x3c6ef372;
  51. hd->h3 = 0xa54ff53a;
  52. hd->h4 = 0x510e527f;
  53. hd->h5 = 0x9b05688c;
  54. hd->h6 = 0x1f83d9ab;
  55. hd->h7 = 0x5be0cd19;
  56. hd->nblocks = 0;
  57. hd->count = 0;
  58. }
  59. static void
  60. sha224_init (void *context)
  61. {
  62. SHA256_CONTEXT *hd = context;
  63. hd->h0 = 0xc1059ed8;
  64. hd->h1 = 0x367cd507;
  65. hd->h2 = 0x3070dd17;
  66. hd->h3 = 0xf70e5939;
  67. hd->h4 = 0xffc00b31;
  68. hd->h5 = 0x68581511;
  69. hd->h6 = 0x64f98fa7;
  70. hd->h7 = 0xbefa4fa4;
  71. hd->nblocks = 0;
  72. hd->count = 0;
  73. }
  74. /*
  75. Transform the message X which consists of 16 32-bit-words. See FIPS
  76. 180-2 for details. */
  77. #define S0(x) (ror ((x), 7) ^ ror ((x), 18) ^ ((x) >> 3)) /* (4.6) */
  78. #define S1(x) (ror ((x), 17) ^ ror ((x), 19) ^ ((x) >> 10)) /* (4.7) */
  79. #define R(a,b,c,d,e,f,g,h,k,w) do \
  80. { \
  81. t1 = (h) + Sum1((e)) + Cho((e),(f),(g)) + (k) + (w); \
  82. t2 = Sum0((a)) + Maj((a),(b),(c)); \
  83. h = g; \
  84. g = f; \
  85. f = e; \
  86. e = d + t1; \
  87. d = c; \
  88. c = b; \
  89. b = a; \
  90. a = t1 + t2; \
  91. } while (0)
  92. /* (4.2) same as SHA-1's F1. */
  93. static inline u32
  94. Cho (u32 x, u32 y, u32 z)
  95. {
  96. return (z ^ (x & (y ^ z)));
  97. }
  98. /* (4.3) same as SHA-1's F3 */
  99. static inline u32
  100. Maj (u32 x, u32 y, u32 z)
  101. {
  102. return ((x & y) | (z & (x|y)));
  103. }
  104. /* (4.4) */
  105. static inline u32
  106. Sum0 (u32 x)
  107. {
  108. return (ror (x, 2) ^ ror (x, 13) ^ ror (x, 22));
  109. }
  110. /* (4.5) */
  111. static inline u32
  112. Sum1 (u32 x)
  113. {
  114. return (ror (x, 6) ^ ror (x, 11) ^ ror (x, 25));
  115. }
  116. static void
  117. transform (SHA256_CONTEXT *hd, const unsigned char *data)
  118. {
  119. static const u32 K[64] = {
  120. 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5,
  121. 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
  122. 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,
  123. 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
  124. 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc,
  125. 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
  126. 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7,
  127. 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
  128. 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,
  129. 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
  130. 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3,
  131. 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
  132. 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5,
  133. 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
  134. 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,
  135. 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2
  136. };
  137. u32 a,b,c,d,e,f,g,h,t1,t2;
  138. u32 x[16];
  139. u32 w[64];
  140. int i;
  141. a = hd->h0;
  142. b = hd->h1;
  143. c = hd->h2;
  144. d = hd->h3;
  145. e = hd->h4;
  146. f = hd->h5;
  147. g = hd->h6;
  148. h = hd->h7;
  149. #ifdef WORDS_BIGENDIAN
  150. memcpy (x, data, 64);
  151. #else
  152. {
  153. byte *p2;
  154. for (i=0, p2=(byte*)x; i < 16; i++, p2 += 4 )
  155. {
  156. p2[3] = *data++;
  157. p2[2] = *data++;
  158. p2[1] = *data++;
  159. p2[0] = *data++;
  160. }
  161. }
  162. #endif
  163. for (i=0; i < 16; i++)
  164. w[i] = x[i];
  165. for (; i < 64; i++)
  166. w[i] = S1(w[i-2]) + w[i-7] + S0(w[i-15]) + w[i-16];
  167. for (i=0; i < 64;)
  168. {
  169. #if 0
  170. R(a,b,c,d,e,f,g,h,K[i],w[i]);
  171. i++;
  172. #else
  173. t1 = h + Sum1 (e) + Cho (e, f, g) + K[i] + w[i];
  174. t2 = Sum0 (a) + Maj (a, b, c);
  175. d += t1;
  176. h = t1 + t2;
  177. t1 = g + Sum1 (d) + Cho (d, e, f) + K[i+1] + w[i+1];
  178. t2 = Sum0 (h) + Maj (h, a, b);
  179. c += t1;
  180. g = t1 + t2;
  181. t1 = f + Sum1 (c) + Cho (c, d, e) + K[i+2] + w[i+2];
  182. t2 = Sum0 (g) + Maj (g, h, a);
  183. b += t1;
  184. f = t1 + t2;
  185. t1 = e + Sum1 (b) + Cho (b, c, d) + K[i+3] + w[i+3];
  186. t2 = Sum0 (f) + Maj (f, g, h);
  187. a += t1;
  188. e = t1 + t2;
  189. t1 = d + Sum1 (a) + Cho (a, b, c) + K[i+4] + w[i+4];
  190. t2 = Sum0 (e) + Maj (e, f, g);
  191. h += t1;
  192. d = t1 + t2;
  193. t1 = c + Sum1 (h) + Cho (h, a, b) + K[i+5] + w[i+5];
  194. t2 = Sum0 (d) + Maj (d, e, f);
  195. g += t1;
  196. c = t1 + t2;
  197. t1 = b + Sum1 (g) + Cho (g, h, a) + K[i+6] + w[i+6];
  198. t2 = Sum0 (c) + Maj (c, d, e);
  199. f += t1;
  200. b = t1 + t2;
  201. t1 = a + Sum1 (f) + Cho (f, g, h) + K[i+7] + w[i+7];
  202. t2 = Sum0 (b) + Maj (b, c, d);
  203. e += t1;
  204. a = t1 + t2;
  205. i += 8;
  206. #endif
  207. }
  208. hd->h0 += a;
  209. hd->h1 += b;
  210. hd->h2 += c;
  211. hd->h3 += d;
  212. hd->h4 += e;
  213. hd->h5 += f;
  214. hd->h6 += g;
  215. hd->h7 += h;
  216. }
  217. #undef S0
  218. #undef S1
  219. #undef R
  220. /* Update the message digest with the contents of INBUF with length
  221. INLEN. */
  222. static void
  223. sha256_write (void *context, const void *inbuf_arg, size_t inlen)
  224. {
  225. const unsigned char *inbuf = inbuf_arg;
  226. SHA256_CONTEXT *hd = context;
  227. if (hd->count == 64)
  228. { /* flush the buffer */
  229. transform (hd, hd->buf);
  230. _gcry_burn_stack (74*4+32);
  231. hd->count = 0;
  232. hd->nblocks++;
  233. }
  234. if (!inbuf)
  235. return;
  236. if (hd->count)
  237. {
  238. for (; inlen && hd->count < 64; inlen--)
  239. hd->buf[hd->count++] = *inbuf++;
  240. sha256_write (hd, NULL, 0);
  241. if (!inlen)
  242. return;
  243. }
  244. while (inlen >= 64)
  245. {
  246. transform (hd, inbuf);
  247. hd->count = 0;
  248. hd->nblocks++;
  249. inlen -= 64;
  250. inbuf += 64;
  251. }
  252. _gcry_burn_stack (74*4+32);
  253. for (; inlen && hd->count < 64; inlen--)
  254. hd->buf[hd->count++] = *inbuf++;
  255. }
  256. /*
  257. The routine finally terminates the computation and returns the
  258. digest. The handle is prepared for a new cycle, but adding bytes
  259. to the handle will the destroy the returned buffer. Returns: 32
  260. bytes with the message the digest. */
  261. static void
  262. sha256_final(void *context)
  263. {
  264. SHA256_CONTEXT *hd = context;
  265. u32 t, msb, lsb;
  266. byte *p;
  267. sha256_write (hd, NULL, 0); /* flush */;
  268. t = hd->nblocks;
  269. /* multiply by 64 to make a byte count */
  270. lsb = t << 6;
  271. msb = t >> 26;
  272. /* add the count */
  273. t = lsb;
  274. if ((lsb += hd->count) < t)
  275. msb++;
  276. /* multiply by 8 to make a bit count */
  277. t = lsb;
  278. lsb <<= 3;
  279. msb <<= 3;
  280. msb |= t >> 29;
  281. if (hd->count < 56)
  282. { /* enough room */
  283. hd->buf[hd->count++] = 0x80; /* pad */
  284. while (hd->count < 56)
  285. hd->buf[hd->count++] = 0; /* pad */
  286. }
  287. else
  288. { /* need one extra block */
  289. hd->buf[hd->count++] = 0x80; /* pad character */
  290. while (hd->count < 64)
  291. hd->buf[hd->count++] = 0;
  292. sha256_write (hd, NULL, 0); /* flush */;
  293. memset (hd->buf, 0, 56 ); /* fill next block with zeroes */
  294. }
  295. /* append the 64 bit count */
  296. hd->buf[56] = msb >> 24;
  297. hd->buf[57] = msb >> 16;
  298. hd->buf[58] = msb >> 8;
  299. hd->buf[59] = msb;
  300. hd->buf[60] = lsb >> 24;
  301. hd->buf[61] = lsb >> 16;
  302. hd->buf[62] = lsb >> 8;
  303. hd->buf[63] = lsb;
  304. transform (hd, hd->buf);
  305. _gcry_burn_stack (74*4+32);
  306. p = hd->buf;
  307. #ifdef WORDS_BIGENDIAN
  308. #define X(a) do { *(u32*)p = hd->h##a ; p += 4; } while(0)
  309. #else /* little endian */
  310. #define X(a) do { *p++ = hd->h##a >> 24; *p++ = hd->h##a >> 16; \
  311. *p++ = hd->h##a >> 8; *p++ = hd->h##a; } while(0)
  312. #endif
  313. X(0);
  314. X(1);
  315. X(2);
  316. X(3);
  317. X(4);
  318. X(5);
  319. X(6);
  320. X(7);
  321. #undef X
  322. }
  323. static byte *
  324. sha256_read (void *context)
  325. {
  326. SHA256_CONTEXT *hd = context;
  327. return hd->buf;
  328. }
  329. /*
  330. Self-test section.
  331. */
  332. static gpg_err_code_t
  333. selftests_sha224 (int extended, selftest_report_func_t report)
  334. {
  335. const char *what;
  336. const char *errtxt;
  337. what = "short string";
  338. errtxt = _gcry_hash_selftest_check_one
  339. (GCRY_MD_SHA224, 0,
  340. "abc", 3,
  341. "\x23\x09\x7d\x22\x34\x05\xd8\x22\x86\x42\xa4\x77\xbd\xa2\x55\xb3"
  342. "\x2a\xad\xbc\xe4\xbd\xa0\xb3\xf7\xe3\x6c\x9d\xa7", 28);
  343. if (errtxt)
  344. goto failed;
  345. if (extended)
  346. {
  347. what = "long string";
  348. errtxt = _gcry_hash_selftest_check_one
  349. (GCRY_MD_SHA224, 0,
  350. "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq", 56,
  351. "\x75\x38\x8b\x16\x51\x27\x76\xcc\x5d\xba\x5d\xa1\xfd\x89\x01\x50"
  352. "\xb0\xc6\x45\x5c\xb4\xf5\x8b\x19\x52\x52\x25\x25", 28);
  353. if (errtxt)
  354. goto failed;
  355. what = "one million \"a\"";
  356. errtxt = _gcry_hash_selftest_check_one
  357. (GCRY_MD_SHA224, 1,
  358. NULL, 0,
  359. "\x20\x79\x46\x55\x98\x0c\x91\xd8\xbb\xb4\xc1\xea\x97\x61\x8a\x4b"
  360. "\xf0\x3f\x42\x58\x19\x48\xb2\xee\x4e\xe7\xad\x67", 28);
  361. if (errtxt)
  362. goto failed;
  363. }
  364. return 0; /* Succeeded. */
  365. failed:
  366. if (report)
  367. report ("digest", GCRY_MD_SHA224, what, errtxt);
  368. return GPG_ERR_SELFTEST_FAILED;
  369. }
  370. static gpg_err_code_t
  371. selftests_sha256 (int extended, selftest_report_func_t report)
  372. {
  373. const char *what;
  374. const char *errtxt;
  375. what = "short string";
  376. errtxt = _gcry_hash_selftest_check_one
  377. (GCRY_MD_SHA256, 0,
  378. "abc", 3,
  379. "\xba\x78\x16\xbf\x8f\x01\xcf\xea\x41\x41\x40\xde\x5d\xae\x22\x23"
  380. "\xb0\x03\x61\xa3\x96\x17\x7a\x9c\xb4\x10\xff\x61\xf2\x00\x15\xad", 32);
  381. if (errtxt)
  382. goto failed;
  383. if (extended)
  384. {
  385. what = "long string";
  386. errtxt = _gcry_hash_selftest_check_one
  387. (GCRY_MD_SHA256, 0,
  388. "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq", 56,
  389. "\x24\x8d\x6a\x61\xd2\x06\x38\xb8\xe5\xc0\x26\x93\x0c\x3e\x60\x39"
  390. "\xa3\x3c\xe4\x59\x64\xff\x21\x67\xf6\xec\xed\xd4\x19\xdb\x06\xc1",
  391. 32);
  392. if (errtxt)
  393. goto failed;
  394. what = "one million \"a\"";
  395. errtxt = _gcry_hash_selftest_check_one
  396. (GCRY_MD_SHA256, 1,
  397. NULL, 0,
  398. "\xcd\xc7\x6e\x5c\x99\x14\xfb\x92\x81\xa1\xc7\xe2\x84\xd7\x3e\x67"
  399. "\xf1\x80\x9a\x48\xa4\x97\x20\x0e\x04\x6d\x39\xcc\xc7\x11\x2c\xd0",
  400. 32);
  401. if (errtxt)
  402. goto failed;
  403. }
  404. return 0; /* Succeeded. */
  405. failed:
  406. if (report)
  407. report ("digest", GCRY_MD_SHA256, what, errtxt);
  408. return GPG_ERR_SELFTEST_FAILED;
  409. }
  410. /* Run a full self-test for ALGO and return 0 on success. */
  411. static gpg_err_code_t
  412. run_selftests (int algo, int extended, selftest_report_func_t report)
  413. {
  414. gpg_err_code_t ec;
  415. switch (algo)
  416. {
  417. case GCRY_MD_SHA224:
  418. ec = selftests_sha224 (extended, report);
  419. break;
  420. case GCRY_MD_SHA256:
  421. ec = selftests_sha256 (extended, report);
  422. break;
  423. default:
  424. ec = GPG_ERR_DIGEST_ALGO;
  425. break;
  426. }
  427. return ec;
  428. }
  429. static byte asn224[19] = /* Object ID is 2.16.840.1.101.3.4.2.4 */
  430. { 0x30, 0x2D, 0x30, 0x0d, 0x06, 0x09, 0x60, 0x86, 0x48,
  431. 0x01, 0x65, 0x03, 0x04, 0x02, 0x04, 0x05, 0x00, 0x04,
  432. 0x1C
  433. };
  434. static gcry_md_oid_spec_t oid_spec_sha224[] =
  435. {
  436. /* From RFC3874, Section 4 */
  437. { "2.16.840.1.101.3.4.2.4" },
  438. { NULL },
  439. };
  440. static byte asn256[19] = /* Object ID is 2.16.840.1.101.3.4.2.1 */
  441. { 0x30, 0x31, 0x30, 0x0d, 0x06, 0x09, 0x60, 0x86,
  442. 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, 0x01, 0x05,
  443. 0x00, 0x04, 0x20 };
  444. static gcry_md_oid_spec_t oid_spec_sha256[] =
  445. {
  446. /* According to the OpenPGP draft rfc2440-bis06 */
  447. { "2.16.840.1.101.3.4.2.1" },
  448. /* PKCS#1 sha256WithRSAEncryption */
  449. { "1.2.840.113549.1.1.11" },
  450. { NULL },
  451. };
  452. gcry_md_spec_t _gcry_digest_spec_sha224 =
  453. {
  454. "SHA224", asn224, DIM (asn224), oid_spec_sha224, 28,
  455. sha224_init, sha256_write, sha256_final, sha256_read,
  456. sizeof (SHA256_CONTEXT)
  457. };
  458. md_extra_spec_t _gcry_digest_extraspec_sha224 =
  459. {
  460. run_selftests
  461. };
  462. gcry_md_spec_t _gcry_digest_spec_sha256 =
  463. {
  464. "SHA256", asn256, DIM (asn256), oid_spec_sha256, 32,
  465. sha256_init, sha256_write, sha256_final, sha256_read,
  466. sizeof (SHA256_CONTEXT)
  467. };
  468. md_extra_spec_t _gcry_digest_extraspec_sha256 =
  469. {
  470. run_selftests
  471. };