BruteForce algo needed

[_XTREME_]

Hello brains!
I am new in this forum and i post here for first time. Nevermind.
I need bruteforce algo. which combines difined by me characters. If i defined that the characters that will be used are "1","2" and "3" i need tha algo to combine them in this order:
1
2
3
11
12
13
21
22
23
31
32
33
111
112
113
121
...
u got the point
this will go on till the strlen() of the current combination is equal to max_password_lenght, defined by me. 10x for the answers...

[loobian]

Hi, and welcome to our forums!
I am bulgarian, too by the way

I think what you need is permutation algorithm... search for permutation. Also, check out:
www.tutorials.cpp-home.com
Click on "Sub-categories" and see the "Algorithms" category with all of its sub-categories... you might find something useful there, too.

[_XTREME_]

Аз сега се сещам че българи правиха този сайт. Мойте поздравления!

[loobian]

Thanks!
But please, do post in english because this site is viewable for many people who do not know bulgarian.

Translation of _XTREME_'s message:
"I now remember that bulgarians made this site. Congratulations!"

[_XTREME_]

OK, sorry for writing in !english (non-english). So, i checked the algo-s in this site, nothing about bruteforce. Can somebody write this f() or not? My brain refuses to work last few days. I repeat: i need algo which combines the characters in this way:

a
b
c
d
...
aa
ab
ac
ad
...
aaa
aab
aac
aad
aba
abb
....

10x!

[MXP]

Since you have implied that this is a bruteforce password cracker I dont have much desire to help. All I will say is "permutations"

[_XTREME_]

First of all, i said "password cracking" only as an example. This algo can be used with other purposes too. Let`s say... hmmm.... ahmm..... uhmmm.... junk generator! And second, no "permutations" will be used but COMBINATIONS. Because "permutation" of the string abc can be: acb, cab, bca... and so on. But a can`t be permutation of abc.

[raimo]

Well, you know more than enough to code the program. Why don't you just do it? I guess you know how base 3 number system works.

[_XTREME_]

..i know that this algo is as short as several lines. I can write it but too ugly. I want short, optimized code I WANT IT

[raimo]

Well here's the answer: No one is going to write the algorithm for you.

[devil_slayer]

Code: Select all

void generate(char* buffer, int size, int length, char* alphbet, int n)
{
  int i;
  printf("%s\n",buffer);
  if(length>=(size-1)) return;
  for(i=0; i<n; i++)
  {
    buffer[length]=alphabet[i];
    buffer[length+1]=0;
    generate(buffer,size,length+1,alphabet,n);
   }
}

To run it just write:

Code: Select all

char buffer[4];
generate(buffer,4,0,"123",3);

Sorry guys, but I like algorithms...

[_XTREME_]

w0w! That was what am i looking for. Btw what is the last param?... int n i mean. 10q again!

[devil_slayer]

The number of chars in the alphabet.

[_XTREME_]

Code: Select all

void generate(char* buffer, int size, int length, char* alphabet)
{
  int i,n;
  n=strlen(alphabet);
  printf("%s\n",buffer);
  if(length>=(size-1)) return;
  for(i=0; i<n; i++)
  {
    buffer[length]=alphabet[i];
    buffer[length+1]=0;
    generate(buffer,size,length+1,alphabet);
   }
}

void main()
{
   char buffer[4];
   generate(buffer,4,0,"1234");
}


Isn`t now better? I assume the second param is the max_size_of_password-1. And what is the third?

[devil_slayer]

The initial size of the generated password. It's the only paramter that is increased in every recursion step, so it's very important.

Yeah the code's cool now.

You could try and hack it iterativly, but I'm not in the mood now...

Maybe tomorrow...