]>
Commit | Line | Data |
---|---|---|
3c0ef626 | 1 | /* |
2 | * ---------------------------------------------------------------------------- | |
3 | * "THE BEER-WARE LICENSE" (Revision 42): | |
cdd66111 | 4 | * <phk@login.dknet.dk> wrote this file. As long as you retain this |
5 | * notice you can do whatever you want with this stuff. If we meet some | |
6 | * day, and you think this stuff is worth it, you can buy me a beer in | |
0fff78ff | 7 | * return. Poul-Henning Kamp |
3c0ef626 | 8 | * ---------------------------------------------------------------------------- |
9 | */ | |
10 | ||
3c0ef626 | 11 | #include "includes.h" |
12 | ||
3c0ef626 | 13 | #if defined(HAVE_MD5_PASSWORDS) && !defined(HAVE_MD5_CRYPT) |
3c0ef626 | 14 | #include <openssl/md5.h> |
15 | ||
0fff78ff | 16 | RCSID("$Id$"); |
17 | ||
18 | /* 0 ... 63 => ascii - 64 */ | |
19 | static unsigned char itoa64[] = | |
20 | "./0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz"; | |
3c0ef626 | 21 | |
0fff78ff | 22 | static char *magic = "$1$"; |
3c0ef626 | 23 | |
0fff78ff | 24 | static char * |
25 | to64(unsigned long v, int n) | |
3c0ef626 | 26 | { |
0fff78ff | 27 | static char buf[5]; |
28 | char *s = buf; | |
29 | ||
30 | if (n > 4) | |
31 | return (NULL); | |
32 | ||
33 | memset(buf, '\0', sizeof(buf)); | |
3c0ef626 | 34 | while (--n >= 0) { |
35 | *s++ = itoa64[v&0x3f]; | |
36 | v >>= 6; | |
37 | } | |
cdd66111 | 38 | |
0fff78ff | 39 | return (buf); |
3c0ef626 | 40 | } |
41 | ||
42 | int | |
43 | is_md5_salt(const char *salt) | |
44 | { | |
0fff78ff | 45 | return (strncmp(salt, magic, strlen(magic)) == 0); |
3c0ef626 | 46 | } |
47 | ||
3c0ef626 | 48 | char * |
49 | md5_crypt(const char *pw, const char *salt) | |
50 | { | |
0fff78ff | 51 | static char passwd[120], salt_copy[9], *p; |
52 | static const char *sp, *ep; | |
53 | unsigned char final[16]; | |
54 | int sl, pl, i, j; | |
55 | MD5_CTX ctx, ctx1; | |
3c0ef626 | 56 | unsigned long l; |
57 | ||
58 | /* Refine the Salt first */ | |
59 | sp = salt; | |
60 | ||
61 | /* If it starts with the magic string, then skip that */ | |
0fff78ff | 62 | if(strncmp(sp, magic, strlen(magic)) == 0) |
3c0ef626 | 63 | sp += strlen(magic); |
64 | ||
65 | /* It stops at the first '$', max 8 chars */ | |
0fff78ff | 66 | for (ep = sp; *ep != '$'; ep++) { |
67 | if (*ep == '\0' || ep >= (sp + 8)) | |
68 | return (NULL); | |
69 | } | |
3c0ef626 | 70 | |
71 | /* get the length of the true salt */ | |
72 | sl = ep - sp; | |
73 | ||
0fff78ff | 74 | /* Stash the salt */ |
75 | memcpy(salt_copy, sp, sl); | |
76 | salt_copy[sl] = '\0'; | |
77 | ||
3c0ef626 | 78 | MD5_Init(&ctx); |
79 | ||
80 | /* The password first, since that is what is most unknown */ | |
0fff78ff | 81 | MD5_Update(&ctx, pw, strlen(pw)); |
3c0ef626 | 82 | |
83 | /* Then our magic string */ | |
0fff78ff | 84 | MD5_Update(&ctx, magic, strlen(magic)); |
3c0ef626 | 85 | |
86 | /* Then the raw salt */ | |
0fff78ff | 87 | MD5_Update(&ctx, sp, sl); |
3c0ef626 | 88 | |
0fff78ff | 89 | /* Then just as many characters of the MD5(pw, salt, pw) */ |
3c0ef626 | 90 | MD5_Init(&ctx1); |
0fff78ff | 91 | MD5_Update(&ctx1, pw, strlen(pw)); |
92 | MD5_Update(&ctx1, sp, sl); | |
93 | MD5_Update(&ctx1, pw, strlen(pw)); | |
94 | MD5_Final(final, &ctx1); | |
95 | ||
3c0ef626 | 96 | for(pl = strlen(pw); pl > 0; pl -= 16) |
0fff78ff | 97 | MD5_Update(&ctx, final, pl > 16 ? 16 : pl); |
3c0ef626 | 98 | |
99 | /* Don't leave anything around in vm they could use. */ | |
0fff78ff | 100 | memset(final, '\0', sizeof final); |
3c0ef626 | 101 | |
102 | /* Then something really weird... */ | |
0fff78ff | 103 | for (j = 0, i = strlen(pw); i != 0; i >>= 1) |
104 | if (i & 1) | |
105 | MD5_Update(&ctx, final + j, 1); | |
3c0ef626 | 106 | else |
0fff78ff | 107 | MD5_Update(&ctx, pw + j, 1); |
3c0ef626 | 108 | |
109 | /* Now make the output string */ | |
0fff78ff | 110 | snprintf(passwd, sizeof(passwd), "%s%s$", magic, salt_copy); |
3c0ef626 | 111 | |
0fff78ff | 112 | MD5_Final(final, &ctx); |
3c0ef626 | 113 | |
114 | /* | |
115 | * and now, just to make sure things don't run too fast | |
116 | * On a 60 Mhz Pentium this takes 34 msec, so you would | |
117 | * need 30 seconds to build a 1000 entry dictionary... | |
118 | */ | |
0fff78ff | 119 | for(i = 0; i < 1000; i++) { |
3c0ef626 | 120 | MD5_Init(&ctx1); |
0fff78ff | 121 | if (i & 1) |
122 | MD5_Update(&ctx1, pw, strlen(pw)); | |
3c0ef626 | 123 | else |
0fff78ff | 124 | MD5_Update(&ctx1, final, 16); |
3c0ef626 | 125 | |
0fff78ff | 126 | if (i % 3) |
127 | MD5_Update(&ctx1, sp, sl); | |
3c0ef626 | 128 | |
0fff78ff | 129 | if (i % 7) |
130 | MD5_Update(&ctx1, pw, strlen(pw)); | |
3c0ef626 | 131 | |
0fff78ff | 132 | if (i & 1) |
133 | MD5_Update(&ctx1, final, 16); | |
3c0ef626 | 134 | else |
0fff78ff | 135 | MD5_Update(&ctx1, pw, strlen(pw)); |
136 | ||
137 | MD5_Final(final, &ctx1); | |
3c0ef626 | 138 | } |
139 | ||
140 | p = passwd + strlen(passwd); | |
141 | ||
0fff78ff | 142 | l = (final[ 0]<<16) | (final[ 6]<<8) | final[12]; |
143 | strlcat(passwd, to64(l, 4), sizeof(passwd)); | |
144 | l = (final[ 1]<<16) | (final[ 7]<<8) | final[13]; | |
145 | strlcat(passwd, to64(l, 4), sizeof(passwd)); | |
146 | l = (final[ 2]<<16) | (final[ 8]<<8) | final[14]; | |
147 | strlcat(passwd, to64(l, 4), sizeof(passwd)); | |
148 | l = (final[ 3]<<16) | (final[ 9]<<8) | final[15]; | |
149 | strlcat(passwd, to64(l, 4), sizeof(passwd)); | |
150 | l = (final[ 4]<<16) | (final[10]<<8) | final[ 5]; | |
151 | strlcat(passwd, to64(l, 4), sizeof(passwd)); | |
152 | l = final[11] ; | |
153 | strlcat(passwd, to64(l, 2), sizeof(passwd)); | |
3c0ef626 | 154 | |
155 | /* Don't leave anything around in vm they could use. */ | |
0fff78ff | 156 | memset(final, 0, sizeof(final)); |
157 | memset(salt_copy, 0, sizeof(salt_copy)); | |
158 | memset(&ctx, 0, sizeof(ctx)); | |
159 | memset(&ctx1, 0, sizeof(ctx1)); | |
160 | (void)to64(0, 4); | |
3c0ef626 | 161 | |
0fff78ff | 162 | return (passwd); |
3c0ef626 | 163 | } |
164 | ||
165 | #endif /* defined(HAVE_MD5_PASSWORDS) && !defined(HAVE_MD5_CRYPT) */ |