What tool would be best used to have the LM hashes computed for all possible permutations of the administrator password?

Johnny is a member of the hacking group Orpheus1. He is currently working on breaking into the Department of Defense’s front end Exchange Server. He was able to get into the server, located in a DMZ, by using an unused service account that had a very weak password that he was able to guess. Johnny wants to crack the administrator password, but does not have a lot of time to crack it. He wants to use a tool that already has the LM hashes computed for all possible permutations of the administrator password.?

What tool would be best used to accomplish this?

Johnny is a member of the hacking group Orpheus1. He is currently working on breaking into the Department of Defense’s front end Exchange Server. He was able to get into the server, located in a DMZ, by using an unused service account that had a very weak password that he was able to guess. Johnny wants to crack the administrator password, but does not have a lot of time to crack it. He wants to use a tool that already has the LM hashes computed for all possible permutations of the administrator password.?

What tool would be best used to accomplish this?

A.
SMBCrack

B.
RainbowCrack

C.
SmurfCrack

D.
PSCrack

Explanation:
RainbowCrack is a general propose implementation of Philippe Oechslin’s faster time-memory trade-off technique. In short, the RainbowCrack tool is a hash cracker. A traditional brute force cracker try all possible plaintexts one by one in cracking time. It is time consuming to break complex password in this way. The idea of time-memory trade-off is to do all cracking time computation in advance and store the result in files so called "rainbow table". It does take a long time to precompute the tables. But once the one time precomputation is finished, a time-memory trade-off cracker can be hundreds of times faster than a brute force cracker, with the help of precomputed tables.



Leave a Reply 0

Your email address will not be published. Required fields are marked *