Hack Forums
[Perl] Help Generate a PW list of a specific format (for WPA) - Printable Version

+- Hack Forums (https://hackforums.net)
+-- Forum: Tech (https://hackforums.net/forumdisplay.php?fid=444)
+--- Forum: Coding (https://hackforums.net/forumdisplay.php?fid=151)
+---- Forum: Coders Lounge (https://hackforums.net/forumdisplay.php?fid=5)
+---- Thread: [Perl] Help Generate a PW list of a specific format (for WPA) (/showthread.php?tid=318631)

Help Generate a PW list of a specific format (for WPA) - poh-pcp - Mar 16, 2010

Hi guys,
i'm trying to generate a passwordlist for rainbow tables.
I know that t-com routers use a password with a "SP-" at the beging and 9 chars of HEX behind it.
So it should look like "SP-1A2B3C4D5"
When i would have a list with all possibilities (Bruteforce) i could generate a salted RT and crack WPA.
my coding is realy lame but i found a scripts which i though i could use:

Code
--- genpw.pl


#!/usr/bin/perl
#
# genpw.pl
# Craig Perry
# 4th Apr 2007
#
# Generate a PW list of a specific format.
#

use strict;

# Change to suit the first 4 letters, keep space seperated
my @first_four = qw/ f F /;
my @second_four = qw/ u U /;
my @third_four = qw/ l L /;
my @fourth_four = qw/ l L /;

my @alphabet = qw/ a b c d e f g h i j k l m n o p q r s t u v w x y z
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z /;

for my $four1 ( @first_four ){
for my $four2 ( @second_four ){
for my $four3 ( @third_four ){
for my $four4 ( @fourth_four ){
for my $letter1 ( @alphabet ) {
for my $letter2 ( @alphabet ) {
for my $letter3 ( @alphabet ) {

# Generate digits from 00 to 99
for my $tail_digit ( 0..99 ) {
printf "%s%02d\n", $four1 . $four2 . $four3 . $four4 . $letter1 . $letter2 . $letter3, $tail_digit;
}

}
}
}
}
}
}
}


--- end genpw.pl

i tried to change it the way i needed but recognized that it's no good for bruteforce:

Code
--- genpw.pl


#!/usr/bin/perl
#
# genpw.pl
# Craig Perry
# 4th Apr 2007
#
# Generate a PW list of a specific format.
#
use strict;

# Change to suit the first 4 letters, keep space seperated
my @first = qw/ S /;
my @second = qw/ P /;
my @third = qw/ - /;

my @alphabet = qw/ A B C D E F 0 1 2 3 4 5 6 7 8 9 /;

for my $four1 ( @first ){
for my $four2 ( @second ){
for my $four3 ( @third ){
for my $letter1 ( @alphabet ) {
for my $letter2 ( @alphabet ) {
for my $letter3 ( @alphabet ) {
for my $letter4 ( @alphabet ) {
for my $letter5 ( @alphabet ) {
for my $letter6 ( @alphabet ) {
for my $letter7 ( @alphabet ) {
for my $letter8 ( @alphabet ) {
for my $letter9 ( @alphabet ) {

# Generate digits from 00 to 99 <---- here is my problem i think
for my $tail_digit ( 0..99 ) {
printf "%s%02d\n", $four1 . $four2 . $four3 . $letter1 . $letter2 . $letter3 . $letter4 . $letter5 . $letter5 . $letter6 . $letter7 . $letter8 . $letter9;
}
}
}
}
}
}
}
}
}
}
}
}

--- end genpw.pl

if some could help me i would be very thankful. i would donate with paypal i it works ;)
thanks...

sorry for my bad english

silly me :)
take a look at this:
https://hackforums.net/showthread.php?tid=290118

* - z3r0c0re - Mar 17, 2010

you do know that there is 38,443,359,375 diffident compilations and depending on how good your computer is can take 1 to 2 days or more and depending on how much ram you have it will have to create lots of sprite files. if you still want one written i will be more than happy.

* - IceCandle - Mar 17, 2010

(Mar 17, 2010 06:14 AM)z3r0c0re Wrote:  you do know that there is 38,443,359,375 diffident compilations and depending on how good your computer is can take 1 to 2 days or more and depending on how much ram you have it will have to create lots of sprite files. if you still want one written i will be more than happy.

No computer have such a big HDD, and it's more then that. It's up to 10. so 1^2 + 1^3 + 1^4 + 1^5 + 1^7 + 1^8 + 1^9 + 2^1 + 2^2 + 2^3 + 2^4 + 2^5 + 2^6 + 2^................ 9^9 and without the : in between each. that's around 5000000 giga bytes.

This is plain impossible.

* - z3r0c0re - Mar 17, 2010

(Mar 17, 2010 07:12 AM)IceCandle Wrote:  No computer have such a big HDD, and it's more then that. It's up to 10. so 1^2 + 1^3 + 1^4 + 1^5 + 1^7 + 1^8 + 1^9 + 2^1 + 2^2 + 2^3 + 2^4 + 2^5 + 2^6 + 2^................ 9^9 and without the : in between each. that's around 5000000 giga bytes.

This is plain impossible.
the calculation is 16^9 it dosnt start from 1 it starts at 9 but you are right its gonna take a hell of a lot of space about 65536 GB or 64 TB and 68719476736 diffrent combonations