2 RainbowCrack - a general propose implementation of Philippe Oechslin's faster time-memory trade-off technique.
4 Copyright (C) Zhu Shuanglei <shuanglei@hotmail.com>
8 #pragma warning(disable : 4786)
12 #include "boinc_win.h"
25 #include "boinc_api.h"
32 #include <sys/sysinfo.h>
35 //////////////////////////////////////////////////////////////////////
37 unsigned int GetFileLen(FILE* file)
39 unsigned int pos = ftell(file);
40 fseek(file, 0, SEEK_END);
41 unsigned int len = ftell(file);
42 fseek(file, pos, SEEK_SET);
47 string TrimString(string s)
51 if (s[0] == ' ' || s[0] == '\t')
59 if (s[s.size() - 1] == ' ' || s[s.size() - 1] == '\t')
60 s = s.substr(0, s.size() - 1);
67 bool GetHybridCharsets(string sCharset, vector<tCharset>& vCharset)
69 // Example: hybrid(mixalpha-numeric-all-space#1-6,numeric#1-4)
70 if(sCharset.substr(0, 6) != "hybrid") // Not hybrid charset
72 size_t nEnd = sCharset.rfind(')');
73 size_t nStart = sCharset.rfind('(');
74 string sChar = sCharset.substr(nStart + 1, nEnd - nStart - 1);
75 vector<string> vParts;
76 SeperateString(sChar, ",", vParts);
77 for(int i = 0; i < vParts.size(); i++)
80 vector<string> vParts2;
81 SeperateString(vParts[i], "#", vParts2);
82 stCharset.sName = vParts2[0];
83 vector<string> vParts3;
84 SeperateString(vParts2[1], "-", vParts3);
85 stCharset.nPlainLenMin = atoi(vParts3[0].c_str());
86 stCharset.nPlainLenMax = atoi(vParts3[1].c_str());
87 vCharset.push_back(stCharset);
91 bool ReadLinesFromFile(string sPathName, vector<string>& vLine)
95 boinc_resolve_filename(sPathName.c_str(), input_path, sizeof(input_path));
96 FILE *file = boinc_fopen(input_path, "rb");
99 "Couldn't find input file, resolved name %s.\n", input_path
105 unsigned int len = GetFileLen(file);
106 char* data = new char[len + 1];
107 fread(data, 1, len, file);
109 string content = data;
114 for (i = 0; i < content.size(); i++)
116 if (content[i] == '\r')
121 while ((n = content.find("\n", 0)) != -1)
123 string line = content.substr(0, n);
124 line = TrimString(line);
126 vLine.push_back(line);
127 content = content.substr(n + 1);
138 bool SeperateString(string s, string sSeperator, vector<string>& vPart)
143 for (i = 0; i < sSeperator.size(); i++)
145 int n = s.find(sSeperator[i]);
148 vPart.push_back(s.substr(0, n));
159 string uint64tostr(uint64 n)
164 sprintf(str, "%I64u", n);
166 sprintf(str, "%llu", n);
172 string uint64tohexstr(uint64 n)
177 sprintf(str, "%016I64x", n);
179 sprintf(str, "%016llx", n);
185 string HexToStr(const unsigned char* pData, int nLen)
189 for (i = 0; i < nLen; i++)
192 sprintf(szByte, "%02x", pData[i]);
199 unsigned int GetAvailPhysMemorySize()
203 GlobalMemoryStatus(&ms);
204 return ms.dwAvailPhys;
207 sysinfo(&info); // This function is Linux-specific
212 void ParseHash(string sHash, unsigned char* pHash, int& nHashLen)
215 for (i = 0; i < sHash.size() / 2; i++)
217 string sSub = sHash.substr(i * 2, 2);
219 sscanf(sSub.c_str(), "%02x", &nValue);
220 pHash[i] = (unsigned char)nValue;
223 nHashLen = sHash.size() / 2;
228 printf("RainbowCrack (improved) 2.0 - Making a Faster Cryptanalytic Time-Memory Trade-Off\n");
229 printf("by Martin Westergaard <martinwj2005@gmail.com>\n");
230 printf("http://www.freerainbowtables.com/\n");
231 printf("original code by Zhu Shuanglei <shuanglei@hotmail.com>\n");
232 printf("http://www.antsight.com/zsl/rainbowcrack/\n\n");