des.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739
  1. /*
  2. * FreeSec: libcrypt for NetBSD
  3. *
  4. * Copyright (c) 1994 David Burren
  5. * All rights reserved.
  6. *
  7. * Adapted for FreeBSD-2.0 by Geoffrey M. Rehmet
  8. * this file should now *only* export crypt(), in order to make
  9. * binaries of libcrypt exportable from the USA
  10. *
  11. * Adapted for FreeBSD-4.0 by Mark R V Murray
  12. * this file should now *only* export crypt_des(), in order to make
  13. * a module that can be optionally included in libcrypt.
  14. *
  15. * Redistribution and use in source and binary forms, with or without
  16. * modification, are permitted provided that the following conditions
  17. * are met:
  18. * 1. Redistributions of source code must retain the above copyright
  19. * notice, this list of conditions and the following disclaimer.
  20. * 2. Redistributions in binary form must reproduce the above copyright
  21. * notice, this list of conditions and the following disclaimer in the
  22. * documentation and/or other materials provided with the distribution.
  23. * 3. Neither the name of the author nor the names of other contributors
  24. * may be used to endorse or promote products derived from this software
  25. * without specific prior written permission.
  26. *
  27. * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
  28. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  29. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  30. * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
  31. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  32. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  33. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  34. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  35. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  36. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  37. * SUCH DAMAGE.
  38. *
  39. * This is an original implementation of the DES and the crypt(3) interfaces
  40. * by David Burren <davidb@werj.com.au>.
  41. *
  42. * An excellent reference on the underlying algorithm (and related
  43. * algorithms) is:
  44. *
  45. * B. Schneier, Applied Cryptography: protocols, algorithms,
  46. * and source code in C, John Wiley & Sons, 1994.
  47. *
  48. * Note that in that book's description of DES the lookups for the initial,
  49. * pbox, and final permutations are inverted (this has been brought to the
  50. * attention of the author). A list of errata for this book has been
  51. * posted to the sci.crypt newsgroup by the author and is available for FTP.
  52. *
  53. * ARCHITECTURE ASSUMPTIONS:
  54. * It is assumed that the 8-byte arrays passed by reference can be
  55. * addressed as arrays of u_int32_t's (ie. the CPU is not picky about
  56. * alignment).
  57. */
  58. #include <sys/cdefs.h>
  59. #include <sys/types.h>
  60. #include <sys/param.h>
  61. #include <netinet/in.h>
  62. #include <pwd.h>
  63. #include <string.h>
  64. #include <crypt.h>
  65. #include "libcrypt.h"
  66. /* Re-entrantify me -- all this junk needs to be in
  67. * struct crypt_data to make this really reentrant... */
  68. static u_char inv_key_perm[64];
  69. static u_char inv_comp_perm[56];
  70. static u_char un_pbox[32];
  71. static u_int32_t en_keysl[16], en_keysr[16];
  72. static u_int32_t de_keysl[16], de_keysr[16];
  73. static u_int32_t ip_maskl[8][256], ip_maskr[8][256];
  74. static u_int32_t fp_maskl[8][256], fp_maskr[8][256];
  75. static u_int32_t key_perm_maskl[8][128], key_perm_maskr[8][128];
  76. static u_int32_t comp_maskl[8][128], comp_maskr[8][128];
  77. static u_int32_t saltbits;
  78. static u_int32_t old_salt;
  79. static u_int32_t old_rawkey0, old_rawkey1;
  80. /* Static stuff that stays resident and doesn't change after
  81. * being initialized, and therefore doesn't need to be made
  82. * reentrant. */
  83. static u_char init_perm[64], final_perm[64];
  84. static u_char m_sbox[4][4096];
  85. static u_int32_t psbox[4][256];
  86. /* A pile of data */
  87. static const u_char ascii64[] = "./0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
  88. static const u_char IP[64] = {
  89. 58, 50, 42, 34, 26, 18, 10, 2, 60, 52, 44, 36, 28, 20, 12, 4,
  90. 62, 54, 46, 38, 30, 22, 14, 6, 64, 56, 48, 40, 32, 24, 16, 8,
  91. 57, 49, 41, 33, 25, 17, 9, 1, 59, 51, 43, 35, 27, 19, 11, 3,
  92. 61, 53, 45, 37, 29, 21, 13, 5, 63, 55, 47, 39, 31, 23, 15, 7
  93. };
  94. static const u_char key_perm[56] = {
  95. 57, 49, 41, 33, 25, 17, 9, 1, 58, 50, 42, 34, 26, 18,
  96. 10, 2, 59, 51, 43, 35, 27, 19, 11, 3, 60, 52, 44, 36,
  97. 63, 55, 47, 39, 31, 23, 15, 7, 62, 54, 46, 38, 30, 22,
  98. 14, 6, 61, 53, 45, 37, 29, 21, 13, 5, 28, 20, 12, 4
  99. };
  100. static const u_char key_shifts[16] = {
  101. 1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1
  102. };
  103. static const u_char comp_perm[48] = {
  104. 14, 17, 11, 24, 1, 5, 3, 28, 15, 6, 21, 10,
  105. 23, 19, 12, 4, 26, 8, 16, 7, 27, 20, 13, 2,
  106. 41, 52, 31, 37, 47, 55, 30, 40, 51, 45, 33, 48,
  107. 44, 49, 39, 56, 34, 53, 46, 42, 50, 36, 29, 32
  108. };
  109. /*
  110. * No E box is used, as it's replaced by some ANDs, shifts, and ORs.
  111. */
  112. static const u_char sbox[8][64] = {
  113. {
  114. 14, 4, 13, 1, 2, 15, 11, 8, 3, 10, 6, 12, 5, 9, 0, 7,
  115. 0, 15, 7, 4, 14, 2, 13, 1, 10, 6, 12, 11, 9, 5, 3, 8,
  116. 4, 1, 14, 8, 13, 6, 2, 11, 15, 12, 9, 7, 3, 10, 5, 0,
  117. 15, 12, 8, 2, 4, 9, 1, 7, 5, 11, 3, 14, 10, 0, 6, 13
  118. },
  119. {
  120. 15, 1, 8, 14, 6, 11, 3, 4, 9, 7, 2, 13, 12, 0, 5, 10,
  121. 3, 13, 4, 7, 15, 2, 8, 14, 12, 0, 1, 10, 6, 9, 11, 5,
  122. 0, 14, 7, 11, 10, 4, 13, 1, 5, 8, 12, 6, 9, 3, 2, 15,
  123. 13, 8, 10, 1, 3, 15, 4, 2, 11, 6, 7, 12, 0, 5, 14, 9
  124. },
  125. {
  126. 10, 0, 9, 14, 6, 3, 15, 5, 1, 13, 12, 7, 11, 4, 2, 8,
  127. 13, 7, 0, 9, 3, 4, 6, 10, 2, 8, 5, 14, 12, 11, 15, 1,
  128. 13, 6, 4, 9, 8, 15, 3, 0, 11, 1, 2, 12, 5, 10, 14, 7,
  129. 1, 10, 13, 0, 6, 9, 8, 7, 4, 15, 14, 3, 11, 5, 2, 12
  130. },
  131. {
  132. 7, 13, 14, 3, 0, 6, 9, 10, 1, 2, 8, 5, 11, 12, 4, 15,
  133. 13, 8, 11, 5, 6, 15, 0, 3, 4, 7, 2, 12, 1, 10, 14, 9,
  134. 10, 6, 9, 0, 12, 11, 7, 13, 15, 1, 3, 14, 5, 2, 8, 4,
  135. 3, 15, 0, 6, 10, 1, 13, 8, 9, 4, 5, 11, 12, 7, 2, 14
  136. },
  137. {
  138. 2, 12, 4, 1, 7, 10, 11, 6, 8, 5, 3, 15, 13, 0, 14, 9,
  139. 14, 11, 2, 12, 4, 7, 13, 1, 5, 0, 15, 10, 3, 9, 8, 6,
  140. 4, 2, 1, 11, 10, 13, 7, 8, 15, 9, 12, 5, 6, 3, 0, 14,
  141. 11, 8, 12, 7, 1, 14, 2, 13, 6, 15, 0, 9, 10, 4, 5, 3
  142. },
  143. {
  144. 12, 1, 10, 15, 9, 2, 6, 8, 0, 13, 3, 4, 14, 7, 5, 11,
  145. 10, 15, 4, 2, 7, 12, 9, 5, 6, 1, 13, 14, 0, 11, 3, 8,
  146. 9, 14, 15, 5, 2, 8, 12, 3, 7, 0, 4, 10, 1, 13, 11, 6,
  147. 4, 3, 2, 12, 9, 5, 15, 10, 11, 14, 1, 7, 6, 0, 8, 13
  148. },
  149. {
  150. 4, 11, 2, 14, 15, 0, 8, 13, 3, 12, 9, 7, 5, 10, 6, 1,
  151. 13, 0, 11, 7, 4, 9, 1, 10, 14, 3, 5, 12, 2, 15, 8, 6,
  152. 1, 4, 11, 13, 12, 3, 7, 14, 10, 15, 6, 8, 0, 5, 9, 2,
  153. 6, 11, 13, 8, 1, 4, 10, 7, 9, 5, 0, 15, 14, 2, 3, 12
  154. },
  155. {
  156. 13, 2, 8, 4, 6, 15, 11, 1, 10, 9, 3, 14, 5, 0, 12, 7,
  157. 1, 15, 13, 8, 10, 3, 7, 4, 12, 5, 6, 11, 0, 14, 9, 2,
  158. 7, 11, 4, 1, 9, 12, 14, 2, 0, 6, 10, 13, 15, 3, 5, 8,
  159. 2, 1, 14, 7, 4, 10, 8, 13, 15, 12, 9, 0, 3, 5, 6, 11
  160. }
  161. };
  162. static const u_char pbox[32] = {
  163. 16, 7, 20, 21, 29, 12, 28, 17, 1, 15, 23, 26, 5, 18, 31, 10,
  164. 2, 8, 24, 14, 32, 27, 3, 9, 19, 13, 30, 6, 22, 11, 4, 25
  165. };
  166. static const u_int32_t bits32[32] =
  167. {
  168. 0x80000000, 0x40000000, 0x20000000, 0x10000000,
  169. 0x08000000, 0x04000000, 0x02000000, 0x01000000,
  170. 0x00800000, 0x00400000, 0x00200000, 0x00100000,
  171. 0x00080000, 0x00040000, 0x00020000, 0x00010000,
  172. 0x00008000, 0x00004000, 0x00002000, 0x00001000,
  173. 0x00000800, 0x00000400, 0x00000200, 0x00000100,
  174. 0x00000080, 0x00000040, 0x00000020, 0x00000010,
  175. 0x00000008, 0x00000004, 0x00000002, 0x00000001
  176. };
  177. static const u_char bits8[8] = { 0x80, 0x40, 0x20, 0x10, 0x08, 0x04, 0x02, 0x01 };
  178. static int
  179. ascii_to_bin(char ch)
  180. {
  181. if (ch > 'z')
  182. return(0);
  183. if (ch >= 'a')
  184. return(ch - 'a' + 38);
  185. if (ch > 'Z')
  186. return(0);
  187. if (ch >= 'A')
  188. return(ch - 'A' + 12);
  189. if (ch > '9')
  190. return(0);
  191. if (ch >= '.')
  192. return(ch - '.');
  193. return(0);
  194. }
  195. static void
  196. des_init(void)
  197. {
  198. static int des_initialised = 0;
  199. int i, j, b, k, inbit, obit;
  200. u_int32_t *p, *il, *ir, *fl, *fr;
  201. const u_int32_t *bits28, *bits24;
  202. u_char u_sbox[8][64];
  203. if (des_initialised==1)
  204. return;
  205. old_rawkey0 = old_rawkey1 = 0L;
  206. saltbits = 0L;
  207. old_salt = 0L;
  208. bits24 = (bits28 = bits32 + 4) + 4;
  209. /*
  210. * Invert the S-boxes, reordering the input bits.
  211. */
  212. for (i = 0; i < 8; i++)
  213. for (j = 0; j < 64; j++) {
  214. b = (j & 0x20) | ((j & 1) << 4) | ((j >> 1) & 0xf);
  215. u_sbox[i][j] = sbox[i][b];
  216. }
  217. /*
  218. * Convert the inverted S-boxes into 4 arrays of 8 bits.
  219. * Each will handle 12 bits of the S-box input.
  220. */
  221. for (b = 0; b < 4; b++)
  222. for (i = 0; i < 64; i++)
  223. for (j = 0; j < 64; j++)
  224. m_sbox[b][(i << 6) | j] =
  225. (u_char)((u_sbox[(b << 1)][i] << 4) |
  226. u_sbox[(b << 1) + 1][j]);
  227. /*
  228. * Set up the initial & final permutations into a useful form, and
  229. * initialise the inverted key permutation.
  230. */
  231. for (i = 0; i < 64; i++) {
  232. init_perm[final_perm[i] = IP[i] - 1] = (u_char)i;
  233. inv_key_perm[i] = 255;
  234. }
  235. /*
  236. * Invert the key permutation and initialise the inverted key
  237. * compression permutation.
  238. */
  239. for (i = 0; i < 56; i++) {
  240. inv_key_perm[key_perm[i] - 1] = (u_char)i;
  241. inv_comp_perm[i] = 255;
  242. }
  243. /*
  244. * Invert the key compression permutation.
  245. */
  246. for (i = 0; i < 48; i++) {
  247. inv_comp_perm[comp_perm[i] - 1] = (u_char)i;
  248. }
  249. /*
  250. * Set up the OR-mask arrays for the initial and final permutations,
  251. * and for the key initial and compression permutations.
  252. */
  253. for (k = 0; k < 8; k++) {
  254. for (i = 0; i < 256; i++) {
  255. *(il = &ip_maskl[k][i]) = 0L;
  256. *(ir = &ip_maskr[k][i]) = 0L;
  257. *(fl = &fp_maskl[k][i]) = 0L;
  258. *(fr = &fp_maskr[k][i]) = 0L;
  259. for (j = 0; j < 8; j++) {
  260. inbit = 8 * k + j;
  261. if (i & bits8[j]) {
  262. if ((obit = init_perm[inbit]) < 32)
  263. *il |= bits32[obit];
  264. else
  265. *ir |= bits32[obit-32];
  266. if ((obit = final_perm[inbit]) < 32)
  267. *fl |= bits32[obit];
  268. else
  269. *fr |= bits32[obit - 32];
  270. }
  271. }
  272. }
  273. for (i = 0; i < 128; i++) {
  274. *(il = &key_perm_maskl[k][i]) = 0L;
  275. *(ir = &key_perm_maskr[k][i]) = 0L;
  276. for (j = 0; j < 7; j++) {
  277. inbit = 8 * k + j;
  278. if (i & bits8[j + 1]) {
  279. if ((obit = inv_key_perm[inbit]) == 255)
  280. continue;
  281. if (obit < 28)
  282. *il |= bits28[obit];
  283. else
  284. *ir |= bits28[obit - 28];
  285. }
  286. }
  287. *(il = &comp_maskl[k][i]) = 0L;
  288. *(ir = &comp_maskr[k][i]) = 0L;
  289. for (j = 0; j < 7; j++) {
  290. inbit = 7 * k + j;
  291. if (i & bits8[j + 1]) {
  292. if ((obit=inv_comp_perm[inbit]) == 255)
  293. continue;
  294. if (obit < 24)
  295. *il |= bits24[obit];
  296. else
  297. *ir |= bits24[obit - 24];
  298. }
  299. }
  300. }
  301. }
  302. /*
  303. * Invert the P-box permutation, and convert into OR-masks for
  304. * handling the output of the S-box arrays setup above.
  305. */
  306. for (i = 0; i < 32; i++)
  307. un_pbox[pbox[i] - 1] = (u_char)i;
  308. for (b = 0; b < 4; b++)
  309. for (i = 0; i < 256; i++) {
  310. *(p = &psbox[b][i]) = 0L;
  311. for (j = 0; j < 8; j++) {
  312. if (i & bits8[j])
  313. *p |= bits32[un_pbox[8 * b + j]];
  314. }
  315. }
  316. des_initialised = 1;
  317. }
  318. static void
  319. setup_salt(u_int32_t salt)
  320. {
  321. u_int32_t obit, saltbit;
  322. int i;
  323. if (salt == old_salt)
  324. return;
  325. old_salt = salt;
  326. saltbits = 0L;
  327. saltbit = 1;
  328. obit = 0x800000;
  329. for (i = 0; i < 24; i++) {
  330. if (salt & saltbit)
  331. saltbits |= obit;
  332. saltbit <<= 1;
  333. obit >>= 1;
  334. }
  335. }
  336. static void
  337. des_setkey(const char *key)
  338. {
  339. u_int32_t k0, k1, rawkey0, rawkey1;
  340. int shifts, round;
  341. des_init();
  342. rawkey0 = ntohl(*(const u_int32_t *) key);
  343. rawkey1 = ntohl(*(const u_int32_t *) (key + 4));
  344. if ((rawkey0 | rawkey1)
  345. && rawkey0 == old_rawkey0
  346. && rawkey1 == old_rawkey1) {
  347. /*
  348. * Already setup for this key.
  349. * This optimisation fails on a zero key (which is weak and
  350. * has bad parity anyway) in order to simplify the starting
  351. * conditions.
  352. */
  353. return;
  354. }
  355. old_rawkey0 = rawkey0;
  356. old_rawkey1 = rawkey1;
  357. /*
  358. * Do key permutation and split into two 28-bit subkeys.
  359. */
  360. k0 = key_perm_maskl[0][rawkey0 >> 25]
  361. | key_perm_maskl[1][(rawkey0 >> 17) & 0x7f]
  362. | key_perm_maskl[2][(rawkey0 >> 9) & 0x7f]
  363. | key_perm_maskl[3][(rawkey0 >> 1) & 0x7f]
  364. | key_perm_maskl[4][rawkey1 >> 25]
  365. | key_perm_maskl[5][(rawkey1 >> 17) & 0x7f]
  366. | key_perm_maskl[6][(rawkey1 >> 9) & 0x7f]
  367. | key_perm_maskl[7][(rawkey1 >> 1) & 0x7f];
  368. k1 = key_perm_maskr[0][rawkey0 >> 25]
  369. | key_perm_maskr[1][(rawkey0 >> 17) & 0x7f]
  370. | key_perm_maskr[2][(rawkey0 >> 9) & 0x7f]
  371. | key_perm_maskr[3][(rawkey0 >> 1) & 0x7f]
  372. | key_perm_maskr[4][rawkey1 >> 25]
  373. | key_perm_maskr[5][(rawkey1 >> 17) & 0x7f]
  374. | key_perm_maskr[6][(rawkey1 >> 9) & 0x7f]
  375. | key_perm_maskr[7][(rawkey1 >> 1) & 0x7f];
  376. /*
  377. * Rotate subkeys and do compression permutation.
  378. */
  379. shifts = 0;
  380. for (round = 0; round < 16; round++) {
  381. u_int32_t t0, t1;
  382. shifts += key_shifts[round];
  383. t0 = (k0 << shifts) | (k0 >> (28 - shifts));
  384. t1 = (k1 << shifts) | (k1 >> (28 - shifts));
  385. de_keysl[15 - round] =
  386. en_keysl[round] = comp_maskl[0][(t0 >> 21) & 0x7f]
  387. | comp_maskl[1][(t0 >> 14) & 0x7f]
  388. | comp_maskl[2][(t0 >> 7) & 0x7f]
  389. | comp_maskl[3][t0 & 0x7f]
  390. | comp_maskl[4][(t1 >> 21) & 0x7f]
  391. | comp_maskl[5][(t1 >> 14) & 0x7f]
  392. | comp_maskl[6][(t1 >> 7) & 0x7f]
  393. | comp_maskl[7][t1 & 0x7f];
  394. de_keysr[15 - round] =
  395. en_keysr[round] = comp_maskr[0][(t0 >> 21) & 0x7f]
  396. | comp_maskr[1][(t0 >> 14) & 0x7f]
  397. | comp_maskr[2][(t0 >> 7) & 0x7f]
  398. | comp_maskr[3][t0 & 0x7f]
  399. | comp_maskr[4][(t1 >> 21) & 0x7f]
  400. | comp_maskr[5][(t1 >> 14) & 0x7f]
  401. | comp_maskr[6][(t1 >> 7) & 0x7f]
  402. | comp_maskr[7][t1 & 0x7f];
  403. }
  404. }
  405. static int
  406. do_des( u_int32_t l_in, u_int32_t r_in, u_int32_t *l_out, u_int32_t *r_out, int count)
  407. {
  408. /* l_in, r_in, l_out, and r_out are in pseudo-"big-endian" format. */
  409. u_int32_t l, r, *kl, *kr, *kl1, *kr1;
  410. u_int32_t f, r48l, r48r;
  411. int round;
  412. if (count == 0) {
  413. return 1;
  414. }
  415. if (count > 0) {
  416. /* Encrypting */
  417. kl1 = en_keysl;
  418. kr1 = en_keysr;
  419. } else {
  420. /* Decrypting */
  421. count = -count;
  422. kl1 = de_keysl;
  423. kr1 = de_keysr;
  424. }
  425. /* Do initial permutation (IP). */
  426. l = ip_maskl[0][l_in >> 24]
  427. | ip_maskl[1][(l_in >> 16) & 0xff]
  428. | ip_maskl[2][(l_in >> 8) & 0xff]
  429. | ip_maskl[3][l_in & 0xff]
  430. | ip_maskl[4][r_in >> 24]
  431. | ip_maskl[5][(r_in >> 16) & 0xff]
  432. | ip_maskl[6][(r_in >> 8) & 0xff]
  433. | ip_maskl[7][r_in & 0xff];
  434. r = ip_maskr[0][l_in >> 24]
  435. | ip_maskr[1][(l_in >> 16) & 0xff]
  436. | ip_maskr[2][(l_in >> 8) & 0xff]
  437. | ip_maskr[3][l_in & 0xff]
  438. | ip_maskr[4][r_in >> 24]
  439. | ip_maskr[5][(r_in >> 16) & 0xff]
  440. | ip_maskr[6][(r_in >> 8) & 0xff]
  441. | ip_maskr[7][r_in & 0xff];
  442. while (count--) {
  443. /* Do each round. */
  444. kl = kl1;
  445. kr = kr1;
  446. round = 16;
  447. do {
  448. /* Expand R to 48 bits (simulate the E-box). */
  449. r48l = ((r & 0x00000001) << 23)
  450. | ((r & 0xf8000000) >> 9)
  451. | ((r & 0x1f800000) >> 11)
  452. | ((r & 0x01f80000) >> 13)
  453. | ((r & 0x001f8000) >> 15);
  454. r48r = ((r & 0x0001f800) << 7)
  455. | ((r & 0x00001f80) << 5)
  456. | ((r & 0x000001f8) << 3)
  457. | ((r & 0x0000001f) << 1)
  458. | ((r & 0x80000000) >> 31);
  459. /*
  460. * Do salting for crypt() and friends, and
  461. * XOR with the permuted key.
  462. */
  463. f = (r48l ^ r48r) & saltbits;
  464. r48l ^= f ^ *kl++;
  465. r48r ^= f ^ *kr++;
  466. /*
  467. * Do sbox lookups (which shrink it back to 32 bits)
  468. * and do the pbox permutation at the same time.
  469. */
  470. f = psbox[0][m_sbox[0][r48l >> 12]]
  471. | psbox[1][m_sbox[1][r48l & 0xfff]]
  472. | psbox[2][m_sbox[2][r48r >> 12]]
  473. | psbox[3][m_sbox[3][r48r & 0xfff]];
  474. /* Now that we've permuted things, complete f(). */
  475. f ^= l;
  476. l = r;
  477. r = f;
  478. } while (--round);
  479. r = l;
  480. l = f;
  481. }
  482. /* Do final permutation (inverse of IP). */
  483. *l_out = fp_maskl[0][l >> 24]
  484. | fp_maskl[1][(l >> 16) & 0xff]
  485. | fp_maskl[2][(l >> 8) & 0xff]
  486. | fp_maskl[3][l & 0xff]
  487. | fp_maskl[4][r >> 24]
  488. | fp_maskl[5][(r >> 16) & 0xff]
  489. | fp_maskl[6][(r >> 8) & 0xff]
  490. | fp_maskl[7][r & 0xff];
  491. *r_out = fp_maskr[0][l >> 24]
  492. | fp_maskr[1][(l >> 16) & 0xff]
  493. | fp_maskr[2][(l >> 8) & 0xff]
  494. | fp_maskr[3][l & 0xff]
  495. | fp_maskr[4][r >> 24]
  496. | fp_maskr[5][(r >> 16) & 0xff]
  497. | fp_maskr[6][(r >> 8) & 0xff]
  498. | fp_maskr[7][r & 0xff];
  499. return(0);
  500. }
  501. #if 0
  502. static int
  503. des_cipher(const char *in, char *out, u_int32_t salt, int count)
  504. {
  505. u_int32_t l_out, r_out, rawl, rawr;
  506. int retval;
  507. union {
  508. u_int32_t *ui32;
  509. const char *c;
  510. } trans;
  511. des_init();
  512. setup_salt(salt);
  513. trans.c = in;
  514. rawl = ntohl(*trans.ui32++);
  515. rawr = ntohl(*trans.ui32);
  516. retval = do_des(rawl, rawr, &l_out, &r_out, count);
  517. trans.c = out;
  518. *trans.ui32++ = htonl(l_out);
  519. *trans.ui32 = htonl(r_out);
  520. return(retval);
  521. }
  522. #endif
  523. void
  524. setkey(const char *key)
  525. {
  526. int i, j;
  527. u_int32_t packed_keys[2];
  528. u_char *p;
  529. p = (u_char *) packed_keys;
  530. for (i = 0; i < 8; i++) {
  531. p[i] = 0;
  532. for (j = 0; j < 8; j++)
  533. if (*key++ & 1)
  534. p[i] |= bits8[j];
  535. }
  536. des_setkey((char *)p);
  537. }
  538. void
  539. encrypt(char *block, int flag)
  540. {
  541. u_int32_t io[2];
  542. u_char *p;
  543. int i, j;
  544. des_init();
  545. setup_salt(0L);
  546. p = (u_char*)block;
  547. for (i = 0; i < 2; i++) {
  548. io[i] = 0L;
  549. for (j = 0; j < 32; j++)
  550. if (*p++ & 1)
  551. io[i] |= bits32[j];
  552. }
  553. do_des(io[0], io[1], io, io + 1, flag ? -1 : 1);
  554. for (i = 0; i < 2; i++)
  555. for (j = 0; j < 32; j++)
  556. block[(i << 5) | j] = (io[i] & bits32[j]) ? 1 : 0;
  557. }
  558. char *__des_crypt(const unsigned char *key, const unsigned char *setting)
  559. {
  560. u_int32_t count, salt, l, r0, r1, keybuf[2];
  561. u_char *p, *q;
  562. static char output[21];
  563. des_init();
  564. /*
  565. * Copy the key, shifting each character up by one bit
  566. * and padding with zeros.
  567. */
  568. q = (u_char *)keybuf;
  569. while (q - (u_char *)keybuf - 8) {
  570. *q++ = *key << 1;
  571. if (*(q - 1))
  572. key++;
  573. }
  574. des_setkey((char *)keybuf);
  575. #if 0
  576. if (*setting == _PASSWORD_EFMT1) {
  577. int i;
  578. /*
  579. * "new"-style:
  580. * setting - underscore, 4 bytes of count, 4 bytes of salt
  581. * key - unlimited characters
  582. */
  583. for (i = 1, count = 0L; i < 5; i++)
  584. count |= ascii_to_bin(setting[i]) << ((i - 1) * 6);
  585. for (i = 5, salt = 0L; i < 9; i++)
  586. salt |= ascii_to_bin(setting[i]) << ((i - 5) * 6);
  587. while (*key) {
  588. /*
  589. * Encrypt the key with itself.
  590. */
  591. if (des_cipher((char *)keybuf, (char *)keybuf, 0L, 1))
  592. return(NULL);
  593. /*
  594. * And XOR with the next 8 characters of the key.
  595. */
  596. q = (u_char *)keybuf;
  597. while (q - (u_char *)keybuf - 8 && *key)
  598. *q++ ^= *key++ << 1;
  599. des_setkey((char *)keybuf);
  600. }
  601. strncpy(output, setting, 9);
  602. /*
  603. * Double check that we weren't given a short setting.
  604. * If we were, the above code will probably have created
  605. * wierd values for count and salt, but we don't really care.
  606. * Just make sure the output string doesn't have an extra
  607. * NUL in it.
  608. */
  609. output[9] = '\0';
  610. p = (u_char *)output + strlen(output);
  611. } else
  612. #endif
  613. {
  614. /*
  615. * "old"-style:
  616. * setting - 2 bytes of salt
  617. * key - up to 8 characters
  618. */
  619. count = 25;
  620. salt = (ascii_to_bin(setting[1]) << 6)
  621. | ascii_to_bin(setting[0]);
  622. output[0] = setting[0];
  623. /*
  624. * If the encrypted password that the salt was extracted from
  625. * is only 1 character long, the salt will be corrupted. We
  626. * need to ensure that the output string doesn't have an extra
  627. * NUL in it!
  628. */
  629. output[1] = setting[1] ? setting[1] : output[0];
  630. p = (u_char *)output + 2;
  631. }
  632. setup_salt(salt);
  633. /*
  634. * Do it.
  635. */
  636. if (do_des(0L, 0L, &r0, &r1, (int)count))
  637. return(NULL);
  638. /*
  639. * Now encode the result...
  640. */
  641. l = (r0 >> 8);
  642. *p++ = ascii64[(l >> 18) & 0x3f];
  643. *p++ = ascii64[(l >> 12) & 0x3f];
  644. *p++ = ascii64[(l >> 6) & 0x3f];
  645. *p++ = ascii64[l & 0x3f];
  646. l = (r0 << 16) | ((r1 >> 16) & 0xffff);
  647. *p++ = ascii64[(l >> 18) & 0x3f];
  648. *p++ = ascii64[(l >> 12) & 0x3f];
  649. *p++ = ascii64[(l >> 6) & 0x3f];
  650. *p++ = ascii64[l & 0x3f];
  651. l = r1 << 2;
  652. *p++ = ascii64[(l >> 12) & 0x3f];
  653. *p++ = ascii64[(l >> 6) & 0x3f];
  654. *p++ = ascii64[l & 0x3f];
  655. *p = 0;
  656. return(output);
  657. }