You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 

178 lines
5.5 KiB

  1. /* Copyright (c) 2011 Stanford University.
  2. * Copyright (c) 2014 Cryptography Research, Inc.
  3. * Released under the MIT License. See LICENSE.txt for license information.
  4. */
  5. #include "word.h"
  6. #include "sha512.h"
  7. #include <string.h>
  8. #include <assert.h>
  9. static inline uint64_t
  10. rotate_r (
  11. uint64_t x,
  12. int d
  13. ) {
  14. return (x >> d) | (x << (64-d));
  15. }
  16. static const uint64_t
  17. sha512_init_state[8] = {
  18. 0x6a09e667f3bcc908, 0xbb67ae8584caa73b, 0x3c6ef372fe94f82b, 0xa54ff53a5f1d36f1,
  19. 0x510e527fade682d1, 0x9b05688c2b3e6c1f, 0x1f83d9abfb41bd6b, 0x5be0cd19137e2179
  20. };
  21. static const uint64_t
  22. sha512_k[80] = {
  23. 0x428a2f98d728ae22, 0x7137449123ef65cd, 0xb5c0fbcfec4d3b2f, 0xe9b5dba58189dbbc,
  24. 0x3956c25bf348b538, 0x59f111f1b605d019, 0x923f82a4af194f9b, 0xab1c5ed5da6d8118,
  25. 0xd807aa98a3030242, 0x12835b0145706fbe, 0x243185be4ee4b28c, 0x550c7dc3d5ffb4e2,
  26. 0x72be5d74f27b896f, 0x80deb1fe3b1696b1, 0x9bdc06a725c71235, 0xc19bf174cf692694,
  27. 0xe49b69c19ef14ad2, 0xefbe4786384f25e3, 0x0fc19dc68b8cd5b5, 0x240ca1cc77ac9c65,
  28. 0x2de92c6f592b0275, 0x4a7484aa6ea6e483, 0x5cb0a9dcbd41fbd4, 0x76f988da831153b5,
  29. 0x983e5152ee66dfab, 0xa831c66d2db43210, 0xb00327c898fb213f, 0xbf597fc7beef0ee4,
  30. 0xc6e00bf33da88fc2, 0xd5a79147930aa725, 0x06ca6351e003826f, 0x142929670a0e6e70,
  31. 0x27b70a8546d22ffc, 0x2e1b21385c26c926, 0x4d2c6dfc5ac42aed, 0x53380d139d95b3df,
  32. 0x650a73548baf63de, 0x766a0abb3c77b2a8, 0x81c2c92e47edaee6, 0x92722c851482353b,
  33. 0xa2bfe8a14cf10364, 0xa81a664bbc423001, 0xc24b8b70d0f89791, 0xc76c51a30654be30,
  34. 0xd192e819d6ef5218, 0xd69906245565a910, 0xf40e35855771202a, 0x106aa07032bbd1b8,
  35. 0x19a4c116b8d2d0c8, 0x1e376c085141ab53, 0x2748774cdf8eeb99, 0x34b0bcb5e19b48a8,
  36. 0x391c0cb3c5c95a63, 0x4ed8aa4ae3418acb, 0x5b9cca4f7763e373, 0x682e6ff3d6b2b8a3,
  37. 0x748f82ee5defb2fc, 0x78a5636f43172f60, 0x84c87814a1f0ab72, 0x8cc702081a6439ec,
  38. 0x90befffa23631e28, 0xa4506cebde82bde9, 0xbef9a3f7b2c67915, 0xc67178f2e372532b,
  39. 0xca273eceea26619c, 0xd186b8c721c0c207, 0xeada7dd6cde0eb1e, 0xf57d4f7fee6ed178,
  40. 0x06f067aa72176fba, 0x0a637dc5a2c898a6, 0x113f9804bef90dae, 0x1b710b35131c471b,
  41. 0x28db77f523047d84, 0x32caab7b40c72493, 0x3c9ebe0a15c9bebc, 0x431d67c49c100d4c,
  42. 0x4cc5d4becb3e42b6, 0x597f299cfc657e2a, 0x5fcb6fab3ad6faec, 0x6c44198c4a475817
  43. };
  44. static inline uint64_t S0 (uint64_t h1) {
  45. return rotate_r(h1, 28) ^ rotate_r(h1, 34) ^ rotate_r(h1, 39);
  46. }
  47. static inline uint64_t S1 (uint64_t h4) {
  48. return rotate_r(h4,14) ^ rotate_r(h4,18) ^ rotate_r(h4,41);
  49. }
  50. static inline uint64_t s0 (uint64_t a) {
  51. return rotate_r(a,1) ^ rotate_r(a,8) ^ a>>7;
  52. }
  53. static inline uint64_t s1 (uint64_t b) {
  54. return rotate_r(b,19) ^ rotate_r(b,61) ^ b>>6;
  55. }
  56. static inline uint64_t ch (uint64_t h4, uint64_t h5, uint64_t h6) {
  57. return h6^(h4 & (h6^h5));
  58. }
  59. static inline uint64_t maj(uint64_t h1, uint64_t h2, uint64_t h3) {
  60. return (h1&h2) ^ (h3&(h1^h2));
  61. }
  62. static void
  63. sha512_process_block (
  64. struct sha512_ctx_t *ctx
  65. ) {
  66. uint64_t i, tmp, a, b,
  67. *w = (uint64_t *) ctx->block,
  68. *state = ctx->chain,
  69. h0 = state[0], h1 = state[1], h2 = state[2], h3 = state[3],
  70. h4 = state[4], h5 = state[5], h6 = state[6], h7 = state[7];
  71. /* Clang doesn't unswitch this automatically */
  72. for (i=0; i<16; i++) {
  73. /* load up the input word for this round */
  74. tmp = w[i] = htobe64(w[i]);
  75. tmp = tmp + h7 + S1(h4) + ch(h4,h5,h6) + sha512_k[i];
  76. /* shift register */
  77. h7 = h6; h6 = h5; h5 = h4;
  78. h4 = h3 + tmp;
  79. h3 = h2; h2 = h1; h1 = h0;
  80. h0 = tmp + maj(h1,h2,h3) + S0(h1);
  81. }
  82. for (; i<80; i++) {
  83. /* load up the input word for this round */
  84. a = w[(i+1 ) & 15];
  85. b = w[(i+14) & 15];
  86. tmp = w[i&15] = s0(a) + s1(b) + w[i&15] + w[(i+9) & 15];
  87. tmp = tmp + h7 + S1(h4) + ch(h4,h5,h6) + sha512_k[i];
  88. /* shift register */
  89. h7 = h6; h6 = h5; h5 = h4;
  90. h4 = h3 + tmp;
  91. h3 = h2; h2 = h1; h1 = h0;
  92. h0 = tmp + maj(h1,h2,h3) + S0(h1);
  93. }
  94. state[0] += h0;
  95. state[1] += h1;
  96. state[2] += h2;
  97. state[3] += h3;
  98. state[4] += h4;
  99. state[5] += h5;
  100. state[6] += h6;
  101. state[7] += h7;
  102. }
  103. void
  104. sha512_init (
  105. struct sha512_ctx_t *ctx
  106. ) {
  107. ctx->nbytes = 0;
  108. memcpy(ctx->chain, sha512_init_state, sizeof(sha512_init_state));
  109. memset(ctx->block, 0, sizeof(ctx->block));
  110. }
  111. void
  112. sha512_update (
  113. struct sha512_ctx_t *ctx,
  114. const unsigned char *data,
  115. uint64_t bytes
  116. ) {
  117. assert(ctx->nbytes < 1ull<<56);
  118. assert(bytes < 1ull<<56);
  119. while (bytes) {
  120. uint64_t fill = ctx->nbytes % 128, accept = 128 - fill;
  121. if (accept > bytes) accept = bytes;
  122. ctx->nbytes += accept;
  123. memcpy(ctx->block + fill, data, accept);
  124. if (fill+accept == 128)
  125. sha512_process_block(ctx);
  126. bytes -= accept;
  127. data += accept;
  128. }
  129. assert(ctx->nbytes < 1ull<<56);
  130. }
  131. void
  132. sha512_final (
  133. struct sha512_ctx_t *ctx,
  134. uint8_t result[64]
  135. ) {
  136. uint64_t fill = ctx->nbytes % 128, i;
  137. ctx->block[fill++] = 0x80;
  138. if (fill > 112) {
  139. memset(ctx->block + fill, 0, 128-fill);
  140. sha512_process_block(ctx);
  141. fill = 0;
  142. }
  143. memset(ctx->block + fill, 0, 112-fill);
  144. uint64_t highCount = 0, lowCount = htobe64((ctx->nbytes * 8));
  145. memcpy(&ctx->block[112],&highCount,8);
  146. memcpy(&ctx->block[120],&lowCount,8);
  147. sha512_process_block(ctx);
  148. for (i=0; i<8; i++) {
  149. ctx->chain[i] = htobe64(ctx->chain[i]);
  150. }
  151. memcpy(result, ctx->chain, sizeof(ctx->chain));
  152. sha512_init(ctx);
  153. }