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>
16 #pragma comment(lib, "libeay32.lib")
19 //////////////////////////////////////////////////////////////////////
21 string CChainWalkContext::m_sHashRoutineName;
22 HASHROUTINE CChainWalkContext::m_pHashRoutine;
23 int CChainWalkContext::m_nHashLen;
24 int CChainWalkContext::m_nPlainLenMinTotal = 0;
25 int CChainWalkContext::m_nPlainLenMaxTotal = 0;
26 int CChainWalkContext::m_nHybridCharset = 0;
27 vector<stCharset> CChainWalkContext::m_vCharset;
28 uint64 CChainWalkContext::m_nPlainSpaceUpToX[MAX_PLAIN_LEN + 1];
29 uint64 CChainWalkContext::m_nPlainSpaceTotal;
30 unsigned char CChainWalkContext::m_Salt[MAX_SALT_LEN];
31 int CChainWalkContext::m_nSaltLen = 0;
32 int CChainWalkContext::m_nRainbowTableIndex;
33 uint64 CChainWalkContext::m_nReduceOffset;
35 //////////////////////////////////////////////////////////////////////
37 CChainWalkContext::CChainWalkContext()
41 CChainWalkContext::~CChainWalkContext()
45 bool CChainWalkContext::LoadCharset(string sName)
53 for (i = 0x00; i <= 0xff; i++)
54 tCharset.m_PlainCharset[i] = i;
55 tCharset.m_nPlainCharsetLen = 256;
56 tCharset.m_sPlainCharsetName = sName;
57 tCharset.m_sPlainCharsetContent = "0x00, 0x01, ... 0xff";
58 m_vCharset.push_back(tCharset);
61 if(sName.substr(0, 6) == "hybrid") // Hybrid charset consisting of 2 charsets
66 if (ReadLinesFromFile("charset.txt", vLine))
69 for (i = 0; i < vLine.size(); i++)
72 if (vLine[i][0] == '#')
76 if (SeperateString(vLine[i], "=", vPart))
79 string sCharsetName = TrimString(vPart[0]);
80 if (sCharsetName == "")
83 // sCharsetName charset check
84 bool fCharsetNameCheckPass = true;
86 for (j = 0; j < sCharsetName.size(); j++)
88 if ( !isalpha(sCharsetName[j])
89 && !isdigit(sCharsetName[j])
90 && (sCharsetName[j] != '-'))
92 fCharsetNameCheckPass = false;
96 if (!fCharsetNameCheckPass)
98 printf("invalid charset name %s in charset configuration file\n", sCharsetName.c_str());
103 string sCharsetContent = TrimString(vPart[1]);
104 if (sCharsetContent == "" || sCharsetContent == "[]")
106 if (sCharsetContent[0] != '[' || sCharsetContent[sCharsetContent.size() - 1] != ']')
108 printf("invalid charset content %s in charset configuration file\n", sCharsetContent.c_str());
111 sCharsetContent = sCharsetContent.substr(1, sCharsetContent.size() - 2);
112 if (sCharsetContent.size() > 256)
114 printf("charset content %s too long\n", sCharsetContent.c_str());
118 //printf("%s = [%s]\n", sCharsetName.c_str(), sCharsetContent.c_str());
120 // Is it the wanted charset?
121 if(m_nHybridCharset == 1)
123 vector<tCharset> vCharsets;
124 GetHybridCharsets(sName, vCharsets);
125 if(sCharsetName == vCharsets[m_vCharset.size()].sName)
127 stCharset tCharset = {0};
128 tCharset.m_nPlainCharsetLen = sCharsetContent.size();
129 memcpy(tCharset.m_PlainCharset, sCharsetContent.c_str(), tCharset.m_nPlainCharsetLen);
130 tCharset.m_sPlainCharsetName = sCharsetName;
131 tCharset.m_sPlainCharsetContent = sCharsetContent;
132 tCharset.m_nPlainLenMin = vCharsets[m_vCharset.size()].nPlainLenMin;
133 tCharset.m_nPlainLenMax = vCharsets[m_vCharset.size()].nPlainLenMax;
134 m_vCharset.push_back(tCharset);
135 if(vCharsets.size() == m_vCharset.size())
137 i = 0; // Start the lookup over again for the next charset
140 else if (sCharsetName == sName)
143 tCharset.m_nPlainCharsetLen = sCharsetContent.size();
144 memcpy(tCharset.m_PlainCharset, sCharsetContent.c_str(), tCharset.m_nPlainCharsetLen);
145 tCharset.m_sPlainCharsetName = sCharsetName;
146 tCharset.m_sPlainCharsetContent = sCharsetContent;
147 m_vCharset.push_back(tCharset);
152 printf("charset %s not found in charset.txt\n", sName.c_str());
155 printf("can't open charset configuration file\n");*/
159 //////////////////////////////////////////////////////////////////////
161 bool CChainWalkContext::SetHashRoutine(string sHashRoutineName)
164 hr.GetHashRoutine(sHashRoutineName, m_pHashRoutine, m_nHashLen);
165 if (m_pHashRoutine != NULL)
167 m_sHashRoutineName = sHashRoutineName;
174 bool CChainWalkContext::SetPlainCharset(string sCharsetName, int nPlainLenMin, int nPlainLenMax)
177 // m_PlainCharset, m_nPlainCharsetLen, m_sPlainCharsetName, m_sPlainCharsetContent
178 if (!LoadCharset(sCharsetName))
181 if(m_vCharset.size() == 1) // Not hybrid charset
183 // m_nPlainLenMin, m_nPlainLenMax
184 if (nPlainLenMin < 1 || nPlainLenMax > MAX_PLAIN_LEN || nPlainLenMin > nPlainLenMax)
186 printf("invalid plaintext length range: %d - %d\n", nPlainLenMin, nPlainLenMax);
189 m_vCharset[0].m_nPlainLenMin = nPlainLenMin;
190 m_vCharset[0].m_nPlainLenMax = nPlainLenMax;
192 // m_nPlainSpaceUpToX
193 m_nPlainSpaceUpToX[0] = 0;
194 m_nPlainLenMaxTotal = 0;
195 m_nPlainLenMinTotal = 0;
198 for(j = 0; j < m_vCharset.size(); j++)
201 m_nPlainLenMaxTotal += m_vCharset[j].m_nPlainLenMax;
202 m_nPlainLenMinTotal += m_vCharset[j].m_nPlainLenMin;
203 for (i = 1; i <= m_vCharset[j].m_nPlainLenMax; i++)
205 nTemp *= m_vCharset[j].m_nPlainCharsetLen;
206 if (i < m_vCharset[j].m_nPlainLenMin)
207 m_nPlainSpaceUpToX[k] = 0;
209 m_nPlainSpaceUpToX[k] = m_nPlainSpaceUpToX[k - 1] + nTemp;
213 // m_nPlainSpaceTotal
214 m_nPlainSpaceTotal = m_nPlainSpaceUpToX[m_nPlainLenMaxTotal];
219 bool CChainWalkContext::SetRainbowTableIndex(int nRainbowTableIndex)
221 if (nRainbowTableIndex < 0)
223 m_nRainbowTableIndex = nRainbowTableIndex;
224 m_nReduceOffset = 65536 * nRainbowTableIndex;
229 bool CChainWalkContext::SetSalt(unsigned char *Salt, int nSaltLength)
231 memcpy(&m_Salt[0], Salt, nSaltLength);
233 m_nSaltLen = nSaltLength;
238 bool CChainWalkContext::SetupWithPathName(string sPathName, int& nRainbowChainLen, int& nRainbowChainCount)
240 // something like lm_alpha#1-7_0_100x16_test.rt
243 int nIndex = sPathName.find_last_of('\\');
245 int nIndex = sPathName.find_last_of('/');
248 sPathName = sPathName.substr(nIndex + 1);
250 if (sPathName.size() < 3)
252 printf("%s is not a rainbow table\n", sPathName.c_str());
255 if (sPathName.substr(sPathName.size() - 4) != ".rti")
257 printf("%s is not a rainbow table\n", sPathName.c_str());
262 vector<string> vPart;
263 if (!SeperateString(sPathName, "___x_", vPart))
265 printf("filename %s not identified\n", sPathName.c_str());
269 string sHashRoutineName = vPart[0];
270 int nRainbowTableIndex = atoi(vPart[2].c_str());
271 nRainbowChainLen = atoi(vPart[3].c_str());
272 nRainbowChainCount = atoi(vPart[4].c_str());
274 // Parse charset definition
275 string sCharsetDefinition = vPart[1];
277 int nPlainLenMin = 0, nPlainLenMax = 0;
279 // printf("Charset: %s", sCharsetDefinition.c_str());
281 if(sCharsetDefinition.substr(0, 6) == "hybrid") // Hybrid table
283 sCharsetName = sCharsetDefinition;
287 if (sCharsetDefinition.find('#') == -1) // For backward compatibility, "#1-7" is implied
289 sCharsetName = sCharsetDefinition;
295 vector<string> vCharsetDefinitionPart;
296 if (!SeperateString(sCharsetDefinition, "#-", vCharsetDefinitionPart))
298 printf("filename %s not identified\n", sPathName.c_str());
303 sCharsetName = vCharsetDefinitionPart[0];
304 nPlainLenMin = atoi(vCharsetDefinitionPart[1].c_str());
305 nPlainLenMax = atoi(vCharsetDefinitionPart[2].c_str());
310 if (!SetHashRoutine(sHashRoutineName))
312 printf("hash routine %s not supported\n", sHashRoutineName.c_str());
315 if (!SetPlainCharset(sCharsetName, nPlainLenMin, nPlainLenMax))
317 if (!SetRainbowTableIndex(nRainbowTableIndex))
319 printf("invalid rainbow table index %d\n", nRainbowTableIndex);
326 string CChainWalkContext::GetHashRoutineName()
328 return m_sHashRoutineName;
331 int CChainWalkContext::GetHashLen()
336 string CChainWalkContext::GetPlainCharsetName()
338 return m_vCharset[0].m_sPlainCharsetName;
341 string CChainWalkContext::GetPlainCharsetContent()
343 return m_vCharset[0].m_sPlainCharsetContent;
346 int CChainWalkContext::GetPlainLenMin()
348 return m_vCharset[0].m_nPlainLenMin;
351 int CChainWalkContext::GetPlainLenMax()
353 return m_vCharset[0].m_nPlainLenMax;
356 uint64 CChainWalkContext::GetPlainSpaceTotal()
358 return m_nPlainSpaceTotal;
361 int CChainWalkContext::GetRainbowTableIndex()
363 return m_nRainbowTableIndex;
366 void CChainWalkContext::Dump()
368 printf("hash routine: %s\n", m_sHashRoutineName.c_str());
369 printf("hash length: %d\n", m_nHashLen);
371 printf("plain charset: ");
373 for (i = 0; i < m_vCharset[0].m_nPlainCharsetLen; i++)
375 if (isprint(m_vCharset[0].m_PlainCharset[i]))
376 printf("%c", m_vCharset[0].m_PlainCharset[i]);
382 printf("plain charset in hex: ");
383 for (i = 0; i < m_vCharset[0].m_nPlainCharsetLen; i++)
384 printf("%02x ", m_vCharset[0].m_PlainCharset[i]);
387 printf("plain length range: %d - %d\n", m_vCharset[0].m_nPlainLenMin, m_vCharset[0].m_nPlainLenMax);
388 printf("plain charset name: %s\n", m_vCharset[0].m_sPlainCharsetName.c_str());
389 //printf("plain charset content: %s\n", m_sPlainCharsetContent.c_str());
390 //for (i = 0; i <= m_nPlainLenMax; i++)
391 // printf("plain space up to %d: %s\n", i, uint64tostr(m_nPlainSpaceUpToX[i]).c_str());
392 printf("plain space total: %s\n", uint64tostr(m_nPlainSpaceTotal).c_str());
394 printf("rainbow table index: %d\n", m_nRainbowTableIndex);
395 printf("reduce offset: %s\n", uint64tostr(m_nReduceOffset).c_str());
399 void CChainWalkContext::GenerateRandomIndex()
401 RAND_bytes((unsigned char*)&m_nIndex, 8);
402 m_nIndex = m_nIndex % m_nPlainSpaceTotal;
405 void CChainWalkContext::SetIndex(uint64 nIndex)
410 void CChainWalkContext::SetHash(unsigned char* pHash)
412 memcpy(m_Hash, pHash, m_nHashLen);
415 void CChainWalkContext::IndexToPlain()
419 for (i = m_nPlainLenMaxTotal - 1; i >= m_nPlainLenMinTotal - 1; i--)
421 if (m_nIndex >= m_nPlainSpaceUpToX[i])
428 m_nPlainLen = m_nPlainLenMinTotal;
429 uint64 nIndexOfX = m_nIndex - m_nPlainSpaceUpToX[m_nPlainLen - 1];
434 for (i = m_nPlainLen - 1; i >= 0; i--)
437 for(int j = 0; j < m_vCharset.size(); i++)
439 nCharsetLen += m_vCharset[j].m_nPlainLenMax;
440 if(i < nCharsetLen) // We found the correct charset
442 m_Plain[i] = m_vCharset[j].m_PlainCharset[nIndexOfX % m_nPlainCharsetLen];
443 nIndexOfX /= m_vCharset[j].m_nPlainCharsetLen;
451 for (i = m_nPlainLen - 1; i >= 0; i--)
454 if (nIndexOfX < 0x100000000I64)
457 if (nIndexOfX < 0x100000000llu)
461 for(int j = 0; j < m_vCharset.size(); j++)
463 nCharsetLen += m_vCharset[j].m_nPlainLenMax;
464 if(i < nCharsetLen) // We found the correct charset
466 m_Plain[i] = m_vCharset[j].m_PlainCharset[nIndexOfX % m_vCharset[j].m_nPlainCharsetLen];
467 nIndexOfX /= m_vCharset[j].m_nPlainCharsetLen;
473 unsigned int nIndexOfX32 = (unsigned int)nIndexOfX;
477 for(int j = 0; j < m_vCharset.size(); j++)
479 nCharsetLen += m_vCharset[j].m_nPlainLenMax;
480 if(i < nCharsetLen) // We found the correct charset
483 // m_Plain[i] = m_PlainCharset[nIndexOfX32 % m_vCharset[j].m_nPlainCharsetLen];
484 // nIndexOfX32 /= m_vCharset[j].m_nPlainCharsetLen;
486 unsigned int nPlainCharsetLen = m_vCharset[j].m_nPlainCharsetLen;
497 m_Plain[i] = m_vCharset[j].m_PlainCharset[nTemp];
499 __asm__ __volatile__ ( "mov %2, %%eax;"
504 : "=m"(nIndexOfX32), "=m"(nTemp)
505 : "m"(nIndexOfX32), "m"(nPlainCharsetLen)
508 m_Plain[i] = m_vCharset[j].m_PlainCharset[nTemp];
517 void CChainWalkContext::PlainToHash()
519 m_pHashRoutine(m_Plain, m_nPlainLen, m_Hash);
522 void CChainWalkContext::HashToIndex(int nPos)
524 m_nIndex = (*(uint64*)m_Hash + m_nReduceOffset + nPos) % m_nPlainSpaceTotal;
527 uint64 CChainWalkContext::GetIndex()
531 const uint64 *CChainWalkContext::GetIndexPtr()
536 string CChainWalkContext::GetPlain()
540 for (i = 0; i < m_nPlainLen; i++)
543 if (c >= 32 && c <= 126)
552 string CChainWalkContext::GetBinary()
554 return HexToStr(m_Plain, m_nPlainLen);
557 string CChainWalkContext::GetPlainBinary()
562 for (i = 0; i < m_nPlainLenMax - m_nPlainLen; i++)
568 for (i = 0; i < m_nPlainLenMax - m_nPlainLen; i++)
574 string CChainWalkContext::GetHash()
576 return HexToStr(m_Hash, m_nHashLen);
579 bool CChainWalkContext::CheckHash(unsigned char* pHash)
581 if (memcmp(m_Hash, pHash, m_nHashLen) == 0)