Sign up ×
Information Security Stack Exchange is a question and answer site for information security professionals. It's 100% free, no registration required.

This is a basic exemple of Unix Pass Encryption.

I have little Hash of MD5 ARP :


I need to find the pass of user user50 & user60.

I wondering what is the best way to crack this - maybe with John the ripper? Is there a better alternative?

share|improve this question

migrated from Mar 4 '14 at 17:00

This question came from our site for software developers, mathematicians and others interested in cryptography.

1 Answer 1

I would suggest John the Ripper. Get a large dictionary file and run it through John. You could even split it among multiple machines (possibly in the cloud) as the problem is very parallelizable.

John can even do variations on dictionary words like substituting 0 for o.

For more info, see this article.

If you have access to a GPU, oclHashcat looks interesting.

share|improve this answer
Well i use John the ripper. I know the length of the pass is : 7. I try to configure John for search only pass with lenght = 7, but i don't find the option... Do you know what is the option ? – mpgn Mar 4 '14 at 17:45
Take your dictionary file and run it through john with --stdout=7. This will produce a dictionary file where all passwords are no more than 7 characters. See EXAMPLES (search for --stdout on that page and you will see an example). – mikeazo Mar 4 '14 at 17:54
Yeah, --stdout only work with a wordlist, it's not possible with basic option like ../john --stdout=7 pass – mpgn Mar 4 '14 at 17:59
See this then: and look at "Incremental" mode parameters – mikeazo Mar 4 '14 at 18:01
the documentation looks like years 1995... – mpgn Mar 4 '14 at 18:12

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.