⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 digest.cxx

📁 sip中的md5测试源码,可以进行md5加密认证的
💻 CXX
字号:
/* ==================================================================== * The Vovida Software License, Version 1.0 * * Copyright (c) 2000 Vovida Networks, Inc.  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. * * 3. The names "VOCAL", "Vovida Open Communication Application Library", *    and "Vovida Open Communication Application Library (VOCAL)" must *    not be used to endorse or promote products derived from this *    software without prior written permission. For written *    permission, please contact vocal@vovida.org.         * * 4. Products derived from this software may not be called "VOCAL", nor *    may "VOCAL" appear in their name, without prior written *    permission of Vovida Networks, Inc. * * THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESSED OR IMPLIED * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, TITLE AND * NON-INFRINGEMENT ARE DISCLAIMED.  IN NO EVENT SHALL VOVIDA * NETWORKS, INC. OR ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT DAMAGES * IN EXCESS OF $1,000, NOR FOR ANY 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.     * * ==================================================================== * * This software consists of voluntary contributions made by Vovida * Networks, Inc. and many individuals on behalf of Vovida Networks, * Inc.  For more information on Vovida Networks, Inc., please see * <http://www.vovida.org/>. * *   *RFC 2617                  HTTP Authentication                  June 1999***  Full Copyright Statement**   Copyright (C) The Internet Society (1999).  All Rights Reserved.**   This document and translations of it may be copied and furnished to*   others, and derivative works that comment on or otherwise explain it*   or assist in its implementation may be prepared, copied, published*   and distributed, in whole or in part, without restriction of any*   kind, provided that the above copyright notice and this paragraph are*   included on all such copies and derivative works.  However, this*   document itself may not be modified in any way, such as by removing*   the copyright notice or references to the Internet Society or other*   Internet organizations, except as needed for the purpose of*   developing Internet standards in which case the procedures for*   copyrights defined in the Internet Standards process must be*   followed, or as required to translate it into languages other than*   English. *   The limited permissions granted above are perpetual and will not be*   revoked by the Internet Society or its successors or assigns. *   This document and the information contained herein is provided on an*   "AS IS" basis and THE INTERNET SOCIETY AND THE INTERNET ENGINEERING*   TASK FORCE DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED, INCLUDING*   BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF THE INFORMATION*   HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED WARRANTIES OF*   MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. */#include "digest.hxx"/*#define HASHLEN 16typedef char HASH[HASHLEN];#define HASHHEXLEN 32typedef char HASHHEX[HASHHEXLEN+1];#define IN#define OUT   #include <stdio.h>#include <global.h>#include <string.h>#include "vmd5.h"   #include "support.hxx"*//* calculate H(A1) as per HTTP Digest spec */void DigestCalcHA1(    IN char * pszAlg,    IN char * pszUserName,    IN char * pszRealm,    IN char * pszPassword,    IN char * pszNonce,    IN char * pszCNonce,    OUT HASHHEX SessionKey);/* calculate request-digest/response-digest as per HTTP Digest spec */void DigestCalcResponse(    IN HASHHEX HA1,            /* H(A1) */    IN char * pszNonce,        /* nonce from server */    IN char * pszNonceCount,   /* 8 hex digits */    IN char * pszCNonce,       /* client nonce */    IN char * pszQop,          /* qop-value: "", "auth", "auth-int" */    IN char * pszMethod,       /* method from the request */    IN char * pszDigestUri,    /* requested URL */    IN HASHHEX HEntity,        /* H(entity body) if qop="auth-int" */    OUT HASHHEX Response      /* request-digest or response-digest */);void CvtHex(    IN HASH Bin,    OUT HASHHEX Hex){    unsigned short i;    unsigned char j;    for (i = 0; i < HASHLEN; i++)    {        j = (Bin[i] >> 4) & 0xf;        if (j <= 9)            Hex[i*2] = (j + '0');        else            Hex[i*2] = (j + 'a' - 10);        j = Bin[i] & 0xf;        if (j <= 9)            Hex[i*2 + 1] = (j + '0');        else            Hex[i*2 + 1] = (j + 'a' - 10);    }    Hex[HASHHEXLEN] = '\0';}/* calculate H(A1) as per spec */void DigestCalcHA1(    IN char * pszAlg,    IN char * pszUserName,    IN char * pszRealm,    IN char * pszPassword,    IN char * pszNonce,    IN char * pszCNonce,    OUT HASHHEX SessionKey){    struct MD5Context Md5Ctx;    HASH HA1;    MD5Init(&Md5Ctx);    MD5Update(&Md5Ctx, (unsigned char*)(pszUserName), strlen(pszUserName));    MD5Update(&Md5Ctx, (unsigned char*)(":"), 1);    MD5Update(&Md5Ctx, (unsigned char*)(pszRealm), strlen(pszRealm));    MD5Update(&Md5Ctx, (unsigned char*)(":"), 1);    MD5Update(&Md5Ctx, (unsigned char*)(pszPassword), strlen(pszPassword));    MD5Final((unsigned char*)(HA1), &Md5Ctx);    if (strcmp(pszAlg, "md5-sess") == 0)    {        MD5Init(&Md5Ctx);        MD5Update(&Md5Ctx, (unsigned char*)(HA1), HASHLEN);        MD5Update(&Md5Ctx, (unsigned char*)(":"), 1);        MD5Update(&Md5Ctx, (unsigned char*)(pszNonce), strlen(pszNonce));        MD5Update(&Md5Ctx, (unsigned char*)(":"), 1);        MD5Update(&Md5Ctx, (unsigned char*)(pszCNonce), strlen(pszCNonce));        MD5Final((unsigned char*)(HA1), &Md5Ctx);    }    CvtHex(HA1, SessionKey);}/* calculate request-digest/response-digest as per HTTP Digest spec */void DigestCalcResponse(    IN HASHHEX HA1,            /* H(A1) */    IN char * pszNonce,        /* nonce from server */    IN char * pszNonceCount,   /* 8 hex digits */    IN char * pszCNonce,       /* client nonce */    IN char * pszQop,          /* qop-value: "", "auth", "auth-int" */    IN char * pszMethod,       /* method from the request */    IN char * pszDigestUri,    /* requested URL */    IN HASHHEX HEntity,        /* H(entity body) if qop="auth-int" */    OUT HASHHEX Response      /* request-digest or response-digest */){    struct MD5Context Md5Ctx;    HASH HA2;    HASH RespHash;    HASHHEX HA2Hex;    // calculate H(A2)    MD5Init(&Md5Ctx);    MD5Update(&Md5Ctx, (unsigned char*)(pszMethod), strlen(pszMethod));    MD5Update(&Md5Ctx, (unsigned char*)(":"), 1);    MD5Update(&Md5Ctx, (unsigned char*)(pszDigestUri), strlen(pszDigestUri));    if (strcmp(pszQop, "auth-int") == 0)    {        MD5Update(&Md5Ctx, (unsigned char*)(":"), 1);        MD5Update(&Md5Ctx, (unsigned char*)(HEntity), HASHHEXLEN);    }    MD5Final((unsigned char*)(HA2), &Md5Ctx);    CvtHex(HA2, HA2Hex);    // calculate response    MD5Init(&Md5Ctx);    MD5Update(&Md5Ctx, (unsigned char*)(HA1), HASHHEXLEN);    MD5Update(&Md5Ctx, (unsigned char*)(":"), 1);    MD5Update(&Md5Ctx, (unsigned char*)(pszNonce), strlen(pszNonce));    MD5Update(&Md5Ctx, (unsigned char*)(":"), 1);    if (*pszQop)    {        MD5Update(&Md5Ctx, (unsigned char*)(pszNonceCount), strlen(pszNonceCount));        MD5Update(&Md5Ctx, (unsigned char*)(":"), 1);        MD5Update(&Md5Ctx, (unsigned char*)(pszCNonce), strlen(pszCNonce));        MD5Update(&Md5Ctx, (unsigned char*)(":"), 1);        MD5Update(&Md5Ctx, (unsigned char*)(pszQop), strlen(pszQop));        MD5Update(&Md5Ctx, (unsigned char*)(":"), 1);    }    MD5Update(&Md5Ctx, (unsigned char*)(HA2Hex), HASHHEXLEN);    MD5Final((unsigned char*)(RespHash), &Md5Ctx);    CvtHex(RespHash, Response);}#if 0void main(int argc, char ** argv){    char * pszNonce = "dcd98b7102dd2f0e8b11d0f600bfb0c093";    char * pszCNonce = "0a4f113b";    char * pszUser = "Mufasa";    char * pszRealm = "testrealm@host.com";    char * pszPass = "Circle Of Life";    char * pszAlg = "md5";    char szNonceCount[9] = "00000001";    char * pszMethod = "GET";    char * pszQop = "auth";    char * pszURI = "/dir/index.html";    HASHHEX HA1;    HASHHEX HA2 = "";    HASHHEX Response;    DigestCalcHA1(pszAlg, pszUser, pszRealm, pszPass, pszNonce,                  pszCNonce, HA1);    DigestCalcResponse(HA1, pszNonce, szNonceCount, pszCNonce, pszQop,                       pszMethod, pszURI, HA2, Response);    printf("Response = %s\n", Response);}#endif

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -