Dictionary attack simulation.

I am trying to create a program to run a simulation of a dictionary attack. But I want it to not only use the words as it is… but also use different combinations on the word… such as:

Word
WOrd
wORd
etc etc

And

Word
Word1
Word99

The fallowing code is the best I can come up with, but its still not right… and I cant for the life of me work out why… Please help

Code:

#include <cstdlib>
#include <iostream>
#include <string>

using namespace std;

int main(int argc, char *argv[])
{
    string word = "word";
    string wordTemp = word;
    
    int pos = word.length();
    do
    {
        wordTemp[pos] = toupper(wordTemp[pos]);
        for (int i=0; i<word.length(); i++)
        {
            wordTemp[i] = toupper(wordTemp[i]);
            for (int i=0; i<100; i++)
            {
                char data[99];
                itoa(i, data, 10);
                wordTemp.replace(4, 2, data);
                cout << wordTemp << endl;
            }
            if (i < pos) continue;
            wordTemp[i] = tolower(wordTemp[i]);
        }
        pos--;
    } while (pos >= 0);
    system("PAUSE");
    return EXIT_SUCCESS;
}

I would make all the characters uppercase in both strings, then see if the first string is equal to the beginning of the second string. To find that, you can simply make sure the second string length is at least as long as the first string, then use second_str.substr(0, first_str.length()) and compare that to the first string.

If you need to handle matches where the first string is just somewhere inside the second, but not in the front, then you might want to use find.

I would use boost::regex for this.

Well for the dictionary attack bit, you're going to need to download a text-file perhaps with ALL the words in it, i know these are available somewhere, i was referred to a site one time but i cannot remember where it was.

Originally Posted by Junior89

Well for the dictionary attack bit, you're going to need to download a text-file perhaps with ALL the words in it, i know these are available somewhere, i was referred to a site one time but i cannot remember where it was.

I am going to use the Cain & Abel wordlist file, which i have found to be quite good... that is the easy part, and Daved, i think i am going to give your method a try, its just taking me a bit of time to wrap my head around it... lol