Posts: 2
	Threads: 1
	Joined: May 2017
	
	
 
	
		
		
 
		05-20-2017, 04:03 PM 
(This post was last modified: 05-20-2017, 04:21 PM by jcat7.)
		
	 
	
		Hello,
I'm seeking some guidance, I want to brute force a 3DES key (14100 mode).
I know brute forcing a unique 3DES key cannot be brute forced with current technology, but what if the same DES 56bit key is used 3 times over?
Can I make a custom mask that can repeat the same key 3 times - I'm new to hashcat and I notice you cannot use regex and I'm not sure if this is possible?
Can anyone help me, please be nice, I'm new to Hashcat 
	 
	
	
	
	
 
 
	
	
	
		
	Posts: 28
	Threads: 5
	Joined: Mar 2016
	
	
 
	
	
		Now its ECB type triple des supported -14100
Maybe soon also CBC, it depend on atom@ :-D 
But your type of des...  dunno 
Now its not supported
	
	
	
	
	
 
 
	
	
	
		
	Posts: 5,232
	Threads: 233
	Joined: Apr 2010
	
	
 
	
	
		Well a quick fix for you would be to rewrite the kernel to reuse the first 8 byte as input for the 2nd and 3rd DES round and do a mask attack where the last 16 byte are static.
	
	
	
	
	
 
 
	
	
	
		
	Posts: 28
	Threads: 5
	Joined: Mar 2016
	
	
 
	
	
		Can you do that for us atom@?
3 options 
3 the same keys, 3 different keys, and two the same first and last? 
One option is done :-)
	
	
	
	
	
 
 
	
	
	
		
	Posts: 5,232
	Threads: 233
	Joined: Apr 2010
	
	
 
	
	
		It depends on who you are and what the purpose is
	
	
	
	
	
 
 
	
	
	
		
	Posts: 28
	Threads: 5
	Joined: Mar 2016
	
	
 
	
	
		Im just a fan of your work,  fan of hashcat 
Nothing more 
Purpose? 
You prove that with 3 the same keys its possible to break des
You also show us that there is more than one key to get pt CT 
With this, i dont belive in this that we need bilions years to break it
:-)
	
	
	
	
	
 
 
	
	
	
		
	Posts: 2
	Threads: 1
	Joined: May 2017
	
	
 
	
		
		
		05-22-2017, 12:26 PM 
(This post was last modified: 05-22-2017, 01:41 PM by jcat7.)
		
	 
	
		I second that, my requirements are for legitimate pen testing purposes - But also I think it would be a useful addition for a password recovery tool, considering 3DES is certainly brute-forcible if the same key is applied for each encryption cycle, so why not! And it would be cool to demonstrate the weaknesses inherent in 3DES, especially if it's not properly implemented by using repeating keys.
	
	
	
	
	
 
 
	
	
	
		
	Posts: 5,232
	Threads: 233
	Joined: Apr 2010
	
	
 
	
	
		No need to proof, I know it works if the key B = A and C = A. However, I don't know of any tool doing this. Also there are other (more interessting) attack-vectors on 3des, but all of them require to do something wrong with handling 3des in the first place. There's no general error. Anyway, based on your stated purpose, I don't see a use for this in hashcat.
	
	
	
	
	
 
 
	
	
	
		
	Posts: 6
	Threads: 2
	Joined: Mar 2017
	
	
 
	
	
		Hi Atom,
Any chance that you could implement k1 = k3, and k1 != k2 for 3des?
Or could you show me which part of the kernel k3 is, and how to loop/feed k1 into it?
Because I have tried a few times, without any success.
Thanks.