[The Protagonist]

So on the Dream PC thread I said that cracking passwords can be really REALLY quick these days by getting multiple GPUs etc. So that got me thinking: What is the number of possible passwords?
So I set myself some rules:

• Can use any combination of these 96 characters and they can be used multiple times:
  
  Code:

  abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ1234567890 !"£$%^&*()_+¬-={}~@:?><,./;'#][\|
  (PS. Notice that it includes space)
  
• Minimum of 3 characters and a maxiumum of 30 characters in the password.
  
• And I'll use Text Mechanic to check for dupes and such: http://textmechanic.com/
  

At the moment Im trying to work out the number of 3 character passwords.
So I start by using "abc"

• aaa
  
• aab
  
• abb
  
• aba
  
• abc

I didn't put in "bbb" and other combinations like that as the program I am making to work it out is going to loop through all the characters.
So I made this java program:

Spoiler:

Code:

class main {
    public static void main (String args[]){
        int counter = 0;
        String chs[]={ "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", "1", "2", "3", "4", "5", "6", "7", "8", "9", "0", "!", "\"", "£", "$", "%", "^", "&", "*", "(", ")", "_", "+", "-", "=", "{", "}", "[", "]", ":", "@", "~", ";", "\'", "#", "<", ">", "?", ",", ".", "/", "|", "X", " "};
        for(int a=0; a<95; a++){
            System.out.println(chs[a] + chs[a] + chs[a]);
            counter++;
            for (int b = 0; b <95; b++){
                 System.out.println(chs[a] + chs[a] + chs [b]);
                counter++;
            }

            for (int c = 0; c <95; c++){
                System.out.println(chs[a] + chs[c] + chs [c]);
                counter++;
            }

            for (int d = 0; d <95; d++){
                System.out.println(chs[a] + chs[d] + chs [a]);
                counter++;

                for (int e = 0; e <95; e++){
                    System.out.println(chs[a] + chs[d] + chs [e]);
                    counter++;
                }
            }


        }

        System.out.println("Number of Combinations: " + counter);
    }
}

And the result was 884545.
Next Im gonna do 4 character passwords

Ok so as before I used abcd

• aaaa
  
• aaab
  
• aabb
  
• abbb
  
• abbc
  
• abcc
  
• abcd
  

But this time I have worked out the sum

Code:

95 + (95*95) + (95*95) + (95*95) + (95*95*95) + (95*95*95) + (95*95*95*95)  = 83192545

So there are 83192545 combinations for 4 character passwords.

[w00t]

The number of possible combinations of a given keyspace is x^y, where x is the length of the keyspace and y is the length of the desired output.

IE, in your keyspace, for 4 characters, there is 96^4 possibilities.

Research before you implement a program.


There are 93238349796903051837918452757470307165930029979252129792 possible passwords using those characters, with a length between 3 and 30. The program took less one fourth of a second to run, whereas I'm sure your program takes longer.

[The Protagonist]

Could you explain what the ^ does?
I have not yet done this in maths.
Also thanks for this
I think that if I had multiple GPUs and stuff as stated in the Dream PC thread that you could make a program to generate a list of all 3 character combos, 4 character combo etc. and then convert them all to hashes to quickly get plaintexts of everything.

[Prestige]

^4 is 96 * 96 * 96 * 96 so yeah that's a lot

[The Protagonist]

Oh so ^ is the same as to the power of.
Damn why didnt I think of that XD
Now to work out how much space text files with these passes would take up /for fun

---

96^3 = 884736 x 3 = 2654208 bytes = 0.00247192 GB
96^4 = 84934656 x 4 = 339738624 bytes = 0.00030899 Terabytes
96^5 = 8153726976 x 5 = 40768634880 bytes = 0.0370789 Terabytes
96^6 = 782757789696 x 6 = 4696546738176 bytes = 4.27148 Terabytes
96^7 = 75144747810816 x 7 = 526013234675712 bytes = 478.406 Terabytes
96^8 = 7213895789838336 x 8 = 57711166318706688 bytes = 52488 Terabytes
96^9 = 692533995824480300 x 9 = 6232805962420322304 bytes = 5668704 Terabytes
96^10 = 66483263599150105000 x 10 = 664832635991501045760 bytes = 604661760 Terabytes
96^11 = 6382393305518410039296 x 11 = 70206326360702510432256 bytes = 63852281856 Terabytes
96^12 = 612709757329767363772416 x 12 = 7352517087957208365268992 bytes
96^13 = 58820136703657666922151936
96^14 = 5646733123551136024526585856
96^15 = 542086379860909058354552242176
96^16 = 52040292466647269602037015248896
96^17 = 4995868076798137881795553463894016
96^18 = 479603335372621236652373132533825536
96^19 = 46041920195771638718627820723247251456
96^20 = 4420024338794077316988270789431736139776
96^21 = 424322336524231422430873995785446669418496
96^22 = 40734944306326216553363903595402880264175616
96^23 = 3910554653407316789122934745158676505360859136
96^24 = 375413246727102411755801735535232944514642477056
96^25 = 36039671685801831528556966611382362673405677797376
96^26 = 3459808481836975826741468794692706816646945068548096
96^27 = 332141614256349679367181004290499854398106726580617216
96^28 = 31885594968609569219249376411887986022218245751739252736
96^29 = 3061017116986518645047940135541246658132951592166968262656
96^30 = 29385764323070578992460225301195967918076335284802895321497

[w00t]

Could you explain what the ^ does?
I have not yet done this in maths.
Also thanks for this
I think that if I had multiple GPUs and stuff as stated in the Dream PC thread that you could make a program to generate a list of all 3 character combos, 4 character combo etc. and then convert them all to hashes to quickly get plaintexts of everything.

Oh helll no. My computer does one hash in 0.01 seconds, so lets be generous and just divide that by 10(assuming the computer in question is 10 times faster than mine).

0.001 * 93238349796903051837918452757470307165930029979252129792 = 93238350000000000000000000000000000000000000000000000 seconds, rounding up.

That's well over a decade, i believe that might even be hundreds of years.

[The Protagonist]

http://arstechnica.com/security/2012/08/...r-assault/

This $12,000 computer, dubbed Project Erebus v2.5 by creator d3ad0ne, contains eight AMD Radeon HD7970 GPU cards. Running version 0.10 of oclHashcat-lite, it requires just 12 hours to brute force the entire keyspace for any eight-character password containing upper- or lower-case letters, digits or symbols. It aided Team Hashcat in winning this year's Crack Me If You Can contest.

[MinecraftGeek]

How many passwords are possible for 96 characters?

[w00t]

http://arstechnica.com/security/2012/08/...r-assault/

This $12,000 computer, dubbed Project Erebus v2.5 by creator d3ad0ne, contains eight AMD Radeon HD7970 GPU cards. Running version 0.10 of oclHashcat-lite, it requires just 12 hours to brute force the entire keyspace for any eight-character password containing upper- or lower-case letters, digits or symbols. It aided Team Hashcat in winning this year's Crack Me If You Can contest.

Assuming that's using the same keyspace, that's only 96^8 combinations, which is a difference of:

296950881580502692976440171464717149487929275664112415506432


EDIT: I messed up initial calculation, the loop didnt get to 96^30, there is actually 296950881580502692976440171464717149487929282878008205344768
possible combinations.

[The Protagonist]

Hmm I'd need to find out how much calculations he's doing per second. Even on that setup he says in the article that its an old computer so these aren't even optimal setup.Maybe though to go go up to 30 might be stretching it, maybe just up to 20

---

Also I'm not saying that it could be done in 12 hours just that that setup is really effecient and could be faster than your workings. This is awkward on a phone :/