des.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357
  1. /* vi: set sw=4 ts=4: */
  2. /*
  3. * The one and only crypt(3) function.
  4. *
  5. * This source code is derived from Minix's pwdauth.c, which was based
  6. * on Andy Tanenbaum's book "Computer Networks", and then rewritten in
  7. * C by Kees J. Bot, 7 Feb 1994. This code was ported from Minix to
  8. * uClibc on June 28, 2001 by Manuel Novoa III, and then reshuffled to
  9. * be reentrant by Erik Andersen <andersen@lineo.com> on June 28, 2001.
  10. *
  11. * This program is free software; you can redistribute it and/or modify it
  12. * under the terms of the GNU Library General Public License as published by
  13. * the Free Software Foundation; either version 2 of the License, or (at your
  14. * option) any later version.
  15. *
  16. * This program is distributed in the hope that it will be useful, but WITHOUT
  17. * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  18. * FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public License
  19. * for more details.
  20. *
  21. * You should have received a copy of the GNU Library General Public License
  22. * along with this program; if not, write to the Free Software Foundation,
  23. * Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  24. *
  25. * Original copyright notice is retained at the end of this file.
  26. *
  27. */
  28. /* This program gets as input the key and salt arguments of the crypt(3)
  29. * function as two null terminated strings. The crypt result is output as
  30. * one null terminated string. Input and output must be <= 1024 characters.
  31. * The exit code will be 1 on any error.
  32. *
  33. * If the key has the form '##name' then the key will be encrypted and the
  34. * result checked to be equal to the encrypted password in the shadow password
  35. * file. If equal than '##name' will be returned, otherwise exit code 2.
  36. *
  37. * Otherwise the key will be encrypted normally and the result returned.
  38. *
  39. * As a special case, anything matches a null encrypted password to allow
  40. * a no-password login.
  41. */
  42. #include <string.h>
  43. #include <crypt.h>
  44. extern char * md5_crypt_r( const char *pw, const char *salt, struct crypt_data * data);
  45. static const struct ordering InitialTr = { {
  46. 58,50,42,34,26,18,10, 2,60,52,44,36,28,20,12, 4,
  47. 62,54,46,38,30,22,14, 6,64,56,48,40,32,24,16, 8,
  48. 57,49,41,33,25,17, 9, 1,59,51,43,35,27,19,11, 3,
  49. 61,53,45,37,29,21,13, 5,63,55,47,39,31,23,15, 7,
  50. } };
  51. static const struct ordering FinalTr = { {
  52. 40, 8,48,16,56,24,64,32,39, 7,47,15,55,23,63,31,
  53. 38, 6,46,14,54,22,62,30,37, 5,45,13,53,21,61,29,
  54. 36, 4,44,12,52,20,60,28,35, 3,43,11,51,19,59,27,
  55. 34, 2,42,10,50,18,58,26,33, 1,41, 9,49,17,57,25,
  56. } };
  57. static const struct ordering swap = { {
  58. 33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,
  59. 49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,
  60. 1, 2, 3, 4, 5, 6, 7, 8, 9,10,11,12,13,14,15,16,
  61. 17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,
  62. } };
  63. static const struct ordering KeyTr1 = { {
  64. 57,49,41,33,25,17, 9, 1,58,50,42,34,26,18,
  65. 10, 2,59,51,43,35,27,19,11, 3,60,52,44,36,
  66. 63,55,47,39,31,23,15, 7,62,54,46,38,30,22,
  67. 14, 6,61,53,45,37,29,21,13, 5,28,20,12, 4,
  68. } };
  69. static const struct ordering KeyTr2 = { {
  70. 14,17,11,24, 1, 5, 3,28,15, 6,21,10,
  71. 23,19,12, 4,26, 8,16, 7,27,20,13, 2,
  72. 41,52,31,37,47,55,30,40,51,45,33,48,
  73. 44,49,39,56,34,53,46,42,50,36,29,32,
  74. } };
  75. static const struct ordering etr = { {
  76. 32, 1, 2, 3, 4, 5, 4, 5, 6, 7, 8, 9,
  77. 8, 9,10,11,12,13,12,13,14,15,16,17,
  78. 16,17,18,19,20,21,20,21,22,23,24,25,
  79. 24,25,26,27,28,29,28,29,30,31,32, 1,
  80. } };
  81. static const struct ordering ptr = { {
  82. 16, 7,20,21,29,12,28,17, 1,15,23,26, 5,18,31,10,
  83. 2, 8,24,14,32,27, 3, 9,19,13,30, 6,22,11, 4,25,
  84. } };
  85. static const unsigned char s_boxes[8][64] = {
  86. { 14, 4,13, 1, 2,15,11, 8, 3,10, 6,12, 5, 9, 0, 7,
  87. 0,15, 7, 4,14, 2,13, 1,10, 6,12,11, 9, 5, 3, 8,
  88. 4, 1,14, 8,13, 6, 2,11,15,12, 9, 7, 3,10, 5, 0,
  89. 15,12, 8, 2, 4, 9, 1, 7, 5,11, 3,14,10, 0, 6,13,
  90. },
  91. { 15, 1, 8,14, 6,11, 3, 4, 9, 7, 2,13,12, 0, 5,10,
  92. 3,13, 4, 7,15, 2, 8,14,12, 0, 1,10, 6, 9,11, 5,
  93. 0,14, 7,11,10, 4,13, 1, 5, 8,12, 6, 9, 3, 2,15,
  94. 13, 8,10, 1, 3,15, 4, 2,11, 6, 7,12, 0, 5,14, 9,
  95. },
  96. { 10, 0, 9,14, 6, 3,15, 5, 1,13,12, 7,11, 4, 2, 8,
  97. 13, 7, 0, 9, 3, 4, 6,10, 2, 8, 5,14,12,11,15, 1,
  98. 13, 6, 4, 9, 8,15, 3, 0,11, 1, 2,12, 5,10,14, 7,
  99. 1,10,13, 0, 6, 9, 8, 7, 4,15,14, 3,11, 5, 2,12,
  100. },
  101. { 7,13,14, 3, 0, 6, 9,10, 1, 2, 8, 5,11,12, 4,15,
  102. 13, 8,11, 5, 6,15, 0, 3, 4, 7, 2,12, 1,10,14, 9,
  103. 10, 6, 9, 0,12,11, 7,13,15, 1, 3,14, 5, 2, 8, 4,
  104. 3,15, 0, 6,10, 1,13, 8, 9, 4, 5,11,12, 7, 2,14,
  105. },
  106. { 2,12, 4, 1, 7,10,11, 6, 8, 5, 3,15,13, 0,14, 9,
  107. 14,11, 2,12, 4, 7,13, 1, 5, 0,15,10, 3, 9, 8, 6,
  108. 4, 2, 1,11,10,13, 7, 8,15, 9,12, 5, 6, 3, 0,14,
  109. 11, 8,12, 7, 1,14, 2,13, 6,15, 0, 9,10, 4, 5, 3,
  110. },
  111. { 12, 1,10,15, 9, 2, 6, 8, 0,13, 3, 4,14, 7, 5,11,
  112. 10,15, 4, 2, 7,12, 9, 5, 6, 1,13,14, 0,11, 3, 8,
  113. 9,14,15, 5, 2, 8,12, 3, 7, 0, 4,10, 1,13,11, 6,
  114. 4, 3, 2,12, 9, 5,15,10,11,14, 1, 7, 6, 0, 8,13,
  115. },
  116. { 4,11, 2,14,15, 0, 8,13, 3,12, 9, 7, 5,10, 6, 1,
  117. 13, 0,11, 7, 4, 9, 1,10,14, 3, 5,12, 2,15, 8, 6,
  118. 1, 4,11,13,12, 3, 7,14,10,15, 6, 8, 0, 5, 9, 2,
  119. 6,11,13, 8, 1, 4,10, 7, 9, 5, 0,15,14, 2, 3,12,
  120. },
  121. { 13, 2, 8, 4, 6,15,11, 1,10, 9, 3,14, 5, 0,12, 7,
  122. 1,15,13, 8,10, 3, 7, 4,12, 5, 6,11, 0,14, 9, 2,
  123. 7,11, 4, 1, 9,12,14, 2, 0, 6,10,13,15, 3, 5, 8,
  124. 2, 1,14, 7, 4,10, 8,13,15,12, 9, 0, 3, 5, 6,11,
  125. },
  126. };
  127. static const int rots[] = {
  128. 1,1,2,2,2,2,2,2,1,2,2,2,2,2,2,1,
  129. };
  130. static void transpose(struct block *data, const struct ordering *t, int n)
  131. {
  132. struct block x;
  133. x = *data;
  134. while (n-- > 0) {
  135. data->b_data[n] = x.b_data[t->o_data[n] - 1];
  136. }
  137. }
  138. static void rotate(struct block *key)
  139. {
  140. unsigned char *p = key->b_data;
  141. unsigned char *ep = &(key->b_data[55]);
  142. int data0 = key->b_data[0], data28 = key->b_data[28];
  143. while (p++ < ep) *(p-1) = *p;
  144. key->b_data[27] = data0;
  145. key->b_data[55] = data28;
  146. }
  147. static void f(int i, struct block *key, struct block *a, struct block *x, struct crypt_data *data)
  148. {
  149. struct block e, ikey, y;
  150. int k;
  151. unsigned char *p, *q, *r;
  152. e = *a;
  153. transpose(&e, data->EP, 48);
  154. for (k = rots[i]; k; k--) rotate(key);
  155. ikey = *key;
  156. transpose(&ikey, &KeyTr2, 48);
  157. p = &(y.b_data[48]);
  158. q = &(e.b_data[48]);
  159. r = &(ikey.b_data[48]);
  160. while (p > y.b_data) {
  161. *--p = *--q ^ *--r;
  162. }
  163. q = x->b_data;
  164. for (k = 0; k < 8; k++) {
  165. int xb, r;
  166. r = *p++ << 5;
  167. r += *p++ << 3;
  168. r += *p++ << 2;
  169. r += *p++ << 1;
  170. r += *p++;
  171. r += *p++ << 4;
  172. xb = s_boxes[k][r];
  173. *q++ = (xb >> 3) & 1;
  174. *q++ = (xb>>2) & 1;
  175. *q++ = (xb>>1) & 1;
  176. *q++ = (xb & 1);
  177. }
  178. transpose(x, &ptr, 32);
  179. }
  180. void setkey_r(const char *k, struct crypt_data *data)
  181. {
  182. struct block *key = &(data->key);
  183. memcpy(key, k, (sizeof(struct block)));
  184. transpose(key, &KeyTr1, 56);
  185. }
  186. extern void encrypt_r(char *blck, int edflag, struct crypt_data *data)
  187. {
  188. struct block *key = &(data->key);
  189. struct block *p = (struct block *) blck;
  190. int i;
  191. transpose(p, &InitialTr, 64);
  192. for (i = 15; i>= 0; i--) {
  193. int j = edflag ? i : 15 - i;
  194. int k;
  195. struct block b, x;
  196. b = *p;
  197. for (k = 31; k >= 0; k--) {
  198. p->b_data[k] = b.b_data[k + 32];
  199. }
  200. f(j, key, p, &x, data);
  201. for (k = 31; k >= 0; k--) {
  202. p->b_data[k+32] = b.b_data[k] ^ x.b_data[k];
  203. }
  204. }
  205. transpose(p, &swap, 64);
  206. transpose(p, &FinalTr, 64);
  207. }
  208. extern char *crypt_r(const char *pw, const char *salt, struct crypt_data *data)
  209. {
  210. char pwb[66];
  211. char *cp;
  212. static char result[16];
  213. char *p = pwb;
  214. struct ordering new_etr;
  215. int i;
  216. /* First, check if we are supposed to be using the MD5 replacement
  217. * instead of DES... */
  218. if (salt[0]=='$' && salt[1]=='1' && salt[2]=='$')
  219. return md5_crypt_r(pw, salt, data);
  220. data->EP = &etr;
  221. while (*pw && p < &pwb[64]) {
  222. int j = 7;
  223. while (j--) {
  224. *p++ = (*pw >> j) & 01;
  225. }
  226. pw++;
  227. *p++ = 0;
  228. }
  229. while (p < &pwb[64]) *p++ = 0;
  230. setkey_r(p = pwb, data);
  231. while (p < &pwb[66]) *p++ = 0;
  232. new_etr = etr;
  233. data->EP = &new_etr;
  234. if (salt[0] == 0 || salt[1] == 0) salt = "**";
  235. for (i = 0; i < 2; i++) {
  236. char c = *salt++;
  237. int j;
  238. result[i] = c;
  239. if ( c > 'Z') c -= 6 + 7 + '.'; /* c was a lower case letter */
  240. else if ( c > '9') c -= 7 + '.';/* c was upper case letter */
  241. else c -= '.'; /* c was digit, '.' or '/'. */
  242. /* now, 0 <= c <= 63 */
  243. for (j = 0; j < 6; j++) {
  244. if ((c >> j) & 01) {
  245. int t = 6*i + j;
  246. int temp = new_etr.o_data[t];
  247. new_etr.o_data[t] = new_etr.o_data[t+24];
  248. new_etr.o_data[t+24] = temp;
  249. }
  250. }
  251. }
  252. if (result[1] == 0) result[1] = result[0];
  253. for (i = 0; i < 25; i++) encrypt_r(pwb,0, data);
  254. data->EP = &etr;
  255. p = pwb;
  256. cp = result+2;
  257. while (p < &pwb[66]) {
  258. int c = 0;
  259. int j = 6;
  260. while (j--) {
  261. c <<= 1;
  262. c |= *p++;
  263. }
  264. c += '.'; /* becomes >= '.' */
  265. if (c > '9') c += 7; /* not in [./0-9], becomes upper */
  266. if (c > 'Z') c += 6; /* not in [A-Z], becomes lower */
  267. *cp++ = c;
  268. }
  269. *cp = 0;
  270. return result;
  271. }
  272. /*
  273. * Copyright (c) 1987,1997, Prentice Hall
  274. * All rights reserved.
  275. *
  276. * Redistribution and use of the MINIX operating system in source and
  277. * binary forms, with or without modification, are permitted provided
  278. * that the following conditions are met:
  279. *
  280. * Redistributions of source code must retain the above copyright
  281. * notice, this list of conditions and the following disclaimer.
  282. *
  283. * Redistributions in binary form must reproduce the above
  284. * copyright notice, this list of conditions and the following
  285. * disclaimer in the documentation and/or other materials provided
  286. * with the distribution.
  287. *
  288. * Neither the name of Prentice Hall nor the names of the software
  289. * authors or contributors may be used to endorse or promote
  290. * products derived from this software without specific prior
  291. * written permission.
  292. *
  293. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS, AUTHORS, AND
  294. * CONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
  295. * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
  296. * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
  297. * IN NO EVENT SHALL PRENTICE HALL OR ANY AUTHORS OR CONTRIBUTORS BE
  298. * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  299. * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  300. * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
  301. * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
  302. * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
  303. * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
  304. * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  305. *
  306. */