Coding bruteforce dictionary generator

[BlackMat]

Hello all
I am trying to build a dictionary generator in C++ but am alittle lost with the theory so I am hoping I can pick on other peoples brains.
Anyway, I want to generate a file that will have a password length of 6 and generate all possible values from 0-9 and a-z. The only way I can think of doing this is by using a multidimensional array but that'll be really long winded and complex. Does anyone have any suggestions on approach?

[compaq]

changed ifs

char ascii[40] = {"abcdefgh012345678"};

c++;
if(c == 35) {
    c=0;
    c1++;
}
if(c1 == 35) {
   c1=0;
   c2++;
}

temp[0] = ascii[c];
temp[1] = ascii[c1];
temp[2] = ascii[c2];

or

embed fors

for(c=0;c<=35;c++) {
    for(c1=0;c1<=35;c1++) {
        for(c2=0;c2<=35;c2++) {
             temp[2]=ascii[c2];
             temp[1] = ascii[c1];
              temp[0] = ascii[c];
        }

   }


}


fputs(temp,out);
fputs("\n",out);

hope it helps

[Gitsnik]

compaq's code is a good start, but let's invest some time in making it a little more robust - I'll butcher C and make some complex pseudocode:

i = 5;
char buffer[i];
for(j = 0; j < i; j++) {
  buffer[j] = 'a';
}
// that has our buffer seated properly - we'll start with all 'a' characters, though technically '\0' would work

for(j = 0; j < i; j++) {
  for(k = 0; k < 26; k++) {
    buffer[j] = ascii[k];
    printf("%s\n", buffer);
  }
}

The bonus here is, if my logic is straight (I'm fairly wrecked lately from overworking), the number of characters is not hard coded into your algorithym - the idea is we start with a string x wide, and just flip characters in and out of it.

Actually after typing all that, I'm really hoping it's right

[compaq]

The bonus here is, if my logic is straight (I'm fairly wrecked lately from overworking), the number of characters is not hard coded into your algorithym - the idea is we start with a string x wide, and just flip characters in and out of it.

Alot nice code

your code would be something like this

memset(buffer,"a",sizeof(buffer));

for(j=0;j<=i;j++) {
temp=j;
     for(k=0;k<=26;k++) {
	buffer[j] = ascii[k];
	for(h=0;h<=(temp-1);h++) {
                  for(i=0;i<=26;i++) {
                      buffer[j-h] = ascii[k];
                   }
	} 
      printf("%c\n",buffer);		
}


}

[bofh28]

Just use crunch. You can find it at:
https://crunch-wordlist.svn.sourcefo...ordlist/trunk/

[masterzorag]

youtube.com/watch?v=QQuxLfTb4B8
features:
set number of words to output;
maximum numbers of chars to reach;
start word;
end word;
log last 500000 word, when importing words in pyrit from stdin, you can interrupt and resume later;
write to stdout, so you can write or not in an outfile;
implement my algorithm to skip useless words!
ex:
to find the word 'acqua' it skips 19625 words, is 3.76% for 5 chars

to print 6 to 8 chars wordlist just use:
bruteforce -p aaaaaa -m 9
to print fixed 24 chars wordlist just use:
bruteforce -p aaaaaaaaaaaaaaaaaaaaaaaa -m 25

i've to host the binary somewhere to share with others, but, for now what do you think?

[Zermelo]

Here is my reinvention of the wheel, very simple code:

Create a wordlist of only numbers

[foresto]

Hi i was looking over the internet for some information about dictionaries i coded mine and am still testing it im having a bit trouble with it it keeps on getting me a error if this can help any of you mine is done with Msword VB editor.

the error that i get is:

Run-Time Error '4605':

this methode or property is not available because there is a memory or disk problem.

Private Sub CommandButton1_Click()
'Word Generator for use as dictionary
'by Brian Forest
'
'

Dim L1, L2, L3, L4, L5, L6, L7, L8, L9, Word As String
Dim IntL1, IntL2, IntL3, IntL4, IntL5, IntL6, IntL7, IntL8, IntL9 As Integer

L1 = ""
L2 = ""
L3 = ""
L4 = ""
L5 = ""
L6 = ""
L7 = ""
L8 = ""
L9 = ""
Word = ""

IntL1 = 32
IntL2 = 31
IntL3 = 31
IntL4 = 31
IntL5 = 31
IntL6 = 31
IntL7 = 31
IntL8 = 31
IntL9 = 31

Gen:
    If IntL9 > 217 Then
        IntL8 = IntL8 + 1
        IntL9 = 0
    End If
    If IntL8 > 218 Then
        IntL7 = IntL7 + 1
        IntL8 = 32
    End If
    If IntL7 > 218 Then
        IntL6 = IntL6 + 1
        IntL7 = 32
    End If
    If IntL6 > 218 Then
        IntL5 = IntL5 + 1
        IntL6 = 32
    End If
    If IntL5 > 218 Then
        IntL5 = 32
        IntL4 = IntL4 + 1
    End If
    If IntL4 > 218 Then
        IntL4 = 32
        IntL3 = IntL3 + 1
    End If
    If IntL3 > 218 Then
        IntL3 = 32
        IntL2 = IntL2 + 1
    End If
    If IntL2 > 218 Then
    IntL2 = 32
    IntL1 = IntL1 + 1
    End If

Do Until IntL9 = 218
        IntL9 = IntL9 + 1
'    For IntL9 = 32 To 255
        'debut de la composition des mots

        'choix des letres
        L8 = Chr(IntL8)
        L7 = Chr(IntL7)
        L6 = Chr(IntL6)
        L5 = Chr(IntL5)
        L4 = Chr(IntL4)
        L3 = Chr(IntL3)
        L2 = Chr(IntL2)
        L1 = Chr(IntL1)
        L9 = Chr(IntL9)
        '
        'structuration du mot
        Word = L1 & L2 & L3 & L4 & L5 & L6 & L7 & L8 & L9
        '
        'Ecrit du mot sur Document
        Selection.TypeText Text:=Word & "    "

Loop        '
'    Next
    'renvoie de la boucle si la longeur nest pas atteinte
    If IntL1 < 218 Then GoTo Gen


End Sub

[B@Rz-]

Omg

I just coded it this week on c++!

Here it is the download link

SourceForge - WLGen

If you have any question/suggestion, please send me a pm

0.2.2 out! (2009/11/02)

when I'll have some free time, I'll add something new:
1) it will be possible to split the "big wordlist" in smaller ones, with a defined by user number of lines;
2) it will be possible to define the starting and the ending words of the dictionary (the WLGen will generate only the words inside the range).