SHA512.cpp 9.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331
  1. // Code taken from NaCl by D. J. Bernstein and others
  2. // Public domain
  3. /*
  4. 20080913
  5. D. J. Bernstein
  6. Public domain.
  7. */
  8. #include <stdint.h>
  9. #include <stdlib.h>
  10. #include <string.h>
  11. #include "SHA512.hpp"
  12. #include "Utils.hpp"
  13. namespace ZeroTier {
  14. #define uint64 uint64_t
  15. #ifdef ZT_NO_TYPE_PUNNING
  16. static uint64 load_bigendian(const unsigned char *x)
  17. {
  18. return
  19. (uint64) (x[7]) \
  20. | (((uint64) (x[6])) << 8) \
  21. | (((uint64) (x[5])) << 16) \
  22. | (((uint64) (x[4])) << 24) \
  23. | (((uint64) (x[3])) << 32) \
  24. | (((uint64) (x[2])) << 40) \
  25. | (((uint64) (x[1])) << 48) \
  26. | (((uint64) (x[0])) << 56)
  27. ;
  28. }
  29. static void store_bigendian(unsigned char *x,uint64 u)
  30. {
  31. x[7] = u; u >>= 8;
  32. x[6] = u; u >>= 8;
  33. x[5] = u; u >>= 8;
  34. x[4] = u; u >>= 8;
  35. x[3] = u; u >>= 8;
  36. x[2] = u; u >>= 8;
  37. x[1] = u; u >>= 8;
  38. x[0] = u;
  39. }
  40. #else // !ZT_NO_TYPE_PUNNING
  41. #define load_bigendian(x) Utils::ntoh(*((const uint64_t *)(x)))
  42. #define store_bigendian(x,u) (*((uint64_t *)(x)) = Utils::hton((u)))
  43. #endif // ZT_NO_TYPE_PUNNING
  44. #define SHR(x,c) ((x) >> (c))
  45. #define ROTR(x,c) (((x) >> (c)) | ((x) << (64 - (c))))
  46. #define Ch(x,y,z) ((x & y) ^ (~x & z))
  47. #define Maj(x,y,z) ((x & y) ^ (x & z) ^ (y & z))
  48. #define Sigma0(x) (ROTR(x,28) ^ ROTR(x,34) ^ ROTR(x,39))
  49. #define Sigma1(x) (ROTR(x,14) ^ ROTR(x,18) ^ ROTR(x,41))
  50. #define sigma0(x) (ROTR(x, 1) ^ ROTR(x, 8) ^ SHR(x,7))
  51. #define sigma1(x) (ROTR(x,19) ^ ROTR(x,61) ^ SHR(x,6))
  52. #define M(w0,w14,w9,w1) w0 = sigma1(w14) + w9 + sigma0(w1) + w0;
  53. #define EXPAND \
  54. M(w0 ,w14,w9 ,w1 ) \
  55. M(w1 ,w15,w10,w2 ) \
  56. M(w2 ,w0 ,w11,w3 ) \
  57. M(w3 ,w1 ,w12,w4 ) \
  58. M(w4 ,w2 ,w13,w5 ) \
  59. M(w5 ,w3 ,w14,w6 ) \
  60. M(w6 ,w4 ,w15,w7 ) \
  61. M(w7 ,w5 ,w0 ,w8 ) \
  62. M(w8 ,w6 ,w1 ,w9 ) \
  63. M(w9 ,w7 ,w2 ,w10) \
  64. M(w10,w8 ,w3 ,w11) \
  65. M(w11,w9 ,w4 ,w12) \
  66. M(w12,w10,w5 ,w13) \
  67. M(w13,w11,w6 ,w14) \
  68. M(w14,w12,w7 ,w15) \
  69. M(w15,w13,w8 ,w0 )
  70. #define F(w,k) \
  71. T1 = h + Sigma1(e) + Ch(e,f,g) + k + w; \
  72. T2 = Sigma0(a) + Maj(a,b,c); \
  73. h = g; \
  74. g = f; \
  75. f = e; \
  76. e = d + T1; \
  77. d = c; \
  78. c = b; \
  79. b = a; \
  80. a = T1 + T2;
  81. static inline int crypto_hashblocks(unsigned char *statebytes,const unsigned char *in,unsigned long long inlen)
  82. {
  83. uint64 state[8];
  84. uint64 a;
  85. uint64 b;
  86. uint64 c;
  87. uint64 d;
  88. uint64 e;
  89. uint64 f;
  90. uint64 g;
  91. uint64 h;
  92. uint64 T1;
  93. uint64 T2;
  94. a = load_bigendian(statebytes + 0); state[0] = a;
  95. b = load_bigendian(statebytes + 8); state[1] = b;
  96. c = load_bigendian(statebytes + 16); state[2] = c;
  97. d = load_bigendian(statebytes + 24); state[3] = d;
  98. e = load_bigendian(statebytes + 32); state[4] = e;
  99. f = load_bigendian(statebytes + 40); state[5] = f;
  100. g = load_bigendian(statebytes + 48); state[6] = g;
  101. h = load_bigendian(statebytes + 56); state[7] = h;
  102. while (inlen >= 128) {
  103. uint64 w0 = load_bigendian(in + 0);
  104. uint64 w1 = load_bigendian(in + 8);
  105. uint64 w2 = load_bigendian(in + 16);
  106. uint64 w3 = load_bigendian(in + 24);
  107. uint64 w4 = load_bigendian(in + 32);
  108. uint64 w5 = load_bigendian(in + 40);
  109. uint64 w6 = load_bigendian(in + 48);
  110. uint64 w7 = load_bigendian(in + 56);
  111. uint64 w8 = load_bigendian(in + 64);
  112. uint64 w9 = load_bigendian(in + 72);
  113. uint64 w10 = load_bigendian(in + 80);
  114. uint64 w11 = load_bigendian(in + 88);
  115. uint64 w12 = load_bigendian(in + 96);
  116. uint64 w13 = load_bigendian(in + 104);
  117. uint64 w14 = load_bigendian(in + 112);
  118. uint64 w15 = load_bigendian(in + 120);
  119. F(w0 ,0x428a2f98d728ae22ULL)
  120. F(w1 ,0x7137449123ef65cdULL)
  121. F(w2 ,0xb5c0fbcfec4d3b2fULL)
  122. F(w3 ,0xe9b5dba58189dbbcULL)
  123. F(w4 ,0x3956c25bf348b538ULL)
  124. F(w5 ,0x59f111f1b605d019ULL)
  125. F(w6 ,0x923f82a4af194f9bULL)
  126. F(w7 ,0xab1c5ed5da6d8118ULL)
  127. F(w8 ,0xd807aa98a3030242ULL)
  128. F(w9 ,0x12835b0145706fbeULL)
  129. F(w10,0x243185be4ee4b28cULL)
  130. F(w11,0x550c7dc3d5ffb4e2ULL)
  131. F(w12,0x72be5d74f27b896fULL)
  132. F(w13,0x80deb1fe3b1696b1ULL)
  133. F(w14,0x9bdc06a725c71235ULL)
  134. F(w15,0xc19bf174cf692694ULL)
  135. EXPAND
  136. F(w0 ,0xe49b69c19ef14ad2ULL)
  137. F(w1 ,0xefbe4786384f25e3ULL)
  138. F(w2 ,0x0fc19dc68b8cd5b5ULL)
  139. F(w3 ,0x240ca1cc77ac9c65ULL)
  140. F(w4 ,0x2de92c6f592b0275ULL)
  141. F(w5 ,0x4a7484aa6ea6e483ULL)
  142. F(w6 ,0x5cb0a9dcbd41fbd4ULL)
  143. F(w7 ,0x76f988da831153b5ULL)
  144. F(w8 ,0x983e5152ee66dfabULL)
  145. F(w9 ,0xa831c66d2db43210ULL)
  146. F(w10,0xb00327c898fb213fULL)
  147. F(w11,0xbf597fc7beef0ee4ULL)
  148. F(w12,0xc6e00bf33da88fc2ULL)
  149. F(w13,0xd5a79147930aa725ULL)
  150. F(w14,0x06ca6351e003826fULL)
  151. F(w15,0x142929670a0e6e70ULL)
  152. EXPAND
  153. F(w0 ,0x27b70a8546d22ffcULL)
  154. F(w1 ,0x2e1b21385c26c926ULL)
  155. F(w2 ,0x4d2c6dfc5ac42aedULL)
  156. F(w3 ,0x53380d139d95b3dfULL)
  157. F(w4 ,0x650a73548baf63deULL)
  158. F(w5 ,0x766a0abb3c77b2a8ULL)
  159. F(w6 ,0x81c2c92e47edaee6ULL)
  160. F(w7 ,0x92722c851482353bULL)
  161. F(w8 ,0xa2bfe8a14cf10364ULL)
  162. F(w9 ,0xa81a664bbc423001ULL)
  163. F(w10,0xc24b8b70d0f89791ULL)
  164. F(w11,0xc76c51a30654be30ULL)
  165. F(w12,0xd192e819d6ef5218ULL)
  166. F(w13,0xd69906245565a910ULL)
  167. F(w14,0xf40e35855771202aULL)
  168. F(w15,0x106aa07032bbd1b8ULL)
  169. EXPAND
  170. F(w0 ,0x19a4c116b8d2d0c8ULL)
  171. F(w1 ,0x1e376c085141ab53ULL)
  172. F(w2 ,0x2748774cdf8eeb99ULL)
  173. F(w3 ,0x34b0bcb5e19b48a8ULL)
  174. F(w4 ,0x391c0cb3c5c95a63ULL)
  175. F(w5 ,0x4ed8aa4ae3418acbULL)
  176. F(w6 ,0x5b9cca4f7763e373ULL)
  177. F(w7 ,0x682e6ff3d6b2b8a3ULL)
  178. F(w8 ,0x748f82ee5defb2fcULL)
  179. F(w9 ,0x78a5636f43172f60ULL)
  180. F(w10,0x84c87814a1f0ab72ULL)
  181. F(w11,0x8cc702081a6439ecULL)
  182. F(w12,0x90befffa23631e28ULL)
  183. F(w13,0xa4506cebde82bde9ULL)
  184. F(w14,0xbef9a3f7b2c67915ULL)
  185. F(w15,0xc67178f2e372532bULL)
  186. EXPAND
  187. F(w0 ,0xca273eceea26619cULL)
  188. F(w1 ,0xd186b8c721c0c207ULL)
  189. F(w2 ,0xeada7dd6cde0eb1eULL)
  190. F(w3 ,0xf57d4f7fee6ed178ULL)
  191. F(w4 ,0x06f067aa72176fbaULL)
  192. F(w5 ,0x0a637dc5a2c898a6ULL)
  193. F(w6 ,0x113f9804bef90daeULL)
  194. F(w7 ,0x1b710b35131c471bULL)
  195. F(w8 ,0x28db77f523047d84ULL)
  196. F(w9 ,0x32caab7b40c72493ULL)
  197. F(w10,0x3c9ebe0a15c9bebcULL)
  198. F(w11,0x431d67c49c100d4cULL)
  199. F(w12,0x4cc5d4becb3e42b6ULL)
  200. F(w13,0x597f299cfc657e2aULL)
  201. F(w14,0x5fcb6fab3ad6faecULL)
  202. F(w15,0x6c44198c4a475817ULL)
  203. a += state[0];
  204. b += state[1];
  205. c += state[2];
  206. d += state[3];
  207. e += state[4];
  208. f += state[5];
  209. g += state[6];
  210. h += state[7];
  211. state[0] = a;
  212. state[1] = b;
  213. state[2] = c;
  214. state[3] = d;
  215. state[4] = e;
  216. state[5] = f;
  217. state[6] = g;
  218. state[7] = h;
  219. in += 128;
  220. inlen -= 128;
  221. }
  222. store_bigendian(statebytes + 0,state[0]);
  223. store_bigendian(statebytes + 8,state[1]);
  224. store_bigendian(statebytes + 16,state[2]);
  225. store_bigendian(statebytes + 24,state[3]);
  226. store_bigendian(statebytes + 32,state[4]);
  227. store_bigendian(statebytes + 40,state[5]);
  228. store_bigendian(statebytes + 48,state[6]);
  229. store_bigendian(statebytes + 56,state[7]);
  230. return 0;
  231. }
  232. #define blocks crypto_hashblocks
  233. static const unsigned char iv[64] = {
  234. 0x6a,0x09,0xe6,0x67,0xf3,0xbc,0xc9,0x08,
  235. 0xbb,0x67,0xae,0x85,0x84,0xca,0xa7,0x3b,
  236. 0x3c,0x6e,0xf3,0x72,0xfe,0x94,0xf8,0x2b,
  237. 0xa5,0x4f,0xf5,0x3a,0x5f,0x1d,0x36,0xf1,
  238. 0x51,0x0e,0x52,0x7f,0xad,0xe6,0x82,0xd1,
  239. 0x9b,0x05,0x68,0x8c,0x2b,0x3e,0x6c,0x1f,
  240. 0x1f,0x83,0xd9,0xab,0xfb,0x41,0xbd,0x6b,
  241. 0x5b,0xe0,0xcd,0x19,0x13,0x7e,0x21,0x79
  242. };
  243. //////////////////////////////////////////////////////////////////////////////
  244. //////////////////////////////////////////////////////////////////////////////
  245. void SHA512::hash(void *digest,const void *data,unsigned int len)
  246. {
  247. unsigned char h[64];
  248. unsigned char padded[256];
  249. int i;
  250. uint64_t bytes = len;
  251. const unsigned char *in = (const unsigned char *)data;
  252. unsigned int inlen = len;
  253. for (i = 0;i < 64;++i) h[i] = iv[i];
  254. blocks(h,in,inlen);
  255. in += inlen;
  256. inlen &= 127;
  257. in -= inlen;
  258. for (i = 0;i < (int)inlen;++i) padded[i] = in[i];
  259. padded[inlen] = 0x80;
  260. if (inlen < 112) {
  261. for (i = inlen + 1;i < 119;++i) padded[i] = 0;
  262. padded[119] = (unsigned char)((bytes >> 61) & 0xff);
  263. padded[120] = (unsigned char)((bytes >> 53) & 0xff);
  264. padded[121] = (unsigned char)((bytes >> 45) & 0xff);
  265. padded[122] = (unsigned char)((bytes >> 37) & 0xff);
  266. padded[123] = (unsigned char)((bytes >> 29) & 0xff);
  267. padded[124] = (unsigned char)((bytes >> 21) & 0xff);
  268. padded[125] = (unsigned char)((bytes >> 13) & 0xff);
  269. padded[126] = (unsigned char)((bytes >> 5) & 0xff);
  270. padded[127] = (unsigned char)((bytes << 3) & 0xff);
  271. blocks(h,padded,128);
  272. } else {
  273. for (i = inlen + 1;i < 247;++i) padded[i] = 0;
  274. padded[247] = (unsigned char)((bytes >> 61) & 0xff);
  275. padded[248] = (unsigned char)((bytes >> 53) & 0xff);
  276. padded[249] = (unsigned char)((bytes >> 45) & 0xff);
  277. padded[250] = (unsigned char)((bytes >> 37) & 0xff);
  278. padded[251] = (unsigned char)((bytes >> 29) & 0xff);
  279. padded[252] = (unsigned char)((bytes >> 21) & 0xff);
  280. padded[253] = (unsigned char)((bytes >> 13) & 0xff);
  281. padded[254] = (unsigned char)((bytes >> 5) & 0xff);
  282. padded[255] = (unsigned char)((bytes << 3) & 0xff);
  283. blocks(h,padded,256);
  284. }
  285. for (i = 0;i < 64;++i) ((unsigned char *)digest)[i] = h[i];
  286. }
  287. } // namespace ZeroTier