sha2.c 6.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218
  1. /*
  2. * FIPS 180-2 SHA-224/256/384/512 implementation
  3. * Last update: 02/02/2007
  4. * Issue date: 04/30/2005
  5. *
  6. * Copyright 2013 Con Kolivas
  7. * Copyright 2005 2007 Olivier Gay
  8. * All rights reserved.
  9. *
  10. * Redistribution and use in source and binary forms, with or without
  11. * modification, are permitted provided that the following conditions
  12. * are met:
  13. * 1. Redistributions of source code must retain the above copyright
  14. * notice, this list of conditions and the following disclaimer.
  15. * 2. Redistributions in binary form must reproduce the above copyright
  16. * notice, this list of conditions and the following disclaimer in the
  17. * documentation and/or other materials provided with the distribution.
  18. * 3. Neither the name of the project nor the names of its contributors
  19. * may be used to endorse or promote products derived from this software
  20. * without specific prior written permission.
  21. *
  22. * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
  23. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  24. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  25. * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
  26. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  27. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  28. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  29. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  30. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  31. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  32. * SUCH DAMAGE.
  33. */
  34. #include <string.h>
  35. #include "sha2.h"
  36. #define SHFR(x, n) (x >> n)
  37. #define ROTR(x, n) ((x >> n) | (x << ((sizeof(x) << 3) - n)))
  38. #define CH(x, y, z) ((x & y) ^ (~x & z))
  39. #define MAJ(x, y, z) ((x & y) ^ (x & z) ^ (y & z))
  40. #define SHA256_F1(x) (ROTR(x, 2) ^ ROTR(x, 13) ^ ROTR(x, 22))
  41. #define SHA256_F2(x) (ROTR(x, 6) ^ ROTR(x, 11) ^ ROTR(x, 25))
  42. #define SHA256_F3(x) (ROTR(x, 7) ^ ROTR(x, 18) ^ SHFR(x, 3))
  43. #define SHA256_F4(x) (ROTR(x, 17) ^ ROTR(x, 19) ^ SHFR(x, 10))
  44. #define UNPACK32(x, str) \
  45. { \
  46. *((str) + 3) = (uint8_t) ((x) ); \
  47. *((str) + 2) = (uint8_t) ((x) >> 8); \
  48. *((str) + 1) = (uint8_t) ((x) >> 16); \
  49. *((str) + 0) = (uint8_t) ((x) >> 24); \
  50. }
  51. #define PACK32(str, x) \
  52. { \
  53. *(x) = ((uint32_t) *((str) + 3) ) \
  54. | ((uint32_t) *((str) + 2) << 8) \
  55. | ((uint32_t) *((str) + 1) << 16) \
  56. | ((uint32_t) *((str) + 0) << 24); \
  57. }
  58. #define SHA256_SCR(i) \
  59. { \
  60. w[i] = SHA256_F4(w[i - 2]) + w[i - 7] \
  61. + SHA256_F3(w[i - 15]) + w[i - 16]; \
  62. }
  63. uint32_t sha256_h0[8] =
  64. {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a,
  65. 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
  66. uint32_t sha256_k[64] =
  67. {0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5,
  68. 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
  69. 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,
  70. 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
  71. 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc,
  72. 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
  73. 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7,
  74. 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
  75. 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,
  76. 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
  77. 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3,
  78. 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
  79. 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5,
  80. 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
  81. 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,
  82. 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2};
  83. /* SHA-256 functions */
  84. void sha256_transf(sha256_ctx *ctx, const unsigned char *message,
  85. unsigned int block_nb)
  86. {
  87. uint32_t w[64];
  88. uint32_t wv[8];
  89. uint32_t t1, t2;
  90. const unsigned char *sub_block;
  91. int i;
  92. int j;
  93. for (i = 0; i < (int) block_nb; i++) {
  94. sub_block = message + (i << 6);
  95. for (j = 0; j < 16; j++) {
  96. PACK32(&sub_block[j << 2], &w[j]);
  97. }
  98. for (j = 16; j < 64; j++) {
  99. SHA256_SCR(j);
  100. }
  101. for (j = 0; j < 8; j++) {
  102. wv[j] = ctx->h[j];
  103. }
  104. for (j = 0; j < 64; j++) {
  105. t1 = wv[7] + SHA256_F2(wv[4]) + CH(wv[4], wv[5], wv[6])
  106. + sha256_k[j] + w[j];
  107. t2 = SHA256_F1(wv[0]) + MAJ(wv[0], wv[1], wv[2]);
  108. wv[7] = wv[6];
  109. wv[6] = wv[5];
  110. wv[5] = wv[4];
  111. wv[4] = wv[3] + t1;
  112. wv[3] = wv[2];
  113. wv[2] = wv[1];
  114. wv[1] = wv[0];
  115. wv[0] = t1 + t2;
  116. }
  117. for (j = 0; j < 8; j++) {
  118. ctx->h[j] += wv[j];
  119. }
  120. }
  121. }
  122. void sha256(const unsigned char *message, unsigned int len, unsigned char *digest)
  123. {
  124. sha256_ctx ctx;
  125. sha256_init(&ctx);
  126. sha256_update(&ctx, message, len);
  127. sha256_final(&ctx, digest);
  128. }
  129. void sha256_init(sha256_ctx *ctx)
  130. {
  131. int i;
  132. for (i = 0; i < 8; i++) {
  133. ctx->h[i] = sha256_h0[i];
  134. }
  135. ctx->len = 0;
  136. ctx->tot_len = 0;
  137. }
  138. void sha256_update(sha256_ctx *ctx, const unsigned char *message,
  139. unsigned int len)
  140. {
  141. unsigned int block_nb;
  142. unsigned int new_len, rem_len, tmp_len;
  143. const unsigned char *shifted_message;
  144. tmp_len = SHA256_BLOCK_SIZE - ctx->len;
  145. rem_len = len < tmp_len ? len : tmp_len;
  146. memcpy(&ctx->block[ctx->len], message, rem_len);
  147. if (ctx->len + len < SHA256_BLOCK_SIZE) {
  148. ctx->len += len;
  149. return;
  150. }
  151. new_len = len - rem_len;
  152. block_nb = new_len / SHA256_BLOCK_SIZE;
  153. shifted_message = message + rem_len;
  154. sha256_transf(ctx, ctx->block, 1);
  155. sha256_transf(ctx, shifted_message, block_nb);
  156. rem_len = new_len % SHA256_BLOCK_SIZE;
  157. memcpy(ctx->block, &shifted_message[block_nb << 6],
  158. rem_len);
  159. ctx->len = rem_len;
  160. ctx->tot_len += (block_nb + 1) << 6;
  161. }
  162. void sha256_final(sha256_ctx *ctx, unsigned char *digest)
  163. {
  164. unsigned int block_nb;
  165. unsigned int pm_len;
  166. unsigned int len_b;
  167. int i;
  168. block_nb = (1 + ((SHA256_BLOCK_SIZE - 9)
  169. < (ctx->len % SHA256_BLOCK_SIZE)));
  170. len_b = (ctx->tot_len + ctx->len) << 3;
  171. pm_len = block_nb << 6;
  172. memset(ctx->block + ctx->len, 0, pm_len - ctx->len);
  173. ctx->block[ctx->len] = 0x80;
  174. UNPACK32(len_b, ctx->block + pm_len - 4);
  175. sha256_transf(ctx, ctx->block, block_nb);
  176. for (i = 0 ; i < 8; i++) {
  177. UNPACK32(ctx->h[i], &digest[i << 2]);
  178. }
  179. }