1999-11-19 04:53:20 +00:00
|
|
|
/*
|
|
|
|
* ----------------------------------------------------------------------------
|
|
|
|
* "THE BEER-WARE LICENSE" (Revision 42):
|
2003-11-21 12:48:55 +00:00
|
|
|
* <phk@login.dknet.dk> wrote this file. As long as you retain this
|
|
|
|
* notice you can do whatever you want with this stuff. If we meet some
|
|
|
|
* day, and you think this stuff is worth it, you can buy me a beer in
|
2003-05-18 14:46:46 +00:00
|
|
|
* return. Poul-Henning Kamp
|
1999-11-19 04:53:20 +00:00
|
|
|
* ----------------------------------------------------------------------------
|
|
|
|
*/
|
|
|
|
|
2001-02-09 01:55:35 +00:00
|
|
|
#include "includes.h"
|
|
|
|
|
1999-12-28 04:09:35 +00:00
|
|
|
#if defined(HAVE_MD5_PASSWORDS) && !defined(HAVE_MD5_CRYPT)
|
1999-11-19 04:53:20 +00:00
|
|
|
#include <openssl/md5.h>
|
|
|
|
|
2003-11-21 12:56:47 +00:00
|
|
|
RCSID("$Id: md5crypt.c,v 1.9 2003/11/21 12:56:47 djm Exp $");
|
2003-05-18 14:46:46 +00:00
|
|
|
|
|
|
|
/* 0 ... 63 => ascii - 64 */
|
|
|
|
static unsigned char itoa64[] =
|
|
|
|
"./0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
|
1999-11-19 04:53:20 +00:00
|
|
|
|
2003-05-18 14:46:46 +00:00
|
|
|
static char *magic = "$1$";
|
1999-11-19 04:53:20 +00:00
|
|
|
|
2003-05-18 14:46:46 +00:00
|
|
|
static char *
|
|
|
|
to64(unsigned long v, int n)
|
1999-11-19 04:53:20 +00:00
|
|
|
{
|
2003-05-18 14:46:46 +00:00
|
|
|
static char buf[5];
|
|
|
|
char *s = buf;
|
|
|
|
|
|
|
|
if (n > 4)
|
|
|
|
return (NULL);
|
|
|
|
|
|
|
|
memset(buf, '\0', sizeof(buf));
|
1999-11-19 04:53:20 +00:00
|
|
|
while (--n >= 0) {
|
|
|
|
*s++ = itoa64[v&0x3f];
|
|
|
|
v >>= 6;
|
|
|
|
}
|
2003-11-21 12:56:47 +00:00
|
|
|
|
2003-05-18 14:46:46 +00:00
|
|
|
return (buf);
|
1999-11-19 04:53:20 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
is_md5_salt(const char *salt)
|
|
|
|
{
|
2003-05-18 14:46:46 +00:00
|
|
|
return (strncmp(salt, magic, strlen(magic)) == 0);
|
1999-11-19 04:53:20 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
char *
|
|
|
|
md5_crypt(const char *pw, const char *salt)
|
|
|
|
{
|
2003-05-18 14:46:46 +00:00
|
|
|
static char passwd[120], salt_copy[9], *p;
|
|
|
|
static const char *sp, *ep;
|
|
|
|
unsigned char final[16];
|
|
|
|
int sl, pl, i, j;
|
|
|
|
MD5_CTX ctx, ctx1;
|
1999-11-19 04:53:20 +00:00
|
|
|
unsigned long l;
|
|
|
|
|
|
|
|
/* Refine the Salt first */
|
|
|
|
sp = salt;
|
|
|
|
|
|
|
|
/* If it starts with the magic string, then skip that */
|
2003-05-18 14:46:46 +00:00
|
|
|
if(strncmp(sp, magic, strlen(magic)) == 0)
|
1999-11-19 04:53:20 +00:00
|
|
|
sp += strlen(magic);
|
|
|
|
|
|
|
|
/* It stops at the first '$', max 8 chars */
|
2003-05-18 14:46:46 +00:00
|
|
|
for (ep = sp; *ep != '$'; ep++) {
|
|
|
|
if (*ep == '\0' || ep >= (sp + 8))
|
|
|
|
return (NULL);
|
|
|
|
}
|
1999-11-19 04:53:20 +00:00
|
|
|
|
|
|
|
/* get the length of the true salt */
|
|
|
|
sl = ep - sp;
|
|
|
|
|
2003-05-18 14:46:46 +00:00
|
|
|
/* Stash the salt */
|
|
|
|
memcpy(salt_copy, sp, sl);
|
|
|
|
salt_copy[sl] = '\0';
|
|
|
|
|
1999-11-19 04:53:20 +00:00
|
|
|
MD5_Init(&ctx);
|
|
|
|
|
|
|
|
/* The password first, since that is what is most unknown */
|
2003-05-18 14:46:46 +00:00
|
|
|
MD5_Update(&ctx, pw, strlen(pw));
|
1999-11-19 04:53:20 +00:00
|
|
|
|
|
|
|
/* Then our magic string */
|
2003-05-18 14:46:46 +00:00
|
|
|
MD5_Update(&ctx, magic, strlen(magic));
|
1999-11-19 04:53:20 +00:00
|
|
|
|
|
|
|
/* Then the raw salt */
|
2003-05-18 14:46:46 +00:00
|
|
|
MD5_Update(&ctx, sp, sl);
|
1999-11-19 04:53:20 +00:00
|
|
|
|
2003-05-18 14:46:46 +00:00
|
|
|
/* Then just as many characters of the MD5(pw, salt, pw) */
|
1999-11-19 04:53:20 +00:00
|
|
|
MD5_Init(&ctx1);
|
2003-05-18 14:46:46 +00:00
|
|
|
MD5_Update(&ctx1, pw, strlen(pw));
|
|
|
|
MD5_Update(&ctx1, sp, sl);
|
|
|
|
MD5_Update(&ctx1, pw, strlen(pw));
|
|
|
|
MD5_Final(final, &ctx1);
|
|
|
|
|
1999-11-19 04:53:20 +00:00
|
|
|
for(pl = strlen(pw); pl > 0; pl -= 16)
|
2003-05-18 14:46:46 +00:00
|
|
|
MD5_Update(&ctx, final, pl > 16 ? 16 : pl);
|
1999-11-19 04:53:20 +00:00
|
|
|
|
|
|
|
/* Don't leave anything around in vm they could use. */
|
2003-05-18 14:46:46 +00:00
|
|
|
memset(final, '\0', sizeof final);
|
1999-11-19 04:53:20 +00:00
|
|
|
|
|
|
|
/* Then something really weird... */
|
2003-05-18 14:46:46 +00:00
|
|
|
for (j = 0, i = strlen(pw); i != 0; i >>= 1)
|
|
|
|
if (i & 1)
|
|
|
|
MD5_Update(&ctx, final + j, 1);
|
1999-11-19 04:53:20 +00:00
|
|
|
else
|
2003-05-18 14:46:46 +00:00
|
|
|
MD5_Update(&ctx, pw + j, 1);
|
1999-11-19 04:53:20 +00:00
|
|
|
|
|
|
|
/* Now make the output string */
|
2003-05-18 14:46:46 +00:00
|
|
|
snprintf(passwd, sizeof(passwd), "%s%s$", magic, salt_copy);
|
1999-11-19 04:53:20 +00:00
|
|
|
|
2003-05-18 14:46:46 +00:00
|
|
|
MD5_Final(final, &ctx);
|
1999-11-19 04:53:20 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* and now, just to make sure things don't run too fast
|
|
|
|
* On a 60 Mhz Pentium this takes 34 msec, so you would
|
|
|
|
* need 30 seconds to build a 1000 entry dictionary...
|
|
|
|
*/
|
2003-05-18 14:46:46 +00:00
|
|
|
for(i = 0; i < 1000; i++) {
|
1999-11-19 04:53:20 +00:00
|
|
|
MD5_Init(&ctx1);
|
2003-05-18 14:46:46 +00:00
|
|
|
if (i & 1)
|
|
|
|
MD5_Update(&ctx1, pw, strlen(pw));
|
1999-11-19 04:53:20 +00:00
|
|
|
else
|
2003-05-18 14:46:46 +00:00
|
|
|
MD5_Update(&ctx1, final, 16);
|
1999-11-19 04:53:20 +00:00
|
|
|
|
2003-05-18 14:46:46 +00:00
|
|
|
if (i % 3)
|
|
|
|
MD5_Update(&ctx1, sp, sl);
|
1999-11-19 04:53:20 +00:00
|
|
|
|
2003-05-18 14:46:46 +00:00
|
|
|
if (i % 7)
|
|
|
|
MD5_Update(&ctx1, pw, strlen(pw));
|
1999-11-19 04:53:20 +00:00
|
|
|
|
2003-05-18 14:46:46 +00:00
|
|
|
if (i & 1)
|
|
|
|
MD5_Update(&ctx1, final, 16);
|
1999-11-19 04:53:20 +00:00
|
|
|
else
|
2003-05-18 14:46:46 +00:00
|
|
|
MD5_Update(&ctx1, pw, strlen(pw));
|
|
|
|
|
|
|
|
MD5_Final(final, &ctx1);
|
1999-11-19 04:53:20 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
p = passwd + strlen(passwd);
|
|
|
|
|
2003-05-18 14:46:46 +00:00
|
|
|
l = (final[ 0]<<16) | (final[ 6]<<8) | final[12];
|
|
|
|
strlcat(passwd, to64(l, 4), sizeof(passwd));
|
|
|
|
l = (final[ 1]<<16) | (final[ 7]<<8) | final[13];
|
|
|
|
strlcat(passwd, to64(l, 4), sizeof(passwd));
|
|
|
|
l = (final[ 2]<<16) | (final[ 8]<<8) | final[14];
|
|
|
|
strlcat(passwd, to64(l, 4), sizeof(passwd));
|
|
|
|
l = (final[ 3]<<16) | (final[ 9]<<8) | final[15];
|
|
|
|
strlcat(passwd, to64(l, 4), sizeof(passwd));
|
|
|
|
l = (final[ 4]<<16) | (final[10]<<8) | final[ 5];
|
|
|
|
strlcat(passwd, to64(l, 4), sizeof(passwd));
|
|
|
|
l = final[11] ;
|
|
|
|
strlcat(passwd, to64(l, 2), sizeof(passwd));
|
1999-11-19 04:53:20 +00:00
|
|
|
|
|
|
|
/* Don't leave anything around in vm they could use. */
|
2003-05-18 14:46:46 +00:00
|
|
|
memset(final, 0, sizeof(final));
|
|
|
|
memset(salt_copy, 0, sizeof(salt_copy));
|
|
|
|
memset(&ctx, 0, sizeof(ctx));
|
|
|
|
memset(&ctx1, 0, sizeof(ctx1));
|
2003-05-30 06:58:22 +00:00
|
|
|
(void)to64(0, 4);
|
1999-11-19 04:53:20 +00:00
|
|
|
|
2003-05-18 14:46:46 +00:00
|
|
|
return (passwd);
|
1999-11-19 04:53:20 +00:00
|
|
|
}
|
|
|
|
|
1999-12-28 04:09:35 +00:00
|
|
|
#endif /* defined(HAVE_MD5_PASSWORDS) && !defined(HAVE_MD5_CRYPT) */
|