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)
17 //////////////////////////////////////////////////////////////////////
19 unsigned int GetFileLen(FILE* file)
21 unsigned int pos = ftell(file);
22 fseek(file, 0, SEEK_END);
23 unsigned int len = ftell(file);
24 fseek(file, pos, SEEK_SET);
29 string TrimString(string s)
33 if (s[0] == ' ' || s[0] == '\t')
41 if (s[s.size() - 1] == ' ' || s[s.size() - 1] == '\t')
42 s = s.substr(0, s.size() - 1);
49 bool GetHybridCharsets(string sCharset, vector<tCharset>& vCharset)
51 // Example: hybrid(mixalpha-numeric-all-space#1-6,numeric#1-4)
52 if(sCharset.substr(0, 6) != "hybrid") // Not hybrid charset
54 size_t nEnd = sCharset.rfind(')');
55 size_t nStart = sCharset.rfind('(');
56 string sChar = sCharset.substr(nStart + 1, nEnd - nStart - 1);
57 vector<string> vParts;
58 SeperateString(sChar, ",", vParts);
59 for(int i = 0; i < vParts.size(); i++)
62 vector<string> vParts2;
63 SeperateString(vParts[i], "#", vParts2);
64 stCharset.sName = vParts2[0];
65 vector<string> vParts3;
66 SeperateString(vParts2[1], "-", vParts3);
67 stCharset.nPlainLenMin = atoi(vParts3[0].c_str());
68 stCharset.nPlainLenMax = atoi(vParts3[1].c_str());
69 vCharset.push_back(stCharset);
73 bool ReadLinesFromFile(string sPathName, vector<string>& vLine)
77 FILE* file = fopen(sPathName.c_str(), "rb");
80 unsigned int len = GetFileLen(file);
81 char* data = new char[len + 1];
82 fread(data, 1, len, file);
84 string content = data;
89 for (i = 0; i < content.size(); i++)
91 if (content[i] == '\r')
96 while ((n = content.find("\n", 0)) != -1)
98 string line = content.substr(0, n);
99 line = TrimString(line);
101 vLine.push_back(line);
102 content = content.substr(n + 1);
113 bool SeperateString(string s, string sSeperator, vector<string>& vPart)
118 for (i = 0; i < sSeperator.size(); i++)
120 int n = s.find(sSeperator[i]);
123 vPart.push_back(s.substr(0, n));
134 string uint64tostr(uint64 n)
139 sprintf(str, "%I64u", n);
141 sprintf(str, "%llu", n);
147 string uint64tohexstr(uint64 n)
152 sprintf(str, "%016I64x", n);
154 sprintf(str, "%016llx", n);
160 string HexToStr(const unsigned char* pData, int nLen)
164 for (i = 0; i < nLen; i++)
167 sprintf(szByte, "%02x", pData[i]);
174 unsigned int GetAvailPhysMemorySize()
178 GlobalMemoryStatus(&ms);
179 return ms.dwAvailPhys;
181 /* struct sysinfo info;
182 sysinfo(&info); // This function is Linux-specific
183 return info.freeram;*/
184 return 1024 * 1024 * 512;
188 void ParseHash(string sHash, unsigned char* pHash, int& nHashLen)
191 for (i = 0; i < sHash.size() / 2; i++)
193 string sSub = sHash.substr(i * 2, 2);
195 sscanf(sSub.c_str(), "%02x", &nValue);
196 pHash[i] = (unsigned char)nValue;
199 nHashLen = sHash.size() / 2;
204 printf("RainbowCrack (improved) 2.0 - Making a Faster Cryptanalytic Time-Memory Trade-Off\n");
205 printf("by Martin Westergaard <martinwj2005@gmail.com>\n");
206 printf("http://www.freerainbowtables.com/\n");
207 printf("original code by Zhu Shuanglei <shuanglei@hotmail.com>\n");
208 printf("http://www.antsight.com/zsl/rainbowcrack/\n\n");