Take the 2-minute tour ×
Super User is a question and answer site for computer enthusiasts and power users. It's 100% free, no registration required.

A few years back I made a TrueCrypt password with a random combination of a few friends' first names with no names repeated (7 names to be exact). I forgot the sequence and how many names I used. I have a program that does a dictionary attack, but what I need to do is find all the possible combinations of those names. I know that's a lot of possibilities and it may take months to crack but I'm desperate and willing to try. How can I do this?

For example, if the names are 1 2 3, I'd need the following list:

1
2
3
12
13
21
23
31
32
123
213
231
132
312
321
share|improve this question
    
There are 823453 possible combinations assuming that you only have a pool of seven names and your password may include all 7. –  Everett May 12 '13 at 1:33
    
That doesn't include variations in capitalization, and replacements (exchanging @ for a as an example). –  Everett May 12 '13 at 1:34
2  
However, assuming words aren't repeated, there is only 13699 possible words (for passwords from 1 to 7 words in length), so it is viable. If the password is known to be exactly 4 words for example, the space drops to 840. –  David Miani May 12 '13 at 2:04
    
This would require a simple C or C++ program. If you have those skills I suggest you request migration to Stackoverflow. –  Ramhound May 12 '13 at 3:24
    
@Powershell, Python, VBScript or really any robust language would work fine... –  AthomSfere May 12 '13 at 3:28

Your Answer

 
discard

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

Browse other questions tagged or ask your own question.