计算文件hash值的源代码,包含crc,md2,md4,md5,sha,sha1,sha256,ra-Calcu

上传者: yzhj2005 | 上传时间: 2019-12-21 22:16:01 | 文件大小: 275KB | 文件类型: zip
int main(int argc, char *argv[]) { int i = 0; bool bOnce = true; char szPath[RH_MAX_PATH]; char szAbsPath[RH_MAX_PATH]; char szOrgPath[RH_MAX_PATH]; char szTemp[RH_MAX_BUFFER]; int iErrorCode = 0; CHashManager hashmgr; getcwd(szOrgPath, RH_MAX_PATH); //No arguments? if(argc == 1) { printInfo(); return(RH_NO_ARGS); } memset(szPath, 0, RH_MAX_PATH); bOnce = true; hashmgr.SelectAllAlgorithms(true); for(i = 1; i = RH_MAX_BUFFER) continue; // Non-parsable option argument, ignore fmtArgument(argv[i], szTemp); // Format the argument, i.e. remove all special chars if(strcmp(szTemp, "help" ) == 0) printInfo(); if(strcmp(szTemp, "h" ) == 0) printInfo(); if(strcmp(szTemp, "?" ) == 0) printInfo(); if(strcmp(szTemp, "version" ) == 0) printInfo(); if(strcmp(szTemp, "v" ) == 0) printInfo(); if(strcmp(szTemp, "fullpath") == 0) hashmgr.SetOption(OPT_FULLPATH, true); if(strcmp(szTemp, "f" ) == 0) hashmgr.SetOption(OPT_FULLPATH, true); if(strcmp(szTemp, "nopath" ) == 0) hashmgr.SetOption(OPT_FULLPATH, false); if(strcmp(szTemp, "rcrsv" ) == 0) hashmgr.SetOption(OPT_RECURSIVE, true); if(strcmp(szTemp, "norcrsv" ) == 0) hashmgr.SetOption(OPT_RECURSIVE, false); if(strcmp(szTemp, "recur" ) == 0) hashmgr.SetOption(OPT_RECURSIVE, true); if(strcmp(szTemp, "norecur" ) == 0) hashmgr.SetOption(OPT_RECURSIVE, false); if(strcmp(szTemp, "r" ) == 0) hashmgr.SetOption(OPT_RECURSIVE, true); if(strcmp(szTemp, "all" ) == 0) hashmgr.SelectAllAlgorithms(true); if(strcmp(szTemp, "a" ) == 0) hashmgr.SelectAllAlgorithms(true); if(strcmp(szTemp, "none" ) == 0) hashmgr.SelectAllAlgorithms(false); if(strcmp(s

文件下载

资源详情

[{"title":"( 58 个子文件 275KB ) 计算文件hash值的源代码,包含crc,md2,md4,md5,sha,sha1,sha256,ra-Calcu","children":[{"title":"rhsyscfg.h <span style='color:#111;'> 4.23KB </span>","children":null,"spread":false},{"title":"docs","children":[{"title":"gnugpl2.txt <span style='color:#111;'> 15.05KB </span>","children":null,"spread":false},{"title":"rehash.html <span style='color:#111;'> 10.01KB </span>","children":null,"spread":false},{"title":"rehash.jpg <span style='color:#111;'> 109.10KB </span>","children":null,"spread":false}],"spread":true},{"title":"rehash.dsp <span style='color:#111;'> 5.65KB </span>","children":null,"spread":false},{"title":"rehash.cpp <span style='color:#111;'> 6.98KB </span>","children":null,"spread":false},{"title":"clutil.cpp <span style='color:#111;'> 3.65KB </span>","children":null,"spread":false},{"title":"rehash.dsw <span style='color:#111;'> 563B </span>","children":null,"spread":false},{"title":"algo","children":[{"title":"md5.h <span style='color:#111;'> 3.80KB </span>","children":null,"spread":false},{"title":"ghash.cpp <span style='color:#111;'> 1.44KB </span>","children":null,"spread":false},{"title":"sha1.h <span style='color:#111;'> 2.28KB </span>","children":null,"spread":false},{"title":"fcs.h <span style='color:#111;'> 949B </span>","children":null,"spread":false},{"title":"sha1.cpp <span style='color:#111;'> 9.06KB </span>","children":null,"spread":false},{"title":"crc16.cpp <span style='color:#111;'> 3.55KB </span>","children":null,"spread":false},{"title":"gosthash.cpp <span style='color:#111;'> 11.95KB </span>","children":null,"spread":false},{"title":"fcs.cpp <span style='color:#111;'> 6.65KB </span>","children":null,"spread":false},{"title":"md4.h <span style='color:#111;'> 1.73KB </span>","children":null,"spread":false},{"title":"sizehash.cpp <span style='color:#111;'> 776B </span>","children":null,"spread":false},{"title":"md5.cpp <span style='color:#111;'> 11.83KB </span>","children":null,"spread":false},{"title":"ghash.h <span style='color:#111;'> 846B </span>","children":null,"spread":false},{"title":"sha2.h <span style='color:#111;'> 4.39KB </span>","children":null,"spread":false},{"title":"md4.cpp <span style='color:#111;'> 8.17KB </span>","children":null,"spread":false},{"title":"crc32.h <span style='color:#111;'> 763B </span>","children":null,"spread":false},{"title":"md2.cpp <span style='color:#111;'> 2.74KB </span>","children":null,"spread":false},{"title":"tiger.h <span style='color:#111;'> 716B </span>","children":null,"spread":false},{"title":"sha2.cpp <span style='color:#111;'> 25.01KB </span>","children":null,"spread":false},{"title":"sizehash.h <span style='color:#111;'> 772B </span>","children":null,"spread":false},{"title":"md2.h <span style='color:#111;'> 475B </span>","children":null,"spread":false},{"title":"haval.cpp <span style='color:#111;'> 30.70KB </span>","children":null,"spread":false},{"title":"crc32.cpp <span style='color:#111;'> 4.42KB </span>","children":null,"spread":false},{"title":"gosthash.h <span style='color:#111;'> 931B </span>","children":null,"spread":false},{"title":"crc16.h <span style='color:#111;'> 970B </span>","children":null,"spread":false},{"title":"haval.h <span style='color:#111;'> 4.35KB </span>","children":null,"spread":false},{"title":"tiger.cpp <span style='color:#111;'> 44.82KB </span>","children":null,"spread":false}],"spread":false},{"title":"rehash.h <span style='color:#111;'> 1013B </span>","children":null,"spread":false},{"title":"hashmgr.h <span style='color:#111;'> 3.41KB </span>","children":null,"spread":false},{"title":"hashmgr.cpp <span style='color:#111;'> 10.76KB </span>","children":null,"spread":false},{"title":"testvect","children":[{"title":"testvect.txt <span style='color:#111;'> 5.84KB </span>","children":null,"spread":false},{"title":"docs","children":[{"title":"tiger-nessie.txt <span style='color:#111;'> 228.12KB </span>","children":null,"spread":false},{"title":"rfc1321.txt <span style='color:#111;'> 35.55KB </span>","children":null,"spread":false},{"title":"rfc1320.txt <span style='color:#111;'> 32.75KB </span>","children":null,"spread":false},{"title":"haval.cert <span style='color:#111;'> 684B </span>","children":null,"spread":false},{"title":"rfc1319.txt <span style='color:#111;'> 25.99KB </span>","children":null,"spread":false}],"spread":true},{"title":"testfiles","children":[{"title":"tiger_long.txt <span style='color:#111;'> 125B </span>","children":null,"spread":false},{"title":"nothing.txt <span style='color:#111;'> 0B </span>","children":null,"spread":false},{"title":"message digest.txt <span style='color:#111;'> 14B </span>","children":null,"spread":false},{"title":"abc_plus_minus.txt <span style='color:#111;'> 128B </span>","children":null,"spread":false},{"title":"abc-extended.txt <span style='color:#111;'> 62B </span>","children":null,"spread":false},{"title":"numbers.txt <span style='color:#111;'> 80B </span>","children":null,"spread":false},{"title":"abc.txt <span style='color:#111;'> 3B </span>","children":null,"spread":false},{"title":"tiger.txt <span style='color:#111;'> 5B </span>","children":null,"spread":false},{"title":"abc-complete-numbers.txt <span style='color:#111;'> 62B </span>","children":null,"spread":false},{"title":"suppose.txt <span style='color:#111;'> 50B </span>","children":null,"spread":false},{"title":"1million_a.txt <span style='color:#111;'> 976.56KB </span>","children":null,"spread":false},{"title":"a.txt <span style='color:#111;'> 1B </span>","children":null,"spread":false},{"title":"abc-mixed.txt <span style='color:#111;'> 56B </span>","children":null,"spread":false},{"title":"abc-complete.txt <span style='color:#111;'> 26B </span>","children":null,"spread":false}],"spread":false}],"spread":true},{"title":"clutil.h <span style='color:#111;'> 921B </span>","children":null,"spread":false}],"spread":true}]

评论信息

  • csdn616473424 :
    不错,基本上很多类似的哈希算法都有,而且能过跑出来。不错!
    2019-03-22
  • mzabcdefg :
    还可以用的
    2018-04-16
  • Tiany :
    一次收集了那么多hash 非常好
    2017-09-25
  • shuifengling :
    很牛逼的代码,学习了
    2016-08-05
  • kuangkaiyi :
    不错,可以好好学些一下HASH算法
    2015-06-03

免责申明

【只为小站】的资源来自网友分享,仅供学习研究,请务必在下载后24小时内给予删除,不得用于其他任何用途,否则后果自负。基于互联网的特殊性,【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查;无论 【只为小站】 经营者是否已进行审查,用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场,基于网友分享,根据中国法律《信息网络传播权保护条例》第二十二条之规定,若资源存在侵权或相关问题请联系本站客服人员,zhiweidada#qq.com,请把#换成@,本站将给予最大的支持与配合,做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明