2 * rcracki_mt is a multithreaded implementation and fork of the original
\r
5 * Copyright (C) Zhu Shuanglei <shuanglei@hotmail.com>
\r
6 * Copyright Martin Westergaard Jørgensen <martinwj2005@gmail.com>
\r
7 * Copyright 2009, 2010 Daniël Niggebrugge <niggebrugge@fox-it.com>
\r
8 * Copyright 2009, 2010 James Nobis <frt@quelrod.net>
\r
9 * Copyright 2010 Yngve AAdlandsvik
\r
11 * This file is part of rcracki_mt.
\r
13 * rcracki_mt is free software: you can redistribute it and/or modify
\r
14 * it under the terms of the GNU General Public License as published by
\r
15 * the Free Software Foundation, either version 2 of the License, or
\r
16 * (at your option) any later version.
\r
18 * rcracki_mt is distributed in the hope that it will be useful,
\r
19 * but WITHOUT ANY WARRANTY; without even the implied warranty of
\r
20 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
\r
21 * GNU General Public License for more details.
\r
23 * You should have received a copy of the GNU General Public License
\r
24 * along with rcracki_mt. If not, see <http://www.gnu.org/licenses/>.
\r
27 #if defined(_WIN32) && !defined(__GNUC__)
\r
28 #pragma warning(disable : 4786 4267 4018)
\r
31 #include "ChainWalkContext.h"
\r
35 //////////////////////////////////////////////////////////////////////
\r
37 string CChainWalkContext::m_sHashRoutineName;
\r
38 HASHROUTINE CChainWalkContext::m_pHashRoutine;
\r
39 int CChainWalkContext::m_nHashLen;
\r
40 int CChainWalkContext::m_nPlainLenMinTotal = 0;
\r
41 int CChainWalkContext::m_nPlainLenMaxTotal = 0;
\r
42 int CChainWalkContext::m_nHybridCharset = 0;
\r
43 bool CChainWalkContext::isOldRtFormat = false;
\r
44 bool CChainWalkContext::isRti2RtFormat = false;
\r
45 vector<stCharset> CChainWalkContext::m_vCharset;
\r
46 uint64 CChainWalkContext::m_nPlainSpaceUpToX[MAX_PLAIN_LEN + 1];
\r
47 uint64 CChainWalkContext::m_nPlainSpaceTotal;
\r
48 unsigned char CChainWalkContext::m_Salt[MAX_SALT_LEN];
\r
49 int CChainWalkContext::m_nSaltLen = 0;
\r
50 int CChainWalkContext::m_nRainbowTableIndex;
\r
51 uint64 CChainWalkContext::m_nReduceOffset;
\r
53 //////////////////////////////////////////////////////////////////////
\r
55 CChainWalkContext::CChainWalkContext()
\r
59 CChainWalkContext::~CChainWalkContext()
\r
63 bool CChainWalkContext::LoadCharset(string sName)
\r
66 if (sName == "byte")
\r
70 for (i = 0x00; i <= 0xff; i++)
\r
71 tCharset.m_PlainCharset[i] = (unsigned char) i;
\r
72 tCharset.m_nPlainCharsetLen = 256;
\r
73 tCharset.m_sPlainCharsetName = sName;
\r
74 tCharset.m_sPlainCharsetContent = "0x00, 0x01, ... 0xff";
\r
75 m_vCharset.push_back(tCharset);
\r
78 if(sName.substr(0, 6) == "hybrid") // Hybrid charset consisting of 2 charsets
\r
79 m_nHybridCharset = 1;
\r
81 m_nHybridCharset = 0;
\r
83 bool readCharset = false;
\r
84 vector<string> vLine;
\r
87 if ( boinc_ReadLinesFromFile( "charset.txt", vLine ) )
\r
90 if ( ReadLinesFromFile("charset.txt", vLine) )
\r
92 else if ( ReadLinesFromFile(GetApplicationPath() + "charset.txt", vLine) )
\r
99 for (i = 0; i < vLine.size(); i++)
\r
102 if (vLine[i][0] == '#')
\r
105 vector<string> vPart;
\r
106 if (SeperateString(vLine[i], "=", vPart))
\r
109 string sCharsetName = TrimString(vPart[0]);
\r
110 if (sCharsetName == "")
\r
113 // sCharsetName charset check
\r
114 bool fCharsetNameCheckPass = true;
\r
116 for (j = 0; j < sCharsetName.size(); j++)
\r
118 if ( !isalpha(sCharsetName[j])
\r
119 && !isdigit(sCharsetName[j])
\r
120 && (sCharsetName[j] != '-'))
\r
122 fCharsetNameCheckPass = false;
\r
126 if (!fCharsetNameCheckPass)
\r
128 printf("invalid charset name %s in charset configuration file\n", sCharsetName.c_str());
\r
133 string sCharsetContent = TrimString(vPart[1]);
\r
134 if (sCharsetContent == "" || sCharsetContent == "[]")
\r
136 if (sCharsetContent[0] != '[' || sCharsetContent[sCharsetContent.size() - 1] != ']')
\r
138 printf("invalid charset content %s in charset configuration file\n", sCharsetContent.c_str());
\r
141 sCharsetContent = sCharsetContent.substr(1, sCharsetContent.size() - 2);
\r
142 if (sCharsetContent.size() > 256)
\r
144 printf("charset content %s too long\n", sCharsetContent.c_str());
\r
148 //printf("%s = [%s]\n", sCharsetName.c_str(), sCharsetContent.c_str());
\r
150 // Is it the wanted charset?
\r
151 if(m_nHybridCharset == 1)
\r
153 vector<tCharset> vCharsets;
\r
154 GetHybridCharsets(sName, vCharsets);
\r
155 if(sCharsetName == vCharsets[m_vCharset.size()].sName)
\r
157 stCharset tCharset;
\r
158 tCharset.m_nPlainCharsetLen = sCharsetContent.size();
\r
159 memcpy(tCharset.m_PlainCharset, sCharsetContent.c_str(), tCharset.m_nPlainCharsetLen);
\r
160 tCharset.m_sPlainCharsetName = sCharsetName;
\r
161 tCharset.m_sPlainCharsetContent = sCharsetContent;
\r
162 tCharset.m_nPlainLenMin = vCharsets[m_vCharset.size()].nPlainLenMin;
\r
163 tCharset.m_nPlainLenMax = vCharsets[m_vCharset.size()].nPlainLenMax;
\r
164 m_vCharset.push_back(tCharset);
\r
165 if(vCharsets.size() == m_vCharset.size())
\r
167 i = 0; // Start the lookup over again for the next charset
\r
170 else if (sCharsetName == sName)
\r
172 stCharset tCharset;
\r
173 tCharset.m_nPlainCharsetLen = sCharsetContent.size();
\r
174 memcpy(tCharset.m_PlainCharset, sCharsetContent.c_str(), tCharset.m_nPlainCharsetLen);
\r
175 tCharset.m_sPlainCharsetName = sCharsetName;
\r
176 tCharset.m_sPlainCharsetContent = sCharsetContent;
\r
177 m_vCharset.push_back(tCharset);
\r
182 printf("charset %s not found in charset.txt\n", sName.c_str());
\r
185 printf("can't open charset configuration file\n");
\r
190 //////////////////////////////////////////////////////////////////////
\r
192 bool CChainWalkContext::SetHashRoutine(string sHashRoutineName)
\r
195 hr.GetHashRoutine(sHashRoutineName, m_pHashRoutine, m_nHashLen);
\r
196 if (m_pHashRoutine != NULL)
\r
198 m_sHashRoutineName = sHashRoutineName;
\r
205 bool CChainWalkContext::SetPlainCharset(string sCharsetName, int nPlainLenMin, int nPlainLenMax)
\r
207 // m_PlainCharset, m_nPlainCharsetLen, m_sPlainCharsetName, m_sPlainCharsetContent
\r
208 if (!LoadCharset(sCharsetName))
\r
211 if(m_vCharset.size() == 1) // Not hybrid charset
\r
213 // m_nPlainLenMin, m_nPlainLenMax
\r
214 if (nPlainLenMin < 1 || nPlainLenMax > MAX_PLAIN_LEN || nPlainLenMin > nPlainLenMax)
\r
216 printf("invalid plaintext length range: %d - %d\n", nPlainLenMin, nPlainLenMax);
\r
219 m_vCharset[0].m_nPlainLenMin = nPlainLenMin;
\r
220 m_vCharset[0].m_nPlainLenMax = nPlainLenMax;
\r
222 // m_nPlainSpaceUpToX
\r
223 m_nPlainSpaceUpToX[0] = 0;
\r
224 m_nPlainLenMaxTotal = 0;
\r
225 m_nPlainLenMinTotal = 0;
\r
228 for(j = 0; j < m_vCharset.size(); j++)
\r
231 m_nPlainLenMaxTotal += m_vCharset[j].m_nPlainLenMax;
\r
232 m_nPlainLenMinTotal += m_vCharset[j].m_nPlainLenMin;
\r
233 for (i = 1; i <= m_vCharset[j].m_nPlainLenMax; i++)
\r
235 nTemp *= m_vCharset[j].m_nPlainCharsetLen;
\r
236 if (i < m_vCharset[j].m_nPlainLenMin)
\r
237 m_nPlainSpaceUpToX[k] = 0;
\r
239 m_nPlainSpaceUpToX[k] = m_nPlainSpaceUpToX[k - 1] + nTemp;
\r
243 // m_nPlainSpaceTotal
\r
244 m_nPlainSpaceTotal = m_nPlainSpaceUpToX[m_nPlainLenMaxTotal];
\r
249 bool CChainWalkContext::SetRainbowTableIndex(int nRainbowTableIndex)
\r
251 if (nRainbowTableIndex < 0)
\r
253 m_nRainbowTableIndex = nRainbowTableIndex;
\r
254 m_nReduceOffset = 65536 * nRainbowTableIndex;
\r
259 bool CChainWalkContext::SetSalt(unsigned char *Salt, int nSaltLength)
\r
261 memcpy(&m_Salt[0], Salt, nSaltLength);
\r
263 m_nSaltLen = nSaltLength;
\r
264 // m_sSalt = sSalt;
\r
268 bool CChainWalkContext::SetupWithPathName(string sPathName, int& nRainbowChainLen, int& nRainbowChainCount)
\r
270 // something like lm_alpha#1-7_0_100x16_test.rt
\r
273 string::size_type nIndex = sPathName.find_last_of('\\');
\r
275 string::size_type nIndex = sPathName.find_last_of('/');
\r
277 if (nIndex != string::npos)
\r
278 sPathName = sPathName.substr(nIndex + 1);
\r
280 if (sPathName.size() < 3)
\r
282 printf("%s is not a rainbow table\n", sPathName.c_str());
\r
285 if (sPathName.substr(sPathName.size() - 5) == ".rti2")
\r
287 isRti2RtFormat = true;
\r
289 else if (sPathName.substr(sPathName.size() - 4) == ".rti")
\r
291 isOldRtFormat = false;
\r
293 else if (sPathName.substr(sPathName.size() - 3) == ".rt")
\r
295 isOldRtFormat = true;
\r
299 printf("%s is not a rainbow table\n", sPathName.c_str());
\r
304 vector<string> vPart;
\r
305 if (!SeperateString(sPathName, "___x_", vPart))
\r
307 printf("filename %s not identified\n", sPathName.c_str());
\r
311 string sHashRoutineName = vPart[0];
\r
312 int nRainbowTableIndex = atoi(vPart[2].c_str());
\r
313 nRainbowChainLen = atoi(vPart[3].c_str());
\r
314 nRainbowChainCount = atoi(vPart[4].c_str());
\r
316 // Parse charset definition
\r
317 string sCharsetDefinition = vPart[1];
\r
318 string sCharsetName;
\r
319 int nPlainLenMin = 0, nPlainLenMax = 0;
\r
321 // printf("Charset: %s", sCharsetDefinition.c_str());
\r
323 if(sCharsetDefinition.substr(0, 6) == "hybrid") // Hybrid table
\r
325 sCharsetName = sCharsetDefinition;
\r
329 if ( sCharsetDefinition.find('#') == string::npos ) // For backward compatibility, "#1-7" is implied
\r
331 sCharsetName = sCharsetDefinition;
\r
337 vector<string> vCharsetDefinitionPart;
\r
338 if (!SeperateString(sCharsetDefinition, "#-", vCharsetDefinitionPart))
\r
340 printf("filename %s not identified\n", sPathName.c_str());
\r
345 sCharsetName = vCharsetDefinitionPart[0];
\r
346 nPlainLenMin = atoi(vCharsetDefinitionPart[1].c_str());
\r
347 nPlainLenMax = atoi(vCharsetDefinitionPart[2].c_str());
\r
352 if (!SetHashRoutine(sHashRoutineName))
\r
354 printf("hash routine %s not supported\n", sHashRoutineName.c_str());
\r
357 if (!SetPlainCharset(sCharsetName, nPlainLenMin, nPlainLenMax))
\r
359 if (!SetRainbowTableIndex(nRainbowTableIndex))
\r
361 printf("invalid rainbow table index %d\n", nRainbowTableIndex);
\r
364 m_nPlainSpaceTotal = m_nPlainSpaceUpToX[m_nPlainLenMaxTotal];
\r
368 string CChainWalkContext::GetHashRoutineName()
\r
370 return m_sHashRoutineName;
\r
373 int CChainWalkContext::GetHashLen()
\r
378 string CChainWalkContext::GetPlainCharsetName()
\r
380 return m_vCharset[0].m_sPlainCharsetName;
\r
383 string CChainWalkContext::GetPlainCharsetContent()
\r
385 return m_vCharset[0].m_sPlainCharsetContent;
\r
388 int CChainWalkContext::GetPlainLenMin()
\r
390 return m_vCharset[0].m_nPlainLenMin;
\r
393 int CChainWalkContext::GetPlainLenMax()
\r
395 return m_vCharset[0].m_nPlainLenMax;
\r
398 uint64 CChainWalkContext::GetPlainSpaceTotal()
\r
400 return m_nPlainSpaceTotal;
\r
403 int CChainWalkContext::GetRainbowTableIndex()
\r
405 return m_nRainbowTableIndex;
\r
408 void CChainWalkContext::Dump()
\r
410 printf("hash routine: %s\n", m_sHashRoutineName.c_str());
\r
411 printf("hash length: %d\n", m_nHashLen);
\r
413 printf("plain charset: ");
\r
415 for (i = 0; i < m_vCharset[0].m_nPlainCharsetLen; i++)
\r
417 if (isprint(m_vCharset[0].m_PlainCharset[i]))
\r
418 printf("%c", m_vCharset[0].m_PlainCharset[i]);
\r
424 printf("plain charset in hex: ");
\r
425 for (i = 0; i < m_vCharset[0].m_nPlainCharsetLen; i++)
\r
426 printf("%02x ", m_vCharset[0].m_PlainCharset[i]);
\r
429 printf("plain length range: %d - %d\n", m_vCharset[0].m_nPlainLenMin, m_vCharset[0].m_nPlainLenMax);
\r
430 printf("plain charset name: %s\n", m_vCharset[0].m_sPlainCharsetName.c_str());
\r
431 //printf("plain charset content: %s\n", m_sPlainCharsetContent.c_str());
\r
432 //for (i = 0; i <= m_nPlainLenMax; i++)
\r
433 // printf("plain space up to %d: %s\n", i, uint64tostr(m_nPlainSpaceUpToX[i]).c_str());
\r
434 printf("plain space total: %s\n", uint64tostr(m_nPlainSpaceTotal).c_str());
\r
436 printf("rainbow table index: %d\n", m_nRainbowTableIndex);
\r
437 printf("reduce offset: %s\n", uint64tostr(m_nReduceOffset).c_str());
\r
441 void CChainWalkContext::SetIndex(uint64 nIndex)
\r
446 void CChainWalkContext::SetHash(unsigned char* pHash)
\r
448 memcpy(m_Hash, pHash, m_nHashLen);
\r
451 void CChainWalkContext::IndexToPlain()
\r
456 for (i = m_nPlainLenMaxTotal - 1; i >= m_nPlainLenMinTotal - 1; i--)
\r
458 if (m_nIndex >= m_nPlainSpaceUpToX[i])
\r
460 m_nPlainLen = i + 1;
\r
465 // this is an optimized version of the above
\r
467 for (i = m_nPlainLenMaxTotal - 1; i >= m_nPlainLenMinTotal - 1
\r
468 && m_nIndex < m_nPlainSpaceUpToX[i]; i--)
\r
471 m_nPlainLen = i + 1;
\r
474 if(m_nPlainLen == 0)
\r
475 m_nPlainLen = m_nPlainLenMinTotal;
\r
476 uint64 nIndexOfX = m_nIndex - m_nPlainSpaceUpToX[m_nPlainLen - 1];
\r
478 // this is the generic code for non x86/x86_64 platforms
\r
479 #if !defined(_M_X64) && !defined(_M_IX86) && !defined(__i386__) && !defined(__x86_64__)
\r
481 // generic version (slow for non 64-bit platforms and gcc < 4.5.x)
\r
482 for (i = m_nPlainLen - 1; i >= 0; i--)
\r
484 int nCharsetLen = 0;
\r
485 for(uint32 j = 0; j < m_vCharset.size(); j++)
\r
487 nCharsetLen += m_vCharset[j].m_nPlainLenMax;
\r
488 if(i < nCharsetLen) // We found the correct charset
\r
490 m_Plain[i] = m_vCharset[j].m_PlainCharset[nIndexOfX % m_vCharset[j].m_nPlainCharsetLen];
\r
491 nIndexOfX /= m_vCharset[j].m_nPlainCharsetLen;
\r
497 #elif defined(_M_X64) || defined(_M_IX86) || defined(__i386__) || defined(__x86_64__)
\r
499 // Fast ia32 version
\r
500 for (i = m_nPlainLen - 1; i >= 0; i--)
\r
502 // 0x100000000 = 2^32
\r
504 if (nIndexOfX < 0x100000000I64)
\r
507 if (nIndexOfX < 0x100000000llu)
\r
511 int nCharsetLen = 0;
\r
512 for(uint32 j = 0; j < m_vCharset.size(); j++)
\r
514 nCharsetLen += m_vCharset[j].m_nPlainLenMax;
\r
515 if(i < nCharsetLen) // We found the correct charset
\r
517 m_Plain[i] = m_vCharset[j].m_PlainCharset[nIndexOfX % m_vCharset[j].m_nPlainCharsetLen];
\r
518 nIndexOfX /= m_vCharset[j].m_nPlainCharsetLen;
\r
524 uint32 nIndexOfX32 = (uint32)nIndexOfX;
\r
525 for (; i >= 0; i--)
\r
527 int nCharsetLen = 0;
\r
528 for(uint32 j = 0; j < m_vCharset.size(); j++)
\r
530 nCharsetLen += m_vCharset[j].m_nPlainLenMax;
\r
531 if(i < nCharsetLen) // We found the correct charset
\r
534 // m_Plain[i] = m_vCharset[j].m_PlainCharset[nIndexOfX32 % m_vCharset[j].m_nPlainCharsetLen];
\r
535 // nIndexOfX32 /= m_vCharset[j].m_nPlainCharsetLen;
\r
537 // moving nPlainCharsetLen into the asm body and avoiding the extra temp
\r
538 // variable results in a performance gain
\r
539 // unsigned int nPlainCharsetLen = m_vCharset[j].m_nPlainCharsetLen;
\r
540 unsigned int nTemp;
\r
542 #if defined(_WIN32) && !defined(__GNUC__)
\r
543 // VC++ still needs this
\r
544 unsigned int nPlainCharsetLen = m_vCharset[j].m_nPlainCharsetLen;
\r
548 mov eax, nIndexOfX32
\r
550 div nPlainCharsetLen
\r
551 mov nIndexOfX32, eax
\r
554 m_Plain[i] = m_vCharset[j].m_PlainCharset[nTemp];
\r
556 __asm__ __volatile__ ("xor %%edx, %%edx;"
\r
558 : "=a"(nIndexOfX32), "=d"(nTemp)
\r
559 : "a"(nIndexOfX32), "rm"(m_vCharset[j].m_nPlainCharsetLen)
\r
561 m_Plain[i] = m_vCharset[j].m_PlainCharset[nTemp];
\r
570 void CChainWalkContext::PlainToHash()
\r
572 m_pHashRoutine(m_Plain, m_nPlainLen, m_Hash);
\r
575 void CChainWalkContext::HashToIndex(int nPos)
\r
577 m_nIndex = (*(uint64*)m_Hash + m_nReduceOffset + nPos) % m_nPlainSpaceTotal;
\r
580 uint64 CChainWalkContext::GetIndex()
\r
584 const uint64 *CChainWalkContext::GetIndexPtr()
\r
589 string CChainWalkContext::GetPlain()
\r
593 for (i = 0; i < m_nPlainLen; i++)
\r
595 char c = m_Plain[i];
\r
602 string CChainWalkContext::GetBinary()
\r
604 return HexToStr(m_Plain, m_nPlainLen);
\r
607 string CChainWalkContext::GetHash()
\r
609 return HexToStr(m_Hash, m_nHashLen);
\r
612 bool CChainWalkContext::CheckHash(unsigned char* pHash)
\r
614 if (memcmp(m_Hash, pHash, m_nHashLen) == 0)
\r
620 bool CChainWalkContext::isOldFormat()
\r
622 return isOldRtFormat;
\r
625 bool CChainWalkContext::isRti2Format()
\r
627 return isRti2RtFormat;
\r