2 * freerainbowtables is a multithreaded implementation and fork of the original
5 * Copyright (C) Zhu Shuanglei <shuanglei@hotmail.com>
6 * Copyright Martin Westergaard Jørgensen <martinwj2005@gmail.com>
7 * Copyright 2009, 2010 Daniël Niggebrugge <niggebrugge@fox-it.com>
8 * Copyright 2009, 2010 James Nobis <frt@quelrod.net>
9 * Copyright 2010 Yngve AAdlandsvik
11 * This file is part of rcracki_mt.
13 * freerainbowtables is free software: you can redistribute it and/or modify
14 * it under the terms of the GNU General Public License as published by
15 * the Free Software Foundation, either version 2 of the License, or
16 * (at your option) any later version.
18 * freerainbowtables is distributed in the hope that it will be useful,
19 * but WITHOUT ANY WARRANTY; without even the implied warranty of
20 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
21 * GNU General Public License for more details.
23 * You should have received a copy of the GNU General Public License
24 * along with freerainbowtables. If not, see <http://www.gnu.org/licenses/>.
28 #pragma warning(disable : 4786)
31 #include "ChainWalkContext.h"
36 //////////////////////////////////////////////////////////////////////
38 string CChainWalkContext::m_sHashRoutineName;
39 HASHROUTINE CChainWalkContext::m_pHashRoutine;
40 int CChainWalkContext::m_nHashLen;
41 int CChainWalkContext::m_nPlainLenMinTotal = 0;
42 int CChainWalkContext::m_nPlainLenMaxTotal = 0;
43 int CChainWalkContext::m_nHybridCharset = 0;
44 vector<stCharset> CChainWalkContext::m_vCharset;
45 uint64 CChainWalkContext::m_nPlainSpaceUpToX[MAX_PLAIN_LEN + 1];
46 uint64 CChainWalkContext::m_nPlainSpaceTotal;
47 unsigned char CChainWalkContext::m_Salt[MAX_SALT_LEN];
48 int CChainWalkContext::m_nSaltLen = 0;
49 int CChainWalkContext::m_nRainbowTableIndex;
50 uint64 CChainWalkContext::m_nReduceOffset;
52 //////////////////////////////////////////////////////////////////////
54 CChainWalkContext::CChainWalkContext()
58 CChainWalkContext::~CChainWalkContext()
62 bool CChainWalkContext::LoadCharset(string sName)
69 for (i = 0x00; i <= 0xff; i++)
70 tCharset.m_PlainCharset[i] = i;
71 tCharset.m_nPlainCharsetLen = 256;
72 tCharset.m_sPlainCharsetName = sName;
73 tCharset.m_sPlainCharsetContent = "0x00, 0x01, ... 0xff";
74 m_vCharset.push_back(tCharset);
77 if(sName.substr(0, 6) == "hybrid") // Hybrid charset consisting of 2 charsets
82 bool readCharset = false;
86 if ( boinc_ReadLinesFromFile( "charset.txt", vLine ) )
89 if ( ReadLinesFromFile("charset.txt", vLine) )
91 else if ( ReadLinesFromFile(GetApplicationPath() + "charset.txt", vLine) )
98 for (i = 0; i < vLine.size(); i++)
101 if (vLine[i][0] == '#')
104 vector<string> vPart;
105 if (SeperateString(vLine[i], "=", vPart))
108 string sCharsetName = TrimString(vPart[0]);
109 if (sCharsetName == "")
112 // sCharsetName charset check
113 bool fCharsetNameCheckPass = true;
115 for (j = 0; j < sCharsetName.size(); j++)
117 if ( !isalpha(sCharsetName[j])
118 && !isdigit(sCharsetName[j])
119 && (sCharsetName[j] != '-'))
121 fCharsetNameCheckPass = false;
125 if (!fCharsetNameCheckPass)
127 printf("invalid charset name %s in charset configuration file\n", sCharsetName.c_str());
132 string sCharsetContent = TrimString(vPart[1]);
133 if (sCharsetContent == "" || sCharsetContent == "[]")
135 if (sCharsetContent[0] != '[' || sCharsetContent[sCharsetContent.size() - 1] != ']')
137 printf("invalid charset content %s in charset configuration file\n", sCharsetContent.c_str());
140 sCharsetContent = sCharsetContent.substr(1, sCharsetContent.size() - 2);
141 if (sCharsetContent.size() > 256)
143 printf("charset content %s too long\n", sCharsetContent.c_str());
147 //printf("%s = [%s]\n", sCharsetName.c_str(), sCharsetContent.c_str());
149 // Is it the wanted charset?
150 if(m_nHybridCharset == 1)
152 vector<tCharset> vCharsets;
153 GetHybridCharsets(sName, vCharsets);
154 if(sCharsetName == vCharsets[m_vCharset.size()].sName)
157 tCharset.m_nPlainCharsetLen = sCharsetContent.size();
158 memcpy(tCharset.m_PlainCharset, sCharsetContent.c_str(), tCharset.m_nPlainCharsetLen);
159 tCharset.m_sPlainCharsetName = sCharsetName;
160 tCharset.m_sPlainCharsetContent = sCharsetContent;
161 tCharset.m_nPlainLenMin = vCharsets[m_vCharset.size()].nPlainLenMin;
162 tCharset.m_nPlainLenMax = vCharsets[m_vCharset.size()].nPlainLenMax;
163 m_vCharset.push_back(tCharset);
164 if(vCharsets.size() == m_vCharset.size())
166 i = 0; // Start the lookup over again for the next charset
169 else if (sCharsetName == sName)
172 tCharset.m_nPlainCharsetLen = sCharsetContent.size();
173 memcpy(tCharset.m_PlainCharset, sCharsetContent.c_str(), tCharset.m_nPlainCharsetLen);
174 tCharset.m_sPlainCharsetName = sCharsetName;
175 tCharset.m_sPlainCharsetContent = sCharsetContent;
176 m_vCharset.push_back(tCharset);
181 printf("charset %s not found in charset.txt\n", sName.c_str());
184 printf("can't open charset configuration file\n");
189 //////////////////////////////////////////////////////////////////////
191 bool CChainWalkContext::SetHashRoutine(string sHashRoutineName)
194 hr.GetHashRoutine(sHashRoutineName, m_pHashRoutine, m_nHashLen);
195 if (m_pHashRoutine != NULL)
197 m_sHashRoutineName = sHashRoutineName;
204 bool CChainWalkContext::SetPlainCharset(string sCharsetName, int nPlainLenMin, int nPlainLenMax)
206 // m_PlainCharset, m_nPlainCharsetLen, m_sPlainCharsetName, m_sPlainCharsetContent
207 if (!LoadCharset(sCharsetName))
210 if(m_vCharset.size() == 1) // Not hybrid charset
212 // m_nPlainLenMin, m_nPlainLenMax
213 if (nPlainLenMin < 1 || nPlainLenMax > MAX_PLAIN_LEN || nPlainLenMin > nPlainLenMax)
215 printf("invalid plaintext length range: %d - %d\n", nPlainLenMin, nPlainLenMax);
218 m_vCharset[0].m_nPlainLenMin = nPlainLenMin;
219 m_vCharset[0].m_nPlainLenMax = nPlainLenMax;
221 // m_nPlainSpaceUpToX
222 m_nPlainSpaceUpToX[0] = 0;
223 m_nPlainLenMaxTotal = 0;
224 m_nPlainLenMinTotal = 0;
227 for(j = 0; j < m_vCharset.size(); j++)
230 m_nPlainLenMaxTotal += m_vCharset[j].m_nPlainLenMax;
231 m_nPlainLenMinTotal += m_vCharset[j].m_nPlainLenMin;
232 for (i = 1; i <= m_vCharset[j].m_nPlainLenMax; i++)
234 nTemp *= m_vCharset[j].m_nPlainCharsetLen;
235 if (i < m_vCharset[j].m_nPlainLenMin)
236 m_nPlainSpaceUpToX[k] = 0;
238 m_nPlainSpaceUpToX[k] = m_nPlainSpaceUpToX[k - 1] + nTemp;
242 // m_nPlainSpaceTotal
243 m_nPlainSpaceTotal = m_nPlainSpaceUpToX[m_nPlainLenMaxTotal];
248 bool CChainWalkContext::SetRainbowTableIndex(int nRainbowTableIndex)
250 if (nRainbowTableIndex < 0)
252 m_nRainbowTableIndex = nRainbowTableIndex;
253 m_nReduceOffset = 65536 * nRainbowTableIndex;
258 bool CChainWalkContext::SetSalt(unsigned char *Salt, int nSaltLength)
260 memcpy(&m_Salt[0], Salt, nSaltLength);
262 m_nSaltLen = nSaltLength;
267 bool CChainWalkContext::SetupWithPathName(string sPathName, int& nRainbowChainLen, int& nRainbowChainCount)
269 // something like lm_alpha#1-7_0_100x16_test.rt
272 int nIndex = sPathName.find_last_of('\\');
274 int nIndex = sPathName.find_last_of('/');
277 sPathName = sPathName.substr(nIndex + 1);
279 if (sPathName.size() < 3)
281 printf("%s is not a rainbow table\n", sPathName.c_str());
285 if (sPathName.substr(sPathName.size() - 4) != ".rti")
287 printf("%s is not a rainbow table\n", sPathName.c_str());
292 vector<string> vPart;
293 if (!SeperateString(sPathName, "___x_", vPart))
295 printf("filename %s not identified\n", sPathName.c_str());
299 string sHashRoutineName = vPart[0];
300 int nRainbowTableIndex = atoi(vPart[2].c_str());
301 nRainbowChainLen = atoi(vPart[3].c_str());
302 nRainbowChainCount = atoi(vPart[4].c_str());
304 // Parse charset definition
305 string sCharsetDefinition = vPart[1];
307 int nPlainLenMin = 0, nPlainLenMax = 0;
309 // printf("Charset: %s", sCharsetDefinition.c_str());
311 if(sCharsetDefinition.substr(0, 6) == "hybrid") // Hybrid table
313 sCharsetName = sCharsetDefinition;
317 if ( sCharsetDefinition.find('#') == string::npos ) // For backward compatibility, "#1-7" is implied
319 sCharsetName = sCharsetDefinition;
325 vector<string> vCharsetDefinitionPart;
326 if (!SeperateString(sCharsetDefinition, "#-", vCharsetDefinitionPart))
328 printf("filename %s not identified\n", sPathName.c_str());
333 sCharsetName = vCharsetDefinitionPart[0];
334 nPlainLenMin = atoi(vCharsetDefinitionPart[1].c_str());
335 nPlainLenMax = atoi(vCharsetDefinitionPart[2].c_str());
340 if (!SetHashRoutine(sHashRoutineName))
342 printf("hash routine %s not supported\n", sHashRoutineName.c_str());
345 if (!SetPlainCharset(sCharsetName, nPlainLenMin, nPlainLenMax))
347 if (!SetRainbowTableIndex(nRainbowTableIndex))
349 printf("invalid rainbow table index %d\n", nRainbowTableIndex);
352 m_nPlainSpaceTotal = m_nPlainSpaceUpToX[m_nPlainLenMaxTotal];
356 string CChainWalkContext::GetHashRoutineName()
358 return m_sHashRoutineName;
361 int CChainWalkContext::GetHashLen()
366 string CChainWalkContext::GetPlainCharsetName()
368 return m_vCharset[0].m_sPlainCharsetName;
371 string CChainWalkContext::GetPlainCharsetContent()
373 return m_vCharset[0].m_sPlainCharsetContent;
376 int CChainWalkContext::GetPlainLenMin()
378 return m_vCharset[0].m_nPlainLenMin;
381 int CChainWalkContext::GetPlainLenMax()
383 return m_vCharset[0].m_nPlainLenMax;
386 uint64 CChainWalkContext::GetPlainSpaceTotal()
388 return m_nPlainSpaceTotal;
391 int CChainWalkContext::GetRainbowTableIndex()
393 return m_nRainbowTableIndex;
396 void CChainWalkContext::Dump()
398 printf("hash routine: %s\n", m_sHashRoutineName.c_str());
399 printf("hash length: %d\n", m_nHashLen);
401 printf("plain charset: ");
403 for (i = 0; i < m_vCharset[0].m_nPlainCharsetLen; i++)
405 if (isprint(m_vCharset[0].m_PlainCharset[i]))
406 printf("%c", m_vCharset[0].m_PlainCharset[i]);
412 printf("plain charset in hex: ");
413 for (i = 0; i < m_vCharset[0].m_nPlainCharsetLen; i++)
414 printf("%02x ", m_vCharset[0].m_PlainCharset[i]);
417 printf("plain length range: %d - %d\n", m_vCharset[0].m_nPlainLenMin, m_vCharset[0].m_nPlainLenMax);
418 printf("plain charset name: %s\n", m_vCharset[0].m_sPlainCharsetName.c_str());
419 //printf("plain charset content: %s\n", m_sPlainCharsetContent.c_str());
420 //for (i = 0; i <= m_nPlainLenMax; i++)
421 // printf("plain space up to %d: %s\n", i, uint64tostr(m_nPlainSpaceUpToX[i]).c_str());
422 printf("plain space total: %s\n", uint64tostr(m_nPlainSpaceTotal).c_str());
424 printf("rainbow table index: %d\n", m_nRainbowTableIndex);
425 printf("reduce offset: %s\n", uint64tostr(m_nReduceOffset).c_str());
429 void CChainWalkContext::GenerateRandomIndex()
431 RAND_bytes((unsigned char*)&m_nIndex, 8);
432 m_nIndex = m_nIndex % m_nPlainSpaceTotal;
435 void CChainWalkContext::SetIndex(uint64 nIndex)
440 void CChainWalkContext::SetHash(unsigned char* pHash)
442 memcpy(m_Hash, pHash, m_nHashLen);
445 void CChainWalkContext::IndexToPlain()
449 for (i = m_nPlainLenMaxTotal - 1; i >= m_nPlainLenMinTotal - 1; i--)
451 if (m_nIndex >= m_nPlainSpaceUpToX[i])
458 m_nPlainLen = m_nPlainLenMinTotal;
459 uint64 nIndexOfX = m_nIndex - m_nPlainSpaceUpToX[m_nPlainLen - 1];
461 // this is the generic code for non ia32 x86 platforms
462 #if !defined(_M_X86) && !defined(__i386__)
464 // 32-bit/generic version (slow for non 64-bit platforms)
465 for (i = m_nPlainLen - 1; i >= 0; i--)
468 for(uint32 j = 0; j < m_vCharset.size(); i++)
470 nCharsetLen += m_vCharset[j].m_nPlainLenMax;
471 if(i < nCharsetLen) // We found the correct charset
473 m_Plain[i] = m_vCharset[j].m_PlainCharset[nIndexOfX % m_vCharset[j].m_nPlainCharsetLen];
474 nIndexOfX /= m_vCharset[j].m_nPlainCharsetLen;
483 for (i = m_nPlainLen - 1; i >= 0; i--)
485 // 0x100000000 = 2^32
487 if (nIndexOfX < 0x100000000I64)
490 if (nIndexOfX < 0x100000000llu)
494 for(uint32 j = 0; j < m_vCharset.size(); j++)
496 nCharsetLen += m_vCharset[j].m_nPlainLenMax;
497 if(i < nCharsetLen) // We found the correct charset
499 m_Plain[i] = m_vCharset[j].m_PlainCharset[nIndexOfX % m_vCharset[j].m_nPlainCharsetLen];
500 nIndexOfX /= m_vCharset[j].m_nPlainCharsetLen;
506 uint32 nIndexOfX32 = (uint32)nIndexOfX;
510 for(uint32 j = 0; j < m_vCharset.size(); j++)
512 nCharsetLen += m_vCharset[j].m_nPlainLenMax;
513 if(i < nCharsetLen) // We found the correct charset
516 // m_Plain[i] = m_vCharset[j].m_PlainCharset[nIndexOfX32 % m_vCharset[j].m_nPlainCharsetLen];
517 // nIndexOfX32 /= m_vCharset[j].m_nPlainCharsetLen;
519 // moving nPlainCharsetLen into the asm body and avoiding the extra temp
520 // variable results in performance gain
521 // unsigned int nPlainCharsetLen = m_vCharset[j].m_nPlainCharsetLen;
524 #if defined(_WIN32) && !defined(__GNUC__)
529 div m_vCharset[j].m_nPlainCharsetLen
533 m_Plain[i] = m_vCharset[j].m_PlainCharset[nTemp];
535 __asm__ __volatile__ ( "mov %2, %%eax;"
540 : "=m"(nIndexOfX32), "=m"(nTemp)
541 : "m"(nIndexOfX32), "m"(m_vCharset[j].m_nPlainCharsetLen)
544 m_Plain[i] = m_vCharset[j].m_PlainCharset[nTemp];
553 void CChainWalkContext::PlainToHash()
555 m_pHashRoutine(m_Plain, m_nPlainLen, m_Hash);
558 void CChainWalkContext::HashToIndex(int nPos)
560 m_nIndex = (*(uint64*)m_Hash + m_nReduceOffset + nPos) % m_nPlainSpaceTotal;
563 uint64 CChainWalkContext::GetIndex()
567 const uint64 *CChainWalkContext::GetIndexPtr()
572 string CChainWalkContext::GetPlain()
576 for (i = 0; i < m_nPlainLen; i++)
579 if (c >= 32 && c <= 126)
588 string CChainWalkContext::GetBinary()
590 return HexToStr(m_Plain, m_nPlainLen);
593 string CChainWalkContext::GetPlainBinary()
598 for (i = 0; i < m_nPlainLenMax - m_nPlainLen; i++)
604 for (i = 0; i < m_nPlainLenMax - m_nPlainLen; i++)
610 string CChainWalkContext::GetHash()
612 return HexToStr(m_Hash, m_nHashLen);
615 bool CChainWalkContext::CheckHash(unsigned char* pHash)
617 if (memcmp(m_Hash, pHash, m_nHashLen) == 0)