sha256.cc 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425
  1. /*
  2. * Cryptographic API.
  3. *
  4. * SHA-256, as specified in
  5. * http://csrc.nist.gov/cryptval/shs/sha256-384-512.pdf
  6. *
  7. * SHA-256 code by Jean-Luc Cooke <jlcooke@certainkey.com>.
  8. *
  9. * Copyright (c) Jean-Luc Cooke <jlcooke@certainkey.com>
  10. * Copyright (c) Andrew McDonald <andrew@mcdonald.org.uk>
  11. * Copyright (c) 2002 James Morris <jmorris@intercode.com.au>
  12. *
  13. * Ported from the Linux kernel to Apt by Anthony Towns <ajt@debian.org>
  14. *
  15. * This program is free software; you can redistribute it and/or modify it
  16. * under the terms of the GNU General Public License as published by the Free
  17. * Software Foundation; either version 2 of the License, or (at your option)
  18. * any later version.
  19. *
  20. */
  21. #define SHA256_DIGEST_SIZE 32
  22. #define SHA256_HMAC_BLOCK_SIZE 64
  23. #define ror32(value,bits) (((value) >> (bits)) | ((value) << (32 - (bits))))
  24. #include <apt-pkg/sha256.h>
  25. #include <apt-pkg/strutl.h>
  26. #include <string.h>
  27. #include <unistd.h>
  28. #include <stdint.h>
  29. #include <stdlib.h>
  30. #include <stdio.h>
  31. #include <arpa/inet.h>
  32. typedef uint32_t u32;
  33. typedef uint8_t u8;
  34. static inline u32 Ch(u32 x, u32 y, u32 z)
  35. {
  36. return z ^ (x & (y ^ z));
  37. }
  38. static inline u32 Maj(u32 x, u32 y, u32 z)
  39. {
  40. return (x & y) | (z & (x | y));
  41. }
  42. #define e0(x) (ror32(x, 2) ^ ror32(x,13) ^ ror32(x,22))
  43. #define e1(x) (ror32(x, 6) ^ ror32(x,11) ^ ror32(x,25))
  44. #define s0(x) (ror32(x, 7) ^ ror32(x,18) ^ (x >> 3))
  45. #define s1(x) (ror32(x,17) ^ ror32(x,19) ^ (x >> 10))
  46. #define H0 0x6a09e667
  47. #define H1 0xbb67ae85
  48. #define H2 0x3c6ef372
  49. #define H3 0xa54ff53a
  50. #define H4 0x510e527f
  51. #define H5 0x9b05688c
  52. #define H6 0x1f83d9ab
  53. #define H7 0x5be0cd19
  54. static inline void LOAD_OP(int I, u32 *W, const u8 *input)
  55. {
  56. W[I] = ( ((u32) input[I + 0] << 24)
  57. | ((u32) input[I + 1] << 16)
  58. | ((u32) input[I + 2] << 8)
  59. | ((u32) input[I + 3]));
  60. }
  61. static inline void BLEND_OP(int I, u32 *W)
  62. {
  63. W[I] = s1(W[I-2]) + W[I-7] + s0(W[I-15]) + W[I-16];
  64. }
  65. static void sha256_transform(u32 *state, const u8 *input)
  66. {
  67. u32 a, b, c, d, e, f, g, h, t1, t2;
  68. u32 W[64];
  69. int i;
  70. /* load the input */
  71. for (i = 0; i < 16; i++)
  72. LOAD_OP(i, W, input);
  73. /* now blend */
  74. for (i = 16; i < 64; i++)
  75. BLEND_OP(i, W);
  76. /* load the state into our registers */
  77. a=state[0]; b=state[1]; c=state[2]; d=state[3];
  78. e=state[4]; f=state[5]; g=state[6]; h=state[7];
  79. /* now iterate */
  80. t1 = h + e1(e) + Ch(e,f,g) + 0x428a2f98 + W[ 0];
  81. t2 = e0(a) + Maj(a,b,c); d+=t1; h=t1+t2;
  82. t1 = g + e1(d) + Ch(d,e,f) + 0x71374491 + W[ 1];
  83. t2 = e0(h) + Maj(h,a,b); c+=t1; g=t1+t2;
  84. t1 = f + e1(c) + Ch(c,d,e) + 0xb5c0fbcf + W[ 2];
  85. t2 = e0(g) + Maj(g,h,a); b+=t1; f=t1+t2;
  86. t1 = e + e1(b) + Ch(b,c,d) + 0xe9b5dba5 + W[ 3];
  87. t2 = e0(f) + Maj(f,g,h); a+=t1; e=t1+t2;
  88. t1 = d + e1(a) + Ch(a,b,c) + 0x3956c25b + W[ 4];
  89. t2 = e0(e) + Maj(e,f,g); h+=t1; d=t1+t2;
  90. t1 = c + e1(h) + Ch(h,a,b) + 0x59f111f1 + W[ 5];
  91. t2 = e0(d) + Maj(d,e,f); g+=t1; c=t1+t2;
  92. t1 = b + e1(g) + Ch(g,h,a) + 0x923f82a4 + W[ 6];
  93. t2 = e0(c) + Maj(c,d,e); f+=t1; b=t1+t2;
  94. t1 = a + e1(f) + Ch(f,g,h) + 0xab1c5ed5 + W[ 7];
  95. t2 = e0(b) + Maj(b,c,d); e+=t1; a=t1+t2;
  96. t1 = h + e1(e) + Ch(e,f,g) + 0xd807aa98 + W[ 8];
  97. t2 = e0(a) + Maj(a,b,c); d+=t1; h=t1+t2;
  98. t1 = g + e1(d) + Ch(d,e,f) + 0x12835b01 + W[ 9];
  99. t2 = e0(h) + Maj(h,a,b); c+=t1; g=t1+t2;
  100. t1 = f + e1(c) + Ch(c,d,e) + 0x243185be + W[10];
  101. t2 = e0(g) + Maj(g,h,a); b+=t1; f=t1+t2;
  102. t1 = e + e1(b) + Ch(b,c,d) + 0x550c7dc3 + W[11];
  103. t2 = e0(f) + Maj(f,g,h); a+=t1; e=t1+t2;
  104. t1 = d + e1(a) + Ch(a,b,c) + 0x72be5d74 + W[12];
  105. t2 = e0(e) + Maj(e,f,g); h+=t1; d=t1+t2;
  106. t1 = c + e1(h) + Ch(h,a,b) + 0x80deb1fe + W[13];
  107. t2 = e0(d) + Maj(d,e,f); g+=t1; c=t1+t2;
  108. t1 = b + e1(g) + Ch(g,h,a) + 0x9bdc06a7 + W[14];
  109. t2 = e0(c) + Maj(c,d,e); f+=t1; b=t1+t2;
  110. t1 = a + e1(f) + Ch(f,g,h) + 0xc19bf174 + W[15];
  111. t2 = e0(b) + Maj(b,c,d); e+=t1; a=t1+t2;
  112. t1 = h + e1(e) + Ch(e,f,g) + 0xe49b69c1 + W[16];
  113. t2 = e0(a) + Maj(a,b,c); d+=t1; h=t1+t2;
  114. t1 = g + e1(d) + Ch(d,e,f) + 0xefbe4786 + W[17];
  115. t2 = e0(h) + Maj(h,a,b); c+=t1; g=t1+t2;
  116. t1 = f + e1(c) + Ch(c,d,e) + 0x0fc19dc6 + W[18];
  117. t2 = e0(g) + Maj(g,h,a); b+=t1; f=t1+t2;
  118. t1 = e + e1(b) + Ch(b,c,d) + 0x240ca1cc + W[19];
  119. t2 = e0(f) + Maj(f,g,h); a+=t1; e=t1+t2;
  120. t1 = d + e1(a) + Ch(a,b,c) + 0x2de92c6f + W[20];
  121. t2 = e0(e) + Maj(e,f,g); h+=t1; d=t1+t2;
  122. t1 = c + e1(h) + Ch(h,a,b) + 0x4a7484aa + W[21];
  123. t2 = e0(d) + Maj(d,e,f); g+=t1; c=t1+t2;
  124. t1 = b + e1(g) + Ch(g,h,a) + 0x5cb0a9dc + W[22];
  125. t2 = e0(c) + Maj(c,d,e); f+=t1; b=t1+t2;
  126. t1 = a + e1(f) + Ch(f,g,h) + 0x76f988da + W[23];
  127. t2 = e0(b) + Maj(b,c,d); e+=t1; a=t1+t2;
  128. t1 = h + e1(e) + Ch(e,f,g) + 0x983e5152 + W[24];
  129. t2 = e0(a) + Maj(a,b,c); d+=t1; h=t1+t2;
  130. t1 = g + e1(d) + Ch(d,e,f) + 0xa831c66d + W[25];
  131. t2 = e0(h) + Maj(h,a,b); c+=t1; g=t1+t2;
  132. t1 = f + e1(c) + Ch(c,d,e) + 0xb00327c8 + W[26];
  133. t2 = e0(g) + Maj(g,h,a); b+=t1; f=t1+t2;
  134. t1 = e + e1(b) + Ch(b,c,d) + 0xbf597fc7 + W[27];
  135. t2 = e0(f) + Maj(f,g,h); a+=t1; e=t1+t2;
  136. t1 = d + e1(a) + Ch(a,b,c) + 0xc6e00bf3 + W[28];
  137. t2 = e0(e) + Maj(e,f,g); h+=t1; d=t1+t2;
  138. t1 = c + e1(h) + Ch(h,a,b) + 0xd5a79147 + W[29];
  139. t2 = e0(d) + Maj(d,e,f); g+=t1; c=t1+t2;
  140. t1 = b + e1(g) + Ch(g,h,a) + 0x06ca6351 + W[30];
  141. t2 = e0(c) + Maj(c,d,e); f+=t1; b=t1+t2;
  142. t1 = a + e1(f) + Ch(f,g,h) + 0x14292967 + W[31];
  143. t2 = e0(b) + Maj(b,c,d); e+=t1; a=t1+t2;
  144. t1 = h + e1(e) + Ch(e,f,g) + 0x27b70a85 + W[32];
  145. t2 = e0(a) + Maj(a,b,c); d+=t1; h=t1+t2;
  146. t1 = g + e1(d) + Ch(d,e,f) + 0x2e1b2138 + W[33];
  147. t2 = e0(h) + Maj(h,a,b); c+=t1; g=t1+t2;
  148. t1 = f + e1(c) + Ch(c,d,e) + 0x4d2c6dfc + W[34];
  149. t2 = e0(g) + Maj(g,h,a); b+=t1; f=t1+t2;
  150. t1 = e + e1(b) + Ch(b,c,d) + 0x53380d13 + W[35];
  151. t2 = e0(f) + Maj(f,g,h); a+=t1; e=t1+t2;
  152. t1 = d + e1(a) + Ch(a,b,c) + 0x650a7354 + W[36];
  153. t2 = e0(e) + Maj(e,f,g); h+=t1; d=t1+t2;
  154. t1 = c + e1(h) + Ch(h,a,b) + 0x766a0abb + W[37];
  155. t2 = e0(d) + Maj(d,e,f); g+=t1; c=t1+t2;
  156. t1 = b + e1(g) + Ch(g,h,a) + 0x81c2c92e + W[38];
  157. t2 = e0(c) + Maj(c,d,e); f+=t1; b=t1+t2;
  158. t1 = a + e1(f) + Ch(f,g,h) + 0x92722c85 + W[39];
  159. t2 = e0(b) + Maj(b,c,d); e+=t1; a=t1+t2;
  160. t1 = h + e1(e) + Ch(e,f,g) + 0xa2bfe8a1 + W[40];
  161. t2 = e0(a) + Maj(a,b,c); d+=t1; h=t1+t2;
  162. t1 = g + e1(d) + Ch(d,e,f) + 0xa81a664b + W[41];
  163. t2 = e0(h) + Maj(h,a,b); c+=t1; g=t1+t2;
  164. t1 = f + e1(c) + Ch(c,d,e) + 0xc24b8b70 + W[42];
  165. t2 = e0(g) + Maj(g,h,a); b+=t1; f=t1+t2;
  166. t1 = e + e1(b) + Ch(b,c,d) + 0xc76c51a3 + W[43];
  167. t2 = e0(f) + Maj(f,g,h); a+=t1; e=t1+t2;
  168. t1 = d + e1(a) + Ch(a,b,c) + 0xd192e819 + W[44];
  169. t2 = e0(e) + Maj(e,f,g); h+=t1; d=t1+t2;
  170. t1 = c + e1(h) + Ch(h,a,b) + 0xd6990624 + W[45];
  171. t2 = e0(d) + Maj(d,e,f); g+=t1; c=t1+t2;
  172. t1 = b + e1(g) + Ch(g,h,a) + 0xf40e3585 + W[46];
  173. t2 = e0(c) + Maj(c,d,e); f+=t1; b=t1+t2;
  174. t1 = a + e1(f) + Ch(f,g,h) + 0x106aa070 + W[47];
  175. t2 = e0(b) + Maj(b,c,d); e+=t1; a=t1+t2;
  176. t1 = h + e1(e) + Ch(e,f,g) + 0x19a4c116 + W[48];
  177. t2 = e0(a) + Maj(a,b,c); d+=t1; h=t1+t2;
  178. t1 = g + e1(d) + Ch(d,e,f) + 0x1e376c08 + W[49];
  179. t2 = e0(h) + Maj(h,a,b); c+=t1; g=t1+t2;
  180. t1 = f + e1(c) + Ch(c,d,e) + 0x2748774c + W[50];
  181. t2 = e0(g) + Maj(g,h,a); b+=t1; f=t1+t2;
  182. t1 = e + e1(b) + Ch(b,c,d) + 0x34b0bcb5 + W[51];
  183. t2 = e0(f) + Maj(f,g,h); a+=t1; e=t1+t2;
  184. t1 = d + e1(a) + Ch(a,b,c) + 0x391c0cb3 + W[52];
  185. t2 = e0(e) + Maj(e,f,g); h+=t1; d=t1+t2;
  186. t1 = c + e1(h) + Ch(h,a,b) + 0x4ed8aa4a + W[53];
  187. t2 = e0(d) + Maj(d,e,f); g+=t1; c=t1+t2;
  188. t1 = b + e1(g) + Ch(g,h,a) + 0x5b9cca4f + W[54];
  189. t2 = e0(c) + Maj(c,d,e); f+=t1; b=t1+t2;
  190. t1 = a + e1(f) + Ch(f,g,h) + 0x682e6ff3 + W[55];
  191. t2 = e0(b) + Maj(b,c,d); e+=t1; a=t1+t2;
  192. t1 = h + e1(e) + Ch(e,f,g) + 0x748f82ee + W[56];
  193. t2 = e0(a) + Maj(a,b,c); d+=t1; h=t1+t2;
  194. t1 = g + e1(d) + Ch(d,e,f) + 0x78a5636f + W[57];
  195. t2 = e0(h) + Maj(h,a,b); c+=t1; g=t1+t2;
  196. t1 = f + e1(c) + Ch(c,d,e) + 0x84c87814 + W[58];
  197. t2 = e0(g) + Maj(g,h,a); b+=t1; f=t1+t2;
  198. t1 = e + e1(b) + Ch(b,c,d) + 0x8cc70208 + W[59];
  199. t2 = e0(f) + Maj(f,g,h); a+=t1; e=t1+t2;
  200. t1 = d + e1(a) + Ch(a,b,c) + 0x90befffa + W[60];
  201. t2 = e0(e) + Maj(e,f,g); h+=t1; d=t1+t2;
  202. t1 = c + e1(h) + Ch(h,a,b) + 0xa4506ceb + W[61];
  203. t2 = e0(d) + Maj(d,e,f); g+=t1; c=t1+t2;
  204. t1 = b + e1(g) + Ch(g,h,a) + 0xbef9a3f7 + W[62];
  205. t2 = e0(c) + Maj(c,d,e); f+=t1; b=t1+t2;
  206. t1 = a + e1(f) + Ch(f,g,h) + 0xc67178f2 + W[63];
  207. t2 = e0(b) + Maj(b,c,d); e+=t1; a=t1+t2;
  208. state[0] += a; state[1] += b; state[2] += c; state[3] += d;
  209. state[4] += e; state[5] += f; state[6] += g; state[7] += h;
  210. /* clear any sensitive info... */
  211. a = b = c = d = e = f = g = h = t1 = t2 = 0;
  212. memset(W, 0, 64 * sizeof(u32));
  213. }
  214. SHA256Summation::SHA256Summation()
  215. {
  216. Sum.state[0] = H0;
  217. Sum.state[1] = H1;
  218. Sum.state[2] = H2;
  219. Sum.state[3] = H3;
  220. Sum.state[4] = H4;
  221. Sum.state[5] = H5;
  222. Sum.state[6] = H6;
  223. Sum.state[7] = H7;
  224. Sum.count[0] = Sum.count[1] = 0;
  225. memset(Sum.buf, 0, sizeof(Sum.buf));
  226. Done = false;
  227. }
  228. bool SHA256Summation::Add(const u8 *data, unsigned long len)
  229. {
  230. struct sha256_ctx *sctx = &Sum;
  231. unsigned int i, index, part_len;
  232. if (Done) return false;
  233. /* Compute number of bytes mod 128 */
  234. index = (unsigned int)((sctx->count[0] >> 3) & 0x3f);
  235. /* Update number of bits */
  236. if ((sctx->count[0] += (len << 3)) < (len << 3)) {
  237. sctx->count[1]++;
  238. sctx->count[1] += (len >> 29);
  239. }
  240. part_len = 64 - index;
  241. /* Transform as many times as possible. */
  242. if (len >= part_len) {
  243. memcpy(&sctx->buf[index], data, part_len);
  244. sha256_transform(sctx->state, sctx->buf);
  245. for (i = part_len; i + 63 < len; i += 64)
  246. sha256_transform(sctx->state, &data[i]);
  247. index = 0;
  248. } else {
  249. i = 0;
  250. }
  251. /* Buffer remaining input */
  252. memcpy(&sctx->buf[index], &data[i], len-i);
  253. return true;
  254. }
  255. SHA256SumValue SHA256Summation::Result()
  256. {
  257. struct sha256_ctx *sctx = &Sum;
  258. if (!Done) {
  259. u8 bits[8];
  260. unsigned int index, pad_len, t;
  261. static const u8 padding[64] = { 0x80, };
  262. /* Save number of bits */
  263. t = sctx->count[0];
  264. bits[7] = t; t >>= 8;
  265. bits[6] = t; t >>= 8;
  266. bits[5] = t; t >>= 8;
  267. bits[4] = t;
  268. t = sctx->count[1];
  269. bits[3] = t; t >>= 8;
  270. bits[2] = t; t >>= 8;
  271. bits[1] = t; t >>= 8;
  272. bits[0] = t;
  273. /* Pad out to 56 mod 64. */
  274. index = (sctx->count[0] >> 3) & 0x3f;
  275. pad_len = (index < 56) ? (56 - index) : ((64+56) - index);
  276. Add(padding, pad_len);
  277. /* Append length (before padding) */
  278. Add(bits, 8);
  279. }
  280. Done = true;
  281. /* Store state in digest */
  282. SHA256SumValue res;
  283. u8 *out = res.Sum;
  284. int i, j;
  285. unsigned int t;
  286. for (i = j = 0; i < 8; i++, j += 4) {
  287. t = sctx->state[i];
  288. out[j+3] = t; t >>= 8;
  289. out[j+2] = t; t >>= 8;
  290. out[j+1] = t; t >>= 8;
  291. out[j ] = t;
  292. }
  293. return res;
  294. }
  295. // SHA256SumValue::SHA256SumValue - Constructs the sum from a string /*{{{*/
  296. // ---------------------------------------------------------------------
  297. /* The string form of a SHA256 is a 64 character hex number */
  298. SHA256SumValue::SHA256SumValue(string Str)
  299. {
  300. memset(Sum,0,sizeof(Sum));
  301. Set(Str);
  302. }
  303. /*}}}*/
  304. // SHA256SumValue::SHA256SumValue - Default constructor /*{{{*/
  305. // ---------------------------------------------------------------------
  306. /* Sets the value to 0 */
  307. SHA256SumValue::SHA256SumValue()
  308. {
  309. memset(Sum,0,sizeof(Sum));
  310. }
  311. /*}}}*/
  312. // SHA256SumValue::Set - Set the sum from a string /*{{{*/
  313. // ---------------------------------------------------------------------
  314. /* Converts the hex string into a set of chars */
  315. bool SHA256SumValue::Set(string Str)
  316. {
  317. return Hex2Num(Str,Sum,sizeof(Sum));
  318. }
  319. /*}}}*/
  320. // SHA256SumValue::Value - Convert the number into a string /*{{{*/
  321. // ---------------------------------------------------------------------
  322. /* Converts the set of chars into a hex string in lower case */
  323. string SHA256SumValue::Value() const
  324. {
  325. char Conv[16] =
  326. { '0','1','2','3','4','5','6','7','8','9','a','b',
  327. 'c','d','e','f'
  328. };
  329. char Result[65];
  330. Result[64] = 0;
  331. // Convert each char into two letters
  332. int J = 0;
  333. int I = 0;
  334. for (; I != 64; J++,I += 2)
  335. {
  336. Result[I] = Conv[Sum[J] >> 4];
  337. Result[I + 1] = Conv[Sum[J] & 0xF];
  338. }
  339. return string(Result);
  340. }
  341. // SHA256SumValue::operator == - Comparator /*{{{*/
  342. // ---------------------------------------------------------------------
  343. /* Call memcmp on the buffer */
  344. bool SHA256SumValue::operator == (const SHA256SumValue & rhs) const
  345. {
  346. return memcmp(Sum,rhs.Sum,sizeof(Sum)) == 0;
  347. }
  348. /*}}}*/
  349. // SHA256Summation::AddFD - Add content of file into the checksum /*{{{*/
  350. // ---------------------------------------------------------------------
  351. /* */
  352. bool SHA256Summation::AddFD(int Fd,unsigned long Size)
  353. {
  354. unsigned char Buf[64 * 64];
  355. int Res = 0;
  356. int ToEOF = (Size == 0);
  357. while (Size != 0 || ToEOF)
  358. {
  359. unsigned n = sizeof(Buf);
  360. if (!ToEOF) n = min(Size,(unsigned long)n);
  361. Res = read(Fd,Buf,n);
  362. if (Res < 0 || (!ToEOF && (unsigned) Res != n)) // error, or short read
  363. return false;
  364. if (ToEOF && Res == 0) // EOF
  365. break;
  366. Size -= Res;
  367. Add(Buf,Res);
  368. }
  369. return true;
  370. }
  371. /*}}}*/