smbdes.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420
  1. /*
  2. Unix SMB/Netbios implementation.
  3. Version 1.9.
  4. a partial implementation of DES designed for use in the
  5. SMB authentication protocol
  6. Copyright (C) Andrew Tridgell 1998
  7. Modified by Steve French (sfrench@us.ibm.com) 2002,2004
  8. This program is free software; you can redistribute it and/or modify
  9. it under the terms of the GNU General Public License as published by
  10. the Free Software Foundation; either version 2 of the License, or
  11. (at your option) any later version.
  12. This program is distributed in the hope that it will be useful,
  13. but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  15. GNU General Public License for more details.
  16. You should have received a copy of the GNU General Public License
  17. along with this program; if not, write to the Free Software
  18. Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  19. */
  20. /* NOTES:
  21. This code makes no attempt to be fast! In fact, it is a very
  22. slow implementation
  23. This code is NOT a complete DES implementation. It implements only
  24. the minimum necessary for SMB authentication, as used by all SMB
  25. products (including every copy of Microsoft Windows95 ever sold)
  26. In particular, it can only do a unchained forward DES pass. This
  27. means it is not possible to use this code for encryption/decryption
  28. of data, instead it is only useful as a "hash" algorithm.
  29. There is no entry point into this code that allows normal DES operation.
  30. I believe this means that this code does not come under ITAR
  31. regulations but this is NOT a legal opinion. If you are concerned
  32. about the applicability of ITAR regulations to this code then you
  33. should confirm it for yourself (and maybe let me know if you come
  34. up with a different answer to the one above)
  35. */
  36. #include <linux/slab.h>
  37. #include "cifsencrypt.h"
  38. #define uchar unsigned char
  39. static uchar perm1[56] = { 57, 49, 41, 33, 25, 17, 9,
  40. 1, 58, 50, 42, 34, 26, 18,
  41. 10, 2, 59, 51, 43, 35, 27,
  42. 19, 11, 3, 60, 52, 44, 36,
  43. 63, 55, 47, 39, 31, 23, 15,
  44. 7, 62, 54, 46, 38, 30, 22,
  45. 14, 6, 61, 53, 45, 37, 29,
  46. 21, 13, 5, 28, 20, 12, 4
  47. };
  48. static uchar perm2[48] = { 14, 17, 11, 24, 1, 5,
  49. 3, 28, 15, 6, 21, 10,
  50. 23, 19, 12, 4, 26, 8,
  51. 16, 7, 27, 20, 13, 2,
  52. 41, 52, 31, 37, 47, 55,
  53. 30, 40, 51, 45, 33, 48,
  54. 44, 49, 39, 56, 34, 53,
  55. 46, 42, 50, 36, 29, 32
  56. };
  57. static uchar perm3[64] = { 58, 50, 42, 34, 26, 18, 10, 2,
  58. 60, 52, 44, 36, 28, 20, 12, 4,
  59. 62, 54, 46, 38, 30, 22, 14, 6,
  60. 64, 56, 48, 40, 32, 24, 16, 8,
  61. 57, 49, 41, 33, 25, 17, 9, 1,
  62. 59, 51, 43, 35, 27, 19, 11, 3,
  63. 61, 53, 45, 37, 29, 21, 13, 5,
  64. 63, 55, 47, 39, 31, 23, 15, 7
  65. };
  66. static uchar perm4[48] = { 32, 1, 2, 3, 4, 5,
  67. 4, 5, 6, 7, 8, 9,
  68. 8, 9, 10, 11, 12, 13,
  69. 12, 13, 14, 15, 16, 17,
  70. 16, 17, 18, 19, 20, 21,
  71. 20, 21, 22, 23, 24, 25,
  72. 24, 25, 26, 27, 28, 29,
  73. 28, 29, 30, 31, 32, 1
  74. };
  75. static uchar perm5[32] = { 16, 7, 20, 21,
  76. 29, 12, 28, 17,
  77. 1, 15, 23, 26,
  78. 5, 18, 31, 10,
  79. 2, 8, 24, 14,
  80. 32, 27, 3, 9,
  81. 19, 13, 30, 6,
  82. 22, 11, 4, 25
  83. };
  84. static uchar perm6[64] = { 40, 8, 48, 16, 56, 24, 64, 32,
  85. 39, 7, 47, 15, 55, 23, 63, 31,
  86. 38, 6, 46, 14, 54, 22, 62, 30,
  87. 37, 5, 45, 13, 53, 21, 61, 29,
  88. 36, 4, 44, 12, 52, 20, 60, 28,
  89. 35, 3, 43, 11, 51, 19, 59, 27,
  90. 34, 2, 42, 10, 50, 18, 58, 26,
  91. 33, 1, 41, 9, 49, 17, 57, 25
  92. };
  93. static uchar sc[16] = { 1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1 };
  94. static uchar sbox[8][4][16] = {
  95. {{14, 4, 13, 1, 2, 15, 11, 8, 3, 10, 6, 12, 5, 9, 0, 7},
  96. {0, 15, 7, 4, 14, 2, 13, 1, 10, 6, 12, 11, 9, 5, 3, 8},
  97. {4, 1, 14, 8, 13, 6, 2, 11, 15, 12, 9, 7, 3, 10, 5, 0},
  98. {15, 12, 8, 2, 4, 9, 1, 7, 5, 11, 3, 14, 10, 0, 6, 13}},
  99. {{15, 1, 8, 14, 6, 11, 3, 4, 9, 7, 2, 13, 12, 0, 5, 10},
  100. {3, 13, 4, 7, 15, 2, 8, 14, 12, 0, 1, 10, 6, 9, 11, 5},
  101. {0, 14, 7, 11, 10, 4, 13, 1, 5, 8, 12, 6, 9, 3, 2, 15},
  102. {13, 8, 10, 1, 3, 15, 4, 2, 11, 6, 7, 12, 0, 5, 14, 9}},
  103. {{10, 0, 9, 14, 6, 3, 15, 5, 1, 13, 12, 7, 11, 4, 2, 8},
  104. {13, 7, 0, 9, 3, 4, 6, 10, 2, 8, 5, 14, 12, 11, 15, 1},
  105. {13, 6, 4, 9, 8, 15, 3, 0, 11, 1, 2, 12, 5, 10, 14, 7},
  106. {1, 10, 13, 0, 6, 9, 8, 7, 4, 15, 14, 3, 11, 5, 2, 12}},
  107. {{7, 13, 14, 3, 0, 6, 9, 10, 1, 2, 8, 5, 11, 12, 4, 15},
  108. {13, 8, 11, 5, 6, 15, 0, 3, 4, 7, 2, 12, 1, 10, 14, 9},
  109. {10, 6, 9, 0, 12, 11, 7, 13, 15, 1, 3, 14, 5, 2, 8, 4},
  110. {3, 15, 0, 6, 10, 1, 13, 8, 9, 4, 5, 11, 12, 7, 2, 14}},
  111. {{2, 12, 4, 1, 7, 10, 11, 6, 8, 5, 3, 15, 13, 0, 14, 9},
  112. {14, 11, 2, 12, 4, 7, 13, 1, 5, 0, 15, 10, 3, 9, 8, 6},
  113. {4, 2, 1, 11, 10, 13, 7, 8, 15, 9, 12, 5, 6, 3, 0, 14},
  114. {11, 8, 12, 7, 1, 14, 2, 13, 6, 15, 0, 9, 10, 4, 5, 3}},
  115. {{12, 1, 10, 15, 9, 2, 6, 8, 0, 13, 3, 4, 14, 7, 5, 11},
  116. {10, 15, 4, 2, 7, 12, 9, 5, 6, 1, 13, 14, 0, 11, 3, 8},
  117. {9, 14, 15, 5, 2, 8, 12, 3, 7, 0, 4, 10, 1, 13, 11, 6},
  118. {4, 3, 2, 12, 9, 5, 15, 10, 11, 14, 1, 7, 6, 0, 8, 13}},
  119. {{4, 11, 2, 14, 15, 0, 8, 13, 3, 12, 9, 7, 5, 10, 6, 1},
  120. {13, 0, 11, 7, 4, 9, 1, 10, 14, 3, 5, 12, 2, 15, 8, 6},
  121. {1, 4, 11, 13, 12, 3, 7, 14, 10, 15, 6, 8, 0, 5, 9, 2},
  122. {6, 11, 13, 8, 1, 4, 10, 7, 9, 5, 0, 15, 14, 2, 3, 12}},
  123. {{13, 2, 8, 4, 6, 15, 11, 1, 10, 9, 3, 14, 5, 0, 12, 7},
  124. {1, 15, 13, 8, 10, 3, 7, 4, 12, 5, 6, 11, 0, 14, 9, 2},
  125. {7, 11, 4, 1, 9, 12, 14, 2, 0, 6, 10, 13, 15, 3, 5, 8},
  126. {2, 1, 14, 7, 4, 10, 8, 13, 15, 12, 9, 0, 3, 5, 6, 11}}
  127. };
  128. static void
  129. permute(char *out, char *in, uchar * p, int n)
  130. {
  131. int i;
  132. for (i = 0; i < n; i++)
  133. out[i] = in[p[i] - 1];
  134. }
  135. static void
  136. lshift(char *d, int count, int n)
  137. {
  138. char out[64];
  139. int i;
  140. for (i = 0; i < n; i++)
  141. out[i] = d[(i + count) % n];
  142. for (i = 0; i < n; i++)
  143. d[i] = out[i];
  144. }
  145. static void
  146. concat(char *out, char *in1, char *in2, int l1, int l2)
  147. {
  148. while (l1--)
  149. *out++ = *in1++;
  150. while (l2--)
  151. *out++ = *in2++;
  152. }
  153. static void
  154. xor(char *out, char *in1, char *in2, int n)
  155. {
  156. int i;
  157. for (i = 0; i < n; i++)
  158. out[i] = in1[i] ^ in2[i];
  159. }
  160. static void
  161. dohash(char *out, char *in, char *key, int forw)
  162. {
  163. int i, j, k;
  164. char *pk1;
  165. char c[28];
  166. char d[28];
  167. char *cd;
  168. char (*ki)[48];
  169. char *pd1;
  170. char l[32], r[32];
  171. char *rl;
  172. /* Have to reduce stack usage */
  173. pk1 = kmalloc(56+56+64+64,GFP_KERNEL);
  174. if(pk1 == NULL)
  175. return;
  176. ki = kmalloc(16*48, GFP_KERNEL);
  177. if(ki == NULL) {
  178. kfree(pk1);
  179. return;
  180. }
  181. cd = pk1 + 56;
  182. pd1= cd + 56;
  183. rl = pd1 + 64;
  184. permute(pk1, key, perm1, 56);
  185. for (i = 0; i < 28; i++)
  186. c[i] = pk1[i];
  187. for (i = 0; i < 28; i++)
  188. d[i] = pk1[i + 28];
  189. for (i = 0; i < 16; i++) {
  190. lshift(c, sc[i], 28);
  191. lshift(d, sc[i], 28);
  192. concat(cd, c, d, 28, 28);
  193. permute(ki[i], cd, perm2, 48);
  194. }
  195. permute(pd1, in, perm3, 64);
  196. for (j = 0; j < 32; j++) {
  197. l[j] = pd1[j];
  198. r[j] = pd1[j + 32];
  199. }
  200. for (i = 0; i < 16; i++) {
  201. char *er; /* er[48] */
  202. char *erk; /* erk[48] */
  203. char b[8][6];
  204. char *cb; /* cb[32] */
  205. char *pcb; /* pcb[32] */
  206. char *r2; /* r2[32] */
  207. er = kmalloc(48+48+32+32+32, GFP_KERNEL);
  208. if(er == NULL) {
  209. kfree(pk1);
  210. kfree(ki);
  211. return;
  212. }
  213. erk = er+48;
  214. cb = erk+48;
  215. pcb = cb+32;
  216. r2 = pcb+32;
  217. permute(er, r, perm4, 48);
  218. xor(erk, er, ki[forw ? i : 15 - i], 48);
  219. for (j = 0; j < 8; j++)
  220. for (k = 0; k < 6; k++)
  221. b[j][k] = erk[j * 6 + k];
  222. for (j = 0; j < 8; j++) {
  223. int m, n;
  224. m = (b[j][0] << 1) | b[j][5];
  225. n = (b[j][1] << 3) | (b[j][2] << 2) | (b[j][3] <<
  226. 1) | b[j][4];
  227. for (k = 0; k < 4; k++)
  228. b[j][k] =
  229. (sbox[j][m][n] & (1 << (3 - k))) ? 1 : 0;
  230. }
  231. for (j = 0; j < 8; j++)
  232. for (k = 0; k < 4; k++)
  233. cb[j * 4 + k] = b[j][k];
  234. permute(pcb, cb, perm5, 32);
  235. xor(r2, l, pcb, 32);
  236. for (j = 0; j < 32; j++)
  237. l[j] = r[j];
  238. for (j = 0; j < 32; j++)
  239. r[j] = r2[j];
  240. kfree(er);
  241. }
  242. concat(rl, r, l, 32, 32);
  243. permute(out, rl, perm6, 64);
  244. kfree(pk1);
  245. kfree(ki);
  246. }
  247. static void
  248. str_to_key(unsigned char *str, unsigned char *key)
  249. {
  250. int i;
  251. key[0] = str[0] >> 1;
  252. key[1] = ((str[0] & 0x01) << 6) | (str[1] >> 2);
  253. key[2] = ((str[1] & 0x03) << 5) | (str[2] >> 3);
  254. key[3] = ((str[2] & 0x07) << 4) | (str[3] >> 4);
  255. key[4] = ((str[3] & 0x0F) << 3) | (str[4] >> 5);
  256. key[5] = ((str[4] & 0x1F) << 2) | (str[5] >> 6);
  257. key[6] = ((str[5] & 0x3F) << 1) | (str[6] >> 7);
  258. key[7] = str[6] & 0x7F;
  259. for (i = 0; i < 8; i++) {
  260. key[i] = (key[i] << 1);
  261. }
  262. }
  263. static void
  264. smbhash(unsigned char *out, unsigned char *in, unsigned char *key, int forw)
  265. {
  266. int i;
  267. char *outb; /* outb[64] */
  268. char *inb; /* inb[64] */
  269. char *keyb; /* keyb[64] */
  270. unsigned char key2[8];
  271. outb = kmalloc(64 * 3,GFP_KERNEL);
  272. if(outb == NULL)
  273. return;
  274. inb = outb + 64;
  275. keyb = inb + 64;
  276. str_to_key(key, key2);
  277. for (i = 0; i < 64; i++) {
  278. inb[i] = (in[i / 8] & (1 << (7 - (i % 8)))) ? 1 : 0;
  279. keyb[i] = (key2[i / 8] & (1 << (7 - (i % 8)))) ? 1 : 0;
  280. outb[i] = 0;
  281. }
  282. dohash(outb, inb, keyb, forw);
  283. for (i = 0; i < 8; i++) {
  284. out[i] = 0;
  285. }
  286. for (i = 0; i < 64; i++) {
  287. if (outb[i])
  288. out[i / 8] |= (1 << (7 - (i % 8)));
  289. }
  290. kfree(outb);
  291. }
  292. void
  293. E_P16(unsigned char *p14, unsigned char *p16)
  294. {
  295. unsigned char sp8[8] =
  296. { 0x4b, 0x47, 0x53, 0x21, 0x40, 0x23, 0x24, 0x25 };
  297. smbhash(p16, sp8, p14, 1);
  298. smbhash(p16 + 8, sp8, p14 + 7, 1);
  299. }
  300. void
  301. E_P24(unsigned char *p21, unsigned char *c8, unsigned char *p24)
  302. {
  303. smbhash(p24, c8, p21, 1);
  304. smbhash(p24 + 8, c8, p21 + 7, 1);
  305. smbhash(p24 + 16, c8, p21 + 14, 1);
  306. }
  307. #if 0 /* currently unsued */
  308. static void
  309. D_P16(unsigned char *p14, unsigned char *in, unsigned char *out)
  310. {
  311. smbhash(out, in, p14, 0);
  312. smbhash(out + 8, in + 8, p14 + 7, 0);
  313. }
  314. static void
  315. E_old_pw_hash(unsigned char *p14, unsigned char *in, unsigned char *out)
  316. {
  317. smbhash(out, in, p14, 1);
  318. smbhash(out + 8, in + 8, p14 + 7, 1);
  319. }
  320. /* these routines are currently unneeded, but may be
  321. needed later */
  322. void
  323. cred_hash1(unsigned char *out, unsigned char *in, unsigned char *key)
  324. {
  325. unsigned char buf[8];
  326. smbhash(buf, in, key, 1);
  327. smbhash(out, buf, key + 9, 1);
  328. }
  329. void
  330. cred_hash2(unsigned char *out, unsigned char *in, unsigned char *key)
  331. {
  332. unsigned char buf[8];
  333. static unsigned char key2[8];
  334. smbhash(buf, in, key, 1);
  335. key2[0] = key[7];
  336. smbhash(out, buf, key2, 1);
  337. }
  338. void
  339. cred_hash3(unsigned char *out, unsigned char *in, unsigned char *key, int forw)
  340. {
  341. static unsigned char key2[8];
  342. smbhash(out, in, key, forw);
  343. key2[0] = key[7];
  344. smbhash(out + 8, in + 8, key2, forw);
  345. }
  346. #endif /* unneeded routines */