-/*
- RainbowCrack - a general propose implementation of Philippe Oechslin's faster time-memory trade-off technique.
-
- Copyright (C) Zhu Shuanglei <shuanglei@hotmail.com>
-*/
-
-#ifdef _WIN32
- #pragma warning(disable : 4786 4267 4018)
-#endif
-
-#include "HashSet.h"
-
-CHashSet::CHashSet()
-{
-}
-
-CHashSet::~CHashSet()
-{
-}
-
-void CHashSet::AddHash(string sHash)
-{
- if (sHash == "aad3b435b51404ee")
- return;
-
- int i;
- for (i = 0; i < m_vHash.size(); i++)
- {
- if (m_vHash[i] == sHash)
- return;
- }
-
- //printf("debug: adding hash %s\n", sHash.c_str());
-
- m_vHash.push_back(sHash);
- m_vFound.push_back(false);
- m_vPlain.push_back("");
- m_vBinary.push_back("");
-}
-
-string CHashSet::GetHashInfo(int i)
-{
- string found;
- if (m_vFound[i])
- found = "1";
- else
- found = "0";
-
- string buffer = m_vHash[i] + ":" + found + ":" + m_vPlain[i] + ":" + m_vBinary[i];
-
- return buffer;
-}
-
-bool CHashSet::AnyhashLeft()
-{
- int i;
- for (i = 0; i < m_vHash.size(); i++)
- {
- if (!m_vFound[i])
- return true;
- }
-
- return false;
-}
-
-bool CHashSet::AnyHashLeftWithLen(int nLen)
-{
- int i;
- for (i = 0; i < m_vHash.size(); i++)
- {
- if (!m_vFound[i])
- if (m_vHash[i].size() == nLen * 2)
- return true;
- }
-
- return false;
-}
-
-void CHashSet::GetLeftHashWithLen(vector<string>& vHash, int nLen)
-{
- vHash.clear();
-
- int i;
- for (i = 0; i < m_vHash.size(); i++)
- {
- if (!m_vFound[i])
- if (m_vHash[i].size() == nLen * 2)
- vHash.push_back(m_vHash[i]);
- }
-}
-
-void CHashSet::AddHashInfo(string sHash, bool found, string sPlain, string sBinary)
-{
- int i;
- for (i = 0; i < m_vHash.size(); i++)
- {
- if (m_vHash[i] == sHash)
- return;
- }
-
- m_vHash.push_back(sHash);
- m_vFound.push_back(found);
- m_vPlain.push_back(sPlain);
- m_vBinary.push_back(sBinary);
-}
-
-void CHashSet::SetPlain(string sHash, string sPlain, string sBinary)
-{
- int i;
- for (i = 0; i < m_vHash.size(); i++)
- {
- if (m_vHash[i] == sHash)
- {
- m_vFound[i] = true;
- m_vPlain[i] = sPlain;
- m_vBinary[i] = sBinary;
- return;
- }
- }
-}
-
-bool CHashSet::GetPlain(string sHash, string& sPlain, string& sBinary)
-{
- if (sHash == "aad3b435b51404ee")
- {
- sPlain = "";
- sBinary = "";
- return true;
- }
-
- int i;
- for (i = 0; i < m_vHash.size(); i++)
- {
- if (m_vHash[i] == sHash)
- {
- if (m_vFound[i])
- {
- sPlain = m_vPlain[i];
- sBinary = m_vBinary[i];
- return true;
- }
- }
- }
-
- return false;
-}
-
-int CHashSet::GetStatHashFound()
-{
- int nHashFound = 0;
- int i;
- for (i = 0; i < m_vHash.size(); i++)
- {
- if (m_vFound[i])
- nHashFound++;
- }
-
- return nHashFound;
-}
-
-int CHashSet::GetStatHashTotal()
-{
- return m_vHash.size();
-}
+/*\r
+ * rcracki_mt is a multithreaded implementation and fork of the original \r
+ * RainbowCrack\r
+ *\r
+ * Copyright (C) Zhu Shuanglei <shuanglei@hotmail.com>\r
+ * Copyright Martin Westergaard Jørgensen <martinwj2005@gmail.com>\r
+ * Copyright 2009, 2010 Daniël Niggebrugge <niggebrugge@fox-it.com>\r
+ * Copyright 2009, 2010 James Nobis <frt@quelrod.net>\r
+ *\r
+ * This file is part of racrcki_mt.\r
+ *\r
+ * rcracki_mt is free software: you can redistribute it and/or modify\r
+ * it under the terms of the GNU General Public License as published by\r
+ * the Free Software Foundation, either version 2 of the License, or\r
+ * (at your option) any later version.\r
+ *\r
+ * rcracki_mt is distributed in the hope that it will be useful,\r
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of\r
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\r
+ * GNU General Public License for more details.\r
+ *\r
+ * You should have received a copy of the GNU General Public License\r
+ * along with rcracki_mt. If not, see <http://www.gnu.org/licenses/>.\r
+ */\r
+\r
+#ifdef _WIN32\r
+ #pragma warning(disable : 4786 4267 4018)\r
+#endif\r
+\r
+#include "HashSet.h"\r
+\r
+CHashSet::CHashSet()\r
+{\r
+}\r
+\r
+CHashSet::~CHashSet()\r
+{\r
+}\r
+\r
+void CHashSet::AddHash(string sHash)\r
+{\r
+ if (sHash == "aad3b435b51404ee")\r
+ return;\r
+\r
+ UINT4 i;\r
+ for (i = 0; i < m_vHash.size(); i++)\r
+ {\r
+ if (m_vHash[i] == sHash)\r
+ return;\r
+ }\r
+\r
+ //printf("debug: adding hash %s\n", sHash.c_str());\r
+\r
+ m_vHash.push_back(sHash);\r
+ m_vFound.push_back(false);\r
+ m_vPlain.push_back("");\r
+ m_vBinary.push_back("");\r
+}\r
+\r
+string CHashSet::GetHashInfo(int i)\r
+{\r
+ string found;\r
+ if (m_vFound[i])\r
+ found = "1";\r
+ else\r
+ found = "0";\r
+\r
+ string buffer = m_vHash[i] + ":" + found + ":" + m_vPlain[i] + ":" + m_vBinary[i];\r
+\r
+ return buffer;\r
+}\r
+\r
+bool CHashSet::AnyhashLeft()\r
+{\r
+ UINT4 i;\r
+ for (i = 0; i < m_vHash.size(); i++)\r
+ {\r
+ if (!m_vFound[i])\r
+ return true;\r
+ }\r
+\r
+ return false;\r
+}\r
+\r
+bool CHashSet::AnyHashLeftWithLen(int nLen)\r
+{\r
+ UINT4 i;\r
+ for (i = 0; i < m_vHash.size(); i++)\r
+ {\r
+ if (!m_vFound[i])\r
+ if (m_vHash[i].size() == (unsigned long)nLen * 2)\r
+ return true;\r
+ }\r
+\r
+ return false;\r
+}\r
+\r
+void CHashSet::GetLeftHashWithLen(vector<string>& vHash, int nLen)\r
+{\r
+ vHash.clear();\r
+\r
+ UINT4 i;\r
+ for (i = 0; i < m_vHash.size(); i++)\r
+ {\r
+ if (!m_vFound[i])\r
+ if (m_vHash[i].size() == (unsigned long)nLen * 2)\r
+ vHash.push_back(m_vHash[i]);\r
+ }\r
+}\r
+\r
+void CHashSet::AddHashInfo(string sHash, bool found, string sPlain, string sBinary)\r
+{\r
+ UINT4 i;\r
+ for (i = 0; i < m_vHash.size(); i++)\r
+ {\r
+ if (m_vHash[i] == sHash)\r
+ return;\r
+ }\r
+\r
+ m_vHash.push_back(sHash);\r
+ m_vFound.push_back(found);\r
+ m_vPlain.push_back(sPlain);\r
+ m_vBinary.push_back(sBinary);\r
+}\r
+\r
+void CHashSet::SetPlain(string sHash, string sPlain, string sBinary)\r
+{\r
+ UINT4 i;\r
+ for (i = 0; i < m_vHash.size(); i++)\r
+ {\r
+ if (m_vHash[i] == sHash)\r
+ {\r
+ m_vFound[i] = true;\r
+ m_vPlain[i] = sPlain;\r
+ m_vBinary[i] = sBinary;\r
+ return;\r
+ }\r
+ }\r
+}\r
+\r
+bool CHashSet::GetPlain(string sHash, string& sPlain, string& sBinary)\r
+{\r
+ if (sHash == "aad3b435b51404ee")\r
+ {\r
+ sPlain = "";\r
+ sBinary = "";\r
+ return true;\r
+ }\r
+\r
+ UINT4 i;\r
+ for (i = 0; i < m_vHash.size(); i++)\r
+ {\r
+ if (m_vHash[i] == sHash)\r
+ {\r
+ if (m_vFound[i])\r
+ {\r
+ sPlain = m_vPlain[i];\r
+ sBinary = m_vBinary[i];\r
+ return true;\r
+ }\r
+ }\r
+ }\r
+\r
+ return false;\r
+}\r
+\r
+int CHashSet::GetStatHashFound()\r
+{\r
+ int nHashFound = 0;\r
+ UINT4 i;\r
+ for (i = 0; i < m_vHash.size(); i++)\r
+ {\r
+ if (m_vFound[i])\r
+ nHashFound++;\r
+ }\r
+\r
+ return nHashFound;\r
+}\r
+\r
+int CHashSet::GetStatHashTotal()\r
+{\r
+ return (int) m_vHash.size();\r
+}\r
projects / freerainbowtables / blobdiff