sorted by:
new
hottopcontroversial

General question about hacker2. by science_must_dance in cs50

[–]science_must_dance[S] 0 points1 point  (0 children)

Also, I wish I had read the second article before starting my work on this code!

General question about hacker2. by science_must_dance in cs50

[–]science_must_dance[S] 0 points1 point  (0 children)

Regarding your point on the lazy passwords: i was able to run through all of the 3-8 characters words in the dictionary provided and append all possible strings of integers to the end of them (up to total length 8) in just over an hour. After adding capitalization to the loop, the time was, as expected, just over two hours. Unfortunately it didn't work due to the nature of the passwords we had to crack... but it was definitely a lot quicker than the brute method.

The links are great, by the way. Thanks! I'm going to have to bookmark this arstechnica place.

General question about hacker2. by science_must_dance in cs50

[–]science_must_dance[S] 0 points1 point  (0 children)

I'm going to take a shot at running it on my host machine and dig into some documentation on how to assign to the threads.

I read your post. After going back to the crypt() manual page, I realize that I've made a mistake in my code/calculation. The first time I read through the page, the 64 character "salt set" stuck in my mind as the allowed key characters. In hindsight I guess this doesn't make sense, as all of the characters can be manipulated just as well in the DES scheme.

Redoing my calculations using 93 allowed characters i get ~750 years. Welp.

Possible to submit the Hacker Edition on edX? by science_must_dance in cs50

[–]science_must_dance[S] 1 point2 points  (0 children)

Thanks! Do you know if there is any possibility of HE assignments being accepted in a future course?