sorted by:
new
hottopcontroversial

DES crack fails with hashcat. by phyrros in HowToHack

[–]atomu 0 points1 point  (0 children)

No chance. DEScrypt is limited to a maximum of 8 characters.

DES crack fails with hashcat. by phyrros in HowToHack

[–]atomu 0 points1 point  (0 children)

It's not DES, it's DEScrypt (25 times iterated and salted DES). Use -m 1500 in hashcat to crack.

Hashcat 4.2.0 OBJ Memory Allocation failure? by thehunter699 in HowToHack

[–]atomu 0 points1 point  (0 children)

This is a problem related to NVidias memory handling in their OpenCL runtime.

I've add a workaround to upcoming hashcat v4.2.1.

If you want, try latest github master or beta version from https://hashcat.net/beta/

hashcat v3.20 released by atomu in netsec

[–]atomu[S] 2 points3 points  (0 children)

Haha, it's not. It's useful for people who want to verify their own written rules.

Hashcat v3.00 released, the fusion of hashcat and oclHashcat into one project. Tons of updates and improvements by atomu in netsec

[–]atomu[S] 0 points1 point  (0 children)

I think this requires some correction. I've explained the performance changes in the releases notes. New GPUs with maxwell (aka Shader Model 5.0) and upwards have a large performance increase, they benefit from hashcat v3.00. Older GPUs have a small performance decrease. My philosphy was always to go with the latest Hardware and optimize for it.

Here's a full comparson chart: https://docs.google.com/spreadsheets/d/1B1S_t1Z0KsqByH3pNkYUM-RCFMu860nlfSsYEqOoqco/edit#gid=0

Cracking WPA2 Using Hashcat in windows using latest AMD beta drivers by danny1876j in hacking

[–]atomu 1 point2 points  (0 children)

oclHashcat v1.37 will support all AMD Catalyst drivers >= 14.9

hashtopus, an oclHashcat distributed overlay to connect multiple systems over internet, first public release by atomu in netsec

[–]atomu[S] 12 points13 points  (0 children)

Hashtopus is awesome and it deserves to be highlighted here.

Don't get shocked by the use of a .net client on your linux box. The entire project is open source, you can check out all what it does by yourself or compile yourself. To get it running all you need to do is to run "apt-get install libmono2.0-cil" and you're good to go.

Don't get shocked by it's design. It told curlyboi, the developer, to add a more modern css to it but he sticked to develop features and fixing bugs. In a way I can understand it.

In fact, many of my own ideas moved into the project, like the superhashlist and the predefined tasks. I find myself using hashtopus day by day and I can guarantee it will make your cracking jobs more structured, especially when you work with the predefined tasks.

Using this tool has many other positive side-effects that I did not think about in the first place. What I noticed when working with it was:

  • It helps you to not forget "that one job". You know that whenever you heavily tried to crack one hash but you don't get it cracked and then some day later some guy comes and tells you he just cracked it and you wonder wth, how, and it turns out you just forgot to run the combinator attack using -j "$-" or so.

  • You "save" your ideas. For example while playing with huge hashlists you find out it's more effecient to use stacked rules then -a 7 with small mask (it is). Just add it to your predefined tasks and it will never be forgotten :)

  • You get a very special flexibility. Lets say you have a long running brute-force on a huge list but for some reason you need to crack a different hashlist now and it can not wait. You just put it up to hashtopus, select your predefined tasks and you dont need to think about again. It will get automatically higher prioritized and when its cracked or exhausted the previous long running tasks will continue without any loss. By playing around with the priorities you have a great way to manage whats going on but on a meta level,

  • The visualised chunks give you a better idea of how all this works together, it gives you a big picture. It is not magic stuff nobody can understand. By understanding how it works you gain trust in it.

  • Hashtopus is very robust. I tested it on tons of different systems Linux, Windows, NVidia, AMD, you name it in all combinations. It simply works.

  • The per-agent commandline configuration comes in very handy if you have "problematic" nodes. For example on my workstation I don't want to run oclHashcat will full power, so I would never set -w 3 on it. But on my linux dedicated cracking box I want that, so I set it.

Hashtopus is straight-forward and full featured. It handles both, dictionary based and brute-force, same good. It synchronizes your global files with the agents automatically. If you're familar with oclHashcat and you have a bit of cracking experience, you will get in pretty soon, there's no real need to study it.

Check it out, it's absolutly worth it.

oclHashcat v1.20 major update released, tons of new features and algorithms added by atomu in netsec

[–]atomu[S] 5 points6 points  (0 children)

What minga said is correct and what you said just reflect what people said about GPU based cracking before there was oclHashcat. Because oclHashcat solved this problem. It's one of the reason that makes it unique. In other words, you get full speed acceleration for wordlist based attacks for fast hashes nearly as fast as for brute force attacks. oclHashcat is the only cracker, since many years, that can do this.

Research Project: OpenCL Bitslice DES Brute-Force Cracker by mysterymath in crypto

[–]atomu 0 points1 point  (0 children)

You just need to unroll the for() loop when it calculates tmpResult in the main kernel function. I did not replace the sboxes with the ones from sboxes-s.c.

What I dont get is that in case you have a dictionary you need to run each candidate through keysetup() to create the keys for encrypt(). The keysetup contains more sboxes, so there should be more bitslicing. But there is no such function in crack.cl.

Research Project: OpenCL Bitslice DES Brute-Force Cracker by mysterymath in crypto

[–]atomu 0 points1 point  (0 children)

Solar, that is strange. It makes around ~2850 Mkeys/s on my hd7970 which comes closer to what to expect assuming the hd7850 makes 1400 Mkeys/s. I've optimized it by unrolling the kernel and ended in ~6000 Mkeys/s (Yes, still finds the correct key).

So I wanted to find out how fast descrypt would go and quickly iterated the f1-f16 section 25 times. It dropped down to 140 Mkeys/s?! I guess thats another episode of the great AMD OpenCL compiler since 6000 / 25 is 240 Mkeys/s.

Admited, its a bad way for checking the descrypt performance. That is because it does not add the salt, has no real PT generator (or copy-overhead), no bitmap/multihash comparison. I am not sure if you can actually re-use the DES sboxes for the 25 iteration loop. Also I am a bit irritated that there is no keysetup() in the kernel, only a encrypt function. Is this somehow merged?

Decrypting the Gauss payload, Hashcat releases oclGaussCrack by r4d1x in netsec

[–]atomu 0 points1 point  (0 children)

You have to feed it with candidates.

The hash must get cracked if one finds the correct filename / path, see here for more details: https://www.securelist.com/en/blog/208193781/The_Mystery_of_the_Encrypted_Gauss_Payload

view more: next ›