Hot answers tagged

95

The password hashes for MS Office 97-2003 are vulnerable to collision attacks. That is, multiple passwords exist that should be able to open the document. That also means that the password "iemuzqau" is not necessarily the original password that was set by the author. It is just one of the passwords that should be accepted, because it matches the internal ...


13

Let me break down, what you want and what the equivalent hashcat options are. Hash-Type You want to crack a OSX v10.8+ hash, which according to the hashcat example hashes page (https://hashcat.net/wiki/doku.php?id=example_hashes) is type "7100", so: -m 7100. Specifying the correct hash type should also get rid of the "incorrect length" error. Attack-...


12

You must install some stuff. The same happened to me. But you can work with new hashcat 3.x and CPU in your vm, no problem on that: apt-get install libhwloc-dev ocl-icd-dev ocl-icd-opencl-dev And apt-get install pocl-opencl-icd This worked for me. I found it here. What I suggested It's a little different because you can install pocl with apt-get instead ...


9

Sounds like you're looking for --increment-min. This will start a bruteforce/mask attack at a minimum length. For example, this will try digits-only candidates, starting with length 7: hashcat -a 3 -m [hashtype] -i --increment-min=7 targethashes.list ?d?d?d?d?d?d?d?d?d?d You didn't directly ask this, but the deeper intent of your question appears to be "...


9

TL;DR: No. it only means nobody on that list have the same password as you. Stop right here, install a password manager, then come back. Done? Good. That list was from a company (RockYou) that stored all passwords in clear. No matter if someone had a 64 byte password, with a mix of symbols, letters, numbers, capitals, and unicode chars, if he had an ...


8

As stated by @RoyceWilliams, it does not seem to use CUDA. For this purpose, you might want to look at Pyrit, since it leverages CPUs and GPUs on the cracking process. NB: I wanted to leave this as a comment but I still don't have enough reputation.


8

You've got the right idea - this is a great way to learn. For beginning and intermediate cracking, the best general password lists are actual lists of passwords - those found in leaks with large general user bases. And the best general practice hash lists are the hashes from public leaks. Your best "bang for the buck", in my opinion, is the hashes.org "...


8

JWT Token Structure As detailed on the JWT website (https://jwt.io/introduction/), JWT token consists of three parts separated by a dot (.), which are - Header, Payload and Signature. Both Header and Payload are Base64 encoded strings. Therefore a JWT token would typically look like this: Base64(Header).Base64(Payload).Signature The signature is ...


7

Complexity rules like these cannot be natively captured by a single mask. Instead, a list of many masks that fit the criteria must be generated using other tools, such as the policygen tool from the PACK toolkit. $ policygen --minlength=8 --maxlength=20 \ --mindigit=1 --minlower=1 --minupper=1 --maxspecial=0 -o test1.masks $ policygen --minlength=8 --...


7

(This thread is cross-posted on the hashcat forums here. My answer there was too simplistic, so I'll try to do a better job here.) The basics For wordlists and rules, it sounds like you've already got the basics down. As long as the wordlists are in UTF-8, and the input method used to set the password is also UTF-8, then they should work well. I would ...


7

First, some answers to your meta-questions: hashcat does indeed understand the 7-character split and optimizes accordingly. hashcat also knows that LM is case-insensitive, so you can drop the custom character set without changing the speed of the attack. I'm not sure where you got the idea that hashcat's ?s character set does not include '#'. it ...


7

This is a good starting point to learn how the Mask Attack from oclHashcat works: https://hashcat.net/wiki/doku.php?id=mask_attack You need to add the commandline-parameter -a 3 so hashcat knows your going to use a mask attack. Hashcat comes with some predefined mask's (you can define your own also): ?l = abcdefghijklmnopqrstuvwxyz ?u = ...


7

No, it is not possible to crack just any SHA-1 hash. Currently, there are two main issues with using the hash function for security purposes (not specifically password hashing): It is a very fast hash, meaning a brute force attack will run much more quickly than it would if you were to correctly use a slow KDF. The fact that SHA-1 is fast does not allow you ...


6

Your hashcat appears to be working correctly. 30 seconds is about how long it takes mine to run through every password in rockyou.txt It looks like the password is not in rockyou.txt which only contains a few hundred thousand passwords. I suggest you use some rules to make it guess some variations on the passwords in rockyou and/or find a larger ...


6

I don't think so. There's only one mention of OpenCL or CUDA in the source code, and it appears to be a leftover from code copied from John the Ripper. Edited to answer your implicit question: if you want efficient WPA2 cracking on GPU, consider hashcat for the cracking, and hcxtools for conversion to the required format (hccapx). hashcat is superior to ...


6

Hashcat saves its progress in a .pot file. The --show command will let you see the cracked hashes that have been saved in the .pot file. The FAQ will help with more details.


5

I assume you are talking about the Mask Attack and not Brute-force Attack which is outdated and replaced by Mask Attack. I had to add --pwd-min=8 to the list of parameters to force it to start at 8 digits from the get-go. Source: http://hashcat.net/forum/thread-1538.html


5

The syntax is hash:message Note that the length of the message is limited to 51 bytes. See hashcat example wiki page for details: https://hashcat.net/wiki/doku.php?id=example_hashes


5

The file format is MAC:message, as @atom already mentioned. By "MAC" I mean the value the HMAC produces, a.k.a. the hash, so the MAC comes first and then the message that this MAC is signing. In this setup, the goal is to crack the key that the message was signed with. (It seems that you can also try to crack the other value with -m 1460, but I haven't ...


5

This is not possible using hashcat, unless you're ready to change the source code to suit your needs. For example, you can adapt s3inlc's fork which added an option to check for hashes with some specific properties (starting / ending with as much 0 as possible, etc.).


4

Edit: I saw that you found your answer, but I'll add it here for completeness sake. (And I already had this written down). Hashcat doesn't guess the # of rounds, and the amount of rounds specified in your /etc/login.defs isn't properly applied. I took an example from my Linux box: $6$elIIOT8d$lXVE7ZxTaBnvyi3kgrVGOpq.I/tQU9CN....


4

As of the current version (3.30), hashcat does not currently support truncated hashes beyond the half-MD5 modes. In my discussions with the team, I made the pitch (basically what I wrote here). So far, they have expressed non-interest in expanding partial-hash matching to other types, as it's considered to be out of scope for the project. But this could ...


4

You should read the wiki entry on Mask Attack. In particular, you want custom charsets and the examples. First, you define up to four custom character sets, -1 through -4. Then, you put your mask together. For each character position, you can use a fixed character (19, in the first example, is a literal) a standard charset, like ?a or ?l a custom charset, ...


4

Mask attack seems to be a good solution. Generate a .hcmask file with the following lines: $%-",Barbara?1walks?1the?1dog $%-",Barbara?1walks?1the?1?1dog ... And so on, where each line is has differences places for the special characters (?1). Since you know the phrase, and because the set of characters is small, the total number of lines should be very ...


4

The answer depends on the "speed" of the target hash: If it's a fast hash (like MD5), Daisetsu is roughly correct - that it's not worth the trouble to worry about it (though it can vary based on attack and targets); If it's a slow hash (like bcrypt), the GPUs won't be starved for candidate passwords, so you have the luxury of generating candidates ...


4

For any halfway decent hash function, even hashes that are completely unsuitable for cryptography, if you look for collisions by brute force, it doesn't matter how you explore the search space. Keeping a fixed prefix and changing the suffix, or keeping a fixed suffix and changing the prefix, are as good as any other method. That's because all hash functions ...


4

No need for hashcat. From my answer here: [...] at the ATA Secure Erase level, you should be able to initiate a new erase with a new master password, regardless of what the old password was. This destroys all existing data, as designed by the ATA Secure Erase specification. But once it's done, you can then use the drive again.


4

You can use hashcat to do so. You can write rules that will operate on your given wordlist (in this case, the single word "PleaseSub!", however it can be as many as you please) and generate a bunch of similar passwords according to your rules. e.g sXY - s will replace X with Y $X - will append the character X to your wordlist ^X - will prepend the ...


3

Generally yes, if you have enough time. If you know how long or in what format the salt is, it would help you. But the method is brute-force, as the any other hash-reversal: oclHashcat -m=0 b4fbb742bc2a24bc033dbfb4f4582e08 -a=3 userpassword?1?2?2?2?2?2?2 I didn't test that, but documentation is certainly good place to start.


Only top voted, non community-wiki answers of a minimum length are eligible