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)
11 #include "ChainWalkContext.h"
16 //////////////////////////////////////////////////////////////////////
18 string CChainWalkContext::m_sHashRoutineName;
19 HASHROUTINE CChainWalkContext::m_pHashRoutine;
20 int CChainWalkContext::m_nHashLen;
21 int CChainWalkContext::m_nPlainLenMinTotal = 0;
22 int CChainWalkContext::m_nPlainLenMaxTotal = 0;
23 int CChainWalkContext::m_nHybridCharset = 0;
24 vector<stCharset> CChainWalkContext::m_vCharset;
25 uint64 CChainWalkContext::m_nPlainSpaceUpToX[MAX_PLAIN_LEN + 1];
26 uint64 CChainWalkContext::m_nPlainSpaceTotal;
27 unsigned char CChainWalkContext::m_Salt[MAX_SALT_LEN];
28 int CChainWalkContext::m_nSaltLen = 0;
29 int CChainWalkContext::m_nRainbowTableIndex;
30 uint64 CChainWalkContext::m_nReduceOffset;
32 //////////////////////////////////////////////////////////////////////
34 CChainWalkContext::CChainWalkContext()
38 CChainWalkContext::~CChainWalkContext()
42 bool CChainWalkContext::LoadCharset(string sName)
49 for (i = 0x00; i <= 0xff; i++)
50 tCharset.m_PlainCharset[i] = i;
51 tCharset.m_nPlainCharsetLen = 256;
52 tCharset.m_sPlainCharsetName = sName;
53 tCharset.m_sPlainCharsetContent = "0x00, 0x01, ... 0xff";
54 m_vCharset.push_back(tCharset);
57 if(sName.substr(0, 6) == "hybrid") // Hybrid charset consisting of 2 charsets
62 if (ReadLinesFromFile("charset.txt", vLine))
65 for (i = 0; i < vLine.size(); i++)
68 if (vLine[i][0] == '#')
72 if (SeperateString(vLine[i], "=", vPart))
75 string sCharsetName = TrimString(vPart[0]);
76 if (sCharsetName == "")
79 // sCharsetName charset check
80 bool fCharsetNameCheckPass = true;
82 for (j = 0; j < sCharsetName.size(); j++)
84 if ( !isalpha(sCharsetName[j])
85 && !isdigit(sCharsetName[j])
86 && (sCharsetName[j] != '-'))
88 fCharsetNameCheckPass = false;
92 if (!fCharsetNameCheckPass)
94 printf("invalid charset name %s in charset configuration file\n", sCharsetName.c_str());
99 string sCharsetContent = TrimString(vPart[1]);
100 if (sCharsetContent == "" || sCharsetContent == "[]")
102 if (sCharsetContent[0] != '[' || sCharsetContent[sCharsetContent.size() - 1] != ']')
104 printf("invalid charset content %s in charset configuration file\n", sCharsetContent.c_str());
107 sCharsetContent = sCharsetContent.substr(1, sCharsetContent.size() - 2);
108 if (sCharsetContent.size() > 256)
110 printf("charset content %s too long\n", sCharsetContent.c_str());
114 //printf("%s = [%s]\n", sCharsetName.c_str(), sCharsetContent.c_str());
116 // Is it the wanted charset?
117 if(m_nHybridCharset == 1)
119 vector<tCharset> vCharsets;
120 GetHybridCharsets(sName, vCharsets);
121 if(sCharsetName == vCharsets[m_vCharset.size()].sName)
123 stCharset tCharset = {0};
124 tCharset.m_nPlainCharsetLen = sCharsetContent.size();
125 memcpy(tCharset.m_PlainCharset, sCharsetContent.c_str(), tCharset.m_nPlainCharsetLen);
126 tCharset.m_sPlainCharsetName = sCharsetName;
127 tCharset.m_sPlainCharsetContent = sCharsetContent;
128 tCharset.m_nPlainLenMin = vCharsets[m_vCharset.size()].nPlainLenMin;
129 tCharset.m_nPlainLenMax = vCharsets[m_vCharset.size()].nPlainLenMax;
130 m_vCharset.push_back(tCharset);
131 if(vCharsets.size() == m_vCharset.size())
133 i = 0; // Start the lookup over again for the next charset
136 else if (sCharsetName == sName)
139 tCharset.m_nPlainCharsetLen = sCharsetContent.size();
140 memcpy(tCharset.m_PlainCharset, sCharsetContent.c_str(), tCharset.m_nPlainCharsetLen);
141 tCharset.m_sPlainCharsetName = sCharsetName;
142 tCharset.m_sPlainCharsetContent = sCharsetContent;
143 m_vCharset.push_back(tCharset);
148 printf("charset %s not found in charset.txt\n", sName.c_str());
151 printf("can't open charset configuration file\n");
155 //////////////////////////////////////////////////////////////////////
157 bool CChainWalkContext::SetHashRoutine(string sHashRoutineName)
160 hr.GetHashRoutine(sHashRoutineName, m_pHashRoutine, m_nHashLen);
161 if (m_pHashRoutine != NULL)
163 m_sHashRoutineName = sHashRoutineName;
170 bool CChainWalkContext::SetPlainCharset(string sCharsetName, int nPlainLenMin, int nPlainLenMax)
172 // m_PlainCharset, m_nPlainCharsetLen, m_sPlainCharsetName, m_sPlainCharsetContent
173 if (!LoadCharset(sCharsetName))
176 if(m_vCharset.size() == 1) // Not hybrid charset
178 // m_nPlainLenMin, m_nPlainLenMax
179 if (nPlainLenMin < 1 || nPlainLenMax > MAX_PLAIN_LEN || nPlainLenMin > nPlainLenMax)
181 printf("invalid plaintext length range: %d - %d\n", nPlainLenMin, nPlainLenMax);
184 m_vCharset[0].m_nPlainLenMin = nPlainLenMin;
185 m_vCharset[0].m_nPlainLenMax = nPlainLenMax;
187 // m_nPlainSpaceUpToX
188 m_nPlainSpaceUpToX[0] = 0;
189 m_nPlainLenMaxTotal = 0;
190 m_nPlainLenMinTotal = 0;
193 for(j = 0; j < m_vCharset.size(); j++)
196 m_nPlainLenMaxTotal += m_vCharset[j].m_nPlainLenMax;
197 m_nPlainLenMinTotal += m_vCharset[j].m_nPlainLenMin;
198 for (i = 1; i <= m_vCharset[j].m_nPlainLenMax; i++)
200 nTemp *= m_vCharset[j].m_nPlainCharsetLen;
201 if (i < m_vCharset[j].m_nPlainLenMin)
202 m_nPlainSpaceUpToX[k] = 0;
204 m_nPlainSpaceUpToX[k] = m_nPlainSpaceUpToX[k - 1] + nTemp;
208 // m_nPlainSpaceTotal
209 m_nPlainSpaceTotal = m_nPlainSpaceUpToX[m_nPlainLenMaxTotal];
214 bool CChainWalkContext::SetRainbowTableIndex(int nRainbowTableIndex)
216 if (nRainbowTableIndex < 0)
218 m_nRainbowTableIndex = nRainbowTableIndex;
219 m_nReduceOffset = 65536 * nRainbowTableIndex;
224 bool CChainWalkContext::SetSalt(unsigned char *Salt, int nSaltLength)
226 memcpy(&m_Salt[0], Salt, nSaltLength);
228 m_nSaltLen = nSaltLength;
233 bool CChainWalkContext::SetupWithPathName(string sPathName, int& nRainbowChainLen, int& nRainbowChainCount)
235 // something like lm_alpha#1-7_0_100x16_test.rt
238 int nIndex = sPathName.find_last_of('\\');
240 int nIndex = sPathName.find_last_of('/');
243 sPathName = sPathName.substr(nIndex + 1);
245 if (sPathName.size() < 3)
247 printf("%s is not a rainbow table\n", sPathName.c_str());
251 if (sPathName.substr(sPathName.size() - 4) != ".rti")
253 printf("%s is not a rainbow table\n", sPathName.c_str());
258 vector<string> vPart;
259 if (!SeperateString(sPathName, "___x_", vPart))
261 printf("filename %s not identified\n", sPathName.c_str());
265 string sHashRoutineName = vPart[0];
266 int nRainbowTableIndex = atoi(vPart[2].c_str());
267 nRainbowChainLen = atoi(vPart[3].c_str());
268 nRainbowChainCount = atoi(vPart[4].c_str());
270 // Parse charset definition
271 string sCharsetDefinition = vPart[1];
273 int nPlainLenMin = 0, nPlainLenMax = 0;
275 // printf("Charset: %s", sCharsetDefinition.c_str());
277 if(sCharsetDefinition.substr(0, 6) == "hybrid") // Hybrid table
279 sCharsetName = sCharsetDefinition;
283 if (sCharsetDefinition.find('#') == -1) // For backward compatibility, "#1-7" is implied
285 sCharsetName = sCharsetDefinition;
291 vector<string> vCharsetDefinitionPart;
292 if (!SeperateString(sCharsetDefinition, "#-", vCharsetDefinitionPart))
294 printf("filename %s not identified\n", sPathName.c_str());
299 sCharsetName = vCharsetDefinitionPart[0];
300 nPlainLenMin = atoi(vCharsetDefinitionPart[1].c_str());
301 nPlainLenMax = atoi(vCharsetDefinitionPart[2].c_str());
306 if (!SetHashRoutine(sHashRoutineName))
308 printf("hash routine %s not supported\n", sHashRoutineName.c_str());
311 if (!SetPlainCharset(sCharsetName, nPlainLenMin, nPlainLenMax))
313 if (!SetRainbowTableIndex(nRainbowTableIndex))
315 printf("invalid rainbow table index %d\n", nRainbowTableIndex);
318 m_nPlainSpaceTotal = m_nPlainSpaceUpToX[m_nPlainLenMaxTotal];
322 string CChainWalkContext::GetHashRoutineName()
324 return m_sHashRoutineName;
327 int CChainWalkContext::GetHashLen()
332 string CChainWalkContext::GetPlainCharsetName()
334 return m_vCharset[0].m_sPlainCharsetName;
337 string CChainWalkContext::GetPlainCharsetContent()
339 return m_vCharset[0].m_sPlainCharsetContent;
342 int CChainWalkContext::GetPlainLenMin()
344 return m_vCharset[0].m_nPlainLenMin;
347 int CChainWalkContext::GetPlainLenMax()
349 return m_vCharset[0].m_nPlainLenMax;
352 uint64 CChainWalkContext::GetPlainSpaceTotal()
354 return m_nPlainSpaceTotal;
357 int CChainWalkContext::GetRainbowTableIndex()
359 return m_nRainbowTableIndex;
362 void CChainWalkContext::Dump()
364 printf("hash routine: %s\n", m_sHashRoutineName.c_str());
365 printf("hash length: %d\n", m_nHashLen);
367 printf("plain charset: ");
369 for (i = 0; i < m_vCharset[0].m_nPlainCharsetLen; i++)
371 if (isprint(m_vCharset[0].m_PlainCharset[i]))
372 printf("%c", m_vCharset[0].m_PlainCharset[i]);
378 printf("plain charset in hex: ");
379 for (i = 0; i < m_vCharset[0].m_nPlainCharsetLen; i++)
380 printf("%02x ", m_vCharset[0].m_PlainCharset[i]);
383 printf("plain length range: %d - %d\n", m_vCharset[0].m_nPlainLenMin, m_vCharset[0].m_nPlainLenMax);
384 printf("plain charset name: %s\n", m_vCharset[0].m_sPlainCharsetName.c_str());
385 //printf("plain charset content: %s\n", m_sPlainCharsetContent.c_str());
386 //for (i = 0; i <= m_nPlainLenMax; i++)
387 // printf("plain space up to %d: %s\n", i, uint64tostr(m_nPlainSpaceUpToX[i]).c_str());
388 printf("plain space total: %s\n", uint64tostr(m_nPlainSpaceTotal).c_str());
390 printf("rainbow table index: %d\n", m_nRainbowTableIndex);
391 printf("reduce offset: %s\n", uint64tostr(m_nReduceOffset).c_str());
395 void CChainWalkContext::GenerateRandomIndex()
397 RAND_bytes((unsigned char*)&m_nIndex, 8);
398 m_nIndex = m_nIndex % m_nPlainSpaceTotal;
401 void CChainWalkContext::SetIndex(uint64 nIndex)
406 void CChainWalkContext::SetHash(unsigned char* pHash)
408 memcpy(m_Hash, pHash, m_nHashLen);
411 void CChainWalkContext::IndexToPlain()
415 for (i = m_nPlainLenMaxTotal - 1; i >= m_nPlainLenMinTotal - 1; i--)
417 if (m_nIndex >= m_nPlainSpaceUpToX[i])
424 m_nPlainLen = m_nPlainLenMinTotal;
425 uint64 nIndexOfX = m_nIndex - m_nPlainSpaceUpToX[m_nPlainLen - 1];
430 for (i = m_nPlainLen - 1; i >= 0; i--)
433 for(int j = 0; j < m_vCharset.size(); i++)
435 nCharsetLen += m_vCharset[j].m_nPlainLenMax;
436 if(i < nCharsetLen) // We found the correct charset
438 m_Plain[i] = m_vCharset[j].m_PlainCharset[nIndexOfX % m_nPlainCharsetLen];
439 nIndexOfX /= m_vCharset[j].m_nPlainCharsetLen;
447 for (i = m_nPlainLen - 1; i >= 0; i--)
450 if (nIndexOfX < 0x100000000I64)
453 if (nIndexOfX < 0x100000000llu)
457 for(int j = 0; j < m_vCharset.size(); j++)
459 nCharsetLen += m_vCharset[j].m_nPlainLenMax;
460 if(i < nCharsetLen) // We found the correct charset
462 m_Plain[i] = m_vCharset[j].m_PlainCharset[nIndexOfX % m_vCharset[j].m_nPlainCharsetLen];
463 nIndexOfX /= m_vCharset[j].m_nPlainCharsetLen;
469 unsigned int nIndexOfX32 = (unsigned int)nIndexOfX;
473 for(int j = 0; j < m_vCharset.size(); j++)
475 nCharsetLen += m_vCharset[j].m_nPlainLenMax;
476 if(i < nCharsetLen) // We found the correct charset
479 // m_Plain[i] = m_PlainCharset[nIndexOfX32 % m_vCharset[j].m_nPlainCharsetLen];
480 // nIndexOfX32 /= m_vCharset[j].m_nPlainCharsetLen;
482 unsigned int nPlainCharsetLen = m_vCharset[j].m_nPlainCharsetLen;
493 m_Plain[i] = m_vCharset[j].m_PlainCharset[nTemp];
495 __asm__ __volatile__ ( "mov %2, %%eax;"
500 : "=m"(nIndexOfX32), "=m"(nTemp)
501 : "m"(nIndexOfX32), "m"(nPlainCharsetLen)
504 m_Plain[i] = m_vCharset[j].m_PlainCharset[nTemp];
513 void CChainWalkContext::PlainToHash()
515 m_pHashRoutine(m_Plain, m_nPlainLen, m_Hash);
518 void CChainWalkContext::HashToIndex(int nPos)
520 m_nIndex = (*(uint64*)m_Hash + m_nReduceOffset + nPos) % m_nPlainSpaceTotal;
523 uint64 CChainWalkContext::GetIndex()
527 const uint64 *CChainWalkContext::GetIndexPtr()
532 string CChainWalkContext::GetPlain()
536 for (i = 0; i < m_nPlainLen; i++)
539 if (c >= 32 && c <= 126)
548 string CChainWalkContext::GetBinary()
550 return HexToStr(m_Plain, m_nPlainLen);
553 string CChainWalkContext::GetPlainBinary()
558 for (i = 0; i < m_nPlainLenMax - m_nPlainLen; i++)
564 for (i = 0; i < m_nPlainLenMax - m_nPlainLen; i++)
570 string CChainWalkContext::GetHash()
572 return HexToStr(m_Hash, m_nHashLen);
575 bool CChainWalkContext::CheckHash(unsigned char* pHash)
577 if (memcmp(m_Hash, pHash, m_nHashLen) == 0)