2003-06-02 21:43:14 +00:00
|
|
|
/*-
|
2017-11-26 02:00:33 +00:00
|
|
|
* SPDX-License-Identifier: BSD-2-Clause-FreeBSD
|
|
|
|
*
|
2003-06-02 21:43:14 +00:00
|
|
|
* Copyright (c) 2003 Poul-Henning Kamp
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
1999-09-20 12:45:49 +00:00
|
|
|
*/
|
|
|
|
|
2001-09-16 21:35:07 +00:00
|
|
|
#include <sys/cdefs.h>
|
|
|
|
__FBSDID("$FreeBSD$");
|
1999-09-20 12:45:49 +00:00
|
|
|
|
2003-06-02 21:43:14 +00:00
|
|
|
#include <sys/types.h>
|
|
|
|
|
|
|
|
#include <err.h>
|
|
|
|
#include <md5.h>
|
1999-09-20 12:45:49 +00:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <string.h>
|
2003-06-02 21:43:14 +00:00
|
|
|
#include <unistd.h>
|
|
|
|
|
1999-09-20 12:45:49 +00:00
|
|
|
#include "crypt.h"
|
|
|
|
|
|
|
|
/*
|
|
|
|
* UNIX password
|
|
|
|
*/
|
|
|
|
|
2016-08-10 15:16:28 +00:00
|
|
|
int
|
|
|
|
crypt_md5(const char *pw, const char *salt, char *buffer)
|
1999-09-20 12:45:49 +00:00
|
|
|
{
|
|
|
|
MD5_CTX ctx,ctx1;
|
|
|
|
unsigned long l;
|
2002-03-07 10:41:11 +00:00
|
|
|
int sl, pl;
|
|
|
|
u_int i;
|
2002-03-06 17:18:09 +00:00
|
|
|
u_char final[MD5_SIZE];
|
2016-08-10 15:16:28 +00:00
|
|
|
const char *ep;
|
2003-06-02 21:43:14 +00:00
|
|
|
static const char *magic = "$1$";
|
1999-09-20 12:45:49 +00:00
|
|
|
|
2016-08-10 15:16:28 +00:00
|
|
|
/* If the salt starts with the magic string, skip that. */
|
|
|
|
if (!strncmp(salt, magic, strlen(magic)))
|
|
|
|
salt += strlen(magic);
|
1999-09-20 12:45:49 +00:00
|
|
|
|
|
|
|
/* It stops at the first '$', max 8 chars */
|
2016-08-10 15:16:28 +00:00
|
|
|
for (ep = salt; *ep && *ep != '$' && ep < salt + 8; ep++)
|
1999-09-20 12:45:49 +00:00
|
|
|
continue;
|
|
|
|
|
|
|
|
/* get the length of the true salt */
|
2016-08-10 15:16:28 +00:00
|
|
|
sl = ep - salt;
|
1999-09-20 12:45:49 +00:00
|
|
|
|
|
|
|
MD5Init(&ctx);
|
|
|
|
|
|
|
|
/* The password first, since that is what is most unknown */
|
2002-03-06 17:18:09 +00:00
|
|
|
MD5Update(&ctx, (const u_char *)pw, strlen(pw));
|
1999-09-20 12:45:49 +00:00
|
|
|
|
|
|
|
/* Then our magic string */
|
2002-03-06 17:18:09 +00:00
|
|
|
MD5Update(&ctx, (const u_char *)magic, strlen(magic));
|
1999-09-20 12:45:49 +00:00
|
|
|
|
|
|
|
/* Then the raw salt */
|
2016-08-10 15:16:28 +00:00
|
|
|
MD5Update(&ctx, (const u_char *)salt, (u_int)sl);
|
1999-09-20 12:45:49 +00:00
|
|
|
|
|
|
|
/* Then just as many characters of the MD5(pw,salt,pw) */
|
|
|
|
MD5Init(&ctx1);
|
2002-03-06 17:18:09 +00:00
|
|
|
MD5Update(&ctx1, (const u_char *)pw, strlen(pw));
|
2016-08-10 15:16:28 +00:00
|
|
|
MD5Update(&ctx1, (const u_char *)salt, (u_int)sl);
|
2002-03-06 17:18:09 +00:00
|
|
|
MD5Update(&ctx1, (const u_char *)pw, strlen(pw));
|
|
|
|
MD5Final(final, &ctx1);
|
2002-03-07 10:41:11 +00:00
|
|
|
for(pl = (int)strlen(pw); pl > 0; pl -= MD5_SIZE)
|
2002-03-06 17:18:09 +00:00
|
|
|
MD5Update(&ctx, (const u_char *)final,
|
2002-03-07 10:41:11 +00:00
|
|
|
(u_int)(pl > MD5_SIZE ? MD5_SIZE : pl));
|
1999-09-20 12:45:49 +00:00
|
|
|
|
|
|
|
/* Don't leave anything around in vm they could use. */
|
2002-03-06 17:18:09 +00:00
|
|
|
memset(final, 0, sizeof(final));
|
1999-09-20 12:45:49 +00:00
|
|
|
|
|
|
|
/* Then something really weird... */
|
2002-03-06 17:18:09 +00:00
|
|
|
for (i = strlen(pw); i; i >>= 1)
|
|
|
|
if(i & 1)
|
|
|
|
MD5Update(&ctx, (const u_char *)final, 1);
|
1999-09-20 12:45:49 +00:00
|
|
|
else
|
2002-03-06 17:18:09 +00:00
|
|
|
MD5Update(&ctx, (const u_char *)pw, 1);
|
1999-09-20 12:45:49 +00:00
|
|
|
|
|
|
|
/* Now make the output string */
|
2016-08-10 15:16:28 +00:00
|
|
|
buffer = stpcpy(buffer, magic);
|
|
|
|
buffer = stpncpy(buffer, salt, (u_int)sl);
|
|
|
|
*buffer++ = '$';
|
1999-09-20 12:45:49 +00:00
|
|
|
|
2002-03-06 17:18:09 +00:00
|
|
|
MD5Final(final, &ctx);
|
1999-09-20 12:45:49 +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...
|
|
|
|
*/
|
2002-03-06 17:18:09 +00:00
|
|
|
for(i = 0; i < 1000; i++) {
|
1999-09-20 12:45:49 +00:00
|
|
|
MD5Init(&ctx1);
|
|
|
|
if(i & 1)
|
2002-03-06 17:18:09 +00:00
|
|
|
MD5Update(&ctx1, (const u_char *)pw, strlen(pw));
|
1999-09-20 12:45:49 +00:00
|
|
|
else
|
2002-03-06 17:18:09 +00:00
|
|
|
MD5Update(&ctx1, (const u_char *)final, MD5_SIZE);
|
1999-09-20 12:45:49 +00:00
|
|
|
|
|
|
|
if(i % 3)
|
2016-08-10 15:16:28 +00:00
|
|
|
MD5Update(&ctx1, (const u_char *)salt, (u_int)sl);
|
1999-09-20 12:45:49 +00:00
|
|
|
|
|
|
|
if(i % 7)
|
2002-03-06 17:18:09 +00:00
|
|
|
MD5Update(&ctx1, (const u_char *)pw, strlen(pw));
|
1999-09-20 12:45:49 +00:00
|
|
|
|
|
|
|
if(i & 1)
|
2002-03-06 17:18:09 +00:00
|
|
|
MD5Update(&ctx1, (const u_char *)final, MD5_SIZE);
|
1999-09-20 12:45:49 +00:00
|
|
|
else
|
2002-03-06 17:18:09 +00:00
|
|
|
MD5Update(&ctx1, (const u_char *)pw, strlen(pw));
|
|
|
|
MD5Final(final, &ctx1);
|
1999-09-20 12:45:49 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
l = (final[ 0]<<16) | (final[ 6]<<8) | final[12];
|
2016-08-10 15:16:28 +00:00
|
|
|
_crypt_to64(buffer, l, 4); buffer += 4;
|
1999-09-20 12:45:49 +00:00
|
|
|
l = (final[ 1]<<16) | (final[ 7]<<8) | final[13];
|
2016-08-10 15:16:28 +00:00
|
|
|
_crypt_to64(buffer, l, 4); buffer += 4;
|
1999-09-20 12:45:49 +00:00
|
|
|
l = (final[ 2]<<16) | (final[ 8]<<8) | final[14];
|
2016-08-10 15:16:28 +00:00
|
|
|
_crypt_to64(buffer, l, 4); buffer += 4;
|
1999-09-20 12:45:49 +00:00
|
|
|
l = (final[ 3]<<16) | (final[ 9]<<8) | final[15];
|
2016-08-10 15:16:28 +00:00
|
|
|
_crypt_to64(buffer, l, 4); buffer += 4;
|
1999-09-20 12:45:49 +00:00
|
|
|
l = (final[ 4]<<16) | (final[10]<<8) | final[ 5];
|
2016-08-10 15:16:28 +00:00
|
|
|
_crypt_to64(buffer, l, 4); buffer += 4;
|
2003-06-02 21:43:14 +00:00
|
|
|
l = final[11];
|
2016-08-10 15:16:28 +00:00
|
|
|
_crypt_to64(buffer, l, 2); buffer += 2;
|
|
|
|
*buffer = '\0';
|
1999-09-20 12:45:49 +00:00
|
|
|
|
|
|
|
/* Don't leave anything around in vm they could use. */
|
2002-03-06 17:18:09 +00:00
|
|
|
memset(final, 0, sizeof(final));
|
1999-09-20 12:45:49 +00:00
|
|
|
|
2016-08-10 15:16:28 +00:00
|
|
|
return (0);
|
1999-09-20 12:45:49 +00:00
|
|
|
}
|