sha512.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345
  1. /*
  2. * Copyright (C) 2007 Michael Niedermayer <michaelni@gmx.at>
  3. * Copyright (C) 2009 Konstantin Shishkov
  4. * Copyright (C) 2013 James Almer
  5. * based on BSD-licensed SHA-2 code by Aaron D. Gifford
  6. *
  7. * This file is part of FFmpeg.
  8. *
  9. * FFmpeg is free software; you can redistribute it and/or
  10. * modify it under the terms of the GNU Lesser General Public
  11. * License as published by the Free Software Foundation; either
  12. * version 2.1 of the License, or (at your option) any later version.
  13. *
  14. * FFmpeg is distributed in the hope that it will be useful,
  15. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  16. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  17. * Lesser General Public License for more details.
  18. *
  19. * You should have received a copy of the GNU Lesser General Public
  20. * License along with FFmpeg; if not, write to the Free Software
  21. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  22. */
  23. #include <string.h>
  24. #include "attributes.h"
  25. #include "avutil.h"
  26. #include "bswap.h"
  27. #include "sha512.h"
  28. #include "intreadwrite.h"
  29. #include "mem.h"
  30. /** hash context */
  31. typedef struct AVSHA512 {
  32. uint8_t digest_len; ///< digest length in 64-bit words
  33. uint64_t count; ///< number of bytes in buffer
  34. uint8_t buffer[128]; ///< 1024-bit buffer of input values used in hash updating
  35. uint64_t state[8]; ///< current hash value
  36. } AVSHA512;
  37. const int av_sha512_size = sizeof(AVSHA512);
  38. struct AVSHA512 *av_sha512_alloc(void)
  39. {
  40. return av_mallocz(sizeof(struct AVSHA512));
  41. }
  42. static const uint64_t K512[80] = {
  43. UINT64_C(0x428a2f98d728ae22), UINT64_C(0x7137449123ef65cd),
  44. UINT64_C(0xb5c0fbcfec4d3b2f), UINT64_C(0xe9b5dba58189dbbc),
  45. UINT64_C(0x3956c25bf348b538), UINT64_C(0x59f111f1b605d019),
  46. UINT64_C(0x923f82a4af194f9b), UINT64_C(0xab1c5ed5da6d8118),
  47. UINT64_C(0xd807aa98a3030242), UINT64_C(0x12835b0145706fbe),
  48. UINT64_C(0x243185be4ee4b28c), UINT64_C(0x550c7dc3d5ffb4e2),
  49. UINT64_C(0x72be5d74f27b896f), UINT64_C(0x80deb1fe3b1696b1),
  50. UINT64_C(0x9bdc06a725c71235), UINT64_C(0xc19bf174cf692694),
  51. UINT64_C(0xe49b69c19ef14ad2), UINT64_C(0xefbe4786384f25e3),
  52. UINT64_C(0x0fc19dc68b8cd5b5), UINT64_C(0x240ca1cc77ac9c65),
  53. UINT64_C(0x2de92c6f592b0275), UINT64_C(0x4a7484aa6ea6e483),
  54. UINT64_C(0x5cb0a9dcbd41fbd4), UINT64_C(0x76f988da831153b5),
  55. UINT64_C(0x983e5152ee66dfab), UINT64_C(0xa831c66d2db43210),
  56. UINT64_C(0xb00327c898fb213f), UINT64_C(0xbf597fc7beef0ee4),
  57. UINT64_C(0xc6e00bf33da88fc2), UINT64_C(0xd5a79147930aa725),
  58. UINT64_C(0x06ca6351e003826f), UINT64_C(0x142929670a0e6e70),
  59. UINT64_C(0x27b70a8546d22ffc), UINT64_C(0x2e1b21385c26c926),
  60. UINT64_C(0x4d2c6dfc5ac42aed), UINT64_C(0x53380d139d95b3df),
  61. UINT64_C(0x650a73548baf63de), UINT64_C(0x766a0abb3c77b2a8),
  62. UINT64_C(0x81c2c92e47edaee6), UINT64_C(0x92722c851482353b),
  63. UINT64_C(0xa2bfe8a14cf10364), UINT64_C(0xa81a664bbc423001),
  64. UINT64_C(0xc24b8b70d0f89791), UINT64_C(0xc76c51a30654be30),
  65. UINT64_C(0xd192e819d6ef5218), UINT64_C(0xd69906245565a910),
  66. UINT64_C(0xf40e35855771202a), UINT64_C(0x106aa07032bbd1b8),
  67. UINT64_C(0x19a4c116b8d2d0c8), UINT64_C(0x1e376c085141ab53),
  68. UINT64_C(0x2748774cdf8eeb99), UINT64_C(0x34b0bcb5e19b48a8),
  69. UINT64_C(0x391c0cb3c5c95a63), UINT64_C(0x4ed8aa4ae3418acb),
  70. UINT64_C(0x5b9cca4f7763e373), UINT64_C(0x682e6ff3d6b2b8a3),
  71. UINT64_C(0x748f82ee5defb2fc), UINT64_C(0x78a5636f43172f60),
  72. UINT64_C(0x84c87814a1f0ab72), UINT64_C(0x8cc702081a6439ec),
  73. UINT64_C(0x90befffa23631e28), UINT64_C(0xa4506cebde82bde9),
  74. UINT64_C(0xbef9a3f7b2c67915), UINT64_C(0xc67178f2e372532b),
  75. UINT64_C(0xca273eceea26619c), UINT64_C(0xd186b8c721c0c207),
  76. UINT64_C(0xeada7dd6cde0eb1e), UINT64_C(0xf57d4f7fee6ed178),
  77. UINT64_C(0x06f067aa72176fba), UINT64_C(0x0a637dc5a2c898a6),
  78. UINT64_C(0x113f9804bef90dae), UINT64_C(0x1b710b35131c471b),
  79. UINT64_C(0x28db77f523047d84), UINT64_C(0x32caab7b40c72493),
  80. UINT64_C(0x3c9ebe0a15c9bebc), UINT64_C(0x431d67c49c100d4c),
  81. UINT64_C(0x4cc5d4becb3e42b6), UINT64_C(0x597f299cfc657e2a),
  82. UINT64_C(0x5fcb6fab3ad6faec), UINT64_C(0x6c44198c4a475817),
  83. };
  84. #define ror(value, bits) (((value) >> (bits)) | ((value) << (64 - (bits))))
  85. #define Ch(x,y,z) (((x) & ((y) ^ (z))) ^ (z))
  86. #define Maj(z,y,x) ((((x) | (y)) & (z)) | ((x) & (y)))
  87. #define Sigma0_512(x) (ror((x), 28) ^ ror((x), 34) ^ ror((x), 39))
  88. #define Sigma1_512(x) (ror((x), 14) ^ ror((x), 18) ^ ror((x), 41))
  89. #define sigma0_512(x) (ror((x), 1) ^ ror((x), 8) ^ ((x) >> 7))
  90. #define sigma1_512(x) (ror((x), 19) ^ ror((x), 61) ^ ((x) >> 6))
  91. #define blk0(i) (block[i] = AV_RB64(buffer + 8 * (i)))
  92. #define blk(i) (block[i] = block[i - 16] + sigma0_512(block[i - 15]) + \
  93. sigma1_512(block[i - 2]) + block[i - 7])
  94. #define ROUND512(a,b,c,d,e,f,g,h) \
  95. T1 += (h) + Sigma1_512(e) + Ch((e), (f), (g)) + K512[i]; \
  96. (d) += T1; \
  97. (h) = T1 + Sigma0_512(a) + Maj((a), (b), (c)); \
  98. i++
  99. #define ROUND512_0_TO_15(a,b,c,d,e,f,g,h) \
  100. T1 = blk0(i); \
  101. ROUND512(a,b,c,d,e,f,g,h)
  102. #define ROUND512_16_TO_80(a,b,c,d,e,f,g,h) \
  103. T1 = blk(i); \
  104. ROUND512(a,b,c,d,e,f,g,h)
  105. static void sha512_transform(uint64_t *state, const uint8_t buffer[128])
  106. {
  107. uint64_t a, b, c, d, e, f, g, h;
  108. uint64_t block[80];
  109. uint64_t T1;
  110. int i;
  111. a = state[0];
  112. b = state[1];
  113. c = state[2];
  114. d = state[3];
  115. e = state[4];
  116. f = state[5];
  117. g = state[6];
  118. h = state[7];
  119. #if CONFIG_SMALL
  120. for (i = 0; i < 80; i++) {
  121. uint64_t T2;
  122. if (i < 16)
  123. T1 = blk0(i);
  124. else
  125. T1 = blk(i);
  126. T1 += h + Sigma1_512(e) + Ch(e, f, g) + K512[i];
  127. T2 = Sigma0_512(a) + Maj(a, b, c);
  128. h = g;
  129. g = f;
  130. f = e;
  131. e = d + T1;
  132. d = c;
  133. c = b;
  134. b = a;
  135. a = T1 + T2;
  136. }
  137. #else
  138. #define R512_0 \
  139. ROUND512_0_TO_15(a, b, c, d, e, f, g, h); \
  140. ROUND512_0_TO_15(h, a, b, c, d, e, f, g); \
  141. ROUND512_0_TO_15(g, h, a, b, c, d, e, f); \
  142. ROUND512_0_TO_15(f, g, h, a, b, c, d, e); \
  143. ROUND512_0_TO_15(e, f, g, h, a, b, c, d); \
  144. ROUND512_0_TO_15(d, e, f, g, h, a, b, c); \
  145. ROUND512_0_TO_15(c, d, e, f, g, h, a, b); \
  146. ROUND512_0_TO_15(b, c, d, e, f, g, h, a)
  147. i = 0;
  148. R512_0; R512_0;
  149. #define R512_16 \
  150. ROUND512_16_TO_80(a, b, c, d, e, f, g, h); \
  151. ROUND512_16_TO_80(h, a, b, c, d, e, f, g); \
  152. ROUND512_16_TO_80(g, h, a, b, c, d, e, f); \
  153. ROUND512_16_TO_80(f, g, h, a, b, c, d, e); \
  154. ROUND512_16_TO_80(e, f, g, h, a, b, c, d); \
  155. ROUND512_16_TO_80(d, e, f, g, h, a, b, c); \
  156. ROUND512_16_TO_80(c, d, e, f, g, h, a, b); \
  157. ROUND512_16_TO_80(b, c, d, e, f, g, h, a)
  158. R512_16; R512_16; R512_16; R512_16;
  159. R512_16; R512_16; R512_16; R512_16;
  160. #endif
  161. state[0] += a;
  162. state[1] += b;
  163. state[2] += c;
  164. state[3] += d;
  165. state[4] += e;
  166. state[5] += f;
  167. state[6] += g;
  168. state[7] += h;
  169. }
  170. av_cold int av_sha512_init(AVSHA512 *ctx, int bits)
  171. {
  172. ctx->digest_len = bits >> 6;
  173. switch (bits) {
  174. case 224: // SHA-512/224
  175. ctx->state[0] = UINT64_C(0x8C3D37C819544DA2);
  176. ctx->state[1] = UINT64_C(0x73E1996689DCD4D6);
  177. ctx->state[2] = UINT64_C(0x1DFAB7AE32FF9C82);
  178. ctx->state[3] = UINT64_C(0x679DD514582F9FCF);
  179. ctx->state[4] = UINT64_C(0x0F6D2B697BD44DA8);
  180. ctx->state[5] = UINT64_C(0x77E36F7304C48942);
  181. ctx->state[6] = UINT64_C(0x3F9D85A86A1D36C8);
  182. ctx->state[7] = UINT64_C(0x1112E6AD91D692A1);
  183. break;
  184. case 256: // SHA-512/256
  185. ctx->state[0] = UINT64_C(0x22312194FC2BF72C);
  186. ctx->state[1] = UINT64_C(0x9F555FA3C84C64C2);
  187. ctx->state[2] = UINT64_C(0x2393B86B6F53B151);
  188. ctx->state[3] = UINT64_C(0x963877195940EABD);
  189. ctx->state[4] = UINT64_C(0x96283EE2A88EFFE3);
  190. ctx->state[5] = UINT64_C(0xBE5E1E2553863992);
  191. ctx->state[6] = UINT64_C(0x2B0199FC2C85B8AA);
  192. ctx->state[7] = UINT64_C(0x0EB72DDC81C52CA2);
  193. break;
  194. case 384: // SHA-384
  195. ctx->state[0] = UINT64_C(0xCBBB9D5DC1059ED8);
  196. ctx->state[1] = UINT64_C(0x629A292A367CD507);
  197. ctx->state[2] = UINT64_C(0x9159015A3070DD17);
  198. ctx->state[3] = UINT64_C(0x152FECD8F70E5939);
  199. ctx->state[4] = UINT64_C(0x67332667FFC00B31);
  200. ctx->state[5] = UINT64_C(0x8EB44A8768581511);
  201. ctx->state[6] = UINT64_C(0xDB0C2E0D64F98FA7);
  202. ctx->state[7] = UINT64_C(0x47B5481DBEFA4FA4);
  203. break;
  204. case 512: // SHA-512
  205. ctx->state[0] = UINT64_C(0x6A09E667F3BCC908);
  206. ctx->state[1] = UINT64_C(0xBB67AE8584CAA73B);
  207. ctx->state[2] = UINT64_C(0x3C6EF372FE94F82B);
  208. ctx->state[3] = UINT64_C(0xA54FF53A5F1D36F1);
  209. ctx->state[4] = UINT64_C(0x510E527FADE682D1);
  210. ctx->state[5] = UINT64_C(0x9B05688C2B3E6C1F);
  211. ctx->state[6] = UINT64_C(0x1F83D9ABFB41BD6B);
  212. ctx->state[7] = UINT64_C(0x5BE0CD19137E2179);
  213. break;
  214. default:
  215. return -1;
  216. }
  217. ctx->count = 0;
  218. return 0;
  219. }
  220. void av_sha512_update(AVSHA512* ctx, const uint8_t* data, unsigned int len)
  221. {
  222. unsigned int i, j;
  223. j = ctx->count & 127;
  224. ctx->count += len;
  225. #if CONFIG_SMALL
  226. for (i = 0; i < len; i++) {
  227. ctx->buffer[j++] = data[i];
  228. if (128 == j) {
  229. sha512_transform(ctx->state, ctx->buffer);
  230. j = 0;
  231. }
  232. }
  233. #else
  234. if ((j + len) > 127) {
  235. memcpy(&ctx->buffer[j], data, (i = 128 - j));
  236. sha512_transform(ctx->state, ctx->buffer);
  237. for (; i + 127 < len; i += 128)
  238. sha512_transform(ctx->state, &data[i]);
  239. j = 0;
  240. } else
  241. i = 0;
  242. memcpy(&ctx->buffer[j], &data[i], len - i);
  243. #endif
  244. }
  245. void av_sha512_final(AVSHA512* ctx, uint8_t *digest)
  246. {
  247. uint64_t i = 0;
  248. uint64_t finalcount = av_be2ne64(ctx->count << 3);
  249. av_sha512_update(ctx, "\200", 1);
  250. while ((ctx->count & 127) != 112)
  251. av_sha512_update(ctx, "", 1);
  252. av_sha512_update(ctx, (uint8_t *)&i, 8);
  253. av_sha512_update(ctx, (uint8_t *)&finalcount, 8); /* Should cause a transform() */
  254. for (i = 0; i < ctx->digest_len; i++)
  255. AV_WB64(digest + i*8, ctx->state[i]);
  256. if (ctx->digest_len & 1) /* SHA512/224 is 28 bytes, and is not divisible by 8. */
  257. AV_WB32(digest + i*8, ctx->state[i] >> 32);
  258. }
  259. #ifdef TEST
  260. #include <stdio.h>
  261. int main(void)
  262. {
  263. int i, j, k;
  264. AVSHA512 ctx;
  265. unsigned char digest[64];
  266. static const int lengths[4] = { 224, 256, 384, 512 };
  267. for (j = 0; j < 4; j++) {
  268. if (j < 2) printf("Testing SHA-512/%d\n", lengths[j]);
  269. else printf("Testing SHA-%d\n", lengths[j]);
  270. for (k = 0; k < 3; k++) {
  271. av_sha512_init(&ctx, lengths[j]);
  272. if (k == 0)
  273. av_sha512_update(&ctx, "abc", 3);
  274. else if (k == 1)
  275. av_sha512_update(&ctx, "abcdefghbcdefghicdefghijdefghijkefghijklfghijklmghijklmn"
  276. "hijklmnoijklmnopjklmnopqklmnopqrlmnopqrsmnopqrstnopqrstu", 112);
  277. else
  278. for (i = 0; i < 1000*1000; i++)
  279. av_sha512_update(&ctx, "a", 1);
  280. av_sha512_final(&ctx, digest);
  281. for (i = 0; i < lengths[j] >> 3; i++)
  282. printf("%02X", digest[i]);
  283. putchar('\n');
  284. }
  285. switch (j) { //test vectors (from FIPS PUB 180-4 Apendix A)
  286. case 0:
  287. printf("4634270f 707b6a54 daae7530 460842e2 0e37ed26 5ceee9a4 3e8924aa\n"
  288. "23fec5bb 94d60b23 30819264 0b0c4533 35d66473 4fe40e72 68674af9\n"
  289. "37ab331d 76f0d36d e422bd0e deb22a28 accd487b 7a8453ae 965dd287\n");
  290. break;
  291. case 1:
  292. printf("53048e26 81941ef9 9b2e29b7 6b4c7dab e4c2d0c6 34fc6d46 e0e2f131 07e7af23\n"
  293. "3928e184 fb8690f8 40da3988 121d31be 65cb9d3e f83ee614 6feac861 e19b563a\n"
  294. "9a59a052 930187a9 7038cae6 92f30708 aa649192 3ef51943 94dc68d5 6c74fb21\n");
  295. break;
  296. case 2:
  297. printf("cb00753f 45a35e8b b5a03d69 9ac65007 272c32ab 0eded163 "
  298. "1a8b605a 43ff5bed 8086072b a1e7cc23 58baeca1 34c825a7\n"
  299. "09330c33 f71147e8 3d192fc7 82cd1b47 53111b17 3b3b05d2 "
  300. "2fa08086 e3b0f712 fcc7c71a 557e2db9 66c3e9fa 91746039\n"
  301. "9d0e1809 716474cb 086e834e 310a4a1c ed149e9c 00f24852 "
  302. "7972cec5 704c2a5b 07b8b3dc 38ecc4eb ae97ddd8 7f3d8985\n");
  303. break;
  304. case 3:
  305. printf("ddaf35a1 93617aba cc417349 ae204131 12e6fa4e 89a97ea2 0a9eeee6 4b55d39a "
  306. "2192992a 274fc1a8 36ba3c23 a3feebbd 454d4423 643ce80e 2a9ac94f a54ca49f\n"
  307. "8e959b75 dae313da 8cf4f728 14fc143f 8f7779c6 eb9f7fa1 7299aead b6889018 "
  308. "501d289e 4900f7e4 331b99de c4b5433a c7d329ee b6dd2654 5e96e55b 874be909\n"
  309. "e718483d 0ce76964 4e2e42c7 bc15b463 8e1f98b1 3b204428 5632a803 afa973eb "
  310. "de0ff244 877ea60a 4cb0432c e577c31b eb009c5c 2c49aa2e 4eadb217 ad8cc09b\n");
  311. break;
  312. }
  313. }
  314. return 0;
  315. }
  316. #endif