crypt_sha2.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393
  1. /*
  2. This code is based on the code found from 7-Zip, which has a modified
  3. version of the SHA-256 found from Crypto++ <http://www.cryptopp.com/>.
  4. The code was modified a little to fit into liblzma and fitz.
  5. This file has been put into the public domain.
  6. You can do whatever you want with this file.
  7. SHA-384 and SHA-512 were also taken from Crypto++ and adapted for fitz.
  8. */
  9. #include "fitz-internal.h"
  10. static inline int isbigendian(void)
  11. {
  12. static const int one = 1;
  13. return *(char*)&one == 0;
  14. }
  15. static inline unsigned int bswap32(unsigned int num)
  16. {
  17. if (!isbigendian())
  18. {
  19. return ( (((num) << 24))
  20. | (((num) << 8) & 0x00FF0000)
  21. | (((num) >> 8) & 0x0000FF00)
  22. | (((num) >> 24)) );
  23. }
  24. return num;
  25. }
  26. static inline uint64_t bswap64(uint64_t num)
  27. {
  28. if (!isbigendian())
  29. {
  30. return ( (((num) << 56))
  31. | (((num) << 40) & 0x00FF000000000000ULL)
  32. | (((num) << 24) & 0x0000FF0000000000ULL)
  33. | (((num) << 8) & 0x000000FF00000000ULL)
  34. | (((num) >> 8) & 0x00000000FF000000ULL)
  35. | (((num) >> 24) & 0x0000000000FF0000ULL)
  36. | (((num) >> 40) & 0x000000000000FF00ULL)
  37. | (((num) >> 56)) );
  38. }
  39. return num;
  40. }
  41. /* At least on x86, GCC is able to optimize this to a rotate instruction. */
  42. #define rotr(num, amount) ((num) >> (amount) | (num) << (8 * sizeof(num) - (amount)))
  43. #define blk0(i) (W[i] = data[i])
  44. #define blk2(i) (W[i & 15] += s1(W[(i - 2) & 15]) + W[(i - 7) & 15] \
  45. + s0(W[(i - 15) & 15]))
  46. #define Ch(x, y, z) (z ^ (x & (y ^ z)))
  47. #define Maj(x, y, z) ((x & y) | (z & (x | y)))
  48. #define a(i) T[(0 - i) & 7]
  49. #define b(i) T[(1 - i) & 7]
  50. #define c(i) T[(2 - i) & 7]
  51. #define d(i) T[(3 - i) & 7]
  52. #define e(i) T[(4 - i) & 7]
  53. #define f(i) T[(5 - i) & 7]
  54. #define g(i) T[(6 - i) & 7]
  55. #define h(i) T[(7 - i) & 7]
  56. #define R(i) \
  57. h(i) += S1(e(i)) + Ch(e(i), f(i), g(i)) + K[i + j] \
  58. + (j ? blk2(i) : blk0(i)); \
  59. d(i) += h(i); \
  60. h(i) += S0(a(i)) + Maj(a(i), b(i), c(i))
  61. /* For SHA256 */
  62. #define S0(x) (rotr(x, 2) ^ rotr(x, 13) ^ rotr(x, 22))
  63. #define S1(x) (rotr(x, 6) ^ rotr(x, 11) ^ rotr(x, 25))
  64. #define s0(x) (rotr(x, 7) ^ rotr(x, 18) ^ (x >> 3))
  65. #define s1(x) (rotr(x, 17) ^ rotr(x, 19) ^ (x >> 10))
  66. static const unsigned int 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. };
  84. static void
  85. transform256(unsigned int state[8], const unsigned int data_xe[16])
  86. {
  87. const unsigned int *K = SHA256_K;
  88. unsigned int data[16];
  89. unsigned int W[16];
  90. unsigned int T[8];
  91. unsigned int j;
  92. /* ensure big-endian integers */
  93. for (j = 0; j < 16; j++)
  94. data[j] = bswap32(data_xe[j]);
  95. /* Copy state[] to working vars. */
  96. memcpy(T, state, sizeof(T));
  97. /* 64 operations, partially loop unrolled */
  98. for (j = 0; j < 64; j += 16) {
  99. R( 0); R( 1); R( 2); R( 3);
  100. R( 4); R( 5); R( 6); R( 7);
  101. R( 8); R( 9); R(10); R(11);
  102. R(12); R(13); R(14); R(15);
  103. }
  104. /* Add the working vars back into state[]. */
  105. state[0] += a(0);
  106. state[1] += b(0);
  107. state[2] += c(0);
  108. state[3] += d(0);
  109. state[4] += e(0);
  110. state[5] += f(0);
  111. state[6] += g(0);
  112. state[7] += h(0);
  113. }
  114. #undef S0
  115. #undef S1
  116. #undef s0
  117. #undef s1
  118. void fz_sha256_init(fz_sha256 *context)
  119. {
  120. context->count[0] = context->count[1] = 0;
  121. context->state[0] = 0x6A09E667;
  122. context->state[1] = 0xBB67AE85;
  123. context->state[2] = 0x3C6EF372;
  124. context->state[3] = 0xA54FF53A;
  125. context->state[4] = 0x510E527F;
  126. context->state[5] = 0x9B05688C;
  127. context->state[6] = 0x1F83D9AB;
  128. context->state[7] = 0x5BE0CD19;
  129. }
  130. void fz_sha256_update(fz_sha256 *context, const unsigned char *input, unsigned int inlen)
  131. {
  132. /* Copy the input data into a properly aligned temporary buffer.
  133. * This way we can be called with arbitrarily sized buffers
  134. * (no need to be multiple of 64 bytes), and the code works also
  135. * on architectures that don't allow unaligned memory access. */
  136. while (inlen > 0)
  137. {
  138. const unsigned int copy_start = context->count[0] & 0x3F;
  139. unsigned int copy_size = 64 - copy_start;
  140. if (copy_size > inlen)
  141. copy_size = inlen;
  142. memcpy(context->buffer.u8 + copy_start, input, copy_size);
  143. input += copy_size;
  144. inlen -= copy_size;
  145. context->count[0] += copy_size;
  146. /* carry overflow from low to high */
  147. if (context->count[0] < copy_size)
  148. context->count[1]++;
  149. if ((context->count[0] & 0x3F) == 0)
  150. transform256(context->state, context->buffer.u32);
  151. }
  152. }
  153. void fz_sha256_final(fz_sha256 *context, unsigned char digest[32])
  154. {
  155. /* Add padding as described in RFC 3174 (it describes SHA-1 but
  156. * the same padding style is used for SHA-256 too). */
  157. unsigned int j = context->count[0] & 0x3F;
  158. context->buffer.u8[j++] = 0x80;
  159. while (j != 56)
  160. {
  161. if (j == 64)
  162. {
  163. transform256(context->state, context->buffer.u32);
  164. j = 0;
  165. }
  166. context->buffer.u8[j++] = 0x00;
  167. }
  168. /* Convert the message size from bytes to bits. */
  169. context->count[1] = (context->count[1] << 3) + (context->count[0] >> 29);
  170. context->count[0] = context->count[0] << 3;
  171. context->buffer.u32[14] = bswap32(context->count[1]);
  172. context->buffer.u32[15] = bswap32(context->count[0]);
  173. transform256(context->state, context->buffer.u32);
  174. for (j = 0; j < 8; j++)
  175. ((unsigned int *)digest)[j] = bswap32(context->state[j]);
  176. memset(context, 0, sizeof(fz_sha256));
  177. }
  178. /* For SHA512 */
  179. #define S0(x) (rotr(x, 28) ^ rotr(x, 34) ^ rotr(x, 39))
  180. #define S1(x) (rotr(x, 14) ^ rotr(x, 18) ^ rotr(x, 41))
  181. #define s0(x) (rotr(x, 1) ^ rotr(x, 8) ^ (x >> 7))
  182. #define s1(x) (rotr(x, 19) ^ rotr(x, 61) ^ (x >> 6))
  183. static const uint64_t SHA512_K[80] = {
  184. 0x428A2F98D728AE22ULL, 0x7137449123EF65CDULL,
  185. 0xB5C0FBCFEC4D3B2FULL, 0xE9B5DBA58189DBBCULL,
  186. 0x3956C25BF348B538ULL, 0x59F111F1B605D019ULL,
  187. 0x923F82A4AF194F9BULL, 0xAB1C5ED5DA6D8118ULL,
  188. 0xD807AA98A3030242ULL, 0x12835B0145706FBEULL,
  189. 0x243185BE4EE4B28CULL, 0x550C7DC3D5FFB4E2ULL,
  190. 0x72BE5D74F27B896FULL, 0x80DEB1FE3B1696B1ULL,
  191. 0x9BDC06A725C71235ULL, 0xC19BF174CF692694ULL,
  192. 0xE49B69C19EF14AD2ULL, 0xEFBE4786384F25E3ULL,
  193. 0x0FC19DC68B8CD5B5ULL, 0x240CA1CC77AC9C65ULL,
  194. 0x2DE92C6F592B0275ULL, 0x4A7484AA6EA6E483ULL,
  195. 0x5CB0A9DCBD41FBD4ULL, 0x76F988DA831153B5ULL,
  196. 0x983E5152EE66DFABULL, 0xA831C66D2DB43210ULL,
  197. 0xB00327C898FB213FULL, 0xBF597FC7BEEF0EE4ULL,
  198. 0xC6E00BF33DA88FC2ULL, 0xD5A79147930AA725ULL,
  199. 0x06CA6351E003826FULL, 0x142929670A0E6E70ULL,
  200. 0x27B70A8546D22FFCULL, 0x2E1B21385C26C926ULL,
  201. 0x4D2C6DFC5AC42AEDULL, 0x53380D139D95B3DFULL,
  202. 0x650A73548BAF63DEULL, 0x766A0ABB3C77B2A8ULL,
  203. 0x81C2C92E47EDAEE6ULL, 0x92722C851482353BULL,
  204. 0xA2BFE8A14CF10364ULL, 0xA81A664BBC423001ULL,
  205. 0xC24B8B70D0F89791ULL, 0xC76C51A30654BE30ULL,
  206. 0xD192E819D6EF5218ULL, 0xD69906245565A910ULL,
  207. 0xF40E35855771202AULL, 0x106AA07032BBD1B8ULL,
  208. 0x19A4C116B8D2D0C8ULL, 0x1E376C085141AB53ULL,
  209. 0x2748774CDF8EEB99ULL, 0x34B0BCB5E19B48A8ULL,
  210. 0x391C0CB3C5C95A63ULL, 0x4ED8AA4AE3418ACBULL,
  211. 0x5B9CCA4F7763E373ULL, 0x682E6FF3D6B2B8A3ULL,
  212. 0x748F82EE5DEFB2FCULL, 0x78A5636F43172F60ULL,
  213. 0x84C87814A1F0AB72ULL, 0x8CC702081A6439ECULL,
  214. 0x90BEFFFA23631E28ULL, 0xA4506CEBDE82BDE9ULL,
  215. 0xBEF9A3F7B2C67915ULL, 0xC67178F2E372532BULL,
  216. 0xCA273ECEEA26619CULL, 0xD186B8C721C0C207ULL,
  217. 0xEADA7DD6CDE0EB1EULL, 0xF57D4F7FEE6ED178ULL,
  218. 0x06F067AA72176FBAULL, 0x0A637DC5A2C898A6ULL,
  219. 0x113F9804BEF90DAEULL, 0x1B710B35131C471BULL,
  220. 0x28DB77F523047D84ULL, 0x32CAAB7B40C72493ULL,
  221. 0x3C9EBE0A15C9BEBCULL, 0x431D67C49C100D4CULL,
  222. 0x4CC5D4BECB3E42B6ULL, 0x597F299CFC657E2AULL,
  223. 0x5FCB6FAB3AD6FAECULL, 0x6C44198C4A475817ULL,
  224. };
  225. static void
  226. transform512(uint64_t state[8], const uint64_t data_xe[16])
  227. {
  228. const uint64_t *K = SHA512_K;
  229. uint64_t data[16];
  230. uint64_t W[16];
  231. uint64_t T[8];
  232. unsigned int j;
  233. /* ensure big-endian integers */
  234. for (j = 0; j < 16; j++)
  235. data[j] = bswap64(data_xe[j]);
  236. /* Copy state[] to working vars. */
  237. memcpy(T, state, sizeof(T));
  238. /* 80 operations, partially loop unrolled */
  239. for (j = 0; j < 80; j+= 16) {
  240. R( 0); R( 1); R( 2); R( 3);
  241. R( 4); R( 5); R( 6); R( 7);
  242. R( 8); R( 9); R(10); R(11);
  243. R(12); R(13); R(14); R(15);
  244. }
  245. /* Add the working vars back into state[]. */
  246. state[0] += a(0);
  247. state[1] += b(0);
  248. state[2] += c(0);
  249. state[3] += d(0);
  250. state[4] += e(0);
  251. state[5] += f(0);
  252. state[6] += g(0);
  253. state[7] += h(0);
  254. }
  255. #undef S0
  256. #undef S1
  257. #undef s0
  258. #undef s1
  259. void fz_sha512_init(fz_sha512 *context)
  260. {
  261. context->count[0] = context->count[1] = 0;
  262. context->state[0] = 0x6A09E667F3BCC908ull;
  263. context->state[1] = 0xBB67AE8584CAA73Bull;
  264. context->state[2] = 0x3C6EF372FE94F82Bull;
  265. context->state[3] = 0xA54FF53A5F1D36F1ull;
  266. context->state[4] = 0x510E527FADE682D1ull;
  267. context->state[5] = 0x9B05688C2B3E6C1Full;
  268. context->state[6] = 0x1F83D9ABFB41BD6Bull;
  269. context->state[7] = 0x5BE0CD19137E2179ull;
  270. }
  271. void fz_sha512_update(fz_sha512 *context, const unsigned char *input, unsigned int inlen)
  272. {
  273. /* Copy the input data into a properly aligned temporary buffer.
  274. * This way we can be called with arbitrarily sized buffers
  275. * (no need to be multiple of 128 bytes), and the code works also
  276. * on architectures that don't allow unaligned memory access. */
  277. while (inlen > 0)
  278. {
  279. const unsigned int copy_start = context->count[0] & 0x7F;
  280. unsigned int copy_size = 128 - copy_start;
  281. if (copy_size > inlen)
  282. copy_size = inlen;
  283. memcpy(context->buffer.u8 + copy_start, input, copy_size);
  284. input += copy_size;
  285. inlen -= copy_size;
  286. context->count[0] += copy_size;
  287. /* carry overflow from low to high */
  288. if (context->count[0] < copy_size)
  289. context->count[1]++;
  290. if ((context->count[0] & 0x7F) == 0)
  291. transform512(context->state, context->buffer.u64);
  292. }
  293. }
  294. void fz_sha512_final(fz_sha512 *context, unsigned char digest[64])
  295. {
  296. /* Add padding as described in RFC 3174 (it describes SHA-1 but
  297. * the same padding style is used for SHA-512 too). */
  298. unsigned int j = context->count[0] & 0x7F;
  299. context->buffer.u8[j++] = 0x80;
  300. while (j != 112)
  301. {
  302. if (j == 128)
  303. {
  304. transform512(context->state, context->buffer.u64);
  305. j = 0;
  306. }
  307. context->buffer.u8[j++] = 0x00;
  308. }
  309. /* Convert the message size from bytes to bits. */
  310. context->count[1] = (context->count[1] << 3) + (context->count[0] >> 29);
  311. context->count[0] = context->count[0] << 3;
  312. context->buffer.u64[14] = bswap64(context->count[1]);
  313. context->buffer.u64[15] = bswap64(context->count[0]);
  314. transform512(context->state, context->buffer.u64);
  315. for (j = 0; j < 8; j++)
  316. ((uint64_t *)digest)[j] = bswap64(context->state[j]);
  317. memset(context, 0, sizeof(fz_sha512));
  318. }
  319. void fz_sha384_init(fz_sha384 *context)
  320. {
  321. context->count[0] = context->count[1] = 0;
  322. context->state[0] = 0xCBBB9D5DC1059ED8ull;
  323. context->state[1] = 0x629A292A367CD507ull;
  324. context->state[2] = 0x9159015A3070DD17ull;
  325. context->state[3] = 0x152FECD8F70E5939ull;
  326. context->state[4] = 0x67332667FFC00B31ull;
  327. context->state[5] = 0x8EB44A8768581511ull;
  328. context->state[6] = 0xDB0C2E0D64F98FA7ull;
  329. context->state[7] = 0x47B5481DBEFA4FA4ull;
  330. }
  331. void fz_sha384_update(fz_sha384 *context, const unsigned char *input, unsigned int inlen)
  332. {
  333. fz_sha512_update(context, input, inlen);
  334. }
  335. void fz_sha384_final(fz_sha384 *context, unsigned char digest[64])
  336. {
  337. fz_sha512_final(context, digest);
  338. }