sha512.c 8.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238
  1. /* Functions to compute SHA512 message digest of files or memory blocks.
  2. according to the definition of SHA512 in FIPS 180-2.
  3. Copyright (C) 2007-2019 Free Software Foundation, Inc.
  4. This file is part of the GNU C Library.
  5. The GNU C Library is free software; you can redistribute it and/or
  6. modify it under the terms of the GNU Lesser General Public
  7. License as published by the Free Software Foundation; either
  8. version 2.1 of the License, or (at your option) any later version.
  9. The GNU C Library is distributed in the hope that it will be useful,
  10. but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  12. Lesser General Public License for more details.
  13. You should have received a copy of the GNU Lesser General Public
  14. License along with the GNU C Library; if not, see
  15. <http://www.gnu.org/licenses/>. */
  16. /* Written by Ulrich Drepper <drepper@redhat.com>, 2007. */
  17. #ifdef HAVE_CONFIG_H
  18. # include <config.h>
  19. #endif
  20. #include <endian.h>
  21. #include <stdlib.h>
  22. #include <string.h>
  23. #include <stdint.h>
  24. #include <sys/types.h>
  25. #include "sha512.h"
  26. #if __BYTE_ORDER == __LITTLE_ENDIAN
  27. # ifdef _LIBC
  28. # include <byteswap.h>
  29. # define SWAP(n) bswap_64 (n)
  30. # else
  31. # define SWAP(n) \
  32. (((n) << 56) \
  33. | (((n) & 0xff00) << 40) \
  34. | (((n) & 0xff0000) << 24) \
  35. | (((n) & 0xff000000) << 8) \
  36. | (((n) >> 8) & 0xff000000) \
  37. | (((n) >> 24) & 0xff0000) \
  38. | (((n) >> 40) & 0xff00) \
  39. | ((n) >> 56))
  40. # endif
  41. #else
  42. # define SWAP(n) (n)
  43. #endif
  44. /* This array contains the bytes used to pad the buffer to the next
  45. 64-byte boundary. (FIPS 180-2:5.1.2) */
  46. static const unsigned char fillbuf[128] = { 0x80, 0 /* , 0, 0, ... */ };
  47. /* Constants for SHA512 from FIPS 180-2:4.2.3. */
  48. static const uint64_t K[80] =
  49. {
  50. UINT64_C (0x428a2f98d728ae22), UINT64_C (0x7137449123ef65cd),
  51. UINT64_C (0xb5c0fbcfec4d3b2f), UINT64_C (0xe9b5dba58189dbbc),
  52. UINT64_C (0x3956c25bf348b538), UINT64_C (0x59f111f1b605d019),
  53. UINT64_C (0x923f82a4af194f9b), UINT64_C (0xab1c5ed5da6d8118),
  54. UINT64_C (0xd807aa98a3030242), UINT64_C (0x12835b0145706fbe),
  55. UINT64_C (0x243185be4ee4b28c), UINT64_C (0x550c7dc3d5ffb4e2),
  56. UINT64_C (0x72be5d74f27b896f), UINT64_C (0x80deb1fe3b1696b1),
  57. UINT64_C (0x9bdc06a725c71235), UINT64_C (0xc19bf174cf692694),
  58. UINT64_C (0xe49b69c19ef14ad2), UINT64_C (0xefbe4786384f25e3),
  59. UINT64_C (0x0fc19dc68b8cd5b5), UINT64_C (0x240ca1cc77ac9c65),
  60. UINT64_C (0x2de92c6f592b0275), UINT64_C (0x4a7484aa6ea6e483),
  61. UINT64_C (0x5cb0a9dcbd41fbd4), UINT64_C (0x76f988da831153b5),
  62. UINT64_C (0x983e5152ee66dfab), UINT64_C (0xa831c66d2db43210),
  63. UINT64_C (0xb00327c898fb213f), UINT64_C (0xbf597fc7beef0ee4),
  64. UINT64_C (0xc6e00bf33da88fc2), UINT64_C (0xd5a79147930aa725),
  65. UINT64_C (0x06ca6351e003826f), UINT64_C (0x142929670a0e6e70),
  66. UINT64_C (0x27b70a8546d22ffc), UINT64_C (0x2e1b21385c26c926),
  67. UINT64_C (0x4d2c6dfc5ac42aed), UINT64_C (0x53380d139d95b3df),
  68. UINT64_C (0x650a73548baf63de), UINT64_C (0x766a0abb3c77b2a8),
  69. UINT64_C (0x81c2c92e47edaee6), UINT64_C (0x92722c851482353b),
  70. UINT64_C (0xa2bfe8a14cf10364), UINT64_C (0xa81a664bbc423001),
  71. UINT64_C (0xc24b8b70d0f89791), UINT64_C (0xc76c51a30654be30),
  72. UINT64_C (0xd192e819d6ef5218), UINT64_C (0xd69906245565a910),
  73. UINT64_C (0xf40e35855771202a), UINT64_C (0x106aa07032bbd1b8),
  74. UINT64_C (0x19a4c116b8d2d0c8), UINT64_C (0x1e376c085141ab53),
  75. UINT64_C (0x2748774cdf8eeb99), UINT64_C (0x34b0bcb5e19b48a8),
  76. UINT64_C (0x391c0cb3c5c95a63), UINT64_C (0x4ed8aa4ae3418acb),
  77. UINT64_C (0x5b9cca4f7763e373), UINT64_C (0x682e6ff3d6b2b8a3),
  78. UINT64_C (0x748f82ee5defb2fc), UINT64_C (0x78a5636f43172f60),
  79. UINT64_C (0x84c87814a1f0ab72), UINT64_C (0x8cc702081a6439ec),
  80. UINT64_C (0x90befffa23631e28), UINT64_C (0xa4506cebde82bde9),
  81. UINT64_C (0xbef9a3f7b2c67915), UINT64_C (0xc67178f2e372532b),
  82. UINT64_C (0xca273eceea26619c), UINT64_C (0xd186b8c721c0c207),
  83. UINT64_C (0xeada7dd6cde0eb1e), UINT64_C (0xf57d4f7fee6ed178),
  84. UINT64_C (0x06f067aa72176fba), UINT64_C (0x0a637dc5a2c898a6),
  85. UINT64_C (0x113f9804bef90dae), UINT64_C (0x1b710b35131c471b),
  86. UINT64_C (0x28db77f523047d84), UINT64_C (0x32caab7b40c72493),
  87. UINT64_C (0x3c9ebe0a15c9bebc), UINT64_C (0x431d67c49c100d4c),
  88. UINT64_C (0x4cc5d4becb3e42b6), UINT64_C (0x597f299cfc657e2a),
  89. UINT64_C (0x5fcb6fab3ad6faec), UINT64_C (0x6c44198c4a475817)
  90. };
  91. void __sha512_process_block (const void *buffer, size_t len,
  92. struct sha512_ctx *ctx);
  93. /* Initialize structure containing state of computation.
  94. (FIPS 180-2:5.3.3) */
  95. void
  96. __sha512_init_ctx (struct sha512_ctx *ctx)
  97. {
  98. ctx->H[0] = UINT64_C (0x6a09e667f3bcc908);
  99. ctx->H[1] = UINT64_C (0xbb67ae8584caa73b);
  100. ctx->H[2] = UINT64_C (0x3c6ef372fe94f82b);
  101. ctx->H[3] = UINT64_C (0xa54ff53a5f1d36f1);
  102. ctx->H[4] = UINT64_C (0x510e527fade682d1);
  103. ctx->H[5] = UINT64_C (0x9b05688c2b3e6c1f);
  104. ctx->H[6] = UINT64_C (0x1f83d9abfb41bd6b);
  105. ctx->H[7] = UINT64_C (0x5be0cd19137e2179);
  106. ctx->total[0] = ctx->total[1] = 0;
  107. ctx->buflen = 0;
  108. }
  109. /* Process the remaining bytes in the internal buffer and the usual
  110. prolog according to the standard and write the result to RESBUF.
  111. IMPORTANT: On some systems it is required that RESBUF is correctly
  112. aligned for a 32 bits value. */
  113. void *
  114. __sha512_finish_ctx (struct sha512_ctx *ctx, void *resbuf)
  115. {
  116. /* Take yet unprocessed bytes into account. */
  117. uint64_t bytes = ctx->buflen;
  118. size_t pad;
  119. /* Now count remaining bytes. */
  120. #ifdef USE_TOTAL128
  121. ctx->total128 += bytes;
  122. #else
  123. ctx->total[TOTAL128_low] += bytes;
  124. if (ctx->total[TOTAL128_low] < bytes)
  125. ++ctx->total[TOTAL128_high];
  126. #endif
  127. pad = bytes >= 112 ? 128 + 112 - bytes : 112 - bytes;
  128. memcpy (&ctx->buffer[bytes], fillbuf, pad);
  129. /* Put the 128-bit file length in *bits* at the end of the buffer. */
  130. ctx->buffer64[(bytes + pad + 8) / 8] = SWAP (ctx->total[TOTAL128_low] << 3);
  131. ctx->buffer64[(bytes + pad) / 8] = SWAP ((ctx->total[TOTAL128_high] << 3) |
  132. (ctx->total[TOTAL128_low] >> 61));
  133. /* Process last bytes. */
  134. __sha512_process_block (ctx->buffer, bytes + pad + 16, ctx);
  135. /* Put result from CTX in first 64 bytes following RESBUF. */
  136. for (unsigned int i = 0; i < 8; ++i)
  137. ((uint64_t *) resbuf)[i] = SWAP (ctx->H[i]);
  138. return resbuf;
  139. }
  140. void
  141. __sha512_process_bytes (const void *buffer, size_t len, struct sha512_ctx *ctx)
  142. {
  143. /* When we already have some bits in our internal buffer concatenate
  144. both inputs first. */
  145. if (ctx->buflen != 0)
  146. {
  147. size_t left_over = ctx->buflen;
  148. size_t add = 256 - left_over > len ? len : 256 - left_over;
  149. memcpy (&ctx->buffer[left_over], buffer, add);
  150. ctx->buflen += add;
  151. if (ctx->buflen > 128)
  152. {
  153. __sha512_process_block (ctx->buffer, ctx->buflen & ~127, ctx);
  154. ctx->buflen &= 127;
  155. /* The regions in the following copy operation cannot overlap. */
  156. memcpy (ctx->buffer, &ctx->buffer[(left_over + add) & ~127],
  157. ctx->buflen);
  158. }
  159. buffer = (const char *) buffer + add;
  160. len -= add;
  161. }
  162. /* Process available complete blocks. */
  163. if (len >= 128)
  164. {
  165. #if !_STRING_ARCH_unaligned
  166. /* To check alignment gcc has an appropriate operator. Other
  167. compilers don't. */
  168. # if __GNUC__ >= 2
  169. # define UNALIGNED_P(p) (((uintptr_t) p) % __alignof__ (uint64_t) != 0)
  170. # else
  171. # define UNALIGNED_P(p) (((uintptr_t) p) % sizeof (uint64_t) != 0)
  172. # endif
  173. if (UNALIGNED_P (buffer))
  174. while (len > 128)
  175. {
  176. __sha512_process_block (memcpy (ctx->buffer, buffer, 128), 128,
  177. ctx);
  178. buffer = (const char *) buffer + 128;
  179. len -= 128;
  180. }
  181. else
  182. #endif
  183. {
  184. __sha512_process_block (buffer, len & ~127, ctx);
  185. buffer = (const char *) buffer + (len & ~127);
  186. len &= 127;
  187. }
  188. }
  189. /* Move remaining bytes into internal buffer. */
  190. if (len > 0)
  191. {
  192. size_t left_over = ctx->buflen;
  193. memcpy (&ctx->buffer[left_over], buffer, len);
  194. left_over += len;
  195. if (left_over >= 128)
  196. {
  197. __sha512_process_block (ctx->buffer, 128, ctx);
  198. left_over -= 128;
  199. memcpy (ctx->buffer, &ctx->buffer[128], left_over);
  200. }
  201. ctx->buflen = left_over;
  202. }
  203. }
  204. #include <sha512-block.c>