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"
14 #include <openssl/rand.h>
18 #pragma comment(lib, "libeay32.lib")
21 //////////////////////////////////////////////////////////////////////
23 string CChainWalkContext::m_sHashRoutineName;
24 HASHROUTINE CChainWalkContext::m_pHashRoutine;
25 int CChainWalkContext::m_nHashLen;
26 int CChainWalkContext::m_nPlainLenMinTotal = 0;
27 int CChainWalkContext::m_nPlainLenMaxTotal = 0;
28 int CChainWalkContext::m_nHybridCharset = 0;
29 vector<stCharset> CChainWalkContext::m_vCharset;
30 uint64 CChainWalkContext::m_nPlainSpaceUpToX[MAX_PLAIN_LEN + 1];
31 uint64 CChainWalkContext::m_nPlainSpaceTotal;
32 unsigned char CChainWalkContext::m_Salt[MAX_SALT_LEN];
33 int CChainWalkContext::m_nSaltLen = 0;
34 int CChainWalkContext::m_nRainbowTableIndex;
35 uint64 CChainWalkContext::m_nReduceOffset;
37 //////////////////////////////////////////////////////////////////////
39 CChainWalkContext::CChainWalkContext()
43 CChainWalkContext::~CChainWalkContext()
47 bool CChainWalkContext::LoadCharset(string sName)
54 for (i = 0x00; i <= 0xff; i++)
55 tCharset.m_PlainCharset[i] = i;
56 tCharset.m_nPlainCharsetLen = 256;
57 tCharset.m_sPlainCharsetName = sName;
58 tCharset.m_sPlainCharsetContent = "0x00, 0x01, ... 0xff";
59 m_vCharset.push_back(tCharset);
62 if(sName.substr(0, 6) == "hybrid") // Hybrid charset consisting of 2 charsets
71 if (ReadLinesFromFile("charset.txt", vLine))
74 for (i = 0; i < vLine.size(); i++)
77 if (vLine[i][0] == '#')
81 if (SeperateString(vLine[i], "=", vPart))
84 string sCharsetName = TrimString(vPart[0]);
85 if (sCharsetName == "")
88 // sCharsetName charset check
89 bool fCharsetNameCheckPass = true;
91 for (j = 0; j < sCharsetName.size(); j++)
93 if ( !isalpha(sCharsetName[j])
94 && !isdigit(sCharsetName[j])
95 && (sCharsetName[j] != '-'))
97 fCharsetNameCheckPass = false;
101 if (!fCharsetNameCheckPass)
103 printf("invalid charset name %s in charset configuration file\n", sCharsetName.c_str());
108 string sCharsetContent = TrimString(vPart[1]);
109 if (sCharsetContent == "" || sCharsetContent == "[]")
111 if (sCharsetContent[0] != '[' || sCharsetContent[sCharsetContent.size() - 1] != ']')
113 printf("invalid charset content %s in charset configuration file\n", sCharsetContent.c_str());
116 sCharsetContent = sCharsetContent.substr(1, sCharsetContent.size() - 2);
117 if (sCharsetContent.size() > 256)
119 printf("charset content %s too long\n", sCharsetContent.c_str());
123 //printf("%s = [%s]\n", sCharsetName.c_str(), sCharsetContent.c_str());
125 // Is it the wanted charset?
126 if(m_nHybridCharset == 1)
128 vector<tCharset> vCharsets;
129 GetHybridCharsets(sName, vCharsets);
130 if(sCharsetName == vCharsets[m_vCharset.size()].sName)
132 stCharset tCharset = {0};
133 tCharset.m_nPlainCharsetLen = sCharsetContent.size();
134 memcpy(tCharset.m_PlainCharset, sCharsetContent.c_str(), tCharset.m_nPlainCharsetLen);
135 tCharset.m_sPlainCharsetName = sCharsetName;
136 tCharset.m_sPlainCharsetContent = sCharsetContent;
137 tCharset.m_nPlainLenMin = vCharsets[m_vCharset.size()].nPlainLenMin;
138 tCharset.m_nPlainLenMax = vCharsets[m_vCharset.size()].nPlainLenMax;
139 m_vCharset.push_back(tCharset);
140 if(vCharsets.size() == m_vCharset.size())
142 i = 0; // Start the lookup over again for the next charset
145 else if (sCharsetName == sName)
148 tCharset.m_nPlainCharsetLen = sCharsetContent.size();
149 memcpy(tCharset.m_PlainCharset, sCharsetContent.c_str(), tCharset.m_nPlainCharsetLen);
150 tCharset.m_sPlainCharsetName = sCharsetName;
151 tCharset.m_sPlainCharsetContent = sCharsetContent;
152 m_vCharset.push_back(tCharset);
157 printf("charset %s not found in charset.txt\n", sName.c_str());
160 printf("can't open charset configuration file\n");
164 //////////////////////////////////////////////////////////////////////
166 bool CChainWalkContext::SetHashRoutine(string sHashRoutineName)
169 hr.GetHashRoutine(sHashRoutineName, m_pHashRoutine, m_nHashLen);
170 if (m_pHashRoutine != NULL)
172 m_sHashRoutineName = sHashRoutineName;
179 bool CChainWalkContext::SetPlainCharset(string sCharsetName, int nPlainLenMin, int nPlainLenMax)
181 // m_PlainCharset, m_nPlainCharsetLen, m_sPlainCharsetName, m_sPlainCharsetContent
182 if (!LoadCharset(sCharsetName))
185 if(m_vCharset.size() == 1) // Not hybrid charset
187 // m_nPlainLenMin, m_nPlainLenMax
188 if (nPlainLenMin < 1 || nPlainLenMax > MAX_PLAIN_LEN || nPlainLenMin > nPlainLenMax)
190 printf("invalid plaintext length range: %d - %d\n", nPlainLenMin, nPlainLenMax);
193 m_vCharset[0].m_nPlainLenMin = nPlainLenMin;
194 m_vCharset[0].m_nPlainLenMax = nPlainLenMax;
196 // m_nPlainSpaceUpToX
197 m_nPlainSpaceUpToX[0] = 0;
198 m_nPlainLenMaxTotal = 0;
199 m_nPlainLenMinTotal = 0;
202 for(j = 0; j < m_vCharset.size(); j++)
205 m_nPlainLenMaxTotal += m_vCharset[j].m_nPlainLenMax;
206 m_nPlainLenMinTotal += m_vCharset[j].m_nPlainLenMin;
207 for (i = 1; i <= m_vCharset[j].m_nPlainLenMax; i++)
209 nTemp *= m_vCharset[j].m_nPlainCharsetLen;
210 if (i < m_vCharset[j].m_nPlainLenMin)
211 m_nPlainSpaceUpToX[k] = 0;
213 m_nPlainSpaceUpToX[k] = m_nPlainSpaceUpToX[k - 1] + nTemp;
217 // m_nPlainSpaceTotal
218 m_nPlainSpaceTotal = m_nPlainSpaceUpToX[m_nPlainLenMaxTotal];
223 bool CChainWalkContext::SetRainbowTableIndex(int nRainbowTableIndex)
225 if (nRainbowTableIndex < 0)
227 m_nRainbowTableIndex = nRainbowTableIndex;
228 m_nReduceOffset = 65536 * nRainbowTableIndex;
233 bool CChainWalkContext::SetSalt(unsigned char *Salt, int nSaltLength)
235 memcpy(&m_Salt[0], Salt, nSaltLength);
237 m_nSaltLen = nSaltLength;
242 bool CChainWalkContext::SetupWithPathName(string sPathName, int& nRainbowChainLen, int& nRainbowChainCount)
244 // something like lm_alpha#1-7_0_100x16_test.rt
247 int nIndex = sPathName.find_last_of('\\');
249 int nIndex = sPathName.find_last_of('/');
252 sPathName = sPathName.substr(nIndex + 1);
254 if (sPathName.size() < 3)
256 printf("%s is not a rainbow table\n", sPathName.c_str());
259 if (sPathName.substr(sPathName.size() - 3) != ".rt")
261 printf("%s is not a rainbow table\n", sPathName.c_str());
266 vector<string> vPart;
267 if (!SeperateString(sPathName, "___x_", vPart))
269 printf("filename %s not identified\n", sPathName.c_str());
273 string sHashRoutineName = vPart[0];
274 int nRainbowTableIndex = atoi(vPart[2].c_str());
275 nRainbowChainLen = atoi(vPart[3].c_str());
276 nRainbowChainCount = atoi(vPart[4].c_str());
278 // Parse charset definition
279 string sCharsetDefinition = vPart[1];
281 int nPlainLenMin = 0, nPlainLenMax = 0;
283 //printf("Charset: %s", sCharsetDefinition.c_str());
285 if(sCharsetDefinition.substr(0, 6) == "hybrid") // Hybrid table
287 sCharsetName = sCharsetDefinition;
291 if (sCharsetDefinition.find('#') == -1) // For backward compatibility, "#1-7" is implied
293 sCharsetName = sCharsetDefinition;
299 vector<string> vCharsetDefinitionPart;
300 if (!SeperateString(sCharsetDefinition, "#-", vCharsetDefinitionPart))
302 printf("filename %s not identified\n", sPathName.c_str());
307 sCharsetName = vCharsetDefinitionPart[0];
308 nPlainLenMin = atoi(vCharsetDefinitionPart[1].c_str());
309 nPlainLenMax = atoi(vCharsetDefinitionPart[2].c_str());
314 if (!SetHashRoutine(sHashRoutineName))
316 printf("hash routine %s not supported\n", sHashRoutineName.c_str());
319 if (!SetPlainCharset(sCharsetName, nPlainLenMin, nPlainLenMax))
321 if (!SetRainbowTableIndex(nRainbowTableIndex))
323 printf("invalid rainbow table index %d\n", nRainbowTableIndex);
330 string CChainWalkContext::GetHashRoutineName()
332 return m_sHashRoutineName;
335 int CChainWalkContext::GetHashLen()
340 string CChainWalkContext::GetPlainCharsetName()
342 return m_vCharset[0].m_sPlainCharsetName;
345 string CChainWalkContext::GetPlainCharsetContent()
347 return m_vCharset[0].m_sPlainCharsetContent;
350 int CChainWalkContext::GetPlainLenMin()
352 return m_vCharset[0].m_nPlainLenMin;
355 int CChainWalkContext::GetPlainLenMax()
357 return m_vCharset[0].m_nPlainLenMax;
360 uint64 CChainWalkContext::GetPlainSpaceTotal()
362 return m_nPlainSpaceTotal;
365 int CChainWalkContext::GetRainbowTableIndex()
367 return m_nRainbowTableIndex;
370 void CChainWalkContext::Dump()
372 printf("hash routine: %s\n", m_sHashRoutineName.c_str());
373 printf("hash length: %d\n", m_nHashLen);
375 printf("plain charset: ");
377 for (i = 0; i < m_vCharset[0].m_nPlainCharsetLen; i++)
379 if (isprint(m_vCharset[0].m_PlainCharset[i]))
380 printf("%c", m_vCharset[0].m_PlainCharset[i]);
386 printf("plain charset in hex: ");
387 for (i = 0; i < m_vCharset[0].m_nPlainCharsetLen; i++)
388 printf("%02x ", m_vCharset[0].m_PlainCharset[i]);
391 printf("plain length range: %d - %d\n", m_vCharset[0].m_nPlainLenMin, m_vCharset[0].m_nPlainLenMax);
392 printf("plain charset name: %s\n", m_vCharset[0].m_sPlainCharsetName.c_str());
393 //printf("plain charset content: %s\n", m_sPlainCharsetContent.c_str());
394 //for (i = 0; i <= m_nPlainLenMax; i++)
395 // printf("plain space up to %d: %s\n", i, uint64tostr(m_nPlainSpaceUpToX[i]).c_str());
396 printf("plain space total: %s\n", uint64tostr(m_nPlainSpaceTotal).c_str());
398 printf("rainbow table index: %d\n", m_nRainbowTableIndex);
399 printf("reduce offset: %s\n", uint64tostr(m_nReduceOffset).c_str());
403 void CChainWalkContext::SetIndex(uint64 nIndex)
408 void CChainWalkContext::SetHash(unsigned char* pHash)
410 memcpy(m_Hash, pHash, m_nHashLen);
413 void CChainWalkContext::IndexToPlain()
417 for (i = m_nPlainLenMaxTotal - 1; i >= m_nPlainLenMinTotal - 1; i--)
419 if (m_nIndex >= m_nPlainSpaceUpToX[i])
426 m_nPlainLen = m_nPlainLenMinTotal;
427 uint64 nIndexOfX = m_nIndex - m_nPlainSpaceUpToX[m_nPlainLen - 1];
432 for (i = m_nPlainLen - 1; i >= 0; i--)
435 for(int j = 0; j < m_vCharset.size(); j++)
437 nCharsetLen += m_vCharset[j].m_nPlainLenMax;
438 if(i < nCharsetLen) // We found the correct charset
440 m_Plain[i] = m_vCharset[j].m_PlainCharset[nIndexOfX % m_vCharset[j].m_nPlainCharsetLen];
441 nIndexOfX /= m_vCharset[j].m_nPlainCharsetLen;
449 for (i = m_nPlainLen - 1; i >= 0; i--)
452 if (nIndexOfX < 0x100000000I64)
455 if (nIndexOfX < 0x100000000llu)
459 for(int j = 0; j < m_vCharset.size(); j++)
461 nCharsetLen += m_vCharset[j].m_nPlainLenMax;
462 if(i < nCharsetLen) // We found the correct charset
464 m_Plain[i] = m_vCharset[j].m_PlainCharset[nIndexOfX % m_vCharset[j].m_nPlainCharsetLen];
465 nIndexOfX /= m_vCharset[j].m_nPlainCharsetLen;
471 unsigned int nIndexOfX32 = (unsigned int)nIndexOfX;
475 for(int j = 0; j < m_vCharset.size(); j++)
477 nCharsetLen += m_vCharset[j].m_nPlainLenMax;
478 if(i < nCharsetLen) // We found the correct charset
481 // m_Plain[i] = m_PlainCharset[nIndexOfX32 % m_vCharset[j].m_nPlainCharsetLen];
482 // nIndexOfX32 /= m_vCharset[j].m_nPlainCharsetLen;
484 unsigned int nPlainCharsetLen = m_vCharset[j].m_nPlainCharsetLen;
485 unsigned int volatile nTemp;
495 m_Plain[i] = m_vCharset[j].m_PlainCharset[nTemp];
497 __asm__ __volatile__ ( "mov %2, %%eax;"
502 : "=m"(nIndexOfX32), "=m"(nTemp)
503 : "m"(nIndexOfX32), "m"(nPlainCharsetLen)
507 m_Plain[i] = m_vCharset[j].m_PlainCharset[nTemp];
516 void CChainWalkContext::PlainToHash()
518 m_pHashRoutine(m_Plain, m_nPlainLen, m_Hash);
521 void CChainWalkContext::HashToIndex(int nPos)
523 m_nIndex = (*(uint64*)m_Hash + m_nReduceOffset + nPos) % m_nPlainSpaceTotal;
526 uint64 CChainWalkContext::GetIndex()
530 const uint64 *CChainWalkContext::GetIndexPtr()
535 string CChainWalkContext::GetPlain()
539 for (i = 0; i < m_nPlainLen; i++)
542 if (c >= 32 && c <= 126)
551 string CChainWalkContext::GetBinary()
553 return HexToStr(m_Plain, m_nPlainLen);
556 string CChainWalkContext::GetPlainBinary()
561 for (i = 0; i < m_nPlainLenMax - m_nPlainLen; i++)
567 for (i = 0; i < m_nPlainLenMax - m_nPlainLen; i++)
573 string CChainWalkContext::GetHash()
575 return HexToStr(m_Hash, m_nHashLen);
578 bool CChainWalkContext::CheckHash(unsigned char* pHash)
580 if (memcmp(m_Hash, pHash, m_nHashLen) == 0)