sha256.cc 15 KB

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