sha2big.c 8.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247
  1. /* $Id: sha2big.c 216 2010-06-08 09:46:57Z tp $ */
  2. /*
  3. * SHA-384 / SHA-512 implementation.
  4. *
  5. * ==========================(LICENSE BEGIN)============================
  6. *
  7. * Copyright (c) 2007-2010 Projet RNRT SAPHIR
  8. *
  9. * Permission is hereby granted, free of charge, to any person obtaining
  10. * a copy of this software and associated documentation files (the
  11. * "Software"), to deal in the Software without restriction, including
  12. * without limitation the rights to use, copy, modify, merge, publish,
  13. * distribute, sublicense, and/or sell copies of the Software, and to
  14. * permit persons to whom the Software is furnished to do so, subject to
  15. * the following conditions:
  16. *
  17. * The above copyright notice and this permission notice shall be
  18. * included in all copies or substantial portions of the Software.
  19. *
  20. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  21. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  22. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
  23. * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
  24. * CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
  25. * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
  26. * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
  27. *
  28. * ===========================(LICENSE END)=============================
  29. *
  30. * @author Thomas Pornin <thomas.pornin@cryptolog.com>
  31. */
  32. #include <stddef.h>
  33. #include <string.h>
  34. #include "sph_sha2.h"
  35. #if SPH_64
  36. #define CH(X, Y, Z) ((((Y) ^ (Z)) & (X)) ^ (Z))
  37. #define MAJ(X, Y, Z) (((X) & (Y)) | (((X) | (Y)) & (Z)))
  38. #define ROTR64 SPH_ROTR64
  39. #define BSG5_0(x) (ROTR64(x, 28) ^ ROTR64(x, 34) ^ ROTR64(x, 39))
  40. #define BSG5_1(x) (ROTR64(x, 14) ^ ROTR64(x, 18) ^ ROTR64(x, 41))
  41. #define SSG5_0(x) (ROTR64(x, 1) ^ ROTR64(x, 8) ^ SPH_T64((x) >> 7))
  42. #define SSG5_1(x) (ROTR64(x, 19) ^ ROTR64(x, 61) ^ SPH_T64((x) >> 6))
  43. static const sph_u64 K512[80] = {
  44. SPH_C64(0x428A2F98D728AE22), SPH_C64(0x7137449123EF65CD),
  45. SPH_C64(0xB5C0FBCFEC4D3B2F), SPH_C64(0xE9B5DBA58189DBBC),
  46. SPH_C64(0x3956C25BF348B538), SPH_C64(0x59F111F1B605D019),
  47. SPH_C64(0x923F82A4AF194F9B), SPH_C64(0xAB1C5ED5DA6D8118),
  48. SPH_C64(0xD807AA98A3030242), SPH_C64(0x12835B0145706FBE),
  49. SPH_C64(0x243185BE4EE4B28C), SPH_C64(0x550C7DC3D5FFB4E2),
  50. SPH_C64(0x72BE5D74F27B896F), SPH_C64(0x80DEB1FE3B1696B1),
  51. SPH_C64(0x9BDC06A725C71235), SPH_C64(0xC19BF174CF692694),
  52. SPH_C64(0xE49B69C19EF14AD2), SPH_C64(0xEFBE4786384F25E3),
  53. SPH_C64(0x0FC19DC68B8CD5B5), SPH_C64(0x240CA1CC77AC9C65),
  54. SPH_C64(0x2DE92C6F592B0275), SPH_C64(0x4A7484AA6EA6E483),
  55. SPH_C64(0x5CB0A9DCBD41FBD4), SPH_C64(0x76F988DA831153B5),
  56. SPH_C64(0x983E5152EE66DFAB), SPH_C64(0xA831C66D2DB43210),
  57. SPH_C64(0xB00327C898FB213F), SPH_C64(0xBF597FC7BEEF0EE4),
  58. SPH_C64(0xC6E00BF33DA88FC2), SPH_C64(0xD5A79147930AA725),
  59. SPH_C64(0x06CA6351E003826F), SPH_C64(0x142929670A0E6E70),
  60. SPH_C64(0x27B70A8546D22FFC), SPH_C64(0x2E1B21385C26C926),
  61. SPH_C64(0x4D2C6DFC5AC42AED), SPH_C64(0x53380D139D95B3DF),
  62. SPH_C64(0x650A73548BAF63DE), SPH_C64(0x766A0ABB3C77B2A8),
  63. SPH_C64(0x81C2C92E47EDAEE6), SPH_C64(0x92722C851482353B),
  64. SPH_C64(0xA2BFE8A14CF10364), SPH_C64(0xA81A664BBC423001),
  65. SPH_C64(0xC24B8B70D0F89791), SPH_C64(0xC76C51A30654BE30),
  66. SPH_C64(0xD192E819D6EF5218), SPH_C64(0xD69906245565A910),
  67. SPH_C64(0xF40E35855771202A), SPH_C64(0x106AA07032BBD1B8),
  68. SPH_C64(0x19A4C116B8D2D0C8), SPH_C64(0x1E376C085141AB53),
  69. SPH_C64(0x2748774CDF8EEB99), SPH_C64(0x34B0BCB5E19B48A8),
  70. SPH_C64(0x391C0CB3C5C95A63), SPH_C64(0x4ED8AA4AE3418ACB),
  71. SPH_C64(0x5B9CCA4F7763E373), SPH_C64(0x682E6FF3D6B2B8A3),
  72. SPH_C64(0x748F82EE5DEFB2FC), SPH_C64(0x78A5636F43172F60),
  73. SPH_C64(0x84C87814A1F0AB72), SPH_C64(0x8CC702081A6439EC),
  74. SPH_C64(0x90BEFFFA23631E28), SPH_C64(0xA4506CEBDE82BDE9),
  75. SPH_C64(0xBEF9A3F7B2C67915), SPH_C64(0xC67178F2E372532B),
  76. SPH_C64(0xCA273ECEEA26619C), SPH_C64(0xD186B8C721C0C207),
  77. SPH_C64(0xEADA7DD6CDE0EB1E), SPH_C64(0xF57D4F7FEE6ED178),
  78. SPH_C64(0x06F067AA72176FBA), SPH_C64(0x0A637DC5A2C898A6),
  79. SPH_C64(0x113F9804BEF90DAE), SPH_C64(0x1B710B35131C471B),
  80. SPH_C64(0x28DB77F523047D84), SPH_C64(0x32CAAB7B40C72493),
  81. SPH_C64(0x3C9EBE0A15C9BEBC), SPH_C64(0x431D67C49C100D4C),
  82. SPH_C64(0x4CC5D4BECB3E42B6), SPH_C64(0x597F299CFC657E2A),
  83. SPH_C64(0x5FCB6FAB3AD6FAEC), SPH_C64(0x6C44198C4A475817)
  84. };
  85. static const sph_u64 H384[8] = {
  86. SPH_C64(0xCBBB9D5DC1059ED8), SPH_C64(0x629A292A367CD507),
  87. SPH_C64(0x9159015A3070DD17), SPH_C64(0x152FECD8F70E5939),
  88. SPH_C64(0x67332667FFC00B31), SPH_C64(0x8EB44A8768581511),
  89. SPH_C64(0xDB0C2E0D64F98FA7), SPH_C64(0x47B5481DBEFA4FA4)
  90. };
  91. static const sph_u64 H512[8] = {
  92. SPH_C64(0x6A09E667F3BCC908), SPH_C64(0xBB67AE8584CAA73B),
  93. SPH_C64(0x3C6EF372FE94F82B), SPH_C64(0xA54FF53A5F1D36F1),
  94. SPH_C64(0x510E527FADE682D1), SPH_C64(0x9B05688C2B3E6C1F),
  95. SPH_C64(0x1F83D9ABFB41BD6B), SPH_C64(0x5BE0CD19137E2179)
  96. };
  97. /*
  98. * This macro defines the body for a SHA-384 / SHA-512 compression function
  99. * implementation. The "in" parameter should evaluate, when applied to a
  100. * numerical input parameter from 0 to 15, to an expression which yields
  101. * the corresponding input block. The "r" parameter should evaluate to
  102. * an array or pointer expression designating the array of 8 words which
  103. * contains the input and output of the compression function.
  104. *
  105. * SHA-512 is hard for the compiler. If the loop is completely unrolled,
  106. * then the code will be quite huge (possibly more than 100 kB), and the
  107. * performance will be degraded due to cache misses on the code. We
  108. * unroll only eight steps, which avoids all needless copies when
  109. * 64-bit registers are swapped.
  110. */
  111. #define SHA3_STEP(A, B, C, D, E, F, G, H, i) do { \
  112. sph_u64 T1, T2; \
  113. T1 = SPH_T64(H + BSG5_1(E) + CH(E, F, G) + K512[i] + W[i]); \
  114. T2 = SPH_T64(BSG5_0(A) + MAJ(A, B, C)); \
  115. D = SPH_T64(D + T1); \
  116. H = SPH_T64(T1 + T2); \
  117. } while (0)
  118. #define SHA3_ROUND_BODY(in, r) do { \
  119. int i; \
  120. sph_u64 A, B, C, D, E, F, G, H; \
  121. sph_u64 W[80]; \
  122. \
  123. for (i = 0; i < 16; i ++) \
  124. W[i] = in(i); \
  125. for (i = 16; i < 80; i ++) \
  126. W[i] = SPH_T64(SSG5_1(W[i - 2]) + W[i - 7] \
  127. + SSG5_0(W[i - 15]) + W[i - 16]); \
  128. A = (r)[0]; \
  129. B = (r)[1]; \
  130. C = (r)[2]; \
  131. D = (r)[3]; \
  132. E = (r)[4]; \
  133. F = (r)[5]; \
  134. G = (r)[6]; \
  135. H = (r)[7]; \
  136. for (i = 0; i < 80; i += 8) { \
  137. SHA3_STEP(A, B, C, D, E, F, G, H, i + 0); \
  138. SHA3_STEP(H, A, B, C, D, E, F, G, i + 1); \
  139. SHA3_STEP(G, H, A, B, C, D, E, F, i + 2); \
  140. SHA3_STEP(F, G, H, A, B, C, D, E, i + 3); \
  141. SHA3_STEP(E, F, G, H, A, B, C, D, i + 4); \
  142. SHA3_STEP(D, E, F, G, H, A, B, C, i + 5); \
  143. SHA3_STEP(C, D, E, F, G, H, A, B, i + 6); \
  144. SHA3_STEP(B, C, D, E, F, G, H, A, i + 7); \
  145. } \
  146. (r)[0] = SPH_T64((r)[0] + A); \
  147. (r)[1] = SPH_T64((r)[1] + B); \
  148. (r)[2] = SPH_T64((r)[2] + C); \
  149. (r)[3] = SPH_T64((r)[3] + D); \
  150. (r)[4] = SPH_T64((r)[4] + E); \
  151. (r)[5] = SPH_T64((r)[5] + F); \
  152. (r)[6] = SPH_T64((r)[6] + G); \
  153. (r)[7] = SPH_T64((r)[7] + H); \
  154. } while (0)
  155. /*
  156. * One round of SHA-384 / SHA-512. The data must be aligned for 64-bit access.
  157. */
  158. static void
  159. sha3_round(const unsigned char *data, sph_u64 r[8])
  160. {
  161. #define SHA3_IN(x) sph_dec64be_aligned(data + (8 * (x)))
  162. SHA3_ROUND_BODY(SHA3_IN, r);
  163. #undef SHA3_IN
  164. }
  165. /* see sph_sha3.h */
  166. void
  167. sph_sha384_init(void *cc)
  168. {
  169. sph_sha384_context *sc;
  170. sc = cc;
  171. memcpy(sc->val, H384, sizeof H384);
  172. sc->count = 0;
  173. }
  174. /* see sph_sha3.h */
  175. void
  176. sph_sha512_init(void *cc)
  177. {
  178. sph_sha512_context *sc;
  179. sc = cc;
  180. memcpy(sc->val, H512, sizeof H512);
  181. sc->count = 0;
  182. }
  183. #define RFUN sha3_round
  184. #define HASH sha384
  185. #define BE64 1
  186. #include "md_helper.i"
  187. /* see sph_sha3.h */
  188. void
  189. sph_sha384_close(void *cc, void *dst)
  190. {
  191. sha384_close(cc, dst, 6);
  192. sph_sha384_init(cc);
  193. }
  194. /* see sph_sha3.h */
  195. void
  196. sph_sha384_addbits_and_close(void *cc, unsigned ub, unsigned n, void *dst)
  197. {
  198. sha384_addbits_and_close(cc, ub, n, dst, 6);
  199. sph_sha384_init(cc);
  200. }
  201. /* see sph_sha3.h */
  202. void
  203. sph_sha512_close(void *cc, void *dst)
  204. {
  205. sha384_close(cc, dst, 8);
  206. sph_sha512_init(cc);
  207. }
  208. /* see sph_sha3.h */
  209. void
  210. sph_sha512_addbits_and_close(void *cc, unsigned ub, unsigned n, void *dst)
  211. {
  212. sha384_addbits_and_close(cc, ub, n, dst, 8);
  213. sph_sha512_init(cc);
  214. }
  215. /* see sph_sha3.h */
  216. void
  217. sph_sha384_comp(const sph_u64 msg[16], sph_u64 val[8])
  218. {
  219. #define SHA3_IN(x) msg[x]
  220. SHA3_ROUND_BODY(SHA3_IN, val);
  221. #undef SHA3_IN
  222. }
  223. #endif