Hi
Firstly I hope this is the correct place for this post as I have been having a really hard time searching these excellent forums and the internet as a whole and discovered nothing of any use so thought you guys would be the perfect place to post as this seems to be where I make all my discoveries and breakthroughs... Anyway I digress...
So to get to my point I was wondering if it is possible to create a wordlist with crunch (which is easy enough) and perhaps piping it through to another program that will take entries out that have multiple letters and numbers on the fly ie..
aa
bb
cc
dd
11
22
33
44
also does anybody know of either a process to make crunch create a list with alternating alphanumeric a1b2c3d4....???
or if not perhaps redirect these results on the fly as crunch makes the wordist?
I beliveve this would keep the size of aforementioned list day a little at least as I think the calculation would go something like this 26x10x26x10x26x10x26x10 ...??? also i would like to create the reverse 10x26x10x26x10x26x10x26..
Any hope would be great cheers in advance guys....
would it be possible to script this or code it with C..
sorry for the length of the post any help greatly received
B.
I'm a compulsive post editor, you might wanna wait until my post has been online for 5-10 mins before quoting it as it will likely change.
I know I seem harsh in some of my replies. SORRY! But if you're doing something illegal or posting something that seems to be obvious BS I'm going to call you on it.
think I have found out that this command:
./crunch 8 8 -t @$@$@$@$ abcdefghijklmnopqrstuvwxyz 0123456789 \!\@\#\$\%
will do what I want but....
now I just need to pipe the output into aircrack but am currently at a loss I am sure I will work this out though ..?
Worked it out now guys piping output into aircrack as we speak =)
Linux and the Linux community = amazing!!
Last edited by lupin; 09-09-2010 at 07:24 AM. Reason: Merging...
You could write a small little C program that discards strings that contain duplicate characters.
The guts of it would be something like:
...or something along those lines.Code:void Print_String_If_All_Characters_Are_Unique(char const *const str) { for (char const *p = str ; *p != '\0'; ++p) /* Until we reach the null terminator */ { /* Exit loop if next character is null terminator */ if (p[1] == '\0') break; if ( strchr(p+1,*p) ) { /* If this block of code is entered, it means a duplicate character was found. So we exit the function without printing the string */ return; } } /* This point can only be reached if there were no duplicate characters */ puts(str); }
Cheers pal you are totally right currently running it now started at 1pm yesterday and at current guestimates its gonna take 80 days!
thanks for the reply would there by any way to do this but also account for the instances of eg a1a1a1s7 or z5z5z5k9 and to take these out??
Thanks in advance
B.
Last edited by Archangel-Amael; 09-10-2010 at 10:35 AM.
Always learning....