2sha512.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347
  1. /* SHA-256 and SHA-512 implementation based on code by Oliver Gay
  2. * <olivier.gay@a3.epfl.ch> under a BSD-style license. See below.
  3. */
  4. /*
  5. * FIPS 180-2 SHA-224/256/384/512 implementation
  6. * Last update: 02/02/2007
  7. * Issue date: 04/30/2005
  8. *
  9. * Copyright (C) 2005, 2007 Olivier Gay <olivier.gay@a3.epfl.ch>
  10. * All rights reserved.
  11. *
  12. * Redistribution and use in source and binary forms, with or without
  13. * modification, are permitted provided that the following conditions
  14. * are met:
  15. * 1. Redistributions of source code must retain the above copyright
  16. * notice, this list of conditions and the following disclaimer.
  17. * 2. Redistributions in binary form must reproduce the above copyright
  18. * notice, this list of conditions and the following disclaimer in the
  19. * documentation and/or other materials provided with the distribution.
  20. * 3. Neither the name of the project nor the names of its contributors
  21. * may be used to endorse or promote products derived from this software
  22. * without specific prior written permission.
  23. *
  24. * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
  25. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  26. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  27. * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
  28. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  29. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  30. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  31. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  32. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  33. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  34. * SUCH DAMAGE.
  35. */
  36. #include "2sysincludes.h"
  37. #include "2common.h"
  38. #include "2sha.h"
  39. #define SHFR(x, n) (x >> n)
  40. #define ROTR(x, n) ((x >> n) | (x << ((sizeof(x) << 3) - n)))
  41. #define ROTL(x, n) ((x << n) | (x >> ((sizeof(x) << 3) - n)))
  42. #define CH(x, y, z) ((x & y) ^ (~x & z))
  43. #define MAJ(x, y, z) ((x & y) ^ (x & z) ^ (y & z))
  44. #define SHA512_F1(x) (ROTR(x, 28) ^ ROTR(x, 34) ^ ROTR(x, 39))
  45. #define SHA512_F2(x) (ROTR(x, 14) ^ ROTR(x, 18) ^ ROTR(x, 41))
  46. #define SHA512_F3(x) (ROTR(x, 1) ^ ROTR(x, 8) ^ SHFR(x, 7))
  47. #define SHA512_F4(x) (ROTR(x, 19) ^ ROTR(x, 61) ^ SHFR(x, 6))
  48. #define UNPACK32(x, str) \
  49. { \
  50. *((str) + 3) = (uint8_t) ((x) ); \
  51. *((str) + 2) = (uint8_t) ((x) >> 8); \
  52. *((str) + 1) = (uint8_t) ((x) >> 16); \
  53. *((str) + 0) = (uint8_t) ((x) >> 24); \
  54. }
  55. #define UNPACK64(x, str) \
  56. { \
  57. *((str) + 7) = (uint8_t) x; \
  58. *((str) + 6) = (uint8_t) ((uint64_t)x >> 8); \
  59. *((str) + 5) = (uint8_t) ((uint64_t)x >> 16); \
  60. *((str) + 4) = (uint8_t) ((uint64_t)x >> 24); \
  61. *((str) + 3) = (uint8_t) ((uint64_t)x >> 32); \
  62. *((str) + 2) = (uint8_t) ((uint64_t)x >> 40); \
  63. *((str) + 1) = (uint8_t) ((uint64_t)x >> 48); \
  64. *((str) + 0) = (uint8_t) ((uint64_t)x >> 56); \
  65. }
  66. #define PACK64(str, x) \
  67. { \
  68. *(x) = ((uint64_t) *((str) + 7) ) \
  69. | ((uint64_t) *((str) + 6) << 8) \
  70. | ((uint64_t) *((str) + 5) << 16) \
  71. | ((uint64_t) *((str) + 4) << 24) \
  72. | ((uint64_t) *((str) + 3) << 32) \
  73. | ((uint64_t) *((str) + 2) << 40) \
  74. | ((uint64_t) *((str) + 1) << 48) \
  75. | ((uint64_t) *((str) + 0) << 56); \
  76. }
  77. /* Macros used for loops unrolling */
  78. #define SHA512_SCR(i) \
  79. { \
  80. w[i] = SHA512_F4(w[i - 2]) + w[i - 7] \
  81. + SHA512_F3(w[i - 15]) + w[i - 16]; \
  82. }
  83. #define SHA512_EXP(a, b, c, d, e, f, g ,h, j) \
  84. { \
  85. t1 = wv[h] + SHA512_F2(wv[e]) + CH(wv[e], wv[f], wv[g]) \
  86. + sha512_k[j] + w[j]; \
  87. t2 = SHA512_F1(wv[a]) + MAJ(wv[a], wv[b], wv[c]); \
  88. wv[d] += t1; \
  89. wv[h] = t1 + t2; \
  90. }
  91. static const uint64_t sha512_h0[8] = {
  92. 0x6a09e667f3bcc908ULL, 0xbb67ae8584caa73bULL,
  93. 0x3c6ef372fe94f82bULL, 0xa54ff53a5f1d36f1ULL,
  94. 0x510e527fade682d1ULL, 0x9b05688c2b3e6c1fULL,
  95. 0x1f83d9abfb41bd6bULL, 0x5be0cd19137e2179ULL
  96. };
  97. static const uint64_t sha512_k[80] = {
  98. 0x428a2f98d728ae22ULL, 0x7137449123ef65cdULL,
  99. 0xb5c0fbcfec4d3b2fULL, 0xe9b5dba58189dbbcULL,
  100. 0x3956c25bf348b538ULL, 0x59f111f1b605d019ULL,
  101. 0x923f82a4af194f9bULL, 0xab1c5ed5da6d8118ULL,
  102. 0xd807aa98a3030242ULL, 0x12835b0145706fbeULL,
  103. 0x243185be4ee4b28cULL, 0x550c7dc3d5ffb4e2ULL,
  104. 0x72be5d74f27b896fULL, 0x80deb1fe3b1696b1ULL,
  105. 0x9bdc06a725c71235ULL, 0xc19bf174cf692694ULL,
  106. 0xe49b69c19ef14ad2ULL, 0xefbe4786384f25e3ULL,
  107. 0x0fc19dc68b8cd5b5ULL, 0x240ca1cc77ac9c65ULL,
  108. 0x2de92c6f592b0275ULL, 0x4a7484aa6ea6e483ULL,
  109. 0x5cb0a9dcbd41fbd4ULL, 0x76f988da831153b5ULL,
  110. 0x983e5152ee66dfabULL, 0xa831c66d2db43210ULL,
  111. 0xb00327c898fb213fULL, 0xbf597fc7beef0ee4ULL,
  112. 0xc6e00bf33da88fc2ULL, 0xd5a79147930aa725ULL,
  113. 0x06ca6351e003826fULL, 0x142929670a0e6e70ULL,
  114. 0x27b70a8546d22ffcULL, 0x2e1b21385c26c926ULL,
  115. 0x4d2c6dfc5ac42aedULL, 0x53380d139d95b3dfULL,
  116. 0x650a73548baf63deULL, 0x766a0abb3c77b2a8ULL,
  117. 0x81c2c92e47edaee6ULL, 0x92722c851482353bULL,
  118. 0xa2bfe8a14cf10364ULL, 0xa81a664bbc423001ULL,
  119. 0xc24b8b70d0f89791ULL, 0xc76c51a30654be30ULL,
  120. 0xd192e819d6ef5218ULL, 0xd69906245565a910ULL,
  121. 0xf40e35855771202aULL, 0x106aa07032bbd1b8ULL,
  122. 0x19a4c116b8d2d0c8ULL, 0x1e376c085141ab53ULL,
  123. 0x2748774cdf8eeb99ULL, 0x34b0bcb5e19b48a8ULL,
  124. 0x391c0cb3c5c95a63ULL, 0x4ed8aa4ae3418acbULL,
  125. 0x5b9cca4f7763e373ULL, 0x682e6ff3d6b2b8a3ULL,
  126. 0x748f82ee5defb2fcULL, 0x78a5636f43172f60ULL,
  127. 0x84c87814a1f0ab72ULL, 0x8cc702081a6439ecULL,
  128. 0x90befffa23631e28ULL, 0xa4506cebde82bde9ULL,
  129. 0xbef9a3f7b2c67915ULL, 0xc67178f2e372532bULL,
  130. 0xca273eceea26619cULL, 0xd186b8c721c0c207ULL,
  131. 0xeada7dd6cde0eb1eULL, 0xf57d4f7fee6ed178ULL,
  132. 0x06f067aa72176fbaULL, 0x0a637dc5a2c898a6ULL,
  133. 0x113f9804bef90daeULL, 0x1b710b35131c471bULL,
  134. 0x28db77f523047d84ULL, 0x32caab7b40c72493ULL,
  135. 0x3c9ebe0a15c9bebcULL, 0x431d67c49c100d4cULL,
  136. 0x4cc5d4becb3e42b6ULL, 0x597f299cfc657e2aULL,
  137. 0x5fcb6fab3ad6faecULL, 0x6c44198c4a475817ULL
  138. };
  139. /* SHA-512 implementation */
  140. void vb2_sha512_init(struct vb2_sha512_context *ctx)
  141. {
  142. #ifdef UNROLL_LOOPS_SHA512
  143. ctx->h[0] = sha512_h0[0]; ctx->h[1] = sha512_h0[1];
  144. ctx->h[2] = sha512_h0[2]; ctx->h[3] = sha512_h0[3];
  145. ctx->h[4] = sha512_h0[4]; ctx->h[5] = sha512_h0[5];
  146. ctx->h[6] = sha512_h0[6]; ctx->h[7] = sha512_h0[7];
  147. #else
  148. int i;
  149. for (i = 0; i < 8; i++)
  150. ctx->h[i] = sha512_h0[i];
  151. #endif /* UNROLL_LOOPS_SHA512 */
  152. ctx->size = 0;
  153. ctx->total_size = 0;
  154. }
  155. static void vb2_sha512_transform(struct vb2_sha512_context *ctx,
  156. const uint8_t *message,
  157. unsigned int block_nb)
  158. {
  159. /* Note that these arrays use 88*8=704 bytes of stack */
  160. uint64_t w[80];
  161. uint64_t wv[8];
  162. uint64_t t1, t2;
  163. const uint8_t *sub_block;
  164. int i, j;
  165. for (i = 0; i < (int) block_nb; i++) {
  166. sub_block = message + (i << 7);
  167. #ifdef UNROLL_LOOPS_SHA512
  168. PACK64(&sub_block[ 0], &w[ 0]);
  169. PACK64(&sub_block[ 8], &w[ 1]);
  170. PACK64(&sub_block[ 16], &w[ 2]);
  171. PACK64(&sub_block[ 24], &w[ 3]);
  172. PACK64(&sub_block[ 32], &w[ 4]);
  173. PACK64(&sub_block[ 40], &w[ 5]);
  174. PACK64(&sub_block[ 48], &w[ 6]);
  175. PACK64(&sub_block[ 56], &w[ 7]);
  176. PACK64(&sub_block[ 64], &w[ 8]);
  177. PACK64(&sub_block[ 72], &w[ 9]);
  178. PACK64(&sub_block[ 80], &w[10]);
  179. PACK64(&sub_block[ 88], &w[11]);
  180. PACK64(&sub_block[ 96], &w[12]);
  181. PACK64(&sub_block[104], &w[13]);
  182. PACK64(&sub_block[112], &w[14]);
  183. PACK64(&sub_block[120], &w[15]);
  184. SHA512_SCR(16); SHA512_SCR(17); SHA512_SCR(18); SHA512_SCR(19);
  185. SHA512_SCR(20); SHA512_SCR(21); SHA512_SCR(22); SHA512_SCR(23);
  186. SHA512_SCR(24); SHA512_SCR(25); SHA512_SCR(26); SHA512_SCR(27);
  187. SHA512_SCR(28); SHA512_SCR(29); SHA512_SCR(30); SHA512_SCR(31);
  188. SHA512_SCR(32); SHA512_SCR(33); SHA512_SCR(34); SHA512_SCR(35);
  189. SHA512_SCR(36); SHA512_SCR(37); SHA512_SCR(38); SHA512_SCR(39);
  190. SHA512_SCR(40); SHA512_SCR(41); SHA512_SCR(42); SHA512_SCR(43);
  191. SHA512_SCR(44); SHA512_SCR(45); SHA512_SCR(46); SHA512_SCR(47);
  192. SHA512_SCR(48); SHA512_SCR(49); SHA512_SCR(50); SHA512_SCR(51);
  193. SHA512_SCR(52); SHA512_SCR(53); SHA512_SCR(54); SHA512_SCR(55);
  194. SHA512_SCR(56); SHA512_SCR(57); SHA512_SCR(58); SHA512_SCR(59);
  195. SHA512_SCR(60); SHA512_SCR(61); SHA512_SCR(62); SHA512_SCR(63);
  196. SHA512_SCR(64); SHA512_SCR(65); SHA512_SCR(66); SHA512_SCR(67);
  197. SHA512_SCR(68); SHA512_SCR(69); SHA512_SCR(70); SHA512_SCR(71);
  198. SHA512_SCR(72); SHA512_SCR(73); SHA512_SCR(74); SHA512_SCR(75);
  199. SHA512_SCR(76); SHA512_SCR(77); SHA512_SCR(78); SHA512_SCR(79);
  200. wv[0] = ctx->h[0]; wv[1] = ctx->h[1];
  201. wv[2] = ctx->h[2]; wv[3] = ctx->h[3];
  202. wv[4] = ctx->h[4]; wv[5] = ctx->h[5];
  203. wv[6] = ctx->h[6]; wv[7] = ctx->h[7];
  204. j = 0;
  205. do {
  206. SHA512_EXP(0,1,2,3,4,5,6,7,j); j++;
  207. SHA512_EXP(7,0,1,2,3,4,5,6,j); j++;
  208. SHA512_EXP(6,7,0,1,2,3,4,5,j); j++;
  209. SHA512_EXP(5,6,7,0,1,2,3,4,j); j++;
  210. SHA512_EXP(4,5,6,7,0,1,2,3,j); j++;
  211. SHA512_EXP(3,4,5,6,7,0,1,2,j); j++;
  212. SHA512_EXP(2,3,4,5,6,7,0,1,j); j++;
  213. SHA512_EXP(1,2,3,4,5,6,7,0,j); j++;
  214. } while (j < 80);
  215. ctx->h[0] += wv[0]; ctx->h[1] += wv[1];
  216. ctx->h[2] += wv[2]; ctx->h[3] += wv[3];
  217. ctx->h[4] += wv[4]; ctx->h[5] += wv[5];
  218. ctx->h[6] += wv[6]; ctx->h[7] += wv[7];
  219. #else
  220. for (j = 0; j < 16; j++) {
  221. PACK64(&sub_block[j << 3], &w[j]);
  222. }
  223. for (j = 16; j < 80; j++) {
  224. SHA512_SCR(j);
  225. }
  226. for (j = 0; j < 8; j++) {
  227. wv[j] = ctx->h[j];
  228. }
  229. for (j = 0; j < 80; j++) {
  230. t1 = wv[7] + SHA512_F2(wv[4]) + CH(wv[4], wv[5], wv[6])
  231. + sha512_k[j] + w[j];
  232. t2 = SHA512_F1(wv[0]) + MAJ(wv[0], wv[1], wv[2]);
  233. wv[7] = wv[6];
  234. wv[6] = wv[5];
  235. wv[5] = wv[4];
  236. wv[4] = wv[3] + t1;
  237. wv[3] = wv[2];
  238. wv[2] = wv[1];
  239. wv[1] = wv[0];
  240. wv[0] = t1 + t2;
  241. }
  242. for (j = 0; j < 8; j++)
  243. ctx->h[j] += wv[j];
  244. #endif /* UNROLL_LOOPS_SHA512 */
  245. }
  246. }
  247. void vb2_sha512_update(struct vb2_sha512_context *ctx,
  248. const uint8_t *data,
  249. uint32_t size)
  250. {
  251. unsigned int block_nb;
  252. unsigned int new_size, rem_size, tmp_size;
  253. const uint8_t *shifted_data;
  254. tmp_size = VB2_SHA512_BLOCK_SIZE - ctx->size;
  255. rem_size = size < tmp_size ? size : tmp_size;
  256. memcpy(&ctx->block[ctx->size], data, rem_size);
  257. if (ctx->size + size < VB2_SHA512_BLOCK_SIZE) {
  258. ctx->size += size;
  259. return;
  260. }
  261. new_size = size - rem_size;
  262. block_nb = new_size / VB2_SHA512_BLOCK_SIZE;
  263. shifted_data = data + rem_size;
  264. vb2_sha512_transform(ctx, ctx->block, 1);
  265. vb2_sha512_transform(ctx, shifted_data, block_nb);
  266. rem_size = new_size % VB2_SHA512_BLOCK_SIZE;
  267. memcpy(ctx->block, &shifted_data[block_nb << 7],
  268. rem_size);
  269. ctx->size = rem_size;
  270. ctx->total_size += (block_nb + 1) << 7;
  271. }
  272. void vb2_sha512_finalize(struct vb2_sha512_context *ctx, uint8_t *digest)
  273. {
  274. unsigned int block_nb;
  275. unsigned int pm_size;
  276. unsigned int size_b;
  277. #ifndef UNROLL_LOOPS_SHA512
  278. int i;
  279. #endif
  280. block_nb = 1 + ((VB2_SHA512_BLOCK_SIZE - 17)
  281. < (ctx->size % VB2_SHA512_BLOCK_SIZE));
  282. size_b = (ctx->total_size + ctx->size) << 3;
  283. pm_size = block_nb << 7;
  284. memset(ctx->block + ctx->size, 0, pm_size - ctx->size);
  285. ctx->block[ctx->size] = 0x80;
  286. UNPACK32(size_b, ctx->block + pm_size - 4);
  287. vb2_sha512_transform(ctx, ctx->block, block_nb);
  288. #ifdef UNROLL_LOOPS_SHA512
  289. UNPACK64(ctx->h[0], &digest[ 0]);
  290. UNPACK64(ctx->h[1], &digest[ 8]);
  291. UNPACK64(ctx->h[2], &digest[16]);
  292. UNPACK64(ctx->h[3], &digest[24]);
  293. UNPACK64(ctx->h[4], &digest[32]);
  294. UNPACK64(ctx->h[5], &digest[40]);
  295. UNPACK64(ctx->h[6], &digest[48]);
  296. UNPACK64(ctx->h[7], &digest[56]);
  297. #else
  298. for (i = 0 ; i < 8; i++)
  299. UNPACK64(ctx->h[i], &digest[i << 3]);
  300. #endif /* UNROLL_LOOPS_SHA512 */
  301. }