📄 digcalc.hxx
字号:
#ifndef digcalc_hxx#define digcalc_hxx#include "rutil/vmd5.hxx"#include <string.h>#include <iostream>#include "rutil/Data.hxx"#define HASHLEN 16typedef char HASH[HASHLEN];#define HASHHEXLEN 32typedef char HASHHEX[HASHHEXLEN+1];#define IN#define OUTusing namespace std;namespace resip{typedef MD5Context MD5_CTX;voidMD5_Update(struct MD5Context *ctx, char const *buf, unsigned len){ MD5Update(ctx, (unsigned char*)(buf), len);}voidMD5_Final(char digest[16], struct MD5Context *ctx){ MD5Final((unsigned char*)digest, ctx);}/* 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 ){ MD5_CTX Md5Ctx; HASH HA1; MD5Init(&Md5Ctx); MD5_Update(&Md5Ctx, pszUserName, strlen(pszUserName)); MD5_Update(&Md5Ctx, ":", 1); MD5_Update(&Md5Ctx, pszRealm, strlen(pszRealm)); MD5_Update(&Md5Ctx, ":", 1); MD5_Update(&Md5Ctx, pszPassword, strlen(pszPassword)); MD5_Final(HA1, &Md5Ctx); if (strcasecmp(pszAlg, "md5-sess") == 0) { MD5Init(&Md5Ctx); MD5_Update(&Md5Ctx, HA1, HASHLEN); MD5_Update(&Md5Ctx, ":", 1); MD5_Update(&Md5Ctx, pszNonce, strlen(pszNonce)); MD5_Update(&Md5Ctx, ":", 1); MD5_Update(&Md5Ctx, pszCNonce, strlen(pszCNonce)); MD5_Final(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 */ ){ MD5_CTX Md5Ctx; HASH HA2; HASH RespHash; HASHHEX HA2Hex; // calculate H(A2) MD5Init(&Md5Ctx); MD5_Update(&Md5Ctx, pszMethod, strlen(pszMethod)); MD5_Update(&Md5Ctx, ":", 1); MD5_Update(&Md5Ctx, pszDigestUri, strlen(pszDigestUri)); if (strcasecmp(pszQop, "auth-int") == 0) { MD5_Update(&Md5Ctx, ":", 1); MD5_Update(&Md5Ctx, HEntity, HASHHEXLEN); }; MD5_Final(HA2, &Md5Ctx); CvtHex(HA2, HA2Hex); // calculate response MD5Init(&Md5Ctx); MD5_Update(&Md5Ctx, HA1, HASHHEXLEN); MD5_Update(&Md5Ctx, ":", 1); MD5_Update(&Md5Ctx, pszNonce, strlen(pszNonce)); MD5_Update(&Md5Ctx, ":", 1); if (*pszQop) { MD5_Update(&Md5Ctx, pszNonceCount, strlen(pszNonceCount)); MD5_Update(&Md5Ctx, ":", 1); MD5_Update(&Md5Ctx, pszCNonce, strlen(pszCNonce)); MD5_Update(&Md5Ctx, ":", 1); MD5_Update(&Md5Ctx, pszQop, strlen(pszQop)); MD5_Update(&Md5Ctx, ":", 1); }; MD5_Update(&Md5Ctx, HA2Hex, HASHHEXLEN); MD5_Final(RespHash, &Md5Ctx); CvtHex(RespHash, Response);}; }#endif/* ==================================================================== * 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/>. * */
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -