| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169 |
- /** BEGIN COPYRIGHT BLOCK
- * This Program is free software; you can redistribute it and/or modify it under
- * the terms of the GNU General Public License as published by the Free Software
- * Foundation; version 2 of the License.
- *
- * This Program is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
- * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License along with
- * this Program; if not, write to the Free Software Foundation, Inc., 59 Temple
- * Place, Suite 330, Boston, MA 02111-1307 USA.
- *
- * In addition, as a special exception, Red Hat, Inc. gives You the additional
- * right to link the code of this Program with code not covered under the GNU
- * General Public License ("Non-GPL Code") and to distribute linked combinations
- * including the two, subject to the limitations in this paragraph. Non-GPL Code
- * permitted under this exception must only link to the code of this Program
- * through those well defined interfaces identified in the file named EXCEPTION
- * found in the source code files (the "Approved Interfaces"). The files of
- * Non-GPL Code may instantiate templates or use macros or inline functions from
- * the Approved Interfaces without causing the resulting work to be covered by
- * the GNU General Public License. Only Red Hat, Inc. may make changes or
- * additions to the list of Approved Interfaces. You must obey the GNU General
- * Public License in all respects for all of the Program code and other code used
- * in conjunction with the Program except the Non-GPL Code covered by this
- * exception. If you modify this file, you may extend this exception to your
- * version of the file, but you are not obligated to do so. If you do not wish to
- * provide this exception without modification, you must delete this exception
- * statement from your version and license this file solely under the GPL without
- * exception.
- *
- *
- * Copyright (C) 2001 Sun Microsystems, Inc. Used by permission.
- * Copyright (C) 2005 Red Hat, Inc.
- * All rights reserved.
- * END COPYRIGHT BLOCK **/
- #ifdef HAVE_CONFIG_H
- # include <config.h>
- #endif
- /*
- * Adjust password policy management related variables.
- *
- * Valerie Chu
- */
- #include <stdio.h>
- #include <string.h>
- #include <stdlib.h>
- #include <ctype.h>
- #include <sys/types.h>
- #include "ldap.h"
- #include "ldif.h"
- #include "sechash.h"
- #include "dsalib.h"
- #include "dsalib_pw.h"
- #include "prtime.h"
- #include "prlong.h"
- #include "prmem.h"
- #include <pk11func.h>
- #include <pk11pqg.h>
- #define SHA1_SALT_LENGTH 8 /* number of bytes of data in salt */
- #define PWD_HASH_PREFIX_START '{'
- #define PWD_HASH_PREFIX_END '}'
- #define SALTED_SHA1_SCHEME_NAME "SSHA"
- #define SALTED_SHA1_NAME_LEN 4
- /*
- WARNING: The following code is blatantly copied from the server
- pwdstorage ssha_pwd.c plugin. It would be nice to share this
- code with the server. The problem is that the server wants to
- use slapi_ch_malloc to allocate the memory for the returned
- password - this function is not available outside the server
- (as in the setup programs that also want to hash the password)
- We need to figure out a way to put this code into a library
- in such a way that the memory allocation functions to use
- can be passed in or set beforehand.
- */
- static void
- ssha_rand_array(void *randx, size_t len)
- {
- PK11_RandomUpdate(randx, len);
- PK11_GenerateRandom((unsigned char *)randx, (int)len);
- }
- /*
- * A salted SHA1 hash
- * if salt is null, no salt is used (this is for backward compatibility)
- */
- SECStatus
- sha1_salted_hash(unsigned char *hash_out, char *pwd, struct berval *salt)
- {
- PK11Context *ctx;
- unsigned int outLen;
- SECStatus rc;
- if (salt && salt->bv_len) {
- ctx = PK11_CreateDigestContext(SEC_OID_SHA1);
- if (ctx == NULL) {
- rc = SECFailure;
- }
- else {
- PK11_DigestBegin(ctx);
- PK11_DigestOp(ctx, (unsigned char*)pwd, strlen(pwd));
- PK11_DigestOp(ctx, (unsigned char*)(salt->bv_val), salt->bv_len);
- PK11_DigestFinal(ctx, hash_out, &outLen, SHA1_LENGTH);
- PK11_DestroyContext(ctx, 1);
- if (outLen == SHA1_LENGTH)
- rc = SECSuccess;
- else
- rc = SECFailure;
- }
- }
- else {
- /*backward compatibility*/
- rc = PK11_HashBuf(SEC_OID_SHA1, hash_out, (unsigned char *)pwd, strlen(pwd));
- }
- return rc;
- }
- char *
- salted_sha1_pw_enc( char *pwd )
- {
- unsigned char hash[ SHA1_LENGTH + SHA1_SALT_LENGTH ];
- unsigned char *salt = hash + SHA1_LENGTH;
- struct berval saltval;
- char *enc;
- saltval.bv_val = (void*)salt;
- saltval.bv_len = SHA1_SALT_LENGTH;
- /* generate a new random salt */
- /* Note: the uninitialized salt array provides a little extra entropy
- * to the random array generation, but it is not really needed since
- * PK11_GenerateRandom takes care of seeding. In any case, it doesn't
- * hurt. */
- ssha_rand_array( salt, SHA1_SALT_LENGTH );
- /* SHA1 hash the user's key */
- if ( sha1_salted_hash( hash, pwd, &saltval ) != SECSuccess ) {
- return( NULL );
- }
- if (( enc = PR_Malloc( 3 + SALTED_SHA1_NAME_LEN +
- LDIF_BASE64_LEN(sizeof(hash)))) == NULL ) {
- return( NULL );
- }
- sprintf( enc, "%c%s%c", PWD_HASH_PREFIX_START, SALTED_SHA1_SCHEME_NAME,
- PWD_HASH_PREFIX_END );
- (void)ldif_base64_encode( hash, enc + 2 + SALTED_SHA1_NAME_LEN,
- sizeof(hash), -1 );
- return( enc );
- }
- DS_EXPORT_SYMBOL char *
- ds_salted_sha1_pw_enc (char* pwd)
- {
- return( salted_sha1_pw_enc(pwd) );
- }
|