![]() |
![]() |
![]() |
![]() |
![]() |
||||||||||
|
||||||||||||||
![]() |
#1
|
|||
|
|||
![]() Hi together,
i´ve got a truecrypt file (create myself) and forget my password. .... yes i do not remember it !!... that is the problem when you change password and do not remember it again... ![]() My question is now which bruteforce tool i can use to find my lost password ? The tools i use are : Truecrypt 7.1a (it is a hidden file) TCbrute 2.3.4691.22681 for bruteforce Combinator_v1.0 for creat wordlist First i test it with a simpel password on a truecrypt file. (create new tc file for testing with a simpel pw) but it wont work. so i think the TC7.1a and my bruteforce tool are not compatible. Have someone a good idea which bruteforce tool works fine with TC7.1a Thanks from Niruzi ![]() |
#2
|
|||
|
|||
![]()
__________________
Blame Microsoft, get L33t |
#3
|
|||
|
|||
![]() Actually, it should be fairly easy to do a brute force attack by hand if you know the actual words. Think about it, there are not that many combinations. Say you had 3 words A, B and C. You only have to try :
A B C A C B B A C B C A C A B C B A I can't rember much math at my age, but I think if you have N words then you have N Factorial (N!) combinations to try. 6 words is 720 combinations and 7 words is 5040. You should easily be able to set up a batch file to try each in turn. Use something like Excel to create the table. Git |
#4
|
|||
|
|||
![]() Note, however, that each word can possibly be REPEATED in a password:
So, you can also have: AAA BBB CCC AAB AAC ... too large. Also, there are 26 alphabets, and 10 numbers (0-9). And then, if it's CASE SENSITIVE, then you have 26+26 = 52 alphabets. Just saying... Not THAT easy. ![]() And if the programmer is smart, he will have put in a TIME LOOP for a validation. Each validation of the password by the program takes around, say, 5 seconds. Nothing big if you enter the password correct or wrong once or twice. Nightmare, if you are trying to brute force it. Now, DEFINITELY not that easy. ![]() Peace. Have Phun
__________________
Blame Microsoft, get L33t Last edited by Aimless : 02-23-2013 at 01:40 PM. |
#5
|
|||
|
|||
![]() 26 alphabets?. 0 to 9??. Not sure what you mean, but you said you KNEW the WORDS, in which case it is a simple permutation. Where do letters and numbers and alphabets come into it?. It makes no difference if a word is repeated or no, just count it as 2 words and the problem is the same.
Either you are overcomplicating it now, or you under-complicated it when you explained the problem. A B C A C B B A C B C A C A B C B A B = C = A ?. So what, it's the same problem. Just ignore the similarity. Git |