Timeline for Hacker2, Crack: Optimisations
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 16, 2015 at 1:12 | comment | added | Disco King | @Kareem ah yes, actually my math assumed passwords were ALWAYS 8 chars... but yes since they can be fewer, i would have to add those in too. i will write the code assuming brute force then... i just wondered if there was some approach or some aspect of the instructions that i was missing! thanks for the response. i will proceed accordingly! | |
| Feb 15, 2015 at 21:32 | comment | added | kzidane | @DiscoKing I believe there it a total of 95 + 95^2 + ... + 95^8 different possibilities for each password as each password will be no longer than 8 characters. This is still quite a lot though. I guess you'll be able to crack the first couple of passwords or so using a dictionary attack. In my case, I ensured that my code did what it was supposed to do when I implemented the various attacks since it would eventually crack all the passwords and that was enough for me :) | |
| Feb 15, 2015 at 17:44 | comment | added | Disco King | @Kareem: I welcome more advice on an approach to solving the CS50 assignment as stated. I am comfortable writing the code to use dictionary, rainbow book, or brute force attacks. Where I am struggling is that the assignment says that the program must "be designed in such a way that it could crack ALL the passwords." If the goal is ALL possible passwds, then (by definition) we must use a brute force attack to cover possible char combos. The math on it is clear, given 95 printable ASCII chars = (95^8)*4096 = 2.72e19. with 100k tries per second in a high-memory VM, that's 8mill+ years? | |
| Nov 28, 2014 at 2:15 | comment | added | Daniel Levi | Seems to be similar to opening a 3 digit combination lock. 000, 001, 002, 003... 009, 010, 011, 012... Only 1000 combinations in this case | |
| Jul 8, 2014 at 9:54 | vote | accept | Luke Van In | ||
| Jul 8, 2014 at 9:54 | comment | added | Luke Van In | Thanks Kareem. This is some useful advice. | |
| Jul 7, 2014 at 0:27 | history | answered | kzidane | CC BY-SA 3.0 |